From eb7c35c03f148a8d8ba901d4baacdc64a2041a47 Mon Sep 17 00:00:00 2001 From: github-actions Date: Thu, 16 Jan 2025 13:11:12 +0000 Subject: [PATCH] Publish autogenerated nightly docs --- .../nightly/latest/bdk_bitcoind_rpc/all.html | 2 +- .../latest/bdk_bitcoind_rpc/index.html | 2 +- .../bdk_bitcoind_rpc/struct.BlockEvent.html | 14 +- .../bdk_bitcoind_rpc/struct.Emitter.html | 4 +- .../trait.BitcoindRpcErrorExt.html | 2 +- .../bdk/nightly/latest/bdk_chain/all.html | 2 +- .../bitcoin/address/enum.AddressData.html | 2 +- .../bitcoin/address/enum.AddressType.html | 2 +- .../bitcoin/address/enum.FromScriptError.html | 2 +- .../bitcoin/address/enum.KnownHrp.html | 2 +- .../bitcoin/address/enum.NetworkChecked.html | 2 +- .../address/enum.NetworkUnchecked.html | 2 +- .../bitcoin/address/enum.P2shError.html | 2 +- .../bitcoin/address/enum.ParseError.html | 2 +- .../address/error/enum.FromScriptError.html | 2 +- .../bitcoin/address/error/enum.P2shError.html | 2 +- .../address/error/enum.ParseError.html | 2 +- .../bitcoin/address/error/index.html | 2 +- ...truct.InvalidBase58PayloadLengthError.html | 2 +- .../struct.InvalidLegacyPrefixError.html | 2 +- .../struct.LegacyAddressTooLongError.html | 2 +- .../error/struct.NetworkValidationError.html | 2 +- .../error/struct.UnknownAddressTypeError.html | 2 +- .../address/error/struct.UnknownHrpError.html | 2 +- .../bdk_chain/bitcoin/address/index.html | 2 +- .../bitcoin/address/struct.Address.html | 2 +- ...truct.InvalidBase58PayloadLengthError.html | 2 +- .../struct.InvalidLegacyPrefixError.html | 2 +- .../struct.LegacyAddressTooLongError.html | 2 +- .../struct.NetworkValidationError.html | 2 +- .../struct.UnknownAddressTypeError.html | 2 +- .../address/struct.UnknownHrpError.html | 2 +- .../address/trait.NetworkValidation.html | 2 +- .../bitcoin/amount/enum.Denomination.html | 2 +- .../bitcoin/amount/enum.ParseAmountError.html | 2 +- .../bdk_chain/bitcoin/amount/index.html | 2 +- .../amount/serde/as_btc/fn.deserialize.html | 2 +- .../amount/serde/as_btc/fn.serialize.html | 2 +- .../bitcoin/amount/serde/as_btc/index.html | 2 +- .../serde/as_btc/opt/fn.deserialize.html | 2 +- .../amount/serde/as_btc/opt/fn.serialize.html | 2 +- .../amount/serde/as_btc/opt/index.html | 2 +- .../amount/serde/as_sat/fn.deserialize.html | 2 +- .../amount/serde/as_sat/fn.serialize.html | 2 +- .../bitcoin/amount/serde/as_sat/index.html | 2 +- .../serde/as_sat/opt/fn.deserialize.html | 2 +- .../amount/serde/as_sat/opt/fn.serialize.html | 2 +- .../amount/serde/as_sat/opt/index.html | 2 +- .../bdk_chain/bitcoin/amount/serde/index.html | 2 +- .../amount/serde/trait.SerdeAmount.html | 2 +- .../amount/serde/trait.SerdeAmountForOpt.html | 2 +- .../bitcoin/amount/struct.Amount.html | 2 +- .../bitcoin/amount/struct.Display.html | 2 +- .../bitcoin/amount/struct.SignedAmount.html | 2 +- .../bitcoin/amount/trait.CheckedSum.html | 2 +- .../bdk_chain/bitcoin/base58/enum.Error.html | 2 +- .../bitcoin/base58/error/enum.Error.html | 2 +- .../bdk_chain/bitcoin/base58/error/index.html | 2 +- .../error/struct.IncorrectChecksumError.html | 2 +- .../error/struct.InvalidCharacterError.html | 2 +- .../base58/error/struct.TooShortError.html | 2 +- .../bdk_chain/bitcoin/base58/fn.decode.html | 2 +- .../bitcoin/base58/fn.decode_check.html | 2 +- .../bdk_chain/bitcoin/base58/fn.encode.html | 2 +- .../bitcoin/base58/fn.encode_check.html | 2 +- .../base58/fn.encode_check_to_fmt.html | 2 +- .../bdk_chain/bitcoin/base58/index.html | 2 +- .../base58/struct.InvalidCharacterError.html | 2 +- .../bitcoin/base58/struct.String.html | 12 +- .../bdk_chain/bitcoin/base58/struct.Vec.html | 670 +++++++++++------- .../base64/alphabet/constant.BCRYPT.html | 2 +- .../base64/alphabet/constant.BIN_HEX.html | 2 +- .../base64/alphabet/constant.CRYPT.html | 2 +- .../base64/alphabet/constant.IMAP_MUTF7.html | 2 +- .../base64/alphabet/constant.STANDARD.html | 2 +- .../base64/alphabet/constant.URL_SAFE.html | 2 +- .../alphabet/enum.ParseAlphabetError.html | 2 +- .../bitcoin/base64/alphabet/index.html | 2 +- .../base64/alphabet/struct.Alphabet.html | 2 +- .../bitcoin/base64/display/index.html | 2 +- .../base64/display/struct.Base64Display.html | 2 +- .../base64/engine/enum.DecodePaddingMode.html | 2 +- .../general_purpose/constant.NO_PAD.html | 2 +- .../engine/general_purpose/constant.PAD.html | 2 +- .../general_purpose/constant.STANDARD.html | 2 +- .../constant.STANDARD_NO_PAD.html | 2 +- .../general_purpose/constant.URL_SAFE.html | 2 +- .../constant.URL_SAFE_NO_PAD.html | 2 +- .../base64/engine/general_purpose/index.html | 2 +- .../struct.GeneralPurpose.html | 2 +- .../struct.GeneralPurposeConfig.html | 2 +- .../bitcoin/base64/engine/index.html | 2 +- .../base64/engine/struct.DecodeMetadata.html | 2 +- .../base64/engine/struct.GeneralPurpose.html | 2 +- .../engine/struct.GeneralPurposeConfig.html | 2 +- .../bitcoin/base64/engine/trait.Config.html | 2 +- .../base64/engine/trait.DecodeEstimate.html | 2 +- .../bitcoin/base64/engine/trait.Engine.html | 2 +- .../bitcoin/base64/enum.DecodeError.html | 2 +- .../bitcoin/base64/enum.DecodeSliceError.html | 2 +- .../bitcoin/base64/enum.EncodeSliceError.html | 2 +- .../bdk_chain/bitcoin/base64/fn.decode.html | 2 +- .../bitcoin/base64/fn.decode_engine.html | 2 +- .../base64/fn.decode_engine_slice.html | 2 +- .../bitcoin/base64/fn.decode_engine_vec.html | 2 +- .../base64/fn.decoded_len_estimate.html | 2 +- .../bdk_chain/bitcoin/base64/fn.encode.html | 2 +- .../bitcoin/base64/fn.encode_engine.html | 2 +- .../base64/fn.encode_engine_slice.html | 2 +- .../base64/fn.encode_engine_string.html | 2 +- .../bitcoin/base64/fn.encoded_len.html | 2 +- .../bdk_chain/bitcoin/base64/index.html | 2 +- .../prelude/constant.BASE64_STANDARD.html | 2 +- .../constant.BASE64_STANDARD_NO_PAD.html | 2 +- .../prelude/constant.BASE64_URL_SAFE.html | 2 +- .../constant.BASE64_URL_SAFE_NO_PAD.html | 2 +- .../bitcoin/base64/prelude/index.html | 2 +- .../bitcoin/base64/prelude/trait.Engine.html | 2 +- .../bdk_chain/bitcoin/base64/read/index.html | 2 +- .../base64/read/struct.DecoderReader.html | 2 +- .../bitcoin/base64/trait.Engine.html | 2 +- .../bdk_chain/bitcoin/base64/write/index.html | 2 +- .../write/struct.EncoderStringWriter.html | 2 +- .../base64/write/struct.EncoderWriter.html | 2 +- .../base64/write/trait.StrConsumer.html | 2 +- .../bdk_chain/bitcoin/bech32/enum.Bech32.html | 2 +- .../bitcoin/bech32/enum.Bech32m.html | 2 +- .../bitcoin/bech32/enum.DecodeError.html | 2 +- .../bitcoin/bech32/enum.EncodeError.html | 2 +- .../bitcoin/bech32/enum.EncodeIoError.html | 2 +- .../bitcoin/bech32/enum.NoChecksum.html | 2 +- .../bdk_chain/bitcoin/bech32/fn.decode.html | 2 +- .../bdk_chain/bitcoin/bech32/fn.encode.html | 2 +- .../bitcoin/bech32/fn.encode_lower.html | 2 +- .../bech32/fn.encode_lower_to_fmt.html | 2 +- .../bech32/fn.encode_lower_to_writer.html | 2 +- .../bitcoin/bech32/fn.encode_to_fmt.html | 2 +- .../bitcoin/bech32/fn.encode_to_writer.html | 2 +- .../bitcoin/bech32/fn.encode_upper.html | 2 +- .../bech32/fn.encode_upper_to_fmt.html | 2 +- .../bech32/fn.encode_upper_to_writer.html | 2 +- .../bitcoin/bech32/fn.encoded_length.html | 2 +- .../bitcoin/bech32/hrp/constant.BC.html | 2 +- .../bitcoin/bech32/hrp/constant.BCRT.html | 2 +- .../bitcoin/bech32/hrp/constant.TB.html | 2 +- .../bdk_chain/bitcoin/bech32/hrp/index.html | 2 +- .../bitcoin/bech32/hrp/struct.Hrp.html | 2 +- .../bdk_chain/bitcoin/bech32/index.html | 2 +- .../bech32/primitives/checksum/index.html | 2 +- .../primitives/checksum/struct.Engine.html | 2 +- .../checksum/struct.HrpFe32Iter.html | 2 +- .../checksum/struct.PackedNull.html | 2 +- .../primitives/checksum/trait.Checksum.html | 2 +- .../primitives/checksum/trait.PackedFe32.html | 2 +- .../primitives/decode/enum.CharError.html | 2 +- .../decode/enum.CheckedHrpstringError.html | 2 +- .../primitives/decode/enum.ChecksumError.html | 2 +- .../primitives/decode/enum.PaddingError.html | 2 +- .../decode/enum.SegwitHrpstringError.html | 2 +- .../decode/enum.UncheckedHrpstringError.html | 2 +- .../bech32/primitives/decode/index.html | 2 +- .../decode/struct.AsciiToFe32Iter.html | 2 +- .../primitives/decode/struct.ByteIter.html | 2 +- .../decode/struct.CheckedHrpstring.html | 2 +- .../decode/struct.CodeLengthError.html | 2 +- .../primitives/decode/struct.Fe32Iter.html | 2 +- .../decode/struct.SegwitCodeLengthError.html | 2 +- .../decode/struct.SegwitHrpstring.html | 2 +- .../decode/struct.UncheckedHrpstring.html | 2 +- .../bech32/primitives/encode/index.html | 2 +- .../primitives/encode/struct.ByteIter.html | 2 +- .../primitives/encode/struct.CharIter.html | 2 +- .../primitives/encode/struct.Encoder.html | 2 +- .../primitives/encode/struct.Fe32Iter.html | 2 +- .../encode/struct.WitnessVersionIter.html | 2 +- .../bech32/primitives/enum.Bech32.html | 2 +- .../bech32/primitives/enum.Bech32m.html | 2 +- .../bech32/primitives/enum.NoChecksum.html | 2 +- .../primitives/gf32/enum.FromCharError.html | 2 +- .../primitives/gf32/enum.TryFromError.html | 2 +- .../bitcoin/bech32/primitives/gf32/index.html | 2 +- .../bech32/primitives/gf32/struct.Fe32.html | 2 +- .../bech32/primitives/hrp/constant.BC.html | 2 +- .../bech32/primitives/hrp/constant.BCRT.html | 2 +- .../bech32/primitives/hrp/constant.TB.html | 2 +- .../bech32/primitives/hrp/enum.Error.html | 2 +- .../bitcoin/bech32/primitives/hrp/index.html | 2 +- .../primitives/hrp/struct.ByteIter.html | 2 +- .../primitives/hrp/struct.CharIter.html | 2 +- .../bech32/primitives/hrp/struct.Hrp.html | 2 +- .../hrp/struct.LowercaseByteIter.html | 2 +- .../hrp/struct.LowercaseCharIter.html | 2 +- .../bitcoin/bech32/primitives/index.html | 2 +- .../bitcoin/bech32/primitives/iter/index.html | 2 +- .../primitives/iter/struct.BytesToFes.html | 2 +- .../primitives/iter/struct.Checksummed.html | 2 +- .../primitives/iter/struct.FesToBytes.html | 2 +- .../primitives/iter/trait.ByteIterExt.html | 2 +- .../primitives/iter/trait.Fe32IterExt.html | 2 +- .../segwit/constant.MAX_STRING_LENGTH.html | 2 +- .../primitives/segwit/constant.VERSION_0.html | 2 +- .../primitives/segwit/constant.VERSION_1.html | 2 +- .../segwit/enum.WitnessLengthError.html | 2 +- .../fn.is_valid_witness_program_length.html | 2 +- .../segwit/fn.is_valid_witness_version.html | 2 +- .../fn.validate_witness_program_length.html | 2 +- .../segwit/fn.validate_witness_version.html | 2 +- .../bech32/primitives/segwit/index.html | 2 +- .../struct.InvalidWitnessVersionError.html | 2 +- .../bech32/segwit/constant.VERSION_0.html | 2 +- .../bech32/segwit/constant.VERSION_1.html | 2 +- .../bech32/segwit/enum.EncodeError.html | 2 +- .../bitcoin/bech32/segwit/fn.decode.html | 2 +- .../bitcoin/bech32/segwit/fn.encode.html | 2 +- .../fn.encode_lower_to_fmt_unchecked.html | 2 +- .../fn.encode_lower_to_writer_unchecked.html | 2 +- .../segwit/fn.encode_to_fmt_unchecked.html | 2 +- .../segwit/fn.encode_to_writer_unchecked.html | 2 +- .../fn.encode_upper_to_fmt_unchecked.html | 2 +- .../fn.encode_upper_to_writer_unchecked.html | 2 +- .../bitcoin/bech32/segwit/fn.encode_v0.html | 2 +- .../bitcoin/bech32/segwit/fn.encode_v1.html | 2 +- .../bech32/segwit/fn.encoded_length.html | 2 +- .../bitcoin/bech32/segwit/index.html | 2 +- .../bech32/segwit/struct.DecodeError.html | 2 +- .../bdk_chain/bitcoin/bech32/struct.Fe32.html | 2 +- .../bdk_chain/bitcoin/bech32/struct.Hrp.html | 2 +- .../bitcoin/bech32/trait.ByteIterExt.html | 2 +- .../bitcoin/bech32/trait.Checksum.html | 2 +- .../bitcoin/bech32/trait.Fe32IterExt.html | 2 +- .../bdk_chain/bitcoin/bip152/enum.Error.html | 2 +- .../bdk_chain/bitcoin/bip152/index.html | 2 +- .../bip152/struct.BlockTransactions.html | 2 +- .../struct.BlockTransactionsRequest.html | 2 +- .../bip152/struct.HeaderAndShortIds.html | 2 +- .../bip152/struct.PrefilledTransaction.html | 2 +- .../bitcoin/bip152/struct.ShortId.html | 2 +- .../bip152/struct.TxIndexOutOfRangeError.html | 2 +- .../bdk_chain/bitcoin/bip158/enum.Error.html | 2 +- .../bdk_chain/bitcoin/bip158/index.html | 2 +- .../bip158/struct.BitStreamReader.html | 2 +- .../bip158/struct.BitStreamWriter.html | 2 +- .../bitcoin/bip158/struct.BlockFilter.html | 2 +- .../bip158/struct.BlockFilterReader.html | 2 +- .../bip158/struct.BlockFilterWriter.html | 2 +- .../bitcoin/bip158/struct.FilterHash.html | 2 +- .../bitcoin/bip158/struct.FilterHeader.html | 2 +- .../bip158/struct.GcsFilterReader.html | 2 +- .../bip158/struct.GcsFilterWriter.html | 2 +- .../bitcoin/bip32/enum.ChildNumber.html | 2 +- .../bdk_chain/bitcoin/bip32/enum.Error.html | 2 +- .../latest/bdk_chain/bitcoin/bip32/index.html | 2 +- .../bitcoin/bip32/struct.ChainCode.html | 2 +- .../bitcoin/bip32/struct.DerivationPath.html | 2 +- .../bip32/struct.DerivationPathIterator.html | 2 +- .../bitcoin/bip32/struct.Fingerprint.html | 2 +- ...truct.InvalidBase58PayloadLengthError.html | 2 +- .../bitcoin/bip32/struct.XKeyIdentifier.html | 2 +- .../bdk_chain/bitcoin/bip32/struct.Xpriv.html | 2 +- .../bdk_chain/bitcoin/bip32/struct.Xpub.html | 2 +- .../bip32/trait.IntoDerivationPath.html | 2 +- .../bitcoin/bip32/type.ExtendedPrivKey.html | 2 +- .../bitcoin/bip32/type.ExtendedPubKey.html | 2 +- .../bitcoin/bip32/type.ExtendendPrivKey.html | 2 +- .../bitcoin/bip32/type.ExtendendPubKey.html | 2 +- .../bitcoin/bip32/type.KeySource.html | 2 +- .../blockdata/block/enum.Bip34Error.html | 2 +- .../blockdata/block/enum.ValidationError.html | 2 +- .../bitcoin/blockdata/block/index.html | 2 +- .../bitcoin/blockdata/block/struct.Block.html | 2 +- .../blockdata/block/struct.BlockHash.html | 2 +- .../blockdata/block/struct.Header.html | 2 +- .../blockdata/block/struct.TxMerkleNode.html | 2 +- .../blockdata/block/struct.Version.html | 2 +- .../block/struct.WitnessCommitment.html | 2 +- .../block/struct.WitnessMerkleNode.html | 2 +- .../constants/constant.COINBASE_MATURITY.html | 2 +- .../constant.DIFFCHANGE_INTERVAL.html | 2 +- .../constant.DIFFCHANGE_TIMESPAN.html | 2 +- .../constant.MAX_BLOCK_SIGOPS_COST.html | 2 +- .../constant.MAX_SCRIPTNUM_VALUE.html | 2 +- .../constant.MAX_SCRIPT_ELEMENT_SIZE.html | 2 +- .../constant.PUBKEY_ADDRESS_PREFIX_MAIN.html | 2 +- .../constant.PUBKEY_ADDRESS_PREFIX_TEST.html | 2 +- .../constant.SCRIPT_ADDRESS_PREFIX_MAIN.html | 2 +- .../constant.SCRIPT_ADDRESS_PREFIX_TEST.html | 2 +- .../constant.SUBSIDY_HALVING_INTERVAL.html | 2 +- .../constant.TARGET_BLOCK_SPACING.html | 2 +- .../constant.WITNESS_SCALE_FACTOR.html | 2 +- .../blockdata/constants/fn.genesis_block.html | 2 +- .../bitcoin/blockdata/constants/index.html | 2 +- .../blockdata/constants/struct.ChainHash.html | 2 +- .../bitcoin/blockdata/fee_rate/index.html | 2 +- .../blockdata/fee_rate/struct.FeeRate.html | 2 +- .../bdk_chain/bitcoin/blockdata/index.html | 2 +- .../constant.LOCK_TIME_THRESHOLD.html | 2 +- .../locktime/absolute/enum.LockTime.html | 2 +- .../blockdata/locktime/absolute/index.html | 2 +- .../absolute/struct.ConversionError.html | 2 +- .../locktime/absolute/struct.Height.html | 2 +- .../absolute/struct.ParseHeightError.html | 2 +- .../absolute/struct.ParseTimeError.html | 2 +- .../locktime/absolute/struct.Time.html | 2 +- .../bitcoin/blockdata/locktime/index.html | 2 +- .../locktime/relative/enum.LockTime.html | 2 +- .../blockdata/locktime/relative/index.html | 2 +- .../struct.DisabledLockTimeError.html | 2 +- .../locktime/relative/struct.Height.html | 2 +- .../struct.IncompatibleHeightError.html | 2 +- .../struct.IncompatibleTimeError.html | 2 +- .../locktime/relative/struct.Time.html | 2 +- .../relative/struct.TimeOverflowError.html | 2 +- .../opcodes/all/constant.OP_0NOTEQUAL.html | 2 +- .../opcodes/all/constant.OP_1ADD.html | 2 +- .../opcodes/all/constant.OP_1SUB.html | 2 +- .../opcodes/all/constant.OP_2DIV.html | 2 +- .../opcodes/all/constant.OP_2DROP.html | 2 +- .../opcodes/all/constant.OP_2DUP.html | 2 +- .../opcodes/all/constant.OP_2MUL.html | 2 +- .../opcodes/all/constant.OP_2OVER.html | 2 +- .../opcodes/all/constant.OP_2ROT.html | 2 +- .../opcodes/all/constant.OP_2SWAP.html | 2 +- .../opcodes/all/constant.OP_3DUP.html | 2 +- .../opcodes/all/constant.OP_ABS.html | 2 +- .../opcodes/all/constant.OP_ADD.html | 2 +- .../opcodes/all/constant.OP_AND.html | 2 +- .../opcodes/all/constant.OP_BOOLAND.html | 2 +- .../opcodes/all/constant.OP_BOOLOR.html | 2 +- .../opcodes/all/constant.OP_CAT.html | 2 +- .../all/constant.OP_CHECKMULTISIG.html | 2 +- .../all/constant.OP_CHECKMULTISIGVERIFY.html | 2 +- .../opcodes/all/constant.OP_CHECKSIG.html | 2 +- .../opcodes/all/constant.OP_CHECKSIGADD.html | 2 +- .../all/constant.OP_CHECKSIGVERIFY.html | 2 +- .../opcodes/all/constant.OP_CLTV.html | 2 +- .../all/constant.OP_CODESEPARATOR.html | 2 +- .../opcodes/all/constant.OP_CSV.html | 2 +- .../opcodes/all/constant.OP_DEPTH.html | 2 +- .../opcodes/all/constant.OP_DIV.html | 2 +- .../opcodes/all/constant.OP_DROP.html | 2 +- .../opcodes/all/constant.OP_DUP.html | 2 +- .../opcodes/all/constant.OP_ELSE.html | 2 +- .../opcodes/all/constant.OP_ENDIF.html | 2 +- .../opcodes/all/constant.OP_EQUAL.html | 2 +- .../opcodes/all/constant.OP_EQUALVERIFY.html | 2 +- .../opcodes/all/constant.OP_FROMALTSTACK.html | 2 +- .../opcodes/all/constant.OP_GREATERTHAN.html | 2 +- .../all/constant.OP_GREATERTHANOREQUAL.html | 2 +- .../opcodes/all/constant.OP_HASH160.html | 2 +- .../opcodes/all/constant.OP_HASH256.html | 2 +- .../blockdata/opcodes/all/constant.OP_IF.html | 2 +- .../opcodes/all/constant.OP_IFDUP.html | 2 +- .../all/constant.OP_INVALIDOPCODE.html | 2 +- .../opcodes/all/constant.OP_INVERT.html | 2 +- .../opcodes/all/constant.OP_LEFT.html | 2 +- .../opcodes/all/constant.OP_LESSTHAN.html | 2 +- .../all/constant.OP_LESSTHANOREQUAL.html | 2 +- .../opcodes/all/constant.OP_LSHIFT.html | 2 +- .../opcodes/all/constant.OP_MAX.html | 2 +- .../opcodes/all/constant.OP_MIN.html | 2 +- .../opcodes/all/constant.OP_MOD.html | 2 +- .../opcodes/all/constant.OP_MUL.html | 2 +- .../opcodes/all/constant.OP_NEGATE.html | 2 +- .../opcodes/all/constant.OP_NIP.html | 2 +- .../opcodes/all/constant.OP_NOP.html | 2 +- .../opcodes/all/constant.OP_NOP1.html | 2 +- .../opcodes/all/constant.OP_NOP10.html | 2 +- .../opcodes/all/constant.OP_NOP4.html | 2 +- .../opcodes/all/constant.OP_NOP5.html | 2 +- .../opcodes/all/constant.OP_NOP6.html | 2 +- .../opcodes/all/constant.OP_NOP7.html | 2 +- .../opcodes/all/constant.OP_NOP8.html | 2 +- .../opcodes/all/constant.OP_NOP9.html | 2 +- .../opcodes/all/constant.OP_NOT.html | 2 +- .../opcodes/all/constant.OP_NOTIF.html | 2 +- .../opcodes/all/constant.OP_NUMEQUAL.html | 2 +- .../all/constant.OP_NUMEQUALVERIFY.html | 2 +- .../opcodes/all/constant.OP_NUMNOTEQUAL.html | 2 +- .../blockdata/opcodes/all/constant.OP_OR.html | 2 +- .../opcodes/all/constant.OP_OVER.html | 2 +- .../opcodes/all/constant.OP_PICK.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_0.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_1.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_10.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_11.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_12.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_13.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_14.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_15.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_16.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_17.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_18.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_19.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_2.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_20.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_21.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_22.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_23.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_24.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_25.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_26.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_27.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_28.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_29.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_3.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_30.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_31.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_32.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_33.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_34.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_35.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_36.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_37.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_38.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_39.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_4.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_40.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_41.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_42.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_43.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_44.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_45.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_46.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_47.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_48.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_49.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_5.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_50.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_51.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_52.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_53.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_54.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_55.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_56.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_57.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_58.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_59.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_6.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_60.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_61.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_62.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_63.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_64.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_65.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_66.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_67.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_68.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_69.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_7.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_70.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_71.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_72.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_73.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_74.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_75.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_8.html | 2 +- .../opcodes/all/constant.OP_PUSHBYTES_9.html | 2 +- .../opcodes/all/constant.OP_PUSHDATA1.html | 2 +- .../opcodes/all/constant.OP_PUSHDATA2.html | 2 +- .../opcodes/all/constant.OP_PUSHDATA4.html | 2 +- .../opcodes/all/constant.OP_PUSHNUM_1.html | 2 +- .../opcodes/all/constant.OP_PUSHNUM_10.html | 2 +- .../opcodes/all/constant.OP_PUSHNUM_11.html | 2 +- .../opcodes/all/constant.OP_PUSHNUM_12.html | 2 +- .../opcodes/all/constant.OP_PUSHNUM_13.html | 2 +- .../opcodes/all/constant.OP_PUSHNUM_14.html | 2 +- .../opcodes/all/constant.OP_PUSHNUM_15.html | 2 +- .../opcodes/all/constant.OP_PUSHNUM_16.html | 2 +- .../opcodes/all/constant.OP_PUSHNUM_2.html | 2 +- .../opcodes/all/constant.OP_PUSHNUM_3.html | 2 +- .../opcodes/all/constant.OP_PUSHNUM_4.html | 2 +- .../opcodes/all/constant.OP_PUSHNUM_5.html | 2 +- .../opcodes/all/constant.OP_PUSHNUM_6.html | 2 +- .../opcodes/all/constant.OP_PUSHNUM_7.html | 2 +- .../opcodes/all/constant.OP_PUSHNUM_8.html | 2 +- .../opcodes/all/constant.OP_PUSHNUM_9.html | 2 +- .../opcodes/all/constant.OP_PUSHNUM_NEG1.html | 2 +- .../opcodes/all/constant.OP_RESERVED.html | 2 +- .../opcodes/all/constant.OP_RESERVED1.html | 2 +- .../opcodes/all/constant.OP_RESERVED2.html | 2 +- .../opcodes/all/constant.OP_RETURN.html | 2 +- .../opcodes/all/constant.OP_RETURN_187.html | 2 +- .../opcodes/all/constant.OP_RETURN_188.html | 2 +- .../opcodes/all/constant.OP_RETURN_189.html | 2 +- .../opcodes/all/constant.OP_RETURN_190.html | 2 +- .../opcodes/all/constant.OP_RETURN_191.html | 2 +- .../opcodes/all/constant.OP_RETURN_192.html | 2 +- .../opcodes/all/constant.OP_RETURN_193.html | 2 +- .../opcodes/all/constant.OP_RETURN_194.html | 2 +- .../opcodes/all/constant.OP_RETURN_195.html | 2 +- .../opcodes/all/constant.OP_RETURN_196.html | 2 +- .../opcodes/all/constant.OP_RETURN_197.html | 2 +- .../opcodes/all/constant.OP_RETURN_198.html | 2 +- .../opcodes/all/constant.OP_RETURN_199.html | 2 +- .../opcodes/all/constant.OP_RETURN_200.html | 2 +- .../opcodes/all/constant.OP_RETURN_201.html | 2 +- .../opcodes/all/constant.OP_RETURN_202.html | 2 +- .../opcodes/all/constant.OP_RETURN_203.html | 2 +- .../opcodes/all/constant.OP_RETURN_204.html | 2 +- .../opcodes/all/constant.OP_RETURN_205.html | 2 +- .../opcodes/all/constant.OP_RETURN_206.html | 2 +- .../opcodes/all/constant.OP_RETURN_207.html | 2 +- .../opcodes/all/constant.OP_RETURN_208.html | 2 +- .../opcodes/all/constant.OP_RETURN_209.html | 2 +- .../opcodes/all/constant.OP_RETURN_210.html | 2 +- .../opcodes/all/constant.OP_RETURN_211.html | 2 +- .../opcodes/all/constant.OP_RETURN_212.html | 2 +- .../opcodes/all/constant.OP_RETURN_213.html | 2 +- .../opcodes/all/constant.OP_RETURN_214.html | 2 +- .../opcodes/all/constant.OP_RETURN_215.html | 2 +- .../opcodes/all/constant.OP_RETURN_216.html | 2 +- .../opcodes/all/constant.OP_RETURN_217.html | 2 +- .../opcodes/all/constant.OP_RETURN_218.html | 2 +- .../opcodes/all/constant.OP_RETURN_219.html | 2 +- .../opcodes/all/constant.OP_RETURN_220.html | 2 +- .../opcodes/all/constant.OP_RETURN_221.html | 2 +- .../opcodes/all/constant.OP_RETURN_222.html | 2 +- .../opcodes/all/constant.OP_RETURN_223.html | 2 +- .../opcodes/all/constant.OP_RETURN_224.html | 2 +- .../opcodes/all/constant.OP_RETURN_225.html | 2 +- .../opcodes/all/constant.OP_RETURN_226.html | 2 +- .../opcodes/all/constant.OP_RETURN_227.html | 2 +- .../opcodes/all/constant.OP_RETURN_228.html | 2 +- .../opcodes/all/constant.OP_RETURN_229.html | 2 +- .../opcodes/all/constant.OP_RETURN_230.html | 2 +- .../opcodes/all/constant.OP_RETURN_231.html | 2 +- .../opcodes/all/constant.OP_RETURN_232.html | 2 +- .../opcodes/all/constant.OP_RETURN_233.html | 2 +- .../opcodes/all/constant.OP_RETURN_234.html | 2 +- .../opcodes/all/constant.OP_RETURN_235.html | 2 +- .../opcodes/all/constant.OP_RETURN_236.html | 2 +- .../opcodes/all/constant.OP_RETURN_237.html | 2 +- .../opcodes/all/constant.OP_RETURN_238.html | 2 +- .../opcodes/all/constant.OP_RETURN_239.html | 2 +- .../opcodes/all/constant.OP_RETURN_240.html | 2 +- .../opcodes/all/constant.OP_RETURN_241.html | 2 +- .../opcodes/all/constant.OP_RETURN_242.html | 2 +- .../opcodes/all/constant.OP_RETURN_243.html | 2 +- .../opcodes/all/constant.OP_RETURN_244.html | 2 +- .../opcodes/all/constant.OP_RETURN_245.html | 2 +- .../opcodes/all/constant.OP_RETURN_246.html | 2 +- .../opcodes/all/constant.OP_RETURN_247.html | 2 +- .../opcodes/all/constant.OP_RETURN_248.html | 2 +- .../opcodes/all/constant.OP_RETURN_249.html | 2 +- .../opcodes/all/constant.OP_RETURN_250.html | 2 +- .../opcodes/all/constant.OP_RETURN_251.html | 2 +- .../opcodes/all/constant.OP_RETURN_252.html | 2 +- .../opcodes/all/constant.OP_RETURN_253.html | 2 +- .../opcodes/all/constant.OP_RETURN_254.html | 2 +- .../opcodes/all/constant.OP_RIGHT.html | 2 +- .../opcodes/all/constant.OP_RIPEMD160.html | 2 +- .../opcodes/all/constant.OP_ROLL.html | 2 +- .../opcodes/all/constant.OP_ROT.html | 2 +- .../opcodes/all/constant.OP_RSHIFT.html | 2 +- .../opcodes/all/constant.OP_SHA1.html | 2 +- .../opcodes/all/constant.OP_SHA256.html | 2 +- .../opcodes/all/constant.OP_SIZE.html | 2 +- .../opcodes/all/constant.OP_SUB.html | 2 +- .../opcodes/all/constant.OP_SUBSTR.html | 2 +- .../opcodes/all/constant.OP_SWAP.html | 2 +- .../opcodes/all/constant.OP_TOALTSTACK.html | 2 +- .../opcodes/all/constant.OP_TUCK.html | 2 +- .../opcodes/all/constant.OP_VER.html | 2 +- .../opcodes/all/constant.OP_VERIF.html | 2 +- .../opcodes/all/constant.OP_VERIFY.html | 2 +- .../opcodes/all/constant.OP_VERNOTIF.html | 2 +- .../opcodes/all/constant.OP_WITHIN.html | 2 +- .../opcodes/all/constant.OP_XOR.html | 2 +- .../bitcoin/blockdata/opcodes/all/index.html | 2 +- .../bitcoin/blockdata/opcodes/enum.Class.html | 2 +- .../opcodes/enum.ClassifyContext.html | 2 +- .../bitcoin/blockdata/opcodes/index.html | 2 +- .../blockdata/opcodes/static.OP_0.html | 2 +- .../blockdata/opcodes/static.OP_FALSE.html | 2 +- .../blockdata/opcodes/static.OP_NOP2.html | 2 +- .../blockdata/opcodes/static.OP_NOP3.html | 2 +- .../blockdata/opcodes/static.OP_TRUE.html | 2 +- .../blockdata/opcodes/struct.Opcode.html | 2 +- .../bitcoin/blockdata/script/enum.Error.html | 2 +- .../blockdata/script/enum.Instruction.html | 2 +- .../blockdata/script/fn.read_scriptbool.html | 2 +- .../blockdata/script/fn.read_scriptint.html | 2 +- .../script/fn.read_scriptint_non_minimal.html | 2 +- .../blockdata/script/fn.write_scriptint.html | 2 +- .../bitcoin/blockdata/script/index.html | 2 +- .../blockdata/script/struct.Builder.html | 2 +- .../blockdata/script/struct.Bytes.html | 2 +- .../script/struct.InstructionIndices.html | 2 +- .../blockdata/script/struct.Instructions.html | 2 +- .../blockdata/script/struct.PushBytes.html | 2 +- .../blockdata/script/struct.PushBytesBuf.html | 6 +- .../script/struct.PushBytesError.html | 2 +- .../blockdata/script/struct.Script.html | 2 +- .../blockdata/script/struct.ScriptBuf.html | 6 +- .../blockdata/script/struct.ScriptHash.html | 2 +- .../blockdata/script/struct.WScriptHash.html | 2 +- .../script/trait.PushBytesErrorReport.html | 2 +- .../witness_program/constant.MAX_SIZE.html | 2 +- .../witness_program/constant.MIN_SIZE.html | 2 +- .../script/witness_program/enum.Error.html | 2 +- .../script/witness_program/index.html | 2 +- .../struct.WitnessProgram.html | 2 +- .../witness_version/enum.FromStrError.html | 2 +- .../enum.TryFromInstructionError.html | 2 +- .../witness_version/enum.WitnessVersion.html | 2 +- .../script/witness_version/index.html | 2 +- .../witness_version/struct.TryFromError.html | 2 +- .../bitcoin/blockdata/struct.FeeRate.html | 2 +- .../bitcoin/blockdata/struct.Weight.html | 2 +- .../transaction/enum.ParseOutPointError.html | 2 +- .../transaction/fn.effective_value.html | 2 +- .../transaction/fn.predict_weight.html | 2 +- .../fn.predict_weight_from_slices.html | 2 +- .../bitcoin/blockdata/transaction/index.html | 2 +- .../struct.IndexOutOfBoundsError.html | 2 +- .../struct.InputWeightPrediction.html | 2 +- .../transaction/struct.InputsIndexError.html | 2 +- .../transaction/struct.OutPoint.html | 2 +- .../transaction/struct.OutputsIndexError.html | 2 +- .../transaction/struct.Sequence.html | 2 +- .../transaction/struct.Transaction.html | 2 +- .../blockdata/transaction/struct.TxIn.html | 2 +- .../blockdata/transaction/struct.TxOut.html | 2 +- .../blockdata/transaction/struct.Txid.html | 2 +- .../blockdata/transaction/struct.Version.html | 2 +- .../blockdata/transaction/struct.Wtxid.html | 2 +- .../weight/constant.WITNESS_SCALE_FACTOR.html | 2 +- .../bitcoin/blockdata/weight/index.html | 2 +- .../blockdata/weight/struct.Weight.html | 2 +- .../bitcoin/blockdata/witness/index.html | 2 +- .../blockdata/witness/struct.Iter.html | 2 +- .../blockdata/witness/struct.Witness.html | 2 +- .../encode/constant.MAX_VEC_SIZE.html | 2 +- .../bitcoin/consensus/encode/enum.Error.html | 2 +- .../consensus/encode/enum.FromHexError.html | 2 +- .../consensus/encode/fn.deserialize.html | 2 +- .../consensus/encode/fn.deserialize_hex.html | 2 +- .../encode/fn.deserialize_partial.html | 2 +- .../consensus/encode/fn.serialize.html | 2 +- .../consensus/encode/fn.serialize_hex.html | 2 +- .../bitcoin/consensus/encode/index.html | 2 +- .../consensus/encode/struct.CheckedData.html | 2 +- .../consensus/encode/struct.VarInt.html | 2 +- .../consensus/encode/trait.Decodable.html | 2 +- .../consensus/encode/trait.Encodable.html | 2 +- .../consensus/encode/trait.ReadExt.html | 2 +- .../consensus/encode/trait.WriteExt.html | 2 +- .../bitcoin/consensus/enum.DecodeError.html | 2 +- .../bitcoin/consensus/fn.deserialize.html | 2 +- .../consensus/fn.deserialize_partial.html | 2 +- .../bitcoin/consensus/fn.serialize.html | 2 +- .../bdk_chain/bitcoin/consensus/index.html | 2 +- .../bitcoin/consensus/params/index.html | 2 +- .../consensus/params/static.MAINNET.html | 2 +- .../consensus/params/static.REGTEST.html | 2 +- .../consensus/params/static.SIGNET.html | 2 +- .../consensus/params/static.TESTNET.html | 2 +- .../consensus/params/static.TESTNET3.html | 2 +- .../consensus/params/static.TESTNET4.html | 2 +- .../consensus/params/struct.Params.html | 2 +- .../consensus/serde/hex/enum.Lower.html | 2 +- .../consensus/serde/hex/enum.Upper.html | 2 +- .../bitcoin/consensus/serde/hex/index.html | 2 +- .../serde/hex/struct.DecodeError.html | 2 +- .../serde/hex/struct.DecodeInitError.html | 2 +- .../consensus/serde/hex/struct.Decoder.html | 2 +- .../consensus/serde/hex/struct.Encoder.html | 2 +- .../consensus/serde/hex/trait.Case.html | 2 +- .../bitcoin/consensus/serde/index.html | 2 +- .../bitcoin/consensus/serde/struct.Hex.html | 2 +- .../bitcoin/consensus/serde/struct.With.html | 2 +- .../consensus/serde/trait.ByteDecoder.html | 2 +- .../consensus/serde/trait.ByteEncoder.html | 2 +- .../consensus/serde/trait.EncodeBytes.html | 2 +- .../consensus/serde/trait.IntoDeError.html | 2 +- .../bitcoin/consensus/struct.Params.html | 2 +- .../bitcoin/consensus/trait.Decodable.html | 2 +- .../bitcoin/consensus/trait.Encodable.html | 2 +- .../bitcoin/consensus/trait.ReadExt.html | 2 +- .../bitcoin/consensus/trait.WriteExt.html | 2 +- .../bdk_chain/bitcoin/ecdsa/enum.Error.html | 2 +- .../latest/bdk_chain/bitcoin/ecdsa/index.html | 2 +- .../ecdsa/struct.SerializedSignature.html | 541 ++++++++------ .../bitcoin/ecdsa/struct.Signature.html | 2 +- .../bdk_chain/bitcoin/enum.AddressType.html | 2 +- .../bdk_chain/bitcoin/enum.Denomination.html | 2 +- .../bitcoin/enum.EcdsaSighashType.html | 2 +- .../bdk_chain/bitcoin/enum.KnownHrp.html | 2 +- .../bdk_chain/bitcoin/enum.Network.html | 2 +- .../bdk_chain/bitcoin/enum.NetworkKind.html | 2 +- .../bitcoin/enum.TapSighashType.html | 2 +- .../bitcoin/enum.WitnessVersion.html | 2 +- .../bitcoin/error/enum.PrefixedHexError.html | 2 +- .../error/enum.UnprefixedHexError.html | 2 +- .../latest/bdk_chain/bitcoin/error/index.html | 2 +- .../error/struct.ContainsPrefixError.html | 2 +- .../error/struct.MissingPrefixError.html | 2 +- .../bitcoin/error/struct.ParseIntError.html | 2 +- .../bdk_chain/bitcoin/hash_types/index.html | 2 +- .../bitcoin/hash_types/struct.BlockHash.html | 2 +- .../bitcoin/hash_types/struct.FilterHash.html | 2 +- .../hash_types/struct.FilterHeader.html | 2 +- .../hash_types/struct.TxMerkleNode.html | 2 +- .../bitcoin/hash_types/struct.Txid.html | 2 +- .../hash_types/struct.WitnessCommitment.html | 2 +- .../hash_types/struct.WitnessMerkleNode.html | 2 +- .../bitcoin/hash_types/struct.Wtxid.html | 2 +- .../bitcoin/hashes/cmp/fn.fixed_time_eq.html | 2 +- .../bdk_chain/bitcoin/hashes/cmp/index.html | 2 +- .../bitcoin/hashes/hash160/index.html | 2 +- .../bitcoin/hashes/hash160/struct.Hash.html | 2 +- .../bitcoin/hashes/hex/buf_encoder/index.html | 2 +- .../hex/buf_encoder/struct.BufEncoder.html | 2 +- .../bitcoin/hashes/hex/display/index.html | 2 +- .../hex/display/macro.fmt_hex_exact.html | 2 +- .../hex/display/macro.impl_fmt_traits.html | 2 +- .../hex/display/struct.DisplayArray.html | 2 +- .../hex/display/struct.DisplayByteSlice.html | 2 +- .../hashes/hex/display/trait.DisplayHex.html | 2 +- .../bitcoin/hashes/hex/enum.Case.html | 2 +- .../hashes/hex/enum.HexToArrayError.html | 2 +- .../hashes/hex/enum.HexToBytesError.html | 2 +- .../hex/error/enum.HexToArrayError.html | 2 +- .../hex/error/enum.HexToBytesError.html | 2 +- .../bitcoin/hashes/hex/error/index.html | 2 +- .../hex/error/struct.InvalidCharError.html | 2 +- .../hex/error/struct.InvalidLengthError.html | 2 +- .../error/struct.OddLengthStringError.html | 2 +- .../bdk_chain/bitcoin/hashes/hex/index.html | 2 +- .../hashes/hex/macro.fmt_hex_exact.html | 2 +- .../hashes/hex/macro.impl_fmt_traits.html | 2 +- .../hashes/hex/macro.test_hex_unwrap.html | 2 +- .../bitcoin/hashes/hex/macro.write_err.html | 2 +- .../hex/parse/enum.HexToArrayError.html | 2 +- .../hex/parse/enum.HexToBytesError.html | 2 +- .../bitcoin/hashes/hex/parse/index.html | 2 +- .../hashes/hex/parse/trait.FromHex.html | 2 +- .../bitcoin/hashes/hex/prelude/index.html | 2 +- .../hashes/hex/prelude/trait.DisplayHex.html | 2 +- .../hashes/hex/prelude/trait.FromHex.html | 2 +- .../hashes/hex/struct.BytesToHexIter.html | 2 +- .../hashes/hex/struct.HexToBytesIter.html | 2 +- .../hashes/hex/struct.InvalidCharError.html | 2 +- .../hex/struct.OddLengthStringError.html | 2 +- .../bitcoin/hashes/hex/trait.DisplayHex.html | 2 +- .../bitcoin/hashes/hex/trait.FromHex.html | 2 +- .../hashes/hex/type.HexSliceToBytesIter.html | 2 +- .../bdk_chain/bitcoin/hashes/hmac/index.html | 2 +- .../bitcoin/hashes/hmac/struct.Hmac.html | 2 +- .../hashes/hmac/struct.HmacEngine.html | 2 +- .../hashes/hmac/struct.HmacMidState.html | 2 +- .../bdk_chain/bitcoin/hashes/index.html | 2 +- .../hashes/macro.borrow_slice_impl.html | 2 +- .../bitcoin/hashes/macro.hash_newtype.html | 2 +- .../bitcoin/hashes/macro.hex_fmt_impl.html | 2 +- .../bitcoin/hashes/macro.serde_impl.html | 2 +- .../hashes/macro.sha256t_hash_newtype.html | 2 +- .../bitcoin/hashes/ripemd160/index.html | 2 +- .../bitcoin/hashes/ripemd160/struct.Hash.html | 2 +- .../hashes/ripemd160/struct.HashEngine.html | 2 +- .../hashes/serde/de/enum.Unexpected.html | 2 +- .../bitcoin/hashes/serde/de/index.html | 2 +- .../hashes/serde/de/struct.IgnoredAny.html | 2 +- .../hashes/serde/de/trait.Deserialize.html | 4 +- .../serde/de/trait.DeserializeOwned.html | 2 +- .../serde/de/trait.DeserializeSeed.html | 2 +- .../hashes/serde/de/trait.Deserializer.html | 2 +- .../hashes/serde/de/trait.EnumAccess.html | 2 +- .../bitcoin/hashes/serde/de/trait.Error.html | 2 +- .../hashes/serde/de/trait.Expected.html | 2 +- .../serde/de/trait.IntoDeserializer.html | 2 +- .../hashes/serde/de/trait.MapAccess.html | 2 +- .../hashes/serde/de/trait.SeqAccess.html | 2 +- .../hashes/serde/de/trait.StdError.html | 6 +- .../hashes/serde/de/trait.VariantAccess.html | 2 +- .../hashes/serde/de/trait.Visitor.html | 2 +- .../bitcoin/hashes/serde/de/value/index.html | 2 +- .../de/value/struct.BoolDeserializer.html | 2 +- .../struct.BorrowedBytesDeserializer.html | 2 +- .../value/struct.BorrowedStrDeserializer.html | 2 +- .../de/value/struct.BytesDeserializer.html | 2 +- .../de/value/struct.CharDeserializer.html | 2 +- .../de/value/struct.CowStrDeserializer.html | 2 +- .../value/struct.EnumAccessDeserializer.html | 2 +- .../hashes/serde/de/value/struct.Error.html | 2 +- .../de/value/struct.F32Deserializer.html | 2 +- .../de/value/struct.F64Deserializer.html | 2 +- .../de/value/struct.I128Deserializer.html | 2 +- .../de/value/struct.I16Deserializer.html | 2 +- .../de/value/struct.I32Deserializer.html | 2 +- .../de/value/struct.I64Deserializer.html | 2 +- .../serde/de/value/struct.I8Deserializer.html | 2 +- .../de/value/struct.IsizeDeserializer.html | 2 +- .../value/struct.MapAccessDeserializer.html | 2 +- .../de/value/struct.MapDeserializer.html | 2 +- .../value/struct.SeqAccessDeserializer.html | 2 +- .../de/value/struct.SeqDeserializer.html | 2 +- .../de/value/struct.StrDeserializer.html | 2 +- .../de/value/struct.StringDeserializer.html | 2 +- .../de/value/struct.U128Deserializer.html | 2 +- .../de/value/struct.U16Deserializer.html | 2 +- .../de/value/struct.U32Deserializer.html | 2 +- .../de/value/struct.U64Deserializer.html | 2 +- .../serde/de/value/struct.U8Deserializer.html | 2 +- .../de/value/struct.UnitDeserializer.html | 2 +- .../de/value/struct.UsizeDeserializer.html | 2 +- .../hashes/serde/derive.Deserialize.html | 2 +- .../hashes/serde/derive.Serialize.html | 2 +- .../bdk_chain/bitcoin/hashes/serde/index.html | 2 +- .../macro.forward_to_deserialize_any.html | 2 +- .../bitcoin/hashes/serde/ser/index.html | 2 +- .../hashes/serde/ser/struct.Impossible.html | 2 +- .../bitcoin/hashes/serde/ser/trait.Error.html | 2 +- .../hashes/serde/ser/trait.Serialize.html | 4 +- .../hashes/serde/ser/trait.SerializeMap.html | 2 +- .../hashes/serde/ser/trait.SerializeSeq.html | 2 +- .../serde/ser/trait.SerializeStruct.html | 2 +- .../ser/trait.SerializeStructVariant.html | 2 +- .../serde/ser/trait.SerializeTuple.html | 2 +- .../serde/ser/trait.SerializeTupleStruct.html | 2 +- .../ser/trait.SerializeTupleVariant.html | 2 +- .../hashes/serde/ser/trait.Serializer.html | 2 +- .../hashes/serde/ser/trait.StdError.html | 6 +- .../hashes/serde/trait.Deserialize.html | 4 +- .../hashes/serde/trait.Deserializer.html | 2 +- .../bitcoin/hashes/serde/trait.Serialize.html | 4 +- .../hashes/serde/trait.Serializer.html | 2 +- .../bitcoin/hashes/serde_macros/index.html | 2 +- .../serde_macros/serde_details/index.html | 2 +- .../serde_details/trait.SerdeHash.html | 2 +- .../bdk_chain/bitcoin/hashes/sha1/index.html | 2 +- .../bitcoin/hashes/sha1/struct.Hash.html | 2 +- .../hashes/sha1/struct.HashEngine.html | 2 +- .../bitcoin/hashes/sha256/index.html | 2 +- .../bitcoin/hashes/sha256/struct.Hash.html | 2 +- .../hashes/sha256/struct.HashEngine.html | 2 +- .../hashes/sha256/struct.Midstate.html | 2 +- .../bitcoin/hashes/sha256d/index.html | 2 +- .../bitcoin/hashes/sha256d/struct.Hash.html | 2 +- .../bitcoin/hashes/sha256t/index.html | 2 +- .../bitcoin/hashes/sha256t/struct.Hash.html | 2 +- .../bitcoin/hashes/sha256t/trait.Tag.html | 2 +- .../bitcoin/hashes/sha384/index.html | 2 +- .../bitcoin/hashes/sha384/struct.Hash.html | 2 +- .../hashes/sha384/struct.HashEngine.html | 2 +- .../bitcoin/hashes/sha512/index.html | 2 +- .../bitcoin/hashes/sha512/struct.Hash.html | 2 +- .../hashes/sha512/struct.HashEngine.html | 2 +- .../bitcoin/hashes/sha512_256/index.html | 2 +- .../hashes/sha512_256/struct.Hash.html | 2 +- .../hashes/sha512_256/struct.HashEngine.html | 2 +- .../bitcoin/hashes/siphash24/index.html | 2 +- .../bitcoin/hashes/siphash24/struct.Hash.html | 2 +- .../hashes/siphash24/struct.HashEngine.html | 2 +- .../hashes/siphash24/struct.State.html | 2 +- .../bitcoin/hashes/struct.FromSliceError.html | 2 +- .../bdk_chain/bitcoin/hashes/struct.Hmac.html | 2 +- .../bitcoin/hashes/struct.HmacEngine.html | 2 +- .../bdk_chain/bitcoin/hashes/trait.Hash.html | 2 +- .../bitcoin/hashes/trait.HashEngine.html | 2 +- .../latest/bdk_chain/bitcoin/index.html | 2 +- .../bdk_chain/bitcoin/io/enum.ErrorKind.html | 2 +- .../bdk_chain/bitcoin/io/fn.from_std.html | 2 +- .../bdk_chain/bitcoin/io/fn.from_std_mut.html | 2 +- .../latest/bdk_chain/bitcoin/io/fn.sink.html | 2 +- .../latest/bdk_chain/bitcoin/io/index.html | 2 +- .../bitcoin/io/macro.impl_write.html | 2 +- .../bdk_chain/bitcoin/io/struct.Cursor.html | 2 +- .../bdk_chain/bitcoin/io/struct.Error.html | 2 +- .../bdk_chain/bitcoin/io/struct.FromStd.html | 2 +- .../bdk_chain/bitcoin/io/struct.Sink.html | 2 +- .../bdk_chain/bitcoin/io/struct.Take.html | 2 +- .../bdk_chain/bitcoin/io/struct.ToStd.html | 2 +- .../bdk_chain/bitcoin/io/trait.BufRead.html | 2 +- .../bdk_chain/bitcoin/io/trait.Read.html | 2 +- .../bdk_chain/bitcoin/io/trait.Write.html | 2 +- .../bdk_chain/bitcoin/io/type.Result.html | 2 +- .../bitcoin/key/enum.FromSliceError.html | 2 +- .../bitcoin/key/enum.FromWifError.html | 2 +- .../bdk_chain/bitcoin/key/enum.Parity.html | 2 +- .../enum.ParseCompressedPublicKeyError.html | 2 +- .../bitcoin/key/enum.ParsePublicKeyError.html | 2 +- .../latest/bdk_chain/bitcoin/key/index.html | 2 +- .../key/struct.CompressedPublicKey.html | 2 +- .../struct.InvalidAddressVersionError.html | 2 +- ...truct.InvalidBase58PayloadLengthError.html | 2 +- .../bdk_chain/bitcoin/key/struct.Keypair.html | 2 +- .../bitcoin/key/struct.PrivateKey.html | 2 +- .../bitcoin/key/struct.PubkeyHash.html | 2 +- .../bitcoin/key/struct.PublicKey.html | 2 +- .../bitcoin/key/struct.Secp256k1.html | 2 +- .../bdk_chain/bitcoin/key/struct.SortKey.html | 2 +- .../bitcoin/key/struct.TweakedKeypair.html | 2 +- .../bitcoin/key/struct.TweakedPublicKey.html | 2 +- .../struct.UncompressedPublicKeyError.html | 2 +- .../bitcoin/key/struct.WPubkeyHash.html | 2 +- .../bitcoin/key/struct.XOnlyPublicKey.html | 2 +- .../bdk_chain/bitcoin/key/trait.TapTweak.html | 2 +- .../bitcoin/key/trait.Verification.html | 2 +- .../bitcoin/key/type.UntweakedKeypair.html | 2 +- .../bitcoin/key/type.UntweakedPublicKey.html | 2 +- .../merkle_tree/enum.MerkleBlockError.html | 2 +- .../merkle_tree/fn.calculate_root.html | 2 +- .../merkle_tree/fn.calculate_root_inline.html | 2 +- .../bdk_chain/bitcoin/merkle_tree/index.html | 2 +- .../merkle_tree/struct.MerkleBlock.html | 2 +- .../merkle_tree/struct.PartialMerkleTree.html | 2 +- .../network/as_core_arg/fn.deserialize.html | 2 +- .../network/as_core_arg/fn.serialize.html | 2 +- .../bitcoin/network/as_core_arg/index.html | 2 +- .../bitcoin/network/enum.Network.html | 2 +- .../bitcoin/network/enum.NetworkKind.html | 2 +- .../bdk_chain/bitcoin/network/index.html | 2 +- .../network/struct.ParseNetworkError.html | 2 +- .../network/struct.UnknownChainHashError.html | 2 +- .../bitcoin/p2p/address/enum.AddrV2.html | 2 +- .../bdk_chain/bitcoin/p2p/address/index.html | 2 +- .../p2p/address/struct.AddrV2Message.html | 2 +- .../bitcoin/p2p/address/struct.Address.html | 2 +- .../p2p/constant.PROTOCOL_VERSION.html | 2 +- .../latest/bdk_chain/bitcoin/p2p/index.html | 2 +- .../p2p/message/constant.MAX_INV_SIZE.html | 2 +- .../p2p/message/constant.MAX_MSG_SIZE.html | 2 +- .../p2p/message/enum.NetworkMessage.html | 2 +- .../bdk_chain/bitcoin/p2p/message/index.html | 2 +- .../p2p/message/struct.CommandString.html | 2 +- .../message/struct.CommandStringError.html | 2 +- .../p2p/message/struct.RawNetworkMessage.html | 2 +- .../p2p/message_blockdata/enum.Inventory.html | 2 +- .../bitcoin/p2p/message_blockdata/index.html | 2 +- .../struct.GetBlocksMessage.html | 2 +- .../struct.GetHeadersMessage.html | 2 +- .../p2p/message_bloom/enum.BloomFlags.html | 2 +- .../bitcoin/p2p/message_bloom/index.html | 2 +- .../p2p/message_bloom/struct.FilterAdd.html | 2 +- .../p2p/message_bloom/struct.FilterLoad.html | 2 +- .../p2p/message_compact_blocks/index.html | 2 +- .../struct.BlockTxn.html | 2 +- .../struct.CmpctBlock.html | 2 +- .../struct.GetBlockTxn.html | 2 +- .../struct.SendCmpct.html | 2 +- .../bitcoin/p2p/message_filter/index.html | 2 +- .../p2p/message_filter/struct.CFCheckpt.html | 2 +- .../p2p/message_filter/struct.CFHeaders.html | 2 +- .../p2p/message_filter/struct.CFilter.html | 2 +- .../message_filter/struct.GetCFCheckpt.html | 2 +- .../message_filter/struct.GetCFHeaders.html | 2 +- .../message_filter/struct.GetCFilters.html | 2 +- .../message_network/enum.RejectReason.html | 2 +- .../bitcoin/p2p/message_network/index.html | 2 +- .../p2p/message_network/struct.Reject.html | 2 +- .../struct.VersionMessage.html | 2 +- .../bdk_chain/bitcoin/p2p/struct.Address.html | 2 +- .../bdk_chain/bitcoin/p2p/struct.Magic.html | 2 +- .../bitcoin/p2p/struct.ParseMagicError.html | 2 +- .../bitcoin/p2p/struct.ServiceFlags.html | 2 +- .../bitcoin/p2p/struct.UnknownMagicError.html | 2 +- .../latest/bdk_chain/bitcoin/parse/index.html | 2 +- .../bitcoin/parse/struct.ParseIntError.html | 2 +- .../constant.DEFAULT_BYTES_PER_SIGOP.html | 2 +- ...onstant.DEFAULT_INCREMENTAL_RELAY_FEE.html | 2 +- .../constant.DEFAULT_MEMPOOL_EXPIRY.html | 2 +- .../constant.DEFAULT_MIN_RELAY_TX_FEE.html | 2 +- .../policy/constant.DUST_RELAY_TX_FEE.html | 2 +- .../constant.MAX_STANDARD_TX_SIGOPS_COST.html | 2 +- .../constant.MAX_STANDARD_TX_WEIGHT.html | 2 +- ...stant.MIN_STANDARD_TX_NONWITNESS_SIZE.html | 2 +- .../policy/fn.get_virtual_tx_size.html | 2 +- .../bdk_chain/bitcoin/policy/index.html | 2 +- .../latest/bdk_chain/bitcoin/pow/index.html | 2 +- .../bitcoin/pow/struct.CompactTarget.html | 2 +- .../bdk_chain/bitcoin/pow/struct.Target.html | 2 +- .../bdk_chain/bitcoin/pow/struct.Work.html | 2 +- .../bdk_chain/bitcoin/psbt/enum.Error.html | 2 +- .../bitcoin/psbt/enum.ExtractTxError.html | 2 +- .../bitcoin/psbt/enum.GetKeyError.html | 2 +- .../psbt/enum.IndexOutOfBoundsError.html | 2 +- .../bitcoin/psbt/enum.KeyRequest.html | 2 +- .../bitcoin/psbt/enum.OutputType.html | 2 +- .../bitcoin/psbt/enum.PsbtParseError.html | 2 +- .../bitcoin/psbt/enum.SignError.html | 2 +- .../bitcoin/psbt/enum.SigningAlgorithm.html | 2 +- .../bitcoin/psbt/enum.SigningKeys.html | 2 +- .../latest/bdk_chain/bitcoin/psbt/index.html | 2 +- .../bdk_chain/bitcoin/psbt/raw/index.html | 2 +- .../bitcoin/psbt/raw/struct.Key.html | 2 +- .../bitcoin/psbt/raw/struct.Pair.html | 2 +- .../psbt/raw/struct.ProprietaryKey.html | 2 +- .../psbt/raw/type.ProprietaryType.html | 2 +- .../bitcoin/psbt/serialize/index.html | 2 +- .../bdk_chain/bitcoin/psbt/struct.Input.html | 2 +- .../bdk_chain/bitcoin/psbt/struct.Output.html | 2 +- .../bdk_chain/bitcoin/psbt/struct.Psbt.html | 2 +- .../bitcoin/psbt/struct.PsbtSighashType.html | 2 +- .../bdk_chain/bitcoin/psbt/trait.GetKey.html | 2 +- .../bitcoin/psbt/type.SigningErrors.html | 2 +- .../bitcoin/psbt/type.SigningKeysMap.html | 2 +- .../constant.COMPACT_SIGNATURE_SIZE.html | 2 +- .../constants/constant.CURVE_ORDER.html | 2 +- .../constant.ELLSWIFT_ENCODING_SIZE.html | 2 +- .../constants/constant.FIELD_SIZE.html | 2 +- .../constants/constant.GENERATOR_X.html | 2 +- .../constants/constant.GENERATOR_Y.html | 2 +- .../constants/constant.KEY_PAIR_SIZE.html | 2 +- .../constant.MAX_SIGNATURE_SIZE.html | 2 +- .../constants/constant.MESSAGE_SIZE.html | 2 +- .../secp256k1/constants/constant.ONE.html | 2 +- .../constants/constant.PUBLIC_KEY_SIZE.html | 2 +- .../constant.SCHNORR_PUBLIC_KEY_SIZE.html | 2 +- .../constant.SCHNORR_SIGNATURE_SIZE.html | 2 +- .../constants/constant.SECRET_KEY_SIZE.html | 2 +- ...constant.UNCOMPRESSED_PUBLIC_KEY_SIZE.html | 2 +- .../secp256k1/constants/constant.ZERO.html | 2 +- .../bitcoin/secp256k1/constants/index.html | 2 +- .../ecdh/fn.shared_secret_point.html | 2 +- .../bitcoin/secp256k1/ecdh/index.html | 2 +- .../secp256k1/ecdh/struct.SharedSecret.html | 2 +- .../bitcoin/secp256k1/ecdsa/index.html | 2 +- .../ecdsa/serialized_signature/index.html | 2 +- .../serialized_signature/struct.IntoIter.html | 2 +- .../struct.SerializedSignature.html | 182 ++--- .../ecdsa/struct.RecoverableSignature.html | 2 +- .../secp256k1/ecdsa/struct.RecoveryId.html | 2 +- .../ecdsa/struct.SerializedSignature.html | 182 ++--- .../secp256k1/ecdsa/struct.Signature.html | 2 +- .../ellswift/enum.ElligatorSwiftParty.html | 2 +- .../bitcoin/secp256k1/ellswift/index.html | 2 +- .../ellswift/struct.ElligatorSwift.html | 2 +- .../struct.ElligatorSwiftSharedSecret.html | 2 +- .../bdk_chain/bitcoin/secp256k1/enum.All.html | 2 +- .../bitcoin/secp256k1/enum.Error.html | 2 +- .../bitcoin/secp256k1/enum.Parity.html | 2 +- .../bitcoin/secp256k1/enum.SignOnly.html | 2 +- .../bitcoin/secp256k1/enum.VerifyOnly.html | 2 +- .../constant.SECP256K1_SER_COMPRESSED.html | 2 +- .../constant.SECP256K1_SER_UNCOMPRESSED.html | 2 +- .../ffi/constant.SECP256K1_START_NONE.html | 2 +- .../ffi/constant.SECP256K1_START_SIGN.html | 2 +- .../ffi/constant.SECP256K1_START_VERIFY.html | 2 +- .../ffi/fn.ecdsa_signature_parse_der_lax.html | 2 +- .../ffi/fn.non_secure_erase_impl.html | 2 +- ....rustsecp256k1_v0_10_0_context_create.html | 2 +- ...rustsecp256k1_v0_10_0_context_destroy.html | 2 +- ...6k1_v0_10_0_default_error_callback_fn.html | 2 +- ...1_v0_10_0_default_illegal_callback_fn.html | 2 +- .../ffi/fn.secp256k1_context_create.html | 2 +- .../ffi/fn.secp256k1_context_destroy.html | 2 +- ....secp256k1_context_preallocated_clone.html | 2 +- ...256k1_context_preallocated_clone_size.html | 2 +- ...secp256k1_context_preallocated_create.html | 2 +- ...ecp256k1_context_preallocated_destroy.html | 2 +- ...n.secp256k1_context_preallocated_size.html | 2 +- .../ffi/fn.secp256k1_context_randomize.html | 2 +- .../ffi/fn.secp256k1_ec_pubkey_cmp.html | 2 +- .../ffi/fn.secp256k1_ec_pubkey_combine.html | 2 +- .../ffi/fn.secp256k1_ec_pubkey_create.html | 2 +- .../ffi/fn.secp256k1_ec_pubkey_negate.html | 2 +- .../ffi/fn.secp256k1_ec_pubkey_parse.html | 2 +- .../ffi/fn.secp256k1_ec_pubkey_serialize.html | 2 +- .../ffi/fn.secp256k1_ec_pubkey_tweak_add.html | 2 +- .../ffi/fn.secp256k1_ec_pubkey_tweak_mul.html | 2 +- .../ffi/fn.secp256k1_ec_seckey_negate.html | 2 +- .../ffi/fn.secp256k1_ec_seckey_tweak_add.html | 2 +- .../ffi/fn.secp256k1_ec_seckey_tweak_mul.html | 2 +- .../ffi/fn.secp256k1_ec_seckey_verify.html | 2 +- .../secp256k1/ffi/fn.secp256k1_ecdh.html | 2 +- .../ffi/fn.secp256k1_ecdsa_sign.html | 2 +- ...n.secp256k1_ecdsa_signature_normalize.html | 2 +- ...cp256k1_ecdsa_signature_parse_compact.html | 2 +- ...n.secp256k1_ecdsa_signature_parse_der.html | 2 +- ...6k1_ecdsa_signature_serialize_compact.html | 2 +- ...cp256k1_ecdsa_signature_serialize_der.html | 2 +- .../ffi/fn.secp256k1_ecdsa_verify.html | 2 +- .../ffi/fn.secp256k1_ellswift_create.html | 2 +- .../ffi/fn.secp256k1_ellswift_decode.html | 2 +- .../ffi/fn.secp256k1_ellswift_encode.html | 2 +- .../ffi/fn.secp256k1_ellswift_xdh.html | 2 +- .../ffi/fn.secp256k1_keypair_create.html | 2 +- .../ffi/fn.secp256k1_keypair_pub.html | 2 +- .../ffi/fn.secp256k1_keypair_sec.html | 2 +- .../ffi/fn.secp256k1_keypair_xonly_pub.html | 2 +- .../fn.secp256k1_keypair_xonly_tweak_add.html | 2 +- .../ffi/fn.secp256k1_schnorrsig_sign.html | 2 +- .../fn.secp256k1_schnorrsig_sign_custom.html | 2 +- .../ffi/fn.secp256k1_schnorrsig_verify.html | 2 +- .../ffi/fn.secp256k1_xonly_pubkey_cmp.html | 2 +- ...fn.secp256k1_xonly_pubkey_from_pubkey.html | 2 +- .../ffi/fn.secp256k1_xonly_pubkey_parse.html | 2 +- .../fn.secp256k1_xonly_pubkey_serialize.html | 2 +- .../fn.secp256k1_xonly_pubkey_tweak_add.html | 2 +- ...ecp256k1_xonly_pubkey_tweak_add_check.html | 2 +- .../bitcoin/secp256k1/ffi/index.html | 2 +- .../ffi/macro.impl_array_newtype.html | 2 +- .../secp256k1/ffi/macro.impl_raw_debug.html | 2 +- .../recovery/fn.secp256k1_ecdsa_recover.html | 2 +- ...1_ecdsa_recoverable_signature_convert.html | 2 +- ...a_recoverable_signature_parse_compact.html | 2 +- ...coverable_signature_serialize_compact.html | 2 +- .../fn.secp256k1_ecdsa_sign_recoverable.html | 2 +- .../bitcoin/secp256k1/ffi/recovery/index.html | 2 +- .../recovery/struct.RecoverableSignature.html | 2 +- .../static.secp256k1_context_no_precomp.html | 2 +- ....secp256k1_ecdh_hash_function_default.html | 2 +- ...6k1_ellswift_xdh_hash_function_bip324.html | 2 +- ...tatic.secp256k1_nonce_function_bip340.html | 2 +- ...atic.secp256k1_nonce_function_default.html | 2 +- ...atic.secp256k1_nonce_function_rfc6979.html | 2 +- .../bitcoin/secp256k1/ffi/struct.Context.html | 2 +- .../secp256k1/ffi/struct.ElligatorSwift.html | 2 +- .../bitcoin/secp256k1/ffi/struct.Keypair.html | 2 +- .../secp256k1/ffi/struct.PublicKey.html | 2 +- .../ffi/struct.SchnorrSigExtraParams.html | 2 +- .../secp256k1/ffi/struct.Signature.html | 2 +- .../secp256k1/ffi/struct.XOnlyPublicKey.html | 2 +- .../bitcoin/secp256k1/ffi/trait.CPtr.html | 2 +- .../secp256k1/ffi/type.EcdhHashFn.html | 2 +- .../ffi/type.EllswiftEcdhHashFn.html | 2 +- .../bitcoin/secp256k1/ffi/type.NonceFn.html | 2 +- .../secp256k1/ffi/type.SchnorrNonceFn.html | 2 +- .../secp256k1/ffi/types/enum.c_void.html | 2 +- .../bitcoin/secp256k1/ffi/types/index.html | 2 +- .../ffi/types/struct.AlignedType.html | 2 +- .../secp256k1/ffi/types/type.c_char.html | 2 +- .../secp256k1/ffi/types/type.c_int.html | 2 +- .../secp256k1/ffi/types/type.c_uchar.html | 2 +- .../secp256k1/ffi/types/type.c_uint.html | 2 +- .../secp256k1/ffi/types/type.size_t.html | 2 +- .../bitcoin/secp256k1/hashes/index.html | 2 +- .../hashes/macro.borrow_slice_impl.html | 2 +- .../secp256k1/hashes/macro.hash_newtype.html | 2 +- .../secp256k1/hashes/macro.hex_fmt_impl.html | 2 +- .../secp256k1/hashes/macro.serde_impl.html | 2 +- .../hashes/macro.sha256t_hash_newtype.html | 2 +- .../hashes/struct.FromSliceError.html | 2 +- .../bitcoin/secp256k1/hashes/struct.Hmac.html | 2 +- .../secp256k1/hashes/struct.HmacEngine.html | 2 +- .../bitcoin/secp256k1/hashes/trait.Hash.html | 2 +- .../secp256k1/hashes/trait.HashEngine.html | 2 +- .../bdk_chain/bitcoin/secp256k1/index.html | 2 +- .../secp256k1/macro.impl_array_newtype.html | 2 +- .../distributions/enum.BernoulliError.html | 2 +- .../distributions/enum.WeightedError.html | 2 +- .../secp256k1/rand/distributions/index.html | 2 +- .../distributions/struct.Alphanumeric.html | 2 +- .../rand/distributions/struct.Bernoulli.html | 2 +- .../rand/distributions/struct.DistIter.html | 2 +- .../rand/distributions/struct.DistMap.html | 2 +- .../rand/distributions/struct.Open01.html | 2 +- .../distributions/struct.OpenClosed01.html | 2 +- .../rand/distributions/struct.Slice.html | 2 +- .../rand/distributions/struct.Standard.html | 2 +- .../rand/distributions/struct.Uniform.html | 2 +- .../distributions/struct.WeightedIndex.html | 2 +- .../rand/distributions/trait.DistString.html | 2 +- .../distributions/trait.Distribution.html | 2 +- .../rand/distributions/uniform/index.html | 2 +- .../distributions/uniform/struct.Uniform.html | 2 +- .../uniform/struct.UniformChar.html | 2 +- .../uniform/struct.UniformDuration.html | 2 +- .../uniform/struct.UniformFloat.html | 2 +- .../uniform/struct.UniformInt.html | 2 +- .../uniform/trait.SampleBorrow.html | 2 +- .../uniform/trait.SampleRange.html | 2 +- .../uniform/trait.SampleUniform.html | 2 +- .../uniform/trait.UniformSampler.html | 2 +- .../weighted/alias_method/index.html | 2 +- .../alias_method/struct.WeightedIndex.html | 2 +- .../weighted/alias_method/trait.Weight.html | 2 +- .../weighted/enum.WeightedError.html | 2 +- .../rand/distributions/weighted/index.html | 2 +- .../weighted/struct.WeightedIndex.html | 2 +- .../bitcoin/secp256k1/rand/fn.random.html | 2 +- .../bitcoin/secp256k1/rand/fn.thread_rng.html | 2 +- .../bitcoin/secp256k1/rand/index.html | 2 +- .../secp256k1/rand/prelude/fn.random.html | 2 +- .../secp256k1/rand/prelude/fn.thread_rng.html | 2 +- .../bitcoin/secp256k1/rand/prelude/index.html | 2 +- .../secp256k1/rand/prelude/struct.StdRng.html | 2 +- .../rand/prelude/struct.ThreadRng.html | 2 +- .../rand/prelude/trait.CryptoRng.html | 2 +- .../rand/prelude/trait.Distribution.html | 2 +- .../rand/prelude/trait.IteratorRandom.html | 2 +- .../secp256k1/rand/prelude/trait.Rng.html | 2 +- .../secp256k1/rand/prelude/trait.RngCore.html | 2 +- .../rand/prelude/trait.SeedableRng.html | 2 +- .../rand/prelude/trait.SliceRandom.html | 2 +- .../secp256k1/rand/rngs/adapter/index.html | 2 +- .../rand/rngs/adapter/struct.ReadError.html | 2 +- .../rand/rngs/adapter/struct.ReadRng.html | 2 +- .../rngs/adapter/struct.ReseedingRng.html | 2 +- .../bitcoin/secp256k1/rand/rngs/index.html | 2 +- .../secp256k1/rand/rngs/mock/index.html | 2 +- .../rand/rngs/mock/struct.StepRng.html | 2 +- .../secp256k1/rand/rngs/struct.OsRng.html | 2 +- .../secp256k1/rand/rngs/struct.StdRng.html | 2 +- .../secp256k1/rand/rngs/struct.ThreadRng.html | 2 +- .../bitcoin/secp256k1/rand/seq/index.html | 2 +- .../rand/seq/index/enum.IndexVec.html | 2 +- .../rand/seq/index/enum.IndexVecIntoIter.html | 2 +- .../rand/seq/index/enum.IndexVecIter.html | 2 +- .../secp256k1/rand/seq/index/fn.sample.html | 2 +- .../rand/seq/index/fn.sample_weighted.html | 2 +- .../secp256k1/rand/seq/index/index.html | 2 +- .../rand/seq/struct.SliceChooseIter.html | 2 +- .../rand/seq/trait.IteratorRandom.html | 2 +- .../secp256k1/rand/seq/trait.SliceRandom.html | 2 +- .../bitcoin/secp256k1/rand/struct.Error.html | 2 +- .../secp256k1/rand/trait.CryptoRng.html | 2 +- .../bitcoin/secp256k1/rand/trait.Fill.html | 2 +- .../bitcoin/secp256k1/rand/trait.Rng.html | 2 +- .../bitcoin/secp256k1/rand/trait.RngCore.html | 2 +- .../secp256k1/rand/trait.SeedableRng.html | 2 +- .../bitcoin/secp256k1/scalar/index.html | 2 +- .../scalar/struct.OutOfRangeError.html | 2 +- .../secp256k1/scalar/struct.Scalar.html | 2 +- .../bitcoin/secp256k1/schnorr/index.html | 2 +- .../secp256k1/schnorr/struct.Signature.html | 2 +- .../secp256k1/struct.AllPreallocated.html | 2 +- .../secp256k1/struct.InvalidParityValue.html | 2 +- .../bitcoin/secp256k1/struct.Keypair.html | 2 +- .../bitcoin/secp256k1/struct.Message.html | 2 +- .../bitcoin/secp256k1/struct.PublicKey.html | 2 +- .../bitcoin/secp256k1/struct.Scalar.html | 2 +- .../bitcoin/secp256k1/struct.Secp256k1.html | 2 +- .../bitcoin/secp256k1/struct.SecretKey.html | 2 +- .../struct.SignOnlyPreallocated.html | 2 +- .../struct.VerifyOnlyPreallocated.html | 2 +- .../secp256k1/struct.XOnlyPublicKey.html | 2 +- .../bitcoin/secp256k1/trait.Context.html | 2 +- .../secp256k1/trait.PreallocatedContext.html | 2 +- .../bitcoin/secp256k1/trait.Signing.html | 2 +- .../secp256k1/trait.ThirtyTwoByteHash.html | 2 +- .../bitcoin/secp256k1/trait.Verification.html | 2 +- .../bitcoin/sighash/enum.AnnexError.html | 2 +- .../sighash/enum.EcdsaSighashType.html | 2 +- .../sighash/enum.EncodeSigningDataResult.html | 2 +- .../bitcoin/sighash/enum.P2wpkhError.html | 2 +- .../bitcoin/sighash/enum.Prevouts.html | 2 +- .../sighash/enum.PrevoutsIndexError.html | 2 +- .../sighash/enum.SigningDataError.html | 2 +- .../bitcoin/sighash/enum.TapSighashType.html | 2 +- .../bitcoin/sighash/enum.TaprootError.html | 2 +- .../bdk_chain/bitcoin/sighash/index.html | 2 +- .../bitcoin/sighash/struct.Annex.html | 2 +- .../struct.InvalidSighashTypeError.html | 2 +- .../bitcoin/sighash/struct.LegacySighash.html | 2 +- .../struct.NonStandardSighashTypeError.html | 2 +- .../sighash/struct.PrevoutsKindError.html | 2 +- .../sighash/struct.PrevoutsSizeError.html | 2 +- .../bitcoin/sighash/struct.ScriptPath.html | 2 +- .../sighash/struct.SegwitV0Sighash.html | 2 +- .../bitcoin/sighash/struct.SighashCache.html | 2 +- .../sighash/struct.SighashTypeParseError.html | 2 +- .../struct.SingleMissingOutputError.html | 2 +- .../bitcoin/sighash/struct.TapSighash.html | 2 +- .../bitcoin/sighash/struct.TapSighashTag.html | 2 +- .../constant.BITCOIN_SIGNED_MSG_PREFIX.html | 2 +- .../enum.MessageSignatureError.html | 2 +- .../sign_message/fn.signed_msg_hash.html | 2 +- .../bdk_chain/bitcoin/sign_message/index.html | 2 +- .../sign_message/struct.MessageSignature.html | 2 +- .../bdk_chain/bitcoin/struct.Address.html | 2 +- .../bdk_chain/bitcoin/struct.Amount.html | 2 +- .../bdk_chain/bitcoin/struct.Block.html | 2 +- .../bdk_chain/bitcoin/struct.BlockHash.html | 2 +- .../bitcoin/struct.CompactTarget.html | 2 +- .../bitcoin/struct.CompressedPublicKey.html | 2 +- .../bdk_chain/bitcoin/struct.FeeRate.html | 2 +- .../bdk_chain/bitcoin/struct.FilterHash.html | 2 +- .../bitcoin/struct.FilterHeader.html | 2 +- .../bitcoin/struct.LegacySighash.html | 2 +- .../bdk_chain/bitcoin/struct.MerkleBlock.html | 2 +- .../bdk_chain/bitcoin/struct.Opcode.html | 2 +- .../bdk_chain/bitcoin/struct.OutPoint.html | 2 +- .../bdk_chain/bitcoin/struct.PrivateKey.html | 2 +- .../latest/bdk_chain/bitcoin/struct.Psbt.html | 2 +- .../bdk_chain/bitcoin/struct.PubkeyHash.html | 2 +- .../bdk_chain/bitcoin/struct.PublicKey.html | 2 +- .../bdk_chain/bitcoin/struct.Script.html | 2 +- .../bdk_chain/bitcoin/struct.ScriptBuf.html | 6 +- .../bdk_chain/bitcoin/struct.ScriptHash.html | 2 +- .../bitcoin/struct.SegwitV0Sighash.html | 2 +- .../bdk_chain/bitcoin/struct.Sequence.html | 2 +- .../bitcoin/struct.SignedAmount.html | 2 +- .../bitcoin/struct.TapBranchTag.html | 2 +- .../bdk_chain/bitcoin/struct.TapLeafHash.html | 2 +- .../bdk_chain/bitcoin/struct.TapLeafTag.html | 2 +- .../bdk_chain/bitcoin/struct.TapNodeHash.html | 2 +- .../bdk_chain/bitcoin/struct.TapSighash.html | 2 +- .../bitcoin/struct.TapSighashTag.html | 2 +- .../bitcoin/struct.TapTweakHash.html | 2 +- .../bdk_chain/bitcoin/struct.TapTweakTag.html | 2 +- .../bdk_chain/bitcoin/struct.Target.html | 2 +- .../bdk_chain/bitcoin/struct.Transaction.html | 2 +- .../latest/bdk_chain/bitcoin/struct.TxIn.html | 2 +- .../bitcoin/struct.TxMerkleNode.html | 2 +- .../bdk_chain/bitcoin/struct.TxOut.html | 2 +- .../latest/bdk_chain/bitcoin/struct.Txid.html | 2 +- .../bdk_chain/bitcoin/struct.VarInt.html | 2 +- .../bdk_chain/bitcoin/struct.WPubkeyHash.html | 2 +- .../bdk_chain/bitcoin/struct.WScriptHash.html | 2 +- .../bdk_chain/bitcoin/struct.Weight.html | 2 +- .../bdk_chain/bitcoin/struct.Witness.html | 2 +- .../bitcoin/struct.WitnessCommitment.html | 2 +- .../bitcoin/struct.WitnessMerkleNode.html | 2 +- .../bitcoin/struct.WitnessProgram.html | 2 +- .../latest/bdk_chain/bitcoin/struct.Work.html | 2 +- .../bdk_chain/bitcoin/struct.Wtxid.html | 2 +- .../bitcoin/struct.XKeyIdentifier.html | 2 +- .../bitcoin/struct.XOnlyPublicKey.html | 2 +- .../constant.TAPROOT_ANNEX_PREFIX.html | 2 +- .../constant.TAPROOT_CONTROL_BASE_SIZE.html | 2 +- ...nstant.TAPROOT_CONTROL_MAX_NODE_COUNT.html | 2 +- .../constant.TAPROOT_CONTROL_MAX_SIZE.html | 2 +- .../constant.TAPROOT_CONTROL_NODE_SIZE.html | 2 +- .../taproot/constant.TAPROOT_LEAF_MASK.html | 2 +- .../constant.TAPROOT_LEAF_TAPSCRIPT.html | 2 +- .../taproot/enum.HiddenNodesError.html | 2 +- .../taproot/enum.IncompleteBuilderError.html | 2 +- .../bitcoin/taproot/enum.LeafVersion.html | 2 +- .../taproot/enum.SigFromSliceError.html | 2 +- .../bitcoin/taproot/enum.TapLeaf.html | 2 +- .../taproot/enum.TaprootBuilderError.html | 2 +- .../bitcoin/taproot/enum.TaprootError.html | 2 +- .../bdk_chain/bitcoin/taproot/index.html | 2 +- .../bitcoin/taproot/merkle_branch/index.html | 2 +- .../merkle_branch/struct.IntoIter.html | 2 +- .../struct.TaprootMerkleBranch.html | 541 ++++++++------ .../taproot/serialized_signature/index.html | 2 +- .../serialized_signature/struct.IntoIter.html | 2 +- .../struct.SerializedSignature.html | 182 ++--- .../bitcoin/taproot/struct.ControlBlock.html | 2 +- .../taproot/struct.FutureLeafVersion.html | 2 +- .../bitcoin/taproot/struct.LeafNode.html | 2 +- .../bitcoin/taproot/struct.LeafNodes.html | 2 +- .../bitcoin/taproot/struct.NodeInfo.html | 2 +- .../bitcoin/taproot/struct.ScriptLeaf.html | 2 +- .../bitcoin/taproot/struct.ScriptLeaves.html | 2 +- .../bitcoin/taproot/struct.Signature.html | 2 +- .../bitcoin/taproot/struct.TapBranchTag.html | 2 +- .../bitcoin/taproot/struct.TapLeafHash.html | 2 +- .../bitcoin/taproot/struct.TapLeafTag.html | 2 +- .../bitcoin/taproot/struct.TapNodeHash.html | 2 +- .../bitcoin/taproot/struct.TapTree.html | 2 +- .../bitcoin/taproot/struct.TapTweakHash.html | 2 +- .../bitcoin/taproot/struct.TapTweakTag.html | 2 +- .../taproot/struct.TaprootBuilder.html | 2 +- .../taproot/struct.TaprootMerkleBranch.html | 541 ++++++++------ .../taproot/struct.TaprootSpendInfo.html | 2 +- .../bdk_chain/constant.BIP32_MAX_INDEX.html | 2 +- .../bdk_chain/enum.CanonicalReason.html | 2 +- .../latest/bdk_chain/enum.ChainPosition.html | 2 +- .../latest/bdk_chain/enum.ObservedIn.html | 2 +- .../bdk/nightly/latest/bdk_chain/index.html | 4 +- .../bdk_chain/indexed_tx_graph/index.html | 2 +- .../indexed_tx_graph/struct.ChangeSet.html | 4 +- .../struct.IndexedTxGraph.html | 2 +- .../latest/bdk_chain/indexer/index.html | 2 +- .../constant.DEFAULT_LOOKAHEAD.html | 2 +- .../enum.InsertDescriptorError.html | 2 +- .../indexer/keychain_txout/index.html | 2 +- .../keychain_txout/struct.ChangeSet.html | 4 +- .../struct.KeychainTxOutIndex.html | 2 +- .../trait.FullScanRequestBuilderExt.html | 2 +- .../trait.SyncRequestBuilderExt.html | 2 +- .../bdk_chain/indexer/spk_txout/index.html | 2 +- .../spk_txout/struct.SpkTxOutIndex.html | 2 +- .../bdk_chain/indexer/trait.Indexer.html | 2 +- .../local_chain/enum.ApplyHeaderError.html | 2 +- .../latest/bdk_chain/local_chain/index.html | 2 +- .../struct.AlterCheckPointError.html | 2 +- .../struct.CannotConnectError.html | 2 +- .../local_chain/struct.ChangeSet.html | 4 +- .../local_chain/struct.CheckPoint.html | 32 +- .../local_chain/struct.CheckPointIter.html | 4 +- .../local_chain/struct.LocalChain.html | 2 +- .../struct.MissingGenesisError.html | 2 +- .../constant.SCHEMAS_TABLE_NAME.html | 2 +- .../rusqlite_impl/fn.migrate_schema.html | 2 +- .../latest/bdk_chain/rusqlite_impl/index.html | 2 +- .../bdk_chain/spk_client/enum.SyncItem.html | 30 +- .../latest/bdk_chain/spk_client/index.html | 2 +- .../spk_client/struct.FullScanRequest.html | 16 +- .../struct.FullScanRequestBuilder.html | 14 +- .../spk_client/struct.FullScanResponse.html | 6 +- .../spk_client/struct.SyncProgress.html | 16 +- .../spk_client/struct.SyncRequest.html | 22 +- .../spk_client/struct.SyncRequestBuilder.html | 18 +- .../spk_client/struct.SyncResponse.html | 6 +- .../latest/bdk_chain/struct.Balance.html | 2 +- .../latest/bdk_chain/struct.BlockId.html | 16 +- .../bdk_chain/struct.CanonicalIter.html | 2 +- .../latest/bdk_chain/struct.CheckPoint.html | 32 +- .../bdk_chain/struct.CheckPointIter.html | 4 +- .../struct.ConfirmationBlockTime.html | 16 +- .../latest/bdk_chain/struct.DescriptorId.html | 2 +- .../latest/bdk_chain/struct.FullTxOut.html | 2 +- .../nightly/latest/bdk_chain/struct.Impl.html | 6 +- .../latest/bdk_chain/struct.SpkIterator.html | 2 +- .../latest/bdk_chain/struct.TxPosInBlock.html | 2 +- .../latest/bdk_chain/struct.TxUpdate.html | 14 +- .../latest/bdk_chain/trait.Anchor.html | 2 +- .../latest/bdk_chain/trait.ChainOracle.html | 2 +- .../latest/bdk_chain/trait.DescriptorExt.html | 2 +- .../nightly/latest/bdk_chain/trait.Merge.html | 36 +- .../tx_graph/enum.CalculateFeeError.html | 2 +- .../latest/bdk_chain/tx_graph/index.html | 2 +- .../tx_graph/struct.CanonicalTx.html | 2 +- .../bdk_chain/tx_graph/struct.ChangeSet.html | 4 +- .../tx_graph/struct.TxAncestors.html | 2 +- .../tx_graph/struct.TxDescendants.html | 2 +- .../bdk_chain/tx_graph/struct.TxGraph.html | 2 +- .../bdk_chain/tx_graph/struct.TxNode.html | 6 +- .../bdk_chain/tx_graph/struct.TxUpdate.html | 14 +- .../latest/bdk_chain/type.Indexed.html | 2 +- .../bdk_chain/type.KeychainIndexed.html | 2 +- .../bdk/nightly/latest/bdk_core/all.html | 2 +- .../bdk/nightly/latest/bdk_core/index.html | 2 +- .../bdk_core/spk_client/enum.SyncItem.html | 2 +- .../latest/bdk_core/spk_client/index.html | 2 +- .../spk_client/struct.FullScanRequest.html | 2 +- .../struct.FullScanRequestBuilder.html | 2 +- .../spk_client/struct.FullScanResponse.html | 2 +- .../spk_client/struct.SyncProgress.html | 2 +- .../spk_client/struct.SyncRequest.html | 2 +- .../spk_client/struct.SyncRequestBuilder.html | 2 +- .../spk_client/struct.SyncResponse.html | 2 +- .../latest/bdk_core/struct.BlockId.html | 2 +- .../latest/bdk_core/struct.CheckPoint.html | 2 +- .../bdk_core/struct.CheckPointIter.html | 2 +- .../struct.ConfirmationBlockTime.html | 2 +- .../latest/bdk_core/struct.TxUpdate.html | 2 +- .../nightly/latest/bdk_core/trait.Merge.html | 2 +- .../nightly/latest/bdk_core/type.Indexed.html | 2 +- .../latest/bdk_core/type.KeychainIndexed.html | 2 +- .../bdk/nightly/latest/bdk_electrum/all.html | 2 +- .../nightly/latest/bdk_electrum/index.html | 2 +- .../struct.BdkElectrumClient.html | 2 +- .../bdk/nightly/latest/bdk_esplora/all.html | 2 +- .../bdk/nightly/latest/bdk_esplora/index.html | 6 +- .../bdk_esplora/trait.EsploraAsyncExt.html | 30 +- .../latest/bdk_esplora/trait.EsploraExt.html | 28 +- .../latest/bdk_esplora/type.Error.html | 2 +- .../nightly/latest/bdk_file_store/all.html | 2 +- .../latest/bdk_file_store/enum.FileError.html | 2 +- .../latest/bdk_file_store/enum.IterError.html | 2 +- .../nightly/latest/bdk_file_store/index.html | 2 +- .../struct.AggregateChangesetsError.html | 2 +- .../bdk_file_store/struct.EntryIter.html | 2 +- .../latest/bdk_file_store/struct.Store.html | 4 +- .../bdk/nightly/latest/bdk_testenv/all.html | 2 +- .../bdk/nightly/latest/bdk_testenv/index.html | 2 +- .../latest/bdk_testenv/macro.block_id.html | 2 +- .../bdk_testenv/macro.chain_update.html | 2 +- .../latest/bdk_testenv/macro.changeset.html | 2 +- .../latest/bdk_testenv/macro.hash.html | 2 +- .../latest/bdk_testenv/macro.local_chain.html | 2 +- .../latest/bdk_testenv/struct.Config.html | 2 +- .../latest/bdk_testenv/struct.TestEnv.html | 2 +- .../utils/constant.DESCRIPTORS.html | 2 +- .../latest/bdk_testenv/utils/fn.new_tx.html | 2 +- .../latest/bdk_testenv/utils/index.html | 2 +- .../bdk/nightly/latest/bdk_wallet/all.html | 2 +- .../coin_selection/enum.Excess.html | 2 +- .../coin_selection/fn.decide_change.html | 2 +- .../bdk_wallet/coin_selection/index.html | 2 +- .../struct.BranchAndBoundCoinSelection.html | 2 +- .../struct.CoinSelectionResult.html | 2 +- .../struct.InsufficientFunds.html | 2 +- .../struct.LargestFirstCoinSelection.html | 2 +- .../struct.OldestFirstCoinSelection.html | 2 +- .../struct.SingleRandomDraw.html | 2 +- .../trait.CoinSelectionAlgorithm.html | 2 +- .../type.DefaultCoinSelectionAlgorithm.html | 2 +- .../descriptor/checksum/fn.calc_checksum.html | 2 +- .../bdk_wallet/descriptor/checksum/index.html | 2 +- .../descriptor/enum.Descriptor.html | 6 +- .../descriptor/enum.DescriptorPublicKey.html | 2 +- .../bdk_wallet/descriptor/enum.Legacy.html | 2 +- .../bdk_wallet/descriptor/enum.Segwitv0.html | 2 +- .../descriptor/error/enum.Error.html | 2 +- .../bdk_wallet/descriptor/error/index.html | 2 +- .../latest/bdk_wallet/descriptor/index.html | 2 +- .../policy/enum.BuildSatisfaction.html | 2 +- .../descriptor/policy/enum.PkOrF.html | 2 +- .../descriptor/policy/enum.PolicyError.html | 2 +- .../descriptor/policy/enum.Satisfaction.html | 2 +- .../policy/enum.SatisfiableItem.html | 2 +- .../bdk_wallet/descriptor/policy/index.html | 2 +- .../descriptor/policy/struct.Condition.html | 2 +- .../descriptor/policy/struct.Policy.html | 2 +- .../descriptor/policy/type.ConditionMap.html | 2 +- .../policy/type.FoldedConditionMap.html | 2 +- .../descriptor/struct.Miniscript.html | 2 +- .../bdk_wallet/descriptor/template/index.html | 2 +- .../descriptor/template/struct.Bip44.html | 2 +- .../template/struct.Bip44Public.html | 2 +- .../descriptor/template/struct.Bip49.html | 2 +- .../template/struct.Bip49Public.html | 2 +- .../descriptor/template/struct.Bip84.html | 2 +- .../template/struct.Bip84Public.html | 2 +- .../descriptor/template/struct.Bip86.html | 2 +- .../template/struct.Bip86Public.html | 2 +- .../descriptor/template/struct.P2Pkh.html | 2 +- .../descriptor/template/struct.P2TR.html | 2 +- .../descriptor/template/struct.P2Wpkh.html | 2 +- .../template/struct.P2Wpkh_P2Sh.html | 2 +- .../template/trait.DescriptorTemplate.html | 2 +- .../template/type.DescriptorTemplateOut.html | 2 +- .../descriptor/trait.ExtractPolicy.html | 2 +- .../trait.IntoWalletDescriptor.html | 2 +- .../descriptor/trait.ScriptContext.html | 2 +- .../descriptor/type.DerivedDescriptor.html | 2 +- .../descriptor/type.ExtendedDescriptor.html | 2 +- .../descriptor/type.HdKeyPaths.html | 2 +- .../descriptor/type.TapKeyOrigins.html | 2 +- .../bdk_wallet/enum.AddForeignUtxoError.html | 2 +- .../latest/bdk_wallet/enum.AddUtxoError.html | 2 +- .../bdk_wallet/enum.ApplyBlockError.html | 6 +- .../bdk_wallet/enum.ChangeSpendPolicy.html | 2 +- .../enum.CreateWithPersistError.html | 2 +- .../bdk_wallet/enum.FileStoreError.html | 2 +- .../latest/bdk_wallet/enum.KeychainKind.html | 2 +- .../latest/bdk_wallet/enum.LoadError.html | 2 +- .../latest/bdk_wallet/enum.LoadMismatch.html | 4 +- .../bdk_wallet/enum.LoadWithPersistError.html | 2 +- .../latest/bdk_wallet/enum.TxOrdering.html | 2 +- .../nightly/latest/bdk_wallet/enum.Utxo.html | 2 +- .../error/enum.BuildFeeBumpError.html | 2 +- .../bdk_wallet/error/enum.CreateTxError.html | 2 +- .../error/enum.MiniscriptPsbtError.html | 2 +- .../latest/bdk_wallet/error/index.html | 2 +- .../latest/bdk_wallet/export/index.html | 2 +- .../export/struct.FullyNodedExport.html | 2 +- .../bdk_wallet/export/type.WalletExport.html | 2 +- .../nightly/latest/bdk_wallet/fn.version.html | 2 +- .../fn.wallet_name_from_descriptor.html | 2 +- .../bdk/nightly/latest/bdk_wallet/index.html | 4 +- .../bdk_wallet/keys/enum.DescriptorKey.html | 2 +- .../keys/enum.DescriptorPublicKey.html | 2 +- .../keys/enum.DescriptorSecretKey.html | 2 +- .../bdk_wallet/keys/enum.ExtendedKey.html | 2 +- .../latest/bdk_wallet/keys/enum.KeyError.html | 2 +- .../keys/enum.ScriptContextEnum.html | 2 +- .../bdk_wallet/keys/enum.SinglePubKey.html | 2 +- .../bdk_wallet/keys/fn.any_network.html | 2 +- .../bdk_wallet/keys/fn.mainnet_network.html | 2 +- .../bdk_wallet/keys/fn.merge_networks.html | 2 +- .../bdk_wallet/keys/fn.test_networks.html | 2 +- .../nightly/latest/bdk_wallet/keys/index.html | 2 +- .../bdk_wallet/keys/struct.GeneratedKey.html | 6 +- .../struct.PrivateKeyGenerateOptions.html | 2 +- .../bdk_wallet/keys/struct.SinglePriv.html | 2 +- .../bdk_wallet/keys/struct.SinglePub.html | 2 +- .../keys/struct.SortedMultiVec.html | 2 +- .../bdk_wallet/keys/trait.DerivableKey.html | 2 +- .../keys/trait.ExtScriptContext.html | 2 +- .../keys/trait.GeneratableDefaultOptions.html | 2 +- .../bdk_wallet/keys/trait.GeneratableKey.html | 2 +- .../keys/trait.IntoDescriptorKey.html | 2 +- .../bdk_wallet/keys/trait.ScriptContext.html | 2 +- .../latest/bdk_wallet/keys/type.KeyMap.html | 2 +- .../bdk_wallet/keys/type.ValidNetworks.html | 2 +- .../latest/bdk_wallet/macro.descriptor.html | 2 +- .../latest/bdk_wallet/macro.fragment.html | 2 +- .../nightly/latest/bdk_wallet/psbt/index.html | 2 +- .../bdk_wallet/psbt/trait.PsbtUtils.html | 2 +- .../constant.SCHEMAS_TABLE_NAME.html | 2 +- .../rusqlite_impl/fn.migrate_schema.html | 2 +- .../bdk_wallet/rusqlite_impl/index.html | 2 +- .../bdk_wallet/signer/enum.SignerContext.html | 2 +- .../bdk_wallet/signer/enum.SignerError.html | 2 +- .../bdk_wallet/signer/enum.SignerId.html | 2 +- .../signer/enum.TapLeavesOptions.html | 2 +- .../latest/bdk_wallet/signer/index.html | 2 +- .../bdk_wallet/signer/struct.SignOptions.html | 2 +- .../signer/struct.SignerOrdering.html | 2 +- .../signer/struct.SignerWrapper.html | 6 +- .../signer/struct.SignersContainer.html | 2 +- .../bdk_wallet/signer/trait.InputSigner.html | 2 +- .../bdk_wallet/signer/trait.SignerCommon.html | 2 +- .../signer/trait.TransactionSigner.html | 2 +- .../latest/bdk_wallet/struct.AddressInfo.html | 6 +- .../latest/bdk_wallet/struct.Balance.html | 14 +- .../latest/bdk_wallet/struct.ChangeSet.html | 18 +- .../bdk_wallet/struct.CreateParams.html | 8 +- .../latest/bdk_wallet/struct.LoadParams.html | 6 +- .../latest/bdk_wallet/struct.LocalOutput.html | 6 +- .../bdk_wallet/struct.PersistedWallet.html | 54 +- .../latest/bdk_wallet/struct.SignOptions.html | 2 +- .../latest/bdk_wallet/struct.TxBuilder.html | 2 +- .../latest/bdk_wallet/struct.Update.html | 16 +- .../latest/bdk_wallet/struct.Wallet.html | 54 +- .../bdk_wallet/struct.WeightedUtxo.html | 2 +- .../trait.AsyncWalletPersister.html | 2 +- .../latest/bdk_wallet/trait.IsDust.html | 2 +- .../bdk_wallet/trait.WalletPersister.html | 2 +- .../tx_builder/enum.AddForeignUtxoError.html | 2 +- .../tx_builder/enum.AddUtxoError.html | 2 +- .../tx_builder/enum.ChangeSpendPolicy.html | 2 +- .../tx_builder/enum.TxOrdering.html | 2 +- .../latest/bdk_wallet/tx_builder/index.html | 2 +- .../tx_builder/struct.TxBuilder.html | 2 +- .../latest/bdk_wallet/type.WalletTx.html | 10 +- .../example_bitcoind_rpc_polling/all.html | 2 +- .../constant.CHANNEL_BOUND.html | 2 +- .../constant.DB_COMMIT_DELAY.html | 2 +- .../constant.DB_MAGIC.html | 2 +- .../constant.DB_PATH.html | 2 +- .../constant.MEMPOOL_EMIT_DELAY.html | 2 +- .../constant.STDOUT_PRINT_DELAY.html | 2 +- .../enum.Emission.html | 6 +- .../enum.RpcCommands.html | 2 +- .../fn.await_flag.html | 2 +- .../example_bitcoind_rpc_polling/fn.main.html | 2 +- .../fn.start_ctrlc_handler.html | 2 +- .../example_bitcoind_rpc_polling/index.html | 2 +- .../struct.RpcArgs.html | 2 +- .../bdk/nightly/latest/example_cli/all.html | 2 +- .../latest/example_cli/enum.AddressCmd.html | 2 +- .../example_cli/enum.CoinSelectionAlgo.html | 2 +- .../latest/example_cli/enum.Commands.html | 2 +- .../latest/example_cli/enum.Keychain.html | 2 +- .../latest/example_cli/enum.PsbtCmd.html | 2 +- .../latest/example_cli/enum.TxOutCmd.html | 2 +- .../latest/example_cli/fn.create_tx.html | 4 +- .../example_cli/fn.handle_commands.html | 4 +- .../latest/example_cli/fn.init_or_load.html | 2 +- .../latest/example_cli/fn.planned_utxos.html | 4 +- .../bdk/nightly/latest/example_cli/index.html | 2 +- .../latest/example_cli/struct.Args.html | 2 +- .../latest/example_cli/struct.ChangeInfo.html | 6 +- .../latest/example_cli/struct.ChangeSet.html | 16 +- .../latest/example_cli/struct.Init.html | 6 +- .../example_cli/type.KeychainTxGraph.html | 6 +- .../latest/example_cli/type.PlanUtxo.html | 2 +- .../nightly/latest/example_electrum/all.html | 2 +- .../example_electrum/constant.DB_MAGIC.html | 2 +- .../example_electrum/constant.DB_PATH.html | 2 +- .../enum.ElectrumCommands.html | 2 +- .../latest/example_electrum/fn.main.html | 2 +- .../latest/example_electrum/index.html | 2 +- .../example_electrum/struct.ElectrumArgs.html | 2 +- .../example_electrum/struct.ScanOptions.html | 2 +- .../nightly/latest/example_esplora/all.html | 2 +- .../example_esplora/constant.DB_MAGIC.html | 2 +- .../example_esplora/constant.DB_PATH.html | 2 +- .../example_esplora/enum.EsploraCommands.html | 2 +- .../latest/example_esplora/fn.main.html | 2 +- .../nightly/latest/example_esplora/index.html | 2 +- .../example_esplora/struct.EsploraArgs.html | 2 +- .../example_esplora/struct.ScanOptions.html | 2 +- .../latest/example_wallet_electrum/all.html | 2 +- .../constant.BATCH_SIZE.html | 2 +- .../constant.DB_MAGIC.html | 2 +- .../constant.ELECTRUM_URL.html | 2 +- .../constant.EXTERNAL_DESC.html | 2 +- .../constant.INTERNAL_DESC.html | 2 +- .../constant.NETWORK.html | 2 +- .../constant.SEND_AMOUNT.html | 2 +- .../constant.STOP_GAP.html | 2 +- .../example_wallet_electrum/fn.main.html | 2 +- .../latest/example_wallet_electrum/index.html | 2 +- .../example_wallet_esplora_async/all.html | 2 +- .../constant.DB_PATH.html | 2 +- .../constant.ESPLORA_URL.html | 2 +- .../constant.EXTERNAL_DESC.html | 2 +- .../constant.INTERNAL_DESC.html | 2 +- .../constant.NETWORK.html | 2 +- .../constant.PARALLEL_REQUESTS.html | 2 +- .../constant.SEND_AMOUNT.html | 2 +- .../constant.STOP_GAP.html | 2 +- .../example_wallet_esplora_async/fn.main.html | 2 +- .../example_wallet_esplora_async/index.html | 2 +- .../example_wallet_esplora_blocking/all.html | 2 +- .../constant.DB_MAGIC.html | 2 +- .../constant.DB_PATH.html | 2 +- .../constant.ESPLORA_URL.html | 2 +- .../constant.EXTERNAL_DESC.html | 2 +- .../constant.INTERNAL_DESC.html | 2 +- .../constant.NETWORK.html | 2 +- .../constant.PARALLEL_REQUESTS.html | 2 +- .../constant.SEND_AMOUNT.html | 2 +- .../constant.STOP_GAP.html | 2 +- .../fn.main.html | 2 +- .../index.html | 2 +- .../latest/example_wallet_rpc/all.html | 2 +- .../example_wallet_rpc/constant.DB_MAGIC.html | 2 +- .../example_wallet_rpc/enum.Emission.html | 6 +- .../latest/example_wallet_rpc/fn.main.html | 2 +- .../latest/example_wallet_rpc/index.html | 2 +- .../example_wallet_rpc/struct.Args.html | 2 +- .../docs-rs/bdk/nightly/latest/help.html | 2 +- .../docs-rs/bdk/nightly/latest/settings.html | 2 +- .../latest/src/bdk_bitcoind_rpc/lib.rs.html | 2 +- .../latest/src/bdk_chain/balance.rs.html | 2 +- .../src/bdk_chain/canonical_iter.rs.html | 2 +- .../latest/src/bdk_chain/chain_data.rs.html | 2 +- .../latest/src/bdk_chain/chain_oracle.rs.html | 2 +- .../src/bdk_chain/descriptor_ext.rs.html | 2 +- .../src/bdk_chain/example_utils.rs.html | 2 +- .../src/bdk_chain/indexed_tx_graph.rs.html | 2 +- .../latest/src/bdk_chain/indexer.rs.html | 2 +- .../bdk_chain/indexer/keychain_txout.rs.html | 2 +- .../src/bdk_chain/indexer/spk_txout.rs.html | 2 +- .../nightly/latest/src/bdk_chain/lib.rs.html | 2 +- .../latest/src/bdk_chain/local_chain.rs.html | 2 +- .../src/bdk_chain/rusqlite_impl.rs.html | 2 +- .../latest/src/bdk_chain/spk_iter.rs.html | 2 +- .../src/bdk_chain/tx_data_traits.rs.html | 2 +- .../latest/src/bdk_chain/tx_graph.rs.html | 2 +- .../latest/src/bdk_core/block_id.rs.html | 2 +- .../latest/src/bdk_core/checkpoint.rs.html | 2 +- .../nightly/latest/src/bdk_core/lib.rs.html | 2 +- .../nightly/latest/src/bdk_core/merge.rs.html | 2 +- .../latest/src/bdk_core/spk_client.rs.html | 2 +- .../latest/src/bdk_core/tx_update.rs.html | 2 +- .../bdk_electrum/bdk_electrum_client.rs.html | 2 +- .../latest/src/bdk_electrum/lib.rs.html | 2 +- .../latest/src/bdk_esplora/async_ext.rs.html | 2 +- .../src/bdk_esplora/blocking_ext.rs.html | 2 +- .../latest/src/bdk_esplora/lib.rs.html | 2 +- .../src/bdk_file_store/entry_iter.rs.html | 2 +- .../latest/src/bdk_file_store/lib.rs.html | 2 +- .../latest/src/bdk_file_store/store.rs.html | 2 +- .../latest/src/bdk_testenv/lib.rs.html | 2 +- .../latest/src/bdk_testenv/utils.rs.html | 2 +- .../bdk_wallet/descriptor/checksum.rs.html | 2 +- .../src/bdk_wallet/descriptor/dsl.rs.html | 2 +- .../src/bdk_wallet/descriptor/error.rs.html | 2 +- .../src/bdk_wallet/descriptor/mod.rs.html | 2 +- .../src/bdk_wallet/descriptor/policy.rs.html | 2 +- .../bdk_wallet/descriptor/template.rs.html | 2 +- .../latest/src/bdk_wallet/keys/mod.rs.html | 2 +- .../nightly/latest/src/bdk_wallet/lib.rs.html | 2 +- .../latest/src/bdk_wallet/psbt/mod.rs.html | 2 +- .../latest/src/bdk_wallet/types.rs.html | 2 +- .../src/bdk_wallet/wallet/changeset.rs.html | 2 +- .../bdk_wallet/wallet/coin_selection.rs.html | 2 +- .../src/bdk_wallet/wallet/error.rs.html | 2 +- .../src/bdk_wallet/wallet/export.rs.html | 2 +- .../latest/src/bdk_wallet/wallet/mod.rs.html | 2 +- .../src/bdk_wallet/wallet/params.rs.html | 2 +- .../src/bdk_wallet/wallet/persisted.rs.html | 2 +- .../src/bdk_wallet/wallet/signer.rs.html | 2 +- .../src/bdk_wallet/wallet/tx_builder.rs.html | 2 +- .../src/bdk_wallet/wallet/utils.rs.html | 2 +- .../example_bitcoind_rpc_polling/main.rs.html | 2 +- .../latest/src/example_cli/lib.rs.html | 2 +- .../latest/src/example_electrum/main.rs.html | 2 +- .../latest/src/example_esplora/main.rs.html | 2 +- .../src/example_wallet_electrum/main.rs.html | 2 +- .../example_wallet_esplora_async/main.rs.html | 2 +- .../main.rs.html | 2 +- .../src/example_wallet_rpc/main.rs.html | 2 +- ...tdoc-46132b98.css => rustdoc-c579a84d.css} | 2 +- ...{search-75f5ac3e.js => search-1429c0ba.js} | 2 +- .../trait.impl/bdk_core/merge/trait.Merge.js | 4 +- .../trait.impl/core/convert/trait.AsRef.js | 4 +- .../trait.impl/core/convert/trait.From.js | 4 +- .../type.impl/alloc/boxed/struct.Box.js | 2 +- .../collections/btree/map/struct.BTreeMap.js | 4 +- .../indexed_tx_graph/struct.IndexedTxGraph.js | 4 +- .../bdk_chain/tx_graph/struct.CanonicalTx.js | 4 +- .../bdk_wallet/descriptor/enum.Descriptor.js | 4 +- .../latest/type.impl/std/primitive.i32.js | 4 +- .../latest/type.impl/std/primitive.i8.js | 4 +- .../latest/type.impl/std/primitive.tuple.js | 4 +- .../latest/type.impl/std/primitive.u32.js | 4 +- .../latest/type.impl/std/primitive.u8.js | 4 +- .../latest/type.impl/std/primitive.usize.js | 4 +- 1771 files changed, 3781 insertions(+), 3236 deletions(-) rename docs/.vuepress/public/docs-rs/bdk/nightly/latest/static.files/{rustdoc-46132b98.css => rustdoc-c579a84d.css} (94%) rename docs/.vuepress/public/docs-rs/bdk/nightly/latest/static.files/{search-75f5ac3e.js => search-1429c0ba.js} (71%) diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/all.html index cc61a8ef3c..219286043a 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/all.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/all.html @@ -1 +1 @@ -List of all items in this crate

List of all items

Structs

Traits

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

List of all items

Structs

Traits

\ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/index.html index 4cfd708136..dae4b1fe84 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/index.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/index.html @@ -1,4 +1,4 @@ -bdk_bitcoind_rpc - Rust

Crate bdk_bitcoind_rpc

Source
Expand description

This crate is used for emitting blockchain data from the bitcoind RPC interface. It does not +bdk_bitcoind_rpc - Rust

Crate bdk_bitcoind_rpc

Source
Expand description

This crate is used for emitting blockchain data from the bitcoind RPC interface. It does not use the wallet RPC API, so this crate can be used with wallet-disabled Bitcoin Core nodes.

Emitter is the main structure which sources blockchain data from [bitcoincore_rpc::Client].

To only get block updates (exclude mempool transactions), the caller can use diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.BlockEvent.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.BlockEvent.html index 0a98a225ff..c44cf16364 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.BlockEvent.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.BlockEvent.html @@ -1,18 +1,18 @@ -BlockEvent in bdk_bitcoind_rpc - Rust

bdk_bitcoind_rpc

Struct BlockEvent

Source 
pub struct BlockEvent<B> {
+BlockEvent in bdk_bitcoind_rpc - Rust
bdk_bitcoind_rpc
Struct BlockEvent
Source 
pub struct BlockEvent<B> {
     pub block: B,
-    pub checkpoint: CheckPoint,
+    pub checkpoint: CheckPoint,
 }
Expand description
A newly emitted block from Emitter.

 
Fields§
§block: B
Either a full [Block] or [Header] of the new block.

-
§checkpoint: CheckPoint
The checkpoint of the new block.

-
A CheckPoint is a node of a linked list of BlockIds. This checkpoint is linked to
-all BlockIds originally passed in Emitter::new as well as emitted blocks since then.
+
§checkpoint: CheckPoint
The checkpoint of the new block.

+
A [CheckPoint] is a node of a linked list of [BlockId]s. This checkpoint is linked to
+all [BlockId]s originally passed in Emitter::new as well as emitted blocks since then.
 These blocks are guaranteed to be of the same chain.

 
This is important as BDK structures require block-to-apply to be connected with another
 block in the original chain.

 
Implementations§
Source§
impl<B> BlockEvent<B>
Source
pub fn block_height(&self) -> u32
The block height of this new block.

 
Source
pub fn block_hash(&self) -> BlockHash
The block hash of this new block.

-
Source
pub fn connected_to(&self) -> BlockId
The BlockId of a previous block that this block connects to.

-
This either returns a BlockId of a previously emitted block or from the chain we started
+
Source
pub fn connected_to(&self) -> BlockId
The [BlockId] of a previous block that this block connects to.

+
This either returns a [BlockId] of a previously emitted block or from the chain we started
 with (passed in as last_cp in Emitter::new).

 
This value is derived from BlockEvent::checkpoint.

 
Trait Implementations§
Source§
impl<B: Debug> Debug for BlockEvent<B>
Source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
Auto Trait Implementations§
§
impl<B> Freeze for BlockEvent<B>
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.Emitter.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.Emitter.html
index 4fb331e5e1..243dd92c96 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.Emitter.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.Emitter.html
@@ -1,6 +1,6 @@
-Emitter in bdk_bitcoind_rpc - Rust
bdk_bitcoind_rpc
Struct Emitter
Source 
pub struct Emitter<'c, C> { /* private fields */ }
Expand description
The Emitter is used to emit data sourced from [bitcoincore_rpc::Client].

+Emitter in bdk_bitcoind_rpc - Rust
bdk_bitcoind_rpc
Struct Emitter
Source 
pub struct Emitter<'c, C> { /* private fields */ }
Expand description
The Emitter is used to emit data sourced from [bitcoincore_rpc::Client].

 
Refer to module-level documentation for more.

-
Implementations§
Source§
impl<'c, C: RpcApi> Emitter<'c, C>
Source
pub fn new(client: &'c C, last_cp: CheckPoint, start_height: u32) -> Self
Construct a new Emitter.

+
Implementations§
Source§
impl<'c, C: RpcApi> Emitter<'c, C>
Source
pub fn new(client: &'c C, last_cp: CheckPoint, start_height: u32) -> Self
Construct a new Emitter.

 
last_cp informs the emitter of the chain we are starting off with. This way, the emitter
 can start emission from a block that connects to the original chain.

 
start_height starts emission from a given height (if there are no conflicts with the
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/trait.BitcoindRpcErrorExt.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/trait.BitcoindRpcErrorExt.html
index 870e7c2da9..23fe70e282 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/trait.BitcoindRpcErrorExt.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/trait.BitcoindRpcErrorExt.html
@@ -1,4 +1,4 @@
-BitcoindRpcErrorExt in bdk_bitcoind_rpc - Rust
bdk_bitcoind_rpc
Trait BitcoindRpcErrorExt
Source 
pub trait BitcoindRpcErrorExt {
+BitcoindRpcErrorExt in bdk_bitcoind_rpc - Rust
bdk_bitcoind_rpc
Trait BitcoindRpcErrorExt
Source 
pub trait BitcoindRpcErrorExt {
     // Required method
     fn is_not_found_error(&self) -> bool;
 }
Expand description
Extends [bitcoincore_rpc::Error].

diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/all.html
index 806aea4414..6fc618d0d7 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/all.html
@@ -1 +1 @@
-List of all items in this crate
List of all items
Structs
Enums
Traits
Macros
Derive Macros
Functions
Type Aliases
Statics
Constants

\ No newline at end of file
+List of all items in this crate
List of all items
Structs
Enums
Traits
Macros
Derive Macros
Functions
Type Aliases
Statics
Constants

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.AddressData.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.AddressData.html
index ac50c160c8..40a02f1938 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.AddressData.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.AddressData.html
@@ -1,4 +1,4 @@
-AddressData in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum AddressData
#[non_exhaustive]
pub enum AddressData {
+AddressData in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum AddressData
#[non_exhaustive]
pub enum AddressData {
     P2pkh {
         pubkey_hash: PubkeyHash,
     },
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.AddressType.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.AddressType.html
index addb32ff37..07731c79c3 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.AddressType.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.AddressType.html
@@ -1,4 +1,4 @@
-AddressType in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum AddressType
#[non_exhaustive]
pub enum AddressType {
+AddressType in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum AddressType
#[non_exhaustive]
pub enum AddressType {
     P2pkh,
     P2sh,
     P2wpkh,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.FromScriptError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.FromScriptError.html
index 77c48d3a81..2a39aff670 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.FromScriptError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.FromScriptError.html
@@ -1,4 +1,4 @@
-FromScriptError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum FromScriptError
#[non_exhaustive]
pub enum FromScriptError {
+FromScriptError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum FromScriptError
#[non_exhaustive]
pub enum FromScriptError {
     UnrecognizedScript,
     WitnessProgram(Error),
     WitnessVersion(TryFromError),
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.KnownHrp.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.KnownHrp.html
index 3292fb38ef..4a9d7666b3 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.KnownHrp.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.KnownHrp.html
@@ -1,4 +1,4 @@
-KnownHrp in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum KnownHrp
#[non_exhaustive]
pub enum KnownHrp {
+KnownHrp in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum KnownHrp
#[non_exhaustive]
pub enum KnownHrp {
     Mainnet,
     Testnets,
     Regtest,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.NetworkChecked.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.NetworkChecked.html
index e9fc156178..f2ceef0c10 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.NetworkChecked.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.NetworkChecked.html
@@ -1,4 +1,4 @@
-NetworkChecked in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum NetworkChecked
pub enum NetworkChecked {}
Expand description
Marker that address’s network has been successfully validated. See section Parsing addresses
+NetworkChecked in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum NetworkChecked
pub enum NetworkChecked {}
Expand description
Marker that address’s network has been successfully validated. See section Parsing addresses
 on Address for details.

 
Trait Implementations§
§
impl Clone for NetworkChecked
§
fn clone(&self) -> NetworkChecked
Returns a copy of the value. Read more
1.0.0 · Source§
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
§
impl Debug for NetworkChecked
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Hash for NetworkChecked
§
fn hash<__H>(&self, state: &mut __H)
where
     __H: Hasher,
Feeds this value into the given Hasher. Read more
1.3.0 · Source§
fn hash_slice<H>(data: &[Self], state: &mut H)
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.NetworkUnchecked.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.NetworkUnchecked.html
index 9eb15990c7..1d78c6726f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.NetworkUnchecked.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.NetworkUnchecked.html
@@ -1,4 +1,4 @@
-NetworkUnchecked in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum NetworkUnchecked
pub enum NetworkUnchecked {}
Expand description
Marker that address’s network has not yet been validated. See section Parsing addresses
+NetworkUnchecked in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum NetworkUnchecked
pub enum NetworkUnchecked {}
Expand description
Marker that address’s network has not yet been validated. See section Parsing addresses
 on Address for details.

 
Trait Implementations§
§
impl Clone for NetworkUnchecked
§
fn clone(&self) -> NetworkUnchecked
Returns a copy of the value. Read more
1.0.0 · Source§
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
§
impl Debug for NetworkUnchecked
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Hash for NetworkUnchecked
§
fn hash<__H>(&self, state: &mut __H)
where
     __H: Hasher,
Feeds this value into the given Hasher. Read more
1.3.0 · Source§
fn hash_slice<H>(data: &[Self], state: &mut H)
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.P2shError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.P2shError.html
index 4a8e1f222f..b068fb6fc4 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.P2shError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.P2shError.html
@@ -1,4 +1,4 @@
-P2shError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum P2shError
#[non_exhaustive]
pub enum P2shError {
+P2shError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum P2shError
#[non_exhaustive]
pub enum P2shError {
     ExcessiveScriptSize,
 }
Expand description
Error while generating address from a p2sh script.

 
Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
§
ExcessiveScriptSize
Address size more than 520 bytes is not allowed.

diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.ParseError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.ParseError.html
index 1fb8331b9a..37fdf06238 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.ParseError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.ParseError.html
@@ -1,4 +1,4 @@
-ParseError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum ParseError
#[non_exhaustive]
pub enum ParseError {
+ParseError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum ParseError
#[non_exhaustive]
pub enum ParseError {
     Base58(Error),
     Bech32(DecodeError),
     WitnessVersion(TryFromError),
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.FromScriptError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.FromScriptError.html
index 905acd7194..0ae37f50fd 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.FromScriptError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.FromScriptError.html
@@ -1,4 +1,4 @@
-FromScriptError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Enum FromScriptError
#[non_exhaustive]
pub enum FromScriptError {
+FromScriptError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Enum FromScriptError
#[non_exhaustive]
pub enum FromScriptError {
     UnrecognizedScript,
     WitnessProgram(Error),
     WitnessVersion(TryFromError),
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.P2shError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.P2shError.html
index c4cef8ee97..feb3653d2d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.P2shError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.P2shError.html
@@ -1,4 +1,4 @@
-P2shError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Enum P2shError
#[non_exhaustive]
pub enum P2shError {
+P2shError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Enum P2shError
#[non_exhaustive]
pub enum P2shError {
     ExcessiveScriptSize,
 }
Expand description
Error while generating address from a p2sh script.

 
Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
§
ExcessiveScriptSize
Address size more than 520 bytes is not allowed.

diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.ParseError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.ParseError.html
index acbc26ddd6..42280c1ea0 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.ParseError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.ParseError.html
@@ -1,4 +1,4 @@
-ParseError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Enum ParseError
#[non_exhaustive]
pub enum ParseError {
+ParseError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Enum ParseError
#[non_exhaustive]
pub enum ParseError {
     Base58(Error),
     Bech32(DecodeError),
     WitnessVersion(TryFromError),
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/index.html
index 784eef9769..98a472215a 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/index.html
@@ -1,2 +1,2 @@
-bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address
Module error
Expand description
Error code for the address module.

+bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address
Module error
Expand description
Error code for the address module.

 
Structs§
Enums§

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.InvalidBase58PayloadLengthError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.InvalidBase58PayloadLengthError.html
index caa121fb75..4bf898bca8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.InvalidBase58PayloadLengthError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.InvalidBase58PayloadLengthError.html
@@ -1,4 +1,4 @@
-InvalidBase58PayloadLengthError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct InvalidBase58PayloadLengthError
pub struct InvalidBase58PayloadLengthError { /* private fields */ }
Expand description
Decoded base58 data was an invalid length.

+InvalidBase58PayloadLengthError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct InvalidBase58PayloadLengthError
pub struct InvalidBase58PayloadLengthError { /* private fields */ }
Expand description
Decoded base58 data was an invalid length.

 
Implementations§
§
impl InvalidBase58PayloadLengthError
pub fn invalid_base58_payload_length(&self) -> usize
Returns the invalid payload length.

 
Trait Implementations§
§
impl Clone for InvalidBase58PayloadLengthError
§
fn clone(&self) -> InvalidBase58PayloadLengthError
Returns a copy of the value. Read more
1.0.0 · Source§
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
§
impl Debug for InvalidBase58PayloadLengthError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for InvalidBase58PayloadLengthError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for InvalidBase58PayloadLengthError
1.30.0 · Source§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<InvalidBase58PayloadLengthError> for ParseError
§
fn from(e: InvalidBase58PayloadLengthError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for InvalidBase58PayloadLengthError
§
fn eq(&self, other: &InvalidBase58PayloadLengthError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for InvalidBase58PayloadLengthError
§
impl StructuralPartialEq for InvalidBase58PayloadLengthError
Auto Trait Implementations§
Blanket Implementations§
Source§
impl<T> Any for T
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.InvalidLegacyPrefixError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.InvalidLegacyPrefixError.html
index cb8264bb5d..68cd35ad51 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.InvalidLegacyPrefixError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.InvalidLegacyPrefixError.html
@@ -1,4 +1,4 @@
-InvalidLegacyPrefixError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct InvalidLegacyPrefixError
pub struct InvalidLegacyPrefixError { /* private fields */ }
Expand description
Invalid legacy address prefix in decoded base58 data.

+InvalidLegacyPrefixError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct InvalidLegacyPrefixError
pub struct InvalidLegacyPrefixError { /* private fields */ }
Expand description
Invalid legacy address prefix in decoded base58 data.

 
Implementations§
§
impl InvalidLegacyPrefixError
pub fn invalid_legacy_address_prefix(&self) -> u8
Returns the invalid prefix.

 
Trait Implementations§
§
impl Clone for InvalidLegacyPrefixError
§
fn clone(&self) -> InvalidLegacyPrefixError
Returns a copy of the value. Read more
1.0.0 · Source§
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
§
impl Debug for InvalidLegacyPrefixError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for InvalidLegacyPrefixError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for InvalidLegacyPrefixError
1.30.0 · Source§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<InvalidLegacyPrefixError> for ParseError
§
fn from(e: InvalidLegacyPrefixError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for InvalidLegacyPrefixError
§
fn eq(&self, other: &InvalidLegacyPrefixError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for InvalidLegacyPrefixError
§
impl StructuralPartialEq for InvalidLegacyPrefixError
Auto Trait Implementations§
Blanket Implementations§
Source§
impl<T> Any for T
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.LegacyAddressTooLongError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.LegacyAddressTooLongError.html
index 5bfe0c1024..e59d6eb29d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.LegacyAddressTooLongError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.LegacyAddressTooLongError.html
@@ -1,4 +1,4 @@
-LegacyAddressTooLongError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct LegacyAddressTooLongError
pub struct LegacyAddressTooLongError { /* private fields */ }
Expand description
Legacy base58 address was too long, max 50 characters.

+LegacyAddressTooLongError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct LegacyAddressTooLongError
pub struct LegacyAddressTooLongError { /* private fields */ }
Expand description
Legacy base58 address was too long, max 50 characters.

 
Implementations§
§
impl LegacyAddressTooLongError
pub fn invalid_legcay_address_length(&self) -> usize
Returns the invalid legacy address length.

 
Trait Implementations§
§
impl Clone for LegacyAddressTooLongError
§
fn clone(&self) -> LegacyAddressTooLongError
Returns a copy of the value. Read more
1.0.0 · Source§
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
§
impl Debug for LegacyAddressTooLongError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for LegacyAddressTooLongError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for LegacyAddressTooLongError
1.30.0 · Source§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<LegacyAddressTooLongError> for ParseError
§
fn from(e: LegacyAddressTooLongError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for LegacyAddressTooLongError
§
fn eq(&self, other: &LegacyAddressTooLongError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for LegacyAddressTooLongError
§
impl StructuralPartialEq for LegacyAddressTooLongError
Auto Trait Implementations§
Blanket Implementations§
Source§
impl<T> Any for T
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.NetworkValidationError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.NetworkValidationError.html
index c39236fc30..b9d49149e8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.NetworkValidationError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.NetworkValidationError.html
@@ -1,4 +1,4 @@
-NetworkValidationError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct NetworkValidationError
pub struct NetworkValidationError { /* private fields */ }
Expand description
Address’s network differs from required one.

+NetworkValidationError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct NetworkValidationError
pub struct NetworkValidationError { /* private fields */ }
Expand description
Address’s network differs from required one.

 
Trait Implementations§
§
impl Clone for NetworkValidationError
§
fn clone(&self) -> NetworkValidationError
Returns a copy of the value. Read more
1.0.0 · Source§
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
§
impl Debug for NetworkValidationError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for NetworkValidationError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for NetworkValidationError
1.30.0 · Source§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<NetworkValidationError> for ParseError
§
fn from(e: NetworkValidationError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for NetworkValidationError
§
fn eq(&self, other: &NetworkValidationError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for NetworkValidationError
§
impl StructuralPartialEq for NetworkValidationError
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/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.UnknownAddressTypeError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.UnknownAddressTypeError.html
index 522c374e6e..ee4c485d53 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.UnknownAddressTypeError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.UnknownAddressTypeError.html
@@ -1,4 +1,4 @@
-UnknownAddressTypeError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct UnknownAddressTypeError
#[non_exhaustive]
pub struct UnknownAddressTypeError(pub String);
Expand description
Address type is either invalid or not supported in rust-bitcoin.

+UnknownAddressTypeError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct UnknownAddressTypeError
#[non_exhaustive]
pub struct UnknownAddressTypeError(pub String);
Expand description
Address type is either invalid or not supported in rust-bitcoin.

 
Tuple Fields (Non-exhaustive)§
This struct is marked as non-exhaustive
Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.
§0: String
Trait Implementations§
§
impl Clone for UnknownAddressTypeError
§
fn clone(&self) -> UnknownAddressTypeError
Returns a copy of the value. Read more
1.0.0 · Source§
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
§
impl Debug for UnknownAddressTypeError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for UnknownAddressTypeError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for UnknownAddressTypeError
§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl PartialEq for UnknownAddressTypeError
§
fn eq(&self, other: &UnknownAddressTypeError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for UnknownAddressTypeError
§
impl StructuralPartialEq for UnknownAddressTypeError
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/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.UnknownHrpError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.UnknownHrpError.html
index 02d27414e8..f0a416c3ed 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.UnknownHrpError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.UnknownHrpError.html
@@ -1,4 +1,4 @@
-UnknownHrpError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct UnknownHrpError
#[non_exhaustive]
pub struct UnknownHrpError(pub String);
Expand description
Unknown HRP error.

+UnknownHrpError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct UnknownHrpError
#[non_exhaustive]
pub struct UnknownHrpError(pub String);
Expand description
Unknown HRP error.

 
Tuple Fields (Non-exhaustive)§
This struct is marked as non-exhaustive
Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.
§0: String
Trait Implementations§
§
impl Clone for UnknownHrpError
§
fn clone(&self) -> UnknownHrpError
Returns a copy of the value. Read more
1.0.0 · Source§
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
§
impl Debug for UnknownHrpError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for UnknownHrpError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for UnknownHrpError
§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<UnknownHrpError> for ParseError
§
fn from(e: UnknownHrpError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for UnknownHrpError
§
fn eq(&self, other: &UnknownHrpError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for UnknownHrpError
§
impl StructuralPartialEq for UnknownHrpError
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/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/index.html
index e528dcf57a..3e095bc1ed 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/index.html
@@ -1,4 +1,4 @@
-bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin
Module address
Expand description
Bitcoin addresses.

+bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin
Module address
Expand description
Bitcoin addresses.

 
Support for ordinary base58 Bitcoin addresses and private keys.

 
§Example: creating a new address from a randomly-generated key pair

 
use bitcoin::{Address, PublicKey, Network};
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.Address.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.Address.html
index 1796a8984b..5d69909c2b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.Address.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.Address.html
@@ -1,4 +1,4 @@
-Address in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct Address
pub struct Address<V = NetworkChecked>(/* private fields */)
+Address in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct Address
pub struct Address<V = NetworkChecked>(/* private fields */)
 where
     V: NetworkValidation;
Expand description
A Bitcoin address.

 
§Parsing addresses

diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.InvalidBase58PayloadLengthError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.InvalidBase58PayloadLengthError.html
index 7e6133c2d4..feb20b8b1a 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.InvalidBase58PayloadLengthError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.InvalidBase58PayloadLengthError.html
@@ -1,4 +1,4 @@
-InvalidBase58PayloadLengthError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct InvalidBase58PayloadLengthError
pub struct InvalidBase58PayloadLengthError { /* private fields */ }
Expand description
Decoded base58 data was an invalid length.

+InvalidBase58PayloadLengthError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct InvalidBase58PayloadLengthError
pub struct InvalidBase58PayloadLengthError { /* private fields */ }
Expand description
Decoded base58 data was an invalid length.

 
Implementations§
§
impl InvalidBase58PayloadLengthError
pub fn invalid_base58_payload_length(&self) -> usize
Returns the invalid payload length.

 
Trait Implementations§
§
impl Clone for InvalidBase58PayloadLengthError
§
fn clone(&self) -> InvalidBase58PayloadLengthError
Returns a copy of the value. Read more
1.0.0 · Source§
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
§
impl Debug for InvalidBase58PayloadLengthError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for InvalidBase58PayloadLengthError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for InvalidBase58PayloadLengthError
1.30.0 · Source§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<InvalidBase58PayloadLengthError> for ParseError
§
fn from(e: InvalidBase58PayloadLengthError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for InvalidBase58PayloadLengthError
§
fn eq(&self, other: &InvalidBase58PayloadLengthError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for InvalidBase58PayloadLengthError
§
impl StructuralPartialEq for InvalidBase58PayloadLengthError
Auto Trait Implementations§
Blanket Implementations§
Source§
impl<T> Any for T
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.InvalidLegacyPrefixError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.InvalidLegacyPrefixError.html
index 8b7bf48648..2c9cc6359d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.InvalidLegacyPrefixError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.InvalidLegacyPrefixError.html
@@ -1,4 +1,4 @@
-InvalidLegacyPrefixError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct InvalidLegacyPrefixError
pub struct InvalidLegacyPrefixError { /* private fields */ }
Expand description
Invalid legacy address prefix in decoded base58 data.

+InvalidLegacyPrefixError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct InvalidLegacyPrefixError
pub struct InvalidLegacyPrefixError { /* private fields */ }
Expand description
Invalid legacy address prefix in decoded base58 data.

 
Implementations§
§
impl InvalidLegacyPrefixError
pub fn invalid_legacy_address_prefix(&self) -> u8
Returns the invalid prefix.

 
Trait Implementations§
§
impl Clone for InvalidLegacyPrefixError
§
fn clone(&self) -> InvalidLegacyPrefixError
Returns a copy of the value. Read more
1.0.0 · Source§
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
§
impl Debug for InvalidLegacyPrefixError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for InvalidLegacyPrefixError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for InvalidLegacyPrefixError
1.30.0 · Source§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<InvalidLegacyPrefixError> for ParseError
§
fn from(e: InvalidLegacyPrefixError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for InvalidLegacyPrefixError
§
fn eq(&self, other: &InvalidLegacyPrefixError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for InvalidLegacyPrefixError
§
impl StructuralPartialEq for InvalidLegacyPrefixError
Auto Trait Implementations§
Blanket Implementations§
Source§
impl<T> Any for T
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.LegacyAddressTooLongError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.LegacyAddressTooLongError.html
index 831a70d8d0..fd3eda1f36 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.LegacyAddressTooLongError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.LegacyAddressTooLongError.html
@@ -1,4 +1,4 @@
-LegacyAddressTooLongError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct LegacyAddressTooLongError
pub struct LegacyAddressTooLongError { /* private fields */ }
Expand description
Legacy base58 address was too long, max 50 characters.

+LegacyAddressTooLongError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct LegacyAddressTooLongError
pub struct LegacyAddressTooLongError { /* private fields */ }
Expand description
Legacy base58 address was too long, max 50 characters.

 
Implementations§
§
impl LegacyAddressTooLongError
pub fn invalid_legcay_address_length(&self) -> usize
Returns the invalid legacy address length.

 
Trait Implementations§
§
impl Clone for LegacyAddressTooLongError
§
fn clone(&self) -> LegacyAddressTooLongError
Returns a copy of the value. Read more
1.0.0 · Source§
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
§
impl Debug for LegacyAddressTooLongError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for LegacyAddressTooLongError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for LegacyAddressTooLongError
1.30.0 · Source§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<LegacyAddressTooLongError> for ParseError
§
fn from(e: LegacyAddressTooLongError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for LegacyAddressTooLongError
§
fn eq(&self, other: &LegacyAddressTooLongError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for LegacyAddressTooLongError
§
impl StructuralPartialEq for LegacyAddressTooLongError
Auto Trait Implementations§
Blanket Implementations§
Source§
impl<T> Any for T
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.NetworkValidationError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.NetworkValidationError.html
index fd5f1b0e88..ae3259444f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.NetworkValidationError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.NetworkValidationError.html
@@ -1,4 +1,4 @@
-NetworkValidationError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct NetworkValidationError
pub struct NetworkValidationError { /* private fields */ }
Expand description
Address’s network differs from required one.

+NetworkValidationError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct NetworkValidationError
pub struct NetworkValidationError { /* private fields */ }
Expand description
Address’s network differs from required one.

 
Trait Implementations§
§
impl Clone for NetworkValidationError
§
fn clone(&self) -> NetworkValidationError
Returns a copy of the value. Read more
1.0.0 · Source§
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
§
impl Debug for NetworkValidationError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for NetworkValidationError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for NetworkValidationError
1.30.0 · Source§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<NetworkValidationError> for ParseError
§
fn from(e: NetworkValidationError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for NetworkValidationError
§
fn eq(&self, other: &NetworkValidationError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for NetworkValidationError
§
impl StructuralPartialEq for NetworkValidationError
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/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.UnknownAddressTypeError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.UnknownAddressTypeError.html
index 506327f54e..e31e94f9eb 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.UnknownAddressTypeError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.UnknownAddressTypeError.html
@@ -1,4 +1,4 @@
-UnknownAddressTypeError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct UnknownAddressTypeError
#[non_exhaustive]
pub struct UnknownAddressTypeError(pub String);
Expand description
Address type is either invalid or not supported in rust-bitcoin.

+UnknownAddressTypeError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct UnknownAddressTypeError
#[non_exhaustive]
pub struct UnknownAddressTypeError(pub String);
Expand description
Address type is either invalid or not supported in rust-bitcoin.

 
Tuple Fields (Non-exhaustive)§
This struct is marked as non-exhaustive
Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.
§0: String
Trait Implementations§
§
impl Clone for UnknownAddressTypeError
§
fn clone(&self) -> UnknownAddressTypeError
Returns a copy of the value. Read more
1.0.0 · Source§
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
§
impl Debug for UnknownAddressTypeError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for UnknownAddressTypeError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for UnknownAddressTypeError
§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl PartialEq for UnknownAddressTypeError
§
fn eq(&self, other: &UnknownAddressTypeError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for UnknownAddressTypeError
§
impl StructuralPartialEq for UnknownAddressTypeError
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/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.UnknownHrpError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.UnknownHrpError.html
index 133a65e4bc..b7c160ed80 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.UnknownHrpError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.UnknownHrpError.html
@@ -1,4 +1,4 @@
-UnknownHrpError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct UnknownHrpError
#[non_exhaustive]
pub struct UnknownHrpError(pub String);
Expand description
Unknown HRP error.

+UnknownHrpError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct UnknownHrpError
#[non_exhaustive]
pub struct UnknownHrpError(pub String);
Expand description
Unknown HRP error.

 
Tuple Fields (Non-exhaustive)§
This struct is marked as non-exhaustive
Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.
§0: String
Trait Implementations§
§
impl Clone for UnknownHrpError
§
fn clone(&self) -> UnknownHrpError
Returns a copy of the value. Read more
1.0.0 · Source§
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
§
impl Debug for UnknownHrpError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for UnknownHrpError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for UnknownHrpError
§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<UnknownHrpError> for ParseError
§
fn from(e: UnknownHrpError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for UnknownHrpError
§
fn eq(&self, other: &UnknownHrpError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for UnknownHrpError
§
impl StructuralPartialEq for UnknownHrpError
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/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/trait.NetworkValidation.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/trait.NetworkValidation.html
index 8ed15709bc..c621842d25 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/trait.NetworkValidation.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/trait.NetworkValidation.html
@@ -1,4 +1,4 @@
-NetworkValidation in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Trait NetworkValidation
pub trait NetworkValidation:
+NetworkValidation in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Trait NetworkValidation
pub trait NetworkValidation:
     Sized
     + NetworkValidation
     + Sync
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/enum.Denomination.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/enum.Denomination.html
index b6286cfcfe..d1503d31a4 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/enum.Denomination.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/enum.Denomination.html
@@ -1,4 +1,4 @@
-Denomination in bdk_chain::bitcoin::amount - Rust
bdk_chain::bitcoin::amount
Enum Denomination
#[non_exhaustive]
pub enum Denomination {
+Denomination in bdk_chain::bitcoin::amount - Rust
bdk_chain::bitcoin::amount
Enum Denomination
#[non_exhaustive]
pub enum Denomination {
     Bitcoin,
     CentiBitcoin,
     MilliBitcoin,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/enum.ParseAmountError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/enum.ParseAmountError.html
index b271b36dc8..2f3b7ea945 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/enum.ParseAmountError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/enum.ParseAmountError.html
@@ -1,4 +1,4 @@
-ParseAmountError in bdk_chain::bitcoin::amount - Rust
bdk_chain::bitcoin::amount
Enum ParseAmountError
#[non_exhaustive]
pub enum ParseAmountError {
+ParseAmountError in bdk_chain::bitcoin::amount - Rust
bdk_chain::bitcoin::amount
Enum ParseAmountError
#[non_exhaustive]
pub enum ParseAmountError {
     OutOfRange(OutOfRangeError),
     TooPrecise(TooPreciseError),
     MissingDigits(MissingDigitsError),
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/index.html
index 7a5d0f2f45..06d817566f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/index.html
@@ -1,4 +1,4 @@
-bdk_chain::bitcoin::amount - Rust
bdk_chain::bitcoin
Module amount
Expand description
Bitcoin amounts.

+bdk_chain::bitcoin::amount - Rust
bdk_chain::bitcoin
Module amount
Expand description
Bitcoin amounts.

 
This module mainly introduces the Amount and SignedAmount types.
 We refer to the documentation on the types for more information.

 
Modules§
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<P, T> Receiver for P
where
+
Source§
impl<P, T> Receiver for P
where
     P: Deref<Target = T> + ?Sized,
-    T: ?Sized,
Source§
type Target = T
🔬This is a nightly-only experimental API. (arbitrary_self_types)
The target type on which the method may be called.
Source§
impl<T> ToOwned for T
where
+    T: ?Sized,
Source§
type Target = T
🔬This is a nightly-only experimental API. (arbitrary_self_types)
The target type on which the method may be called.
Source§
impl<T> ToOwned for T
where
     T: Clone,
Source§
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§
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>,
Source§
type Error = Infallible
The type returned in the event of a conversion 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
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base58/struct.Vec.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base58/struct.Vec.html
index 733e1fd37a..cd23929a73 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base58/struct.Vec.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base58/struct.Vec.html
@@ -1,4 +1,4 @@
-Vec in bdk_chain::bitcoin::base58 - Rust
bdk_chain::bitcoin::base58
Struct Vec
1.0.0 · Source 
pub struct Vec<T, A = Global>
where
+Vec in bdk_chain::bitcoin::base58 - Rust
bdk_chain::bitcoin::base58
Struct Vec
1.0.0 · Source 
pub struct Vec<T, A = Global>
where
     A: Allocator,
{ /* private fields */ }
Expand description
A contiguous growable array type, written as Vec<T>, short for ‘vector’.

 
§Examples

 
let mut vec = Vec::new();
@@ -1504,7 +1504,7 @@ vec.dedup();
 
 assert_eq!(vec, [1, 2, 3, 2]);

 
Source§
impl<T, A> Vec<T, A>
where
-    A: Allocator,
1.21.0 · Source
pub fn splice<R, I>(
+    A: Allocator,
1.21.0 · Source
pub fn splice<R, I>(
     &mut self,
     range: R,
     replace_with: I,
@@ -1513,7 +1513,7 @@ vec.dedup();
     I: IntoIterator<Item = T>,
Creates a splicing iterator that replaces the specified range in the vector
 with the given replace_with iterator and yields the removed items.
 replace_with does not need to be the same length as range.

-
range is removed even if the iterator is not consumed until the end.

+
range is removed even if the Splice iterator is not consumed before it is dropped.

 
It is unspecified how many elements are removed from the vector
 if the Splice value is leaked.

 
The input iterator replace_with is only consumed when the Splice value is dropped.

@@ -1531,9 +1531,16 @@ the end point is greater than the length of the vector.

 
let mut v = vec![1, 2, 3, 4];
 let new = [7, 8, 9];
 let u: Vec<_> = v.splice(1..3, new).collect();
-assert_eq!(v, &[1, 7, 8, 9, 4]);
-assert_eq!(u, &[2, 3]);

-
Source
pub fn extract_if<F, R>(
+assert_eq!(v, [1, 7, 8, 9, 4]);
+assert_eq!(u, [2, 3]);

+
Using splice to insert new items into a vector efficiently at a specific position
+indicated by an empty range:

+
+
let mut v = vec![1, 5];
+let new = [2, 3, 4];
+v.splice(1..1, new);
+assert_eq!(v, [1, 2, 3, 4, 5]);

+
Source
pub fn extract_if<F, R>(
     &mut self,
     range: R,
     filter: F,
@@ -1584,14 +1591,135 @@ regardless of whether you choose to keep or remove them.

 let ones = items.extract_if(7.., |x| *x == 1).collect::<Vec<_>>();
 assert_eq!(items, vec![0, 0, 0, 0, 0, 0, 0, 2, 2, 2]);
 assert_eq!(ones.len(), 3);

-
Methods from Deref<Target = [T]>§
Source
pub fn as_str(&self) -> &str
🔬This is a nightly-only experimental API. (ascii_char)
Views this slice of ASCII characters as a UTF-8 str.

-
Source
pub fn as_bytes(&self) -> &[u8] ⓘ
🔬This is a nightly-only experimental API. (ascii_char)
Views this slice of ASCII characters as a slice of u8 bytes.

+
Methods from Deref<Target = [T]>§
Source
pub fn write_copy_of_slice(&mut self, src: &[T]) -> &mut [T]
where
+    T: Copy,
🔬This is a nightly-only experimental API. (maybe_uninit_write_slice)
Copies the elements from src to self,
+returning a mutable reference to the now initialized contents of self.

+
If T does not implement Copy, use write_clone_of_slice instead.

+
This is similar to slice::copy_from_slice.

+
§Panics

+
This function will panic if the two slices have different lengths.

+
§Examples

+
#![feature(maybe_uninit_write_slice)]
+use std::mem::MaybeUninit;
+
+let mut dst = [MaybeUninit::uninit(); 32];
+let src = [0; 32];
+
+let init = dst.write_copy_of_slice(&src);
+
+assert_eq!(init, src);

+
+
#![feature(maybe_uninit_write_slice)]
+
+let mut vec = Vec::with_capacity(32);
+let src = [0; 16];
+
+vec.spare_capacity_mut()[..src.len()].write_copy_of_slice(&src);
+
+// SAFETY: we have just copied all the elements of len into the spare capacity
+// the first src.len() elements of the vec are valid now.
+unsafe {
+    vec.set_len(src.len());
+}
+
+assert_eq!(vec, src);

+
Source
pub fn write_clone_of_slice(&mut self, src: &[T]) -> &mut [T]
where
+    T: Clone,
🔬This is a nightly-only experimental API. (maybe_uninit_write_slice)
Clones the elements from src to self,
+returning a mutable reference to the now initialized contents of self.
+Any already initialized elements will not be dropped.

+
If T implements Copy, use write_copy_of_slice instead.

+
This is similar to slice::clone_from_slice but does not drop existing elements.

+
§Panics

+
This function will panic if the two slices have different lengths, or if the implementation of Clone panics.

+
If there is a panic, the already cloned elements will be dropped.

+
§Examples

+
#![feature(maybe_uninit_write_slice)]
+use std::mem::MaybeUninit;
+
+let mut dst = [const { MaybeUninit::uninit() }; 5];
+let src = ["wibbly", "wobbly", "timey", "wimey", "stuff"].map(|s| s.to_string());
+
+let init = dst.write_clone_of_slice(&src);
+
+assert_eq!(init, src);
+

+
+
#![feature(maybe_uninit_write_slice)]
+
+let mut vec = Vec::with_capacity(32);
+let src = ["rust", "is", "a", "pretty", "cool", "language"].map(|s| s.to_string());
+
+vec.spare_capacity_mut()[..src.len()].write_clone_of_slice(&src);
+
+// SAFETY: we have just cloned all the elements of len into the spare capacity
+// the first src.len() elements of the vec are valid now.
+unsafe {
+    vec.set_len(src.len());
+}
+
+assert_eq!(vec, src);

+
Source
pub fn as_bytes(&self) -> &[MaybeUninit<u8>]
🔬This is a nightly-only experimental API. (maybe_uninit_as_bytes)
Returns the contents of this MaybeUninit as a slice of potentially uninitialized bytes.

+
Note that even if the contents of a MaybeUninit have been initialized, the value may still
+contain padding bytes which are left uninitialized.

+
§Examples

+
#![feature(maybe_uninit_as_bytes, maybe_uninit_write_slice, maybe_uninit_slice)]
+use std::mem::MaybeUninit;
+
+let uninit = [MaybeUninit::new(0x1234u16), MaybeUninit::new(0x5678u16)];
+let uninit_bytes = uninit.as_bytes();
+let bytes = unsafe { uninit_bytes.assume_init_ref() };
+let val1 = u16::from_ne_bytes(bytes[0..2].try_into().unwrap());
+let val2 = u16::from_ne_bytes(bytes[2..4].try_into().unwrap());
+assert_eq!(&[val1, val2], &[0x1234u16, 0x5678u16]);

+
Source
pub fn as_bytes_mut(&mut self) -> &mut [MaybeUninit<u8>]
🔬This is a nightly-only experimental API. (maybe_uninit_as_bytes)
Returns the contents of this MaybeUninit slice as a mutable slice of potentially
+uninitialized bytes.

+
Note that even if the contents of a MaybeUninit have been initialized, the value may still
+contain padding bytes which are left uninitialized.

+
§Examples

+
#![feature(maybe_uninit_as_bytes, maybe_uninit_write_slice, maybe_uninit_slice)]
+use std::mem::MaybeUninit;
+
+let mut uninit = [MaybeUninit::<u16>::uninit(), MaybeUninit::<u16>::uninit()];
+let uninit_bytes = MaybeUninit::slice_as_bytes_mut(&mut uninit);
+uninit_bytes.write_copy_of_slice(&[0x12, 0x34, 0x56, 0x78]);
+let vals = unsafe { uninit.assume_init_ref() };
+if cfg!(target_endian = "little") {
+    assert_eq!(vals, &[0x3412u16, 0x7856u16]);
+} else {
+    assert_eq!(vals, &[0x1234u16, 0x5678u16]);
+}

+
Source
pub unsafe fn assume_init_drop(&mut self)
🔬This is a nightly-only experimental API. (maybe_uninit_slice)
Drops the contained values in place.

+
§Safety

+
It is up to the caller to guarantee that every MaybeUninit<T> in the slice
+really is in an initialized state. Calling this when the content is not yet
+fully initialized causes undefined behavior.

+
On top of that, all additional invariants of the type T must be
+satisfied, as the Drop implementation of T (or its members) may
+rely on this. For example, setting a Vec<T> to an invalid but
+non-null address makes it initialized (under the current implementation;
+this does not constitute a stable guarantee), because the only
+requirement the compiler knows about it is that the data pointer must be
+non-null. Dropping such a Vec<T> however will cause undefined
+behaviour.

+
Source
pub unsafe fn assume_init_ref(&self) -> &[T]
🔬This is a nightly-only experimental API. (maybe_uninit_slice)
Gets a shared reference to the contained value.

+
§Safety

+
Calling this when the content is not yet fully initialized causes undefined
+behavior: it is up to the caller to guarantee that every MaybeUninit<T> in
+the slice really is in an initialized state.

+
Source
pub unsafe fn assume_init_mut(&mut self) -> &mut [T]
🔬This is a nightly-only experimental API. (maybe_uninit_slice)
Gets a mutable (unique) reference to the contained value.

+
§Safety

+
Calling this when the content is not yet fully initialized causes undefined
+behavior: it is up to the caller to guarantee that every MaybeUninit<T> in the
+slice really is in an initialized state. For instance, .assume_init_mut() cannot
+be used to initialize a MaybeUninit slice.

+
Source
pub fn as_str(&self) -> &str
🔬This is a nightly-only experimental API. (ascii_char)
Views this slice of ASCII characters as a UTF-8 str.

+
Source
pub fn as_bytes(&self) -> &[u8] ⓘ
🔬This is a nightly-only experimental API. (ascii_char)
Views this slice of ASCII characters as a slice of u8 bytes.

 
1.23.0 · Source
pub fn is_ascii(&self) -> bool
Checks if all bytes in this slice are within the ASCII range.

 
Source
pub fn as_ascii(&self) -> Option<&[AsciiChar]>
🔬This is a nightly-only experimental API. (ascii_char)
If this slice is_ascii, returns it as a slice of
 ASCII characters, otherwise returns None.

 
Source
pub unsafe fn as_ascii_unchecked(&self) -> &[AsciiChar]
🔬This is a nightly-only experimental API. (ascii_char)
Converts this slice of bytes into a slice of ASCII characters,
 without checking whether they’re valid.

-
§Safety

+
§Safety

 
Every byte in the slice must be in 0..=127, or else this is UB.

 
1.23.0 · Source
pub fn eq_ignore_ascii_case(&self, other: &[u8]) -> bool
Checks that two slices are an ASCII case-insensitive match.

 
Same as to_ascii_lowercase(a) == to_ascii_lowercase(b),
@@ -1608,7 +1736,7 @@ but non-ASCII letters are unchanged.

 to_ascii_lowercase.

 
1.60.0 · Source
pub fn escape_ascii(&self) -> EscapeAscii<'_> ⓘ
Returns an iterator that produces an escaped version of this slice,
 treating it as an ASCII string.

-
§Examples

+
§Examples

 

 let s = b"0\t\r\n'\"\\\x9d";
 let escaped = s.escape_ascii().to_string();
@@ -1616,14 +1744,14 @@ treating it as an ASCII string.

 
1.80.0 · Source
pub fn trim_ascii_start(&self) -> &[u8] ⓘ
Returns a byte slice with leading ASCII whitespace bytes removed.

 
‘Whitespace’ refers to the definition used by
 u8::is_ascii_whitespace.

-
§Examples

+
§Examples

 
assert_eq!(b" \t hello world\n".trim_ascii_start(), b"hello world\n");
 assert_eq!(b"  ".trim_ascii_start(), b"");
 assert_eq!(b"".trim_ascii_start(), b"");

 
1.80.0 · Source
pub fn trim_ascii_end(&self) -> &[u8] ⓘ
Returns a byte slice with trailing ASCII whitespace bytes removed.

 
‘Whitespace’ refers to the definition used by
 u8::is_ascii_whitespace.

-
§Examples

+
§Examples

 
assert_eq!(b"\r hello world\n ".trim_ascii_end(), b"\r hello world");
 assert_eq!(b"  ".trim_ascii_end(), b"");
 assert_eq!(b"".trim_ascii_end(), b"");

@@ -1631,30 +1759,30 @@ treating it as an ASCII string.

 removed.

 
‘Whitespace’ refers to the definition used by
 u8::is_ascii_whitespace.

-
§Examples

+
§Examples

 
assert_eq!(b"\r hello world\n ".trim_ascii(), b"hello world");
 assert_eq!(b"  ".trim_ascii(), b"");
 assert_eq!(b"".trim_ascii(), b"");

 
1.0.0 · Source
pub fn len(&self) -> usize
Returns the number of elements in the slice.

-
§Examples

+
§Examples

 
let a = [1, 2, 3];
 assert_eq!(a.len(), 3);

 
1.0.0 · Source
pub fn is_empty(&self) -> bool
Returns true if the slice has a length of 0.

-
§Examples

+
§Examples

 
let a = [1, 2, 3];
 assert!(!a.is_empty());
 
 let b: &[i32] = &[];
 assert!(b.is_empty());

 
1.0.0 · Source
pub fn first(&self) -> Option<&T>
Returns the first element of the slice, or None if it is empty.

-
§Examples

+
§Examples

 
let v = [10, 40, 30];
 assert_eq!(Some(&10), v.first());
 
 let w: &[i32] = &[];
 assert_eq!(None, w.first());

 
1.0.0 · Source
pub fn first_mut(&mut self) -> Option<&mut T>
Returns a mutable reference to the first element of the slice, or None if it is empty.

-
§Examples

+
§Examples

 
let x = &mut [0, 1, 2];
 
 if let Some(first) = x.first_mut() {
@@ -1665,7 +1793,7 @@ removed.

 let y: &mut [i32] = &mut [];
 assert_eq!(None, y.first_mut());

 
1.5.0 · Source
pub fn split_first(&self) -> Option<(&T, &[T])>
Returns the first and all the rest of the elements of the slice, or None if it is empty.

-
§Examples

+
§Examples

 
let x = &[0, 1, 2];
 
 if let Some((first, elements)) = x.split_first() {
@@ -1673,7 +1801,7 @@ removed.

     assert_eq!(elements, &[1, 2]);
 }

 
1.5.0 · Source
pub fn split_first_mut(&mut self) -> Option<(&mut T, &mut [T])>
Returns the first and all the rest of the elements of the slice, or None if it is empty.

-
§Examples

+
§Examples

 
let x = &mut [0, 1, 2];
 
 if let Some((first, elements)) = x.split_first_mut() {
@@ -1683,7 +1811,7 @@ removed.

 }
 assert_eq!(x, &[3, 4, 5]);

 
1.5.0 · Source
pub fn split_last(&self) -> Option<(&T, &[T])>
Returns the last and all the rest of the elements of the slice, or None if it is empty.

-
§Examples

+
§Examples

 
let x = &[0, 1, 2];
 
 if let Some((last, elements)) = x.split_last() {
@@ -1691,7 +1819,7 @@ removed.

     assert_eq!(elements, &[0, 1]);
 }

 
1.5.0 · Source
pub fn split_last_mut(&mut self) -> Option<(&mut T, &mut [T])>
Returns the last and all the rest of the elements of the slice, or None if it is empty.

-
§Examples

+
§Examples

 
let x = &mut [0, 1, 2];
 
 if let Some((last, elements)) = x.split_last_mut() {
@@ -1701,14 +1829,14 @@ removed.

 }
 assert_eq!(x, &[4, 5, 3]);

 
1.0.0 · Source
pub fn last(&self) -> Option<&T>
Returns the last element of the slice, or None if it is empty.

-
§Examples

+
§Examples

 
let v = [10, 40, 30];
 assert_eq!(Some(&30), v.last());
 
 let w: &[i32] = &[];
 assert_eq!(None, w.last());

 
1.0.0 · Source
pub fn last_mut(&mut self) -> Option<&mut T>
Returns a mutable reference to the last item in the slice, or None if it is empty.

-
§Examples

+
§Examples

 
let x = &mut [0, 1, 2];
 
 if let Some(last) = x.last_mut() {
@@ -1720,7 +1848,7 @@ removed.

 assert_eq!(None, y.last_mut());

 
1.77.0 · Source
pub fn first_chunk<const N: usize>(&self) -> Option<&[T; N]>
Returns an array reference to the first N items in the slice.

 
If the slice is not at least N in length, this will return None.

-
§Examples

+
§Examples

 
let u = [10, 40, 30];
 assert_eq!(Some(&[10, 40]), u.first_chunk::<2>());
 
@@ -1731,7 +1859,7 @@ removed.

 assert_eq!(Some(&[]), w.first_chunk::<0>());

 
1.77.0 · Source
pub fn first_chunk_mut<const N: usize>(&mut self) -> Option<&mut [T; N]>
Returns a mutable array reference to the first N items in the slice.

 
If the slice is not at least N in length, this will return None.

-
§Examples

+
§Examples

 
let x = &mut [0, 1, 2];
 
 if let Some(first) = x.first_chunk_mut::<2>() {
@@ -1743,7 +1871,7 @@ removed.

 assert_eq!(None, x.first_chunk_mut::<4>());

 
1.77.0 · Source
pub fn split_first_chunk<const N: usize>(&self) -> Option<(&[T; N], &[T])>
Returns an array reference to the first N items in the slice and the remaining slice.

 
If the slice is not at least N in length, this will return None.

-
§Examples

+
§Examples

 
let x = &[0, 1, 2];
 
 if let Some((first, elements)) = x.split_first_chunk::<2>() {
@@ -1757,7 +1885,7 @@ removed.

 ) -> Option<(&mut [T; N], &mut [T])>
Returns a mutable array reference to the first N items in the slice and the remaining
 slice.

 
If the slice is not at least N in length, this will return None.

-
§Examples

+
§Examples

 
let x = &mut [0, 1, 2];
 
 if let Some((first, elements)) = x.split_first_chunk_mut::<2>() {
@@ -1770,7 +1898,7 @@ slice.

 assert_eq!(None, x.split_first_chunk_mut::<4>());

 
1.77.0 · Source
pub fn split_last_chunk<const N: usize>(&self) -> Option<(&[T], &[T; N])>
Returns an array reference to the last N items in the slice and the remaining slice.

 
If the slice is not at least N in length, this will return None.

-
§Examples

+
§Examples

 
let x = &[0, 1, 2];
 
 if let Some((elements, last)) = x.split_last_chunk::<2>() {
@@ -1784,7 +1912,7 @@ slice.

 ) -> Option<(&mut [T], &mut [T; N])>
Returns a mutable array reference to the last N items in the slice and the remaining
 slice.

 
If the slice is not at least N in length, this will return None.

-
§Examples

+
§Examples

 
let x = &mut [0, 1, 2];
 
 if let Some((elements, last)) = x.split_last_chunk_mut::<2>() {
@@ -1797,7 +1925,7 @@ slice.

 assert_eq!(None, x.split_last_chunk_mut::<4>());
1.77.0 · Source

pub fn last_chunk<const N: usize>(&self) -> Option<&[T; N]>

Returns an array reference to the last N items in the slice.

If the slice is not at least N in length, this will return None.

-
§Examples
+
§Examples
let u = [10, 40, 30];
 assert_eq!(Some(&[40, 30]), u.last_chunk::<2>());
 
@@ -1808,7 +1936,7 @@ slice.

 assert_eq!(Some(&[]), w.last_chunk::<0>());
1.77.0 · Source

pub fn last_chunk_mut<const N: usize>(&mut self) -> Option<&mut [T; N]>

Returns a mutable array reference to the last N items in the slice.

If the slice is not at least N in length, this will return None.

-
§Examples
+
§Examples
let x = &mut [0, 1, 2];
 
 if let Some(last) = x.last_chunk_mut::<2>() {
@@ -1827,7 +1955,7 @@ position or None if out of bounds.
 
  • If given a range, returns the subslice corresponding to that range,
 or None if out of bounds.
    • 
 
-
    §Examples
    
+
    §Examples
    
 
    let v = [10, 40, 30];
 assert_eq!(Some(&40), v.get(1));
 assert_eq!(Some(&[10, 40][..]), v.get(0..2));
@@ -1839,7 +1967,7 @@ or None if out of bounds.
 ) -> Option<&mut <I as SliceIndex<[T]>>::Output>
    where
     I: SliceIndex<[T]>,

    Returns a mutable reference to an element or subslice depending on the type of index (see get) or None if the index is out of bounds.

    -
    §Examples
    +
    §Examples
    let x = &mut [0, 1, 2];
 
 if let Some(elem) = x.get_mut(1) {
@@ -1853,14 +1981,14 @@ type of index (see SliceIndex<[T]>,

    Returns a reference to an element or subslice, without doing bounds checking.

    For a safe alternative see get.

    -
    §Safety
    +
    §Safety

    Calling this method with an out-of-bounds index is undefined behavior even if the resulting reference is not used.

    You can think of this like .get(index).unwrap_unchecked(). It’s UB to call .get_unchecked(len), even if you immediately convert to a pointer. And it’s UB to call .get_unchecked(..len + 1), .get_unchecked(..=len), or similar.

    -
    §Examples
    +
    §Examples
    let x = &[1, 2, 4];
 
 unsafe {
@@ -1873,14 +2001,14 @@ pointer.  And it’s UB to call .get_unchecked(..len + 1),
     I: SliceIndex<[T]>,

    Returns a mutable reference to an element or subslice, without doing bounds checking.

    For a safe alternative see get_mut.

    -
    §Safety
    +
    §Safety

    Calling this method with an out-of-bounds index is undefined behavior even if the resulting reference is not used.

    You can think of this like .get_mut(index).unwrap_unchecked(). It’s UB to call .get_unchecked_mut(len), even if you immediately convert to a pointer. And it’s UB to call .get_unchecked_mut(..len + 1), .get_unchecked_mut(..=len), or similar.

    -
    §Examples
    +
    §Examples
    let x = &mut [1, 2, 4];
 
 unsafe {
@@ -1896,7 +2024,7 @@ is never written to (except inside an UnsafeCell) using this pointe
 derived from it. If you need to mutate the contents of the slice, use as_mut_ptr.
    
 
    Modifying the container referenced by this slice may cause its buffer
 to be reallocated, which would also make any pointers to it invalid.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &[1, 2, 4];
 let x_ptr = x.as_ptr();
 
@@ -1910,7 +2038,7 @@ to be reallocated, which would also make any pointers to it invalid.
    
 function returns, or else it will end up dangling.
    
 
    Modifying the container referenced by this slice may cause its buffer
 to be reallocated, which would also make any pointers to it invalid.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &mut [1, 2, 4];
 let x_ptr = x.as_mut_ptr();
 
@@ -1962,9 +2090,9 @@ common in C++.
    
 
  • a - The index of the first element
    • 
 
  • b - The index of the second element
    • 
 
-
    §Panics
    
+
    §Panics
    
 
    Panics if a or b are out of bounds.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = ["a", "b", "c", "d", "e"];
 v.swap(2, 4);
 assert!(v == ["a", "b", "e", "d", "c"]);
    
@@ -1975,10 +2103,10 @@ v.swap(2, 4);
 
  • a - The index of the first element
    • 
 
  • b - The index of the second element
    • 
 
-
    §Safety
    
+
    §Safety
    
 
    Calling this method with an out-of-bounds index is undefined behavior.
 The caller has to ensure that a < self.len() and b < self.len().
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_swap_unchecked)]
 
 let mut v = ["a", "b", "c", "d"];
@@ -1986,13 +2114,13 @@ The caller has to ensure that a < self.len() and b < se
 unsafe { v.swap_unchecked(1, 3) };
 assert!(v == ["a", "d", "c", "b"]);
    
 
    1.0.0 · Source
    pub fn reverse(&mut self)
    Reverses the order of elements in the slice, in place.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [1, 2, 3];
 v.reverse();
 assert!(v == [3, 2, 1]);
    
 
    1.0.0 · Source
    pub fn iter(&self) -> Iter<'_, T> ⓘ
    Returns an iterator over the slice.
    
 
    The iterator yields all items from start to end.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &[1, 2, 4];
 let mut iterator = x.iter();
 
@@ -2002,7 +2130,7 @@ v.reverse();
 assert_eq!(iterator.next(), None);
    
 
    1.0.0 · Source
    pub fn iter_mut(&mut self) -> IterMut<'_, T> ⓘ
    Returns an iterator that allows modifying each value.
    
 
    The iterator yields all items from start to end.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &mut [1, 2, 4];
 for elem in x.iter_mut() {
     *elem += 2;
@@ -2011,9 +2139,9 @@ v.reverse();
 
    1.0.0 · Source
    pub fn windows(&self, size: usize) -> Windows<'_, T> ⓘ
    Returns an iterator over all contiguous windows of length
 size. The windows overlap. If the slice is shorter than
 size, the iterator returns no values.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = ['l', 'o', 'r', 'e', 'm'];
 let mut iter = slice.windows(3);
 assert_eq!(iter.next().unwrap(), &['l', 'o', 'r']);
@@ -2046,9 +2174,9 @@ slice, then the last chunk will not have length chunk_size.
    
 
    See chunks_exact for a variant of this iterator that returns chunks of always exactly
 chunk_size elements, and rchunks for the same iterator but starting at the end of the
 slice.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = ['l', 'o', 'r', 'e', 'm'];
 let mut iter = slice.chunks(2);
 assert_eq!(iter.next().unwrap(), &['l', 'o']);
@@ -2062,9 +2190,9 @@ length of the slice, then the last chunk will not have length chunk_sizeSee chunks_exact_mut for a variant of this iterator that returns chunks of always
 exactly chunk_size elements, and rchunks_mut for the same iterator but starting at
 the end of the slice.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = &mut [0, 0, 0, 0, 0];
 let mut count = 1;
 
@@ -2084,9 +2212,9 @@ from the remainder function of the iterator.
    
 resulting code better than in the case of chunks.
    
 
    See chunks for a variant of this iterator that also returns the remainder as a smaller
 chunk, and rchunks_exact for the same iterator but starting at the end of the slice.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = ['l', 'o', 'r', 'e', 'm'];
 let mut iter = slice.chunks_exact(2);
 assert_eq!(iter.next().unwrap(), &['l', 'o']);
@@ -2103,9 +2231,9 @@ resulting code better than in the case of chunks_mut for a variant of this iterator that also returns the remainder as a
 smaller chunk, and rchunks_exact_mut for the same iterator but starting at the end of
 the slice.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = &mut [0, 0, 0, 0, 0];
 let mut count = 1;
 
@@ -2118,13 +2246,13 @@ the slice.
    
 assert_eq!(v, &[1, 1, 2, 2, 0]);
    
 
    Source
    pub unsafe fn as_chunks_unchecked<const N: usize>(&self) -> &[[T; N]]
    🔬This is a nightly-only experimental API. (slice_as_chunks)
    Splits the slice into a slice of N-element arrays,
 assuming that there’s no remainder.
    
-
    §Safety
    
+
    §Safety
    
 
    This may only be called when
    
 
      
 
    • The slice splits exactly into N-element chunks (aka self.len() % N == 0).
      • 
 
    • N != 0.
      • 
 
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_as_chunks)]
 let slice: &[char] = &['l', 'o', 'r', 'e', 'm', '!'];
 let chunks: &[[char; 1]] =
@@ -2142,10 +2270,10 @@ assuming that there’s no remainder.
    
 
    Source
    pub fn as_chunks<const N: usize>(&self) -> (&[[T; N]], &[T])
    🔬This is a nightly-only experimental API. (slice_as_chunks)
    Splits the slice into a slice of N-element arrays,
 starting at the beginning of the slice,
 and a remainder slice with length strictly less than N.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if N is zero. This check will most probably get changed to a compile time
 error before this method gets stabilized.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_as_chunks)]
 let slice = ['l', 'o', 'r', 'e', 'm'];
 let (chunks, remainder) = slice.as_chunks();
@@ -2163,10 +2291,10 @@ error before this method gets stabilized.
    
 
    Source
    pub fn as_rchunks<const N: usize>(&self) -> (&[T], &[[T; N]])
    🔬This is a nightly-only experimental API. (slice_as_chunks)
    Splits the slice into a slice of N-element arrays,
 starting at the end of the slice,
 and a remainder slice with length strictly less than N.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if N is zero. This check will most probably get changed to a compile time
 error before this method gets stabilized.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_as_chunks)]
 let slice = ['l', 'o', 'r', 'e', 'm'];
 let (remainder, chunks) = slice.as_rchunks();
@@ -2178,10 +2306,10 @@ beginning of the slice.
    
 length of the slice, then the last up to N-1 elements will be omitted and can be
 retrieved from the remainder function of the iterator.
    
 
    This method is the const generic equivalent of chunks_exact.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if N is zero. This check will most probably get changed to a compile time
 error before this method gets stabilized.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(array_chunks)]
 let slice = ['l', 'o', 'r', 'e', 'm'];
 let mut iter = slice.array_chunks();
@@ -2193,13 +2321,13 @@ error before this method gets stabilized.
    
     &mut self,
 ) -> &mut [[T; N]]
    🔬This is a nightly-only experimental API. (slice_as_chunks)
    Splits the slice into a slice of N-element arrays,
 assuming that there’s no remainder.
    
-
    §Safety
    
+
    §Safety
    
 
    This may only be called when
    
 
      
 
    • The slice splits exactly into N-element chunks (aka self.len() % N == 0).
      • 
 
    • N != 0.
      • 
 
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_as_chunks)]
 let slice: &mut [char] = &mut ['l', 'o', 'r', 'e', 'm', '!'];
 let chunks: &mut [[char; 1]] =
@@ -2219,10 +2347,10 @@ chunks[1] = ['a', 
    Source
    pub fn as_chunks_mut<const N: usize>(&mut self) -> (&mut [[T; N]], &mut [T])
    🔬This is a nightly-only experimental API. (slice_as_chunks)
    Splits the slice into a slice of N-element arrays,
 starting at the beginning of the slice,
 and a remainder slice with length strictly less than N.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if N is zero. This check will most probably get changed to a compile time
 error before this method gets stabilized.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_as_chunks)]
 let v = &mut [0, 0, 0, 0, 0];
 let mut count = 1;
@@ -2237,10 +2365,10 @@ remainder[0] = 9;
 
    Source
    pub fn as_rchunks_mut<const N: usize>(&mut self) -> (&mut [T], &mut [[T; N]])
    🔬This is a nightly-only experimental API. (slice_as_chunks)
    Splits the slice into a slice of N-element arrays,
 starting at the end of the slice,
 and a remainder slice with length strictly less than N.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if N is zero. This check will most probably get changed to a compile time
 error before this method gets stabilized.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_as_chunks)]
 let v = &mut [0, 0, 0, 0, 0];
 let mut count = 1;
@@ -2258,10 +2386,10 @@ beginning of the slice.
    
 the length of the slice, then the last up to N-1 elements will be omitted and
 can be retrieved from the into_remainder function of the iterator.
    
 
    This method is the const generic equivalent of chunks_exact_mut.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if N is zero. This check will most probably get changed to a compile time
 error before this method gets stabilized.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(array_chunks)]
 let v = &mut [0, 0, 0, 0, 0];
 let mut count = 1;
@@ -2275,10 +2403,10 @@ error before this method gets stabilized.
    
 starting at the beginning of the slice.
    
 
    This is the const generic equivalent of windows.
    
 
    If N is greater than the size of the slice, it will return no windows.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if N is zero. This check will most probably get changed to a compile time
 error before this method gets stabilized.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(array_windows)]
 let slice = [0, 1, 2, 3];
 let mut iter = slice.array_windows();
@@ -2293,9 +2421,9 @@ slice, then the last chunk will not have length chunk_size.
    
 
    See rchunks_exact for a variant of this iterator that returns chunks of always exactly
 chunk_size elements, and chunks for the same iterator but starting at the beginning
 of the slice.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = ['l', 'o', 'r', 'e', 'm'];
 let mut iter = slice.rchunks(2);
 assert_eq!(iter.next().unwrap(), &['e', 'm']);
@@ -2309,9 +2437,9 @@ length of the slice, then the last chunk will not have length chunk_sizeSee rchunks_exact_mut for a variant of this iterator that returns chunks of always
 exactly chunk_size elements, and chunks_mut for the same iterator but starting at the
 beginning of the slice.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = &mut [0, 0, 0, 0, 0];
 let mut count = 1;
 
@@ -2332,9 +2460,9 @@ resulting code better than in the case of rchunks for a variant of this iterator that also returns the remainder as a smaller
 chunk, and chunks_exact for the same iterator but starting at the beginning of the
 slice.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = ['l', 'o', 'r', 'e', 'm'];
 let mut iter = slice.rchunks_exact(2);
 assert_eq!(iter.next().unwrap(), &['e', 'm']);
@@ -2351,9 +2479,9 @@ resulting code better than in the case of rchunks_mut for a variant of this iterator that also returns the remainder as a
 smaller chunk, and chunks_exact_mut for the same iterator but starting at the beginning
 of the slice.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = &mut [0, 0, 0, 0, 0];
 let mut count = 1;
 
@@ -2370,7 +2498,7 @@ of elements using the predicate to separate them.
    
 
    The predicate is called for every pair of consecutive elements,
 meaning that it is called on slice[0] and slice[1],
 followed by slice[1] and slice[2], and so on.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = &[1, 1, 1, 3, 3, 2, 2, 2];
 
 let mut iter = slice.chunk_by(|a, b| a == b);
@@ -2395,7 +2523,7 @@ runs of elements using the predicate to separate them.
    
 
    The predicate is called for every pair of consecutive elements,
 meaning that it is called on slice[0] and slice[1],
 followed by slice[1] and slice[2], and so on.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = &mut [1, 1, 1, 3, 3, 2, 2, 2];
 
 let mut iter = slice.chunk_by_mut(|a, b| a == b);
@@ -2418,10 +2546,10 @@ followed by slice[1] and slice[2], and so on.
    
 
    The first will contain all indices from [0, mid) (excluding
 the index mid itself) and the second will contain all
 indices from [mid, len) (excluding the index len itself).
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if mid > len.  For a non-panicking alternative see
 split_at_checked.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = ['a', 'b', 'c'];
 
 {
@@ -2445,10 +2573,10 @@ indices from [mid, len) (excluding the index len itsel
 
    The first will contain all indices from [0, mid) (excluding
 the index mid itself) and the second will contain all
 indices from [mid, len) (excluding the index len itself).
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if mid > len.  For a non-panicking alternative see
 split_at_mut_checked.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [1, 0, 3, 0, 5, 6];
 let (left, right) = v.split_at_mut(2);
 assert_eq!(left, [1, 0]);
@@ -2461,11 +2589,11 @@ right[1] = 4;
 the index mid itself) and the second will contain all
 indices from [mid, len) (excluding the index len itself).
    
 
    For a safe alternative see split_at.
    
-
    §Safety
    
+
    §Safety
    
 
    Calling this method with an out-of-bounds index is undefined behavior
 even if the resulting reference is not used. The caller has to ensure that
 0 <= mid <= self.len().
    
-
    §Examples
    
+
    §Examples
    
 
    let v = ['a', 'b', 'c'];
 
 unsafe {
@@ -2493,11 +2621,11 @@ even if the resulting reference is not used. The caller has to ensure that
 the index mid itself) and the second will contain all
 indices from [mid, len) (excluding the index len itself).
    
 
    For a safe alternative see split_at_mut.
    
-
    §Safety
    
+
    §Safety
    
 
    Calling this method with an out-of-bounds index is undefined behavior
 even if the resulting reference is not used. The caller has to ensure that
 0 <= mid <= self.len().
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [1, 0, 3, 0, 5, 6];
 // scoped to restrict the lifetime of the borrows
 unsafe {
@@ -2515,7 +2643,7 @@ indices from [0, mid) (excluding the index mid itself)
 second will contain all indices from [mid, len) (excluding the index
 len itself).
    
 
    Otherwise, if mid > len, returns None.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = [1, -2, 3, -4, 5, -6];
 
 {
@@ -2547,7 +2675,7 @@ indices from [0, mid) (excluding the index mid itself)
 second will contain all indices from [mid, len) (excluding the index
 len itself).
    
 
    Otherwise, if mid > len, returns None.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [1, 0, 3, 0, 5, 6];
 
 if let Some((left, right)) = v.split_at_mut_checked(2) {
@@ -2562,7 +2690,7 @@ second will contain all indices from [mid, len) (excluding the inde
 
    1.0.0 · Source
    pub fn split<F>(&self, pred: F) -> Split<'_, T, F> ⓘ
    where
     F: FnMut(&T) -> bool,
    Returns an iterator over subslices separated by elements that match
 pred. The matched element is not contained in the subslices.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = [10, 40, 33, 20];
 let mut iter = slice.split(|num| num % 3 == 0);
 
@@ -2593,7 +2721,7 @@ present between them:
    
 
    1.0.0 · Source
    pub fn split_mut<F>(&mut self, pred: F) -> SplitMut<'_, T, F> ⓘ
    where
     F: FnMut(&T) -> bool,
    Returns an iterator over mutable subslices separated by elements that
 match pred. The matched element is not contained in the subslices.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [10, 40, 30, 20, 60, 50];
 
 for group in v.split_mut(|num| *num % 3 == 0) {
@@ -2604,7 +2732,7 @@ match pred. The matched element is not contained in the subslices.<
     F: FnMut(&T) -> bool,
    Returns an iterator over subslices separated by elements that match
 pred. The matched element is contained in the end of the previous
 subslice as a terminator.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = [10, 40, 33, 20];
 let mut iter = slice.split_inclusive(|num| num % 3 == 0);
 
@@ -2625,7 +2753,7 @@ That slice will be the last item returned by the iterator.
    
     F: FnMut(&T) -> bool,
    Returns an iterator over mutable subslices separated by elements that
 match pred. The matched element is contained in the previous
 subslice as a terminator.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [10, 40, 30, 20, 60, 50];
 
 for group in v.split_inclusive_mut(|num| *num % 3 == 0) {
@@ -2637,7 +2765,7 @@ subslice as a terminator.
    
     F: FnMut(&T) -> bool,
    Returns an iterator over subslices separated by elements that match
 pred, starting at the end of the slice and working backwards.
 The matched element is not contained in the subslices.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = [11, 22, 33, 0, 44, 55];
 let mut iter = slice.rsplit(|num| *num == 0);
 
@@ -2658,7 +2786,7 @@ slice will be the first (or last) item returned by the iterator.
    
     F: FnMut(&T) -> bool,
    Returns an iterator over mutable subslices separated by elements that
 match pred, starting at the end of the slice and working
 backwards. The matched element is not contained in the subslices.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [100, 400, 300, 200, 600, 500];
 
 let mut count = 0;
@@ -2673,7 +2801,7 @@ backwards. The matched element is not contained in the subslices.
    
 not contained in the subslices.
    
 
    The last element returned, if any, will contain the remainder of the
 slice.
    
-
    §Examples
    
+
    §Examples
    
 
    Print the slice split once by numbers divisible by 3 (i.e., [10, 40],
 [20, 60, 50]):
    
 
@@ -2688,7 +2816,7 @@ slice.
    
 not contained in the subslices.
    
 
    The last element returned, if any, will contain the remainder of the
 slice.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [10, 40, 30, 20, 60, 50];
 
 for group in v.splitn_mut(2, |num| *num % 3 == 0) {
@@ -2702,7 +2830,7 @@ the slice and works backwards. The matched element is not contained in
 the subslices.
    
 
    The last element returned, if any, will contain the remainder of the
 slice.
    
-
    §Examples
    
+
    §Examples
    
 
    Print the slice split once, starting from the end, by numbers divisible
 by 3 (i.e., [50], [10, 40, 30, 20]):
    
 
@@ -2718,7 +2846,7 @@ the slice and works backwards. The matched element is not contained in
 the subslices.
    
 
    The last element returned, if any, will contain the remainder of the
 slice.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut s = [10, 40, 30, 20, 60, 50];
 
 for group in s.rsplitn_mut(2, |num| *num % 3 == 0) {
@@ -2731,7 +2859,7 @@ predicate.
    
 
    If any matching elements are present in the slice, returns the prefix
 before the match and suffix after. The matching element itself is not
 included. If no elements match, returns None.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_split_once)]
 let s = [1, 2, 3, 2, 4];
 assert_eq!(s.split_once(|&x| x == 2), Some((
@@ -2745,7 +2873,7 @@ predicate.
    
 
    If any matching elements are present in the slice, returns the prefix
 before the match and suffix after. The matching element itself is not
 included. If no elements match, returns None.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_split_once)]
 let s = [1, 2, 3, 2, 4];
 assert_eq!(s.rsplit_once(|&x| x == 2), Some((
@@ -2757,7 +2885,7 @@ included. If no elements match, returns None.
    
     T: PartialEq,
    Returns true if the slice contains an element with the given value.
    
 
    This operation is O(n).
    
 
    Note that if you have a sorted slice, binary_search may be faster.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = [10, 40, 30];
 assert!(v.contains(&30));
 assert!(!v.contains(&50));
    
@@ -2770,7 +2898,7 @@ use iter().any:
    
 assert!(!v.iter().any(|e| e == "hi"));
    
 
    1.0.0 · Source
    pub fn starts_with(&self, needle: &[T]) -> bool
    where
     T: PartialEq,
    Returns true if needle is a prefix of the slice or equal to the slice.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = [10, 40, 30];
 assert!(v.starts_with(&[10]));
 assert!(v.starts_with(&[10, 40]));
@@ -2785,7 +2913,7 @@ use iter().any:
    
 assert!(v.starts_with(&[]));
    
 
    1.0.0 · Source
    pub fn ends_with(&self, needle: &[T]) -> bool
    where
     T: PartialEq,
    Returns true if needle is a suffix of the slice or equal to the slice.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = [10, 40, 30];
 assert!(v.ends_with(&[30]));
 assert!(v.ends_with(&[40, 30]));
@@ -2805,7 +2933,7 @@ use iter().any:
    
 If prefix is empty, simply returns the original slice. If prefix is equal to the
 original slice, returns an empty slice.
    
 
    If the slice does not start with prefix, returns None.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = &[10, 40, 30];
 assert_eq!(v.strip_prefix(&[10]), Some(&[40, 30][..]));
 assert_eq!(v.strip_prefix(&[10, 40]), Some(&[30][..]));
@@ -2823,7 +2951,7 @@ original slice, returns an empty slice.
    
 If suffix is empty, simply returns the original slice. If suffix is equal to the
 original slice, returns an empty slice.
    
 
    If the slice does not end with suffix, returns None.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = &[10, 40, 30];
 assert_eq!(v.strip_suffix(&[30]), Some(&[10, 40][..]));
 assert_eq!(v.strip_suffix(&[40, 30]), Some(&[10][..]));
@@ -2842,7 +2970,7 @@ If the value is not found then binary_search_by, binary_search_by_key, and partition_point.
    
-
    §Examples
    
+
    §Examples
    
 
    Looks up a series of four elements. The first is found, with a
 uniquely determined position; the second and third are not
 found; the fourth could match any position in [1, 4].
    
@@ -2901,7 +3029,7 @@ If the value is not found then binary_search, binary_search_by_key, and partition_point.
    
-
    §Examples
    
+
    §Examples
    
 
    Looks up a series of four elements. The first is found, with a
 uniquely determined position; the second and third are not
 found; the fourth could match any position in [1, 4].
    
@@ -2936,7 +3064,7 @@ If the value is not found then binary_search, binary_search_by, and partition_point.
    
-
    §Examples
    
+
    §Examples
    
 
    Looks up a series of four elements in a slice of pairs sorted by
 their second elements. The first is found, with a uniquely
 determined position; the second and third are not found; the
@@ -2973,9 +3101,9 @@ linear time on fully sorted and reversed inputs. On inputs with k distinct eleme
 expected time to sort the data is O(n * log(k)).
    
 
    It is typically faster than stable sorting, except in a few special cases, e.g., when the
 slice is partially sorted.
    
-
    §Panics
    
+
    §Panics
    
 
    May panic if the implementation of Ord for T does not implement a total order.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [4, -5, 1, -3, 2];
 
 v.sort_unstable();
@@ -2999,9 +3127,9 @@ linear time on fully sorted and reversed inputs. On inputs with k distinct eleme
 expected time to sort the data is O(n * log(k)).
    
 
    It is typically faster than stable sorting, except in a few special cases, e.g., when the
 slice is partially sorted.
    
-
    §Panics
    
+
    §Panics
    
 
    May panic if compare does not implement a total order.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [4, -5, 1, -3, 2];
 v.sort_unstable_by(|a, b| a.cmp(b));
 assert_eq!(v, [-5, -3, 1, 2, 4]);
@@ -3026,9 +3154,9 @@ linear time on fully sorted and reversed inputs. On inputs with k distinct eleme
 expected time to sort the data is O(n * log(k)).
    
 
    It is typically faster than stable sorting, except in a few special cases, e.g., when the
 slice is partially sorted.
    
-
    §Panics
    
+
    §Panics
    
 
    May panic if the implementation of Ord for K does not implement a total order.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [4i32, -5, 1, -3, 2];
 
 v.sort_unstable_by_key(|k| k.abs());
@@ -3053,10 +3181,10 @@ greater-than-or-equal-to the value of the element at index.
    
 and Orson Peters, which is also the basis for sort_unstable. The fallback algorithm is
 Median of Medians using Tukey’s Ninther for pivot selection, which guarantees linear runtime
 for all inputs.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics when index >= len(), meaning it always panics on empty slices.
    
 
    May panic if the implementation of Ord for T does not implement a total order.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [-5i32, 4, 2, -3, 1];
 
 // Find the items less than or equal to the median, the median, and greater than or equal to
@@ -3094,10 +3222,10 @@ less-than-or-equal-to and greater-than-or-equal-to the value of the element at <
 and Orson Peters, which is also the basis for sort_unstable. The fallback algorithm is
 Median of Medians using Tukey’s Ninther for pivot selection, which guarantees linear runtime
 for all inputs.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics when index >= len(), meaning it always panics on empty slices.
    
 
    May panic if compare does not implement a total order.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [-5i32, 4, 2, -3, 1];
 
 // Find the items less than or equal to the median, the median, and greater than or equal to
@@ -3136,10 +3264,10 @@ less-than-or-equal-to and greater-than-or-equal-to the value of the element at <
 and Orson Peters, which is also the basis for sort_unstable. The fallback algorithm is
 Median of Medians using Tukey’s Ninther for pivot selection, which guarantees linear runtime
 for all inputs.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics when index >= len(), meaning it always panics on empty slices.
    
 
    May panic if K: Ord does not implement a total order.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [-5i32, 4, 1, -3, 2];
 
 // Find the items less than or equal to the median, the median, and greater than or equal to
@@ -3162,7 +3290,7 @@ for all inputs.
    
 
    Returns two slices. The first contains no consecutive repeated elements.
 The second contains all the duplicates in no specified order.
    
 
    If the slice is sorted, the first returned slice contains no duplicates.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_partition_dedup)]
 
 let mut slice = [1, 2, 2, 3, 3, 2, 1, 1];
@@ -3181,7 +3309,7 @@ must determine if the elements compare equal. The elements are passed in opposit
 from their order in the slice, so if same_bucket(a, b) returns true, a is moved
 at the end of the slice.
    
 
    If the slice is sorted, the first returned slice contains no duplicates.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_partition_dedup)]
 
 let mut slice = ["foo", "Foo", "BAZ", "Bar", "bar", "baz", "BAZ"];
@@ -3197,7 +3325,7 @@ to the same key.
    
 
    Returns two slices. The first contains no consecutive repeated elements.
 The second contains all the duplicates in no specified order.
    
 
    If the slice is sorted, the first returned slice contains no duplicates.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_partition_dedup)]
 
 let mut slice = [10, 20, 21, 30, 30, 20, 11, 13];
@@ -3211,13 +3339,13 @@ slice move to the end while the last self.len() - mid elements move
 the front.
    
 
    After calling rotate_left, the element previously at index mid will
 become the first element in the slice.
    
-
    §Panics
    
+
    §Panics
    
 
    This function will panic if mid is greater than the length of the
 slice. Note that mid == self.len() does not panic and is a no-op
 rotation.
    
 
    §Complexity
    
 
    Takes linear (in self.len()) time.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut a = ['a', 'b', 'c', 'd', 'e', 'f'];
 a.rotate_left(2);
 assert_eq!(a, ['c', 'd', 'e', 'f', 'a', 'b']);
    
@@ -3231,13 +3359,13 @@ elements of the slice move to the end while the last k elements mov
 to the front.
    
 
    After calling rotate_right, the element previously at index
 self.len() - k will become the first element in the slice.
    
-
    §Panics
    
+
    §Panics
    
 
    This function will panic if k is greater than the length of the
 slice. Note that k == self.len() does not panic and is a no-op
 rotation.
    
 
    §Complexity
    
 
    Takes linear (in self.len()) time.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut a = ['a', 'b', 'c', 'd', 'e', 'f'];
 a.rotate_right(2);
 assert_eq!(a, ['e', 'f', 'a', 'b', 'c', 'd']);
    
@@ -3248,7 +3376,7 @@ a[1..5].rotate_right(assert_eq!(a, ['a', 'e', 'b', 'c', 'd', 'f']);
    
 
    1.50.0 · Source
    pub fn fill(&mut self, value: T)
    where
     T: Clone,
    Fills self with elements by cloning value.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut buf = vec![0; 10];
 buf.fill(1);
 assert_eq!(buf, vec![1; 10]);
    
@@ -3258,16 +3386,16 @@ buf.fill(1);
 Clone a given value, use fill. If you want to use the Default
 trait to generate values, you can pass Default::default as the
 argument.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut buf = vec![1; 10];
 buf.fill_with(Default::default);
 assert_eq!(buf, vec![0; 10]);
    
 
    1.7.0 · Source
    pub fn clone_from_slice(&mut self, src: &[T])
    where
     T: Clone,
    Copies the elements from src into self.
    
 
    The length of src must be the same as self.
    
-
    §Panics
    
+
    §Panics
    
 
    This function will panic if the two slices have different lengths.
    
-
    §Examples
    
+
    §Examples
    
 
    Cloning two elements from a slice into another:
    
 
 
    let src = [1, 2, 3, 4];
@@ -3299,13 +3427,13 @@ sub-slices from a slice:
    
 }
 
 assert_eq!(slice, [4, 5, 3, 4, 5]);
    
-
    1.9.0 · Source
    pub fn copy_from_slice(&mut self, src: &[T])
    where
+
    1.9.0 · Source
    pub fn copy_from_slice(&mut self, src: &[T])
    where
     T: Copy,
    Copies all elements from src into self, using a memcpy.
    
 
    The length of src must be the same as self.
    
 
    If T does not implement Copy, use clone_from_slice.
    
-
    §Panics
    
+
    §Panics
    
 
    This function will panic if the two slices have different lengths.
    
-
    §Examples
    
+
    §Examples
    
 
    Copying two elements from a slice into another:
    
 
 
    let src = [1, 2, 3, 4];
@@ -3337,7 +3465,7 @@ sub-slices from a slice:
    
 }
 
 assert_eq!(slice, [4, 5, 3, 4, 5]);
    
-
    1.37.0 · Source
    pub fn copy_within<R>(&mut self, src: R, dest: usize)
    where
+
    1.37.0 · Source
    pub fn copy_within<R>(&mut self, src: R, dest: usize)
    where
     R: RangeBounds<usize>,
     T: Copy,
    Copies elements from one part of the slice to another part of itself,
 using a memmove.
    
@@ -3345,10 +3473,10 @@ using a memmove.
    
 index of the range within self to copy to, which will have the same
 length as src. The two ranges may overlap. The ends of the two ranges
 must be less than or equal to self.len().
    
-
    §Panics
    
+
    §Panics
    
 
    This function will panic if either range exceeds the end of the slice,
 or if the end of src is before the start.
    
-
    §Examples
    
+
    §Examples
    
 
    Copying four bytes within a slice:
    
 
 
    let mut bytes = *b"Hello, World!";
@@ -3356,9 +3484,9 @@ or if the end of src is before the start.
    
 bytes.copy_within(1..5, 8);
 
 assert_eq!(&bytes, b"Hello, Wello!");
    
-
    1.27.0 · Source
    pub fn swap_with_slice(&mut self, other: &mut [T])
    Swaps all elements in self with those in other.
    
+
    1.27.0 · Source
    pub fn swap_with_slice(&mut self, other: &mut [T])
    Swaps all elements in self with those in other.
    
 
    The length of other must be the same as self.
    
-
    §Panics
    
+
    §Panics
    
 
    This function will panic if the two slices have different lengths.
    
 
    §Example
    
 
    Swapping two elements across slices:
    
@@ -3388,17 +3516,17 @@ mutable sub-slices from a slice:
    
 }
 
 assert_eq!(slice, [4, 5, 3, 1, 2]);
    
-
    1.30.0 · Source

    pub unsafe fn align_to<U>(&self) -> (&[T], &[U], &[T])

    Transmutes the slice to a slice of another type, ensuring alignment of the types is +

    1.30.0 · Source

    pub unsafe fn align_to<U>(&self) -> (&[T], &[U], &[T])

    Transmutes the slice to a slice of another type, ensuring alignment of the types is maintained.

    This method splits the slice into three distinct slices: prefix, correctly aligned middle slice of a new type, and the suffix slice. The middle part will be as big as possible under the given alignment constraint and element size.

    This method has no purpose when either input element T or output element U are zero-sized and will return the original slice without splitting anything.

    -
    §Safety
    +
    §Safety

    This method is essentially a transmute with respect to the elements in the returned middle slice, so all the usual caveats pertaining to transmute::<T, U> also apply here.

    -
    §Examples
    +
    §Examples

    Basic usage:

    unsafe {
@@ -3408,17 +3536,17 @@ middle slice, so all the usual caveats pertaining to transmute::<T, U&g
     // more_efficient_algorithm_for_aligned_shorts(shorts);
     // less_efficient_algorithm_for_bytes(suffix);
 }
    -
    1.30.0 · Source

    pub unsafe fn align_to_mut<U>(&mut self) -> (&mut [T], &mut [U], &mut [T])

    Transmutes the mutable slice to a mutable slice of another type, ensuring alignment of the +

    1.30.0 · Source

    pub unsafe fn align_to_mut<U>(&mut self) -> (&mut [T], &mut [U], &mut [T])

    Transmutes the mutable slice to a mutable slice of another type, ensuring alignment of the types is maintained.

    This method splits the slice into three distinct slices: prefix, correctly aligned middle slice of a new type, and the suffix slice. The middle part will be as big as possible under the given alignment constraint and element size.

    This method has no purpose when either input element T or output element U are zero-sized and will return the original slice without splitting anything.

    -
    §Safety
    +
    §Safety

    This method is essentially a transmute with respect to the elements in the returned middle slice, so all the usual caveats pertaining to transmute::<T, U> also apply here.

    -
    §Examples
    +
    §Examples

    Basic usage:

    unsafe {
@@ -3428,13 +3556,13 @@ middle slice, so all the usual caveats pertaining to transmute::<T, U&g
     // more_efficient_algorithm_for_aligned_shorts(shorts);
     // less_efficient_algorithm_for_bytes(suffix);
 }
    -
    Source

    pub fn as_simd<const LANES: usize>(&self) -> (&[T], &[Simd<T, LANES>], &[T])
    where +

    Source

    pub fn as_simd<const LANES: usize>(&self) -> (&[T], &[Simd<T, LANES>], &[T])
    where Simd<T, LANES>: AsRef<[T; LANES]>, T: SimdElement, LaneCount<LANES>: SupportedLaneCount,

    🔬This is a nightly-only experimental API. (portable_simd)

    Splits a slice into a prefix, a middle of aligned SIMD types, and a suffix.

    This is a safe wrapper around slice::align_to, so inherits the same guarantees as that method.

    -
    §Panics
    +
    §Panics

    This will panic if the size of the SIMD type is different from LANES times that of the scalar.

    At the time of writing, the trait restrictions on Simd<T, LANES> keeps @@ -3442,7 +3570,7 @@ that from ever happening, as only power-of-two numbers of lanes are supported. It’s possible that, in the future, those restrictions might be lifted in a way that would make it possible to see panics from this method for something like LANES == 3.

    -
    §Examples
    +
    §Examples
    #![feature(portable_simd)]
 use core::simd::prelude::*;
 
@@ -3469,7 +3597,7 @@ method for something like LANES == 3.
    
 
 let numbers: Vec<f32> = (1..101).map(|x| x as _).collect();
 assert_eq!(basic_simd_sum(&numbers[1..99]), 4949.0);
    -
    Source

    pub fn as_simd_mut<const LANES: usize>( +

    Source

    pub fn as_simd_mut<const LANES: usize>( &mut self, ) -> (&mut [T], &mut [Simd<T, LANES>], &mut [T])
    where Simd<T, LANES>: AsMut<[T; LANES]>, @@ -3479,7 +3607,7 @@ and a mutable suffix.

    This is a safe wrapper around slice::align_to_mut, so inherits the same guarantees as that method.

    This is the mutable version of slice::as_simd; see that for examples.

    -
    §Panics
    +
    §Panics

    This will panic if the size of the SIMD type is different from LANES times that of the scalar.

    At the time of writing, the trait restrictions on Simd<T, LANES> keeps @@ -3487,14 +3615,14 @@ that from ever happening, as only power-of-two numbers of lanes are supported. It’s possible that, in the future, those restrictions might be lifted in a way that would make it possible to see panics from this method for something like LANES == 3.

    -

    1.82.0 · Source

    pub fn is_sorted(&self) -> bool
    where +

    1.82.0 · Source

    pub fn is_sorted(&self) -> bool
    where T: PartialOrd,

    Checks if the elements of this slice are sorted.

    That is, for each element a and its following element b, a <= b must hold. If the slice yields exactly zero or one element, true is returned.

    Note that if Self::Item is only PartialOrd, but not Ord, the above definition implies that this function returns false if any two consecutive items are not comparable.

    -
    §Examples
    +
    §Examples
    let empty: [i32; 0] = [];
 
 assert!([1, 2, 2, 9].is_sorted());
@@ -3502,11 +3630,11 @@ comparable.
    
 assert!([0].is_sorted());
 assert!(empty.is_sorted());
 assert!(![0.0, 1.0, f32::NAN].is_sorted());
    -
    1.82.0 · Source

    pub fn is_sorted_by<'a, F>(&'a self, compare: F) -> bool
    where +

    1.82.0 · Source

    pub fn is_sorted_by<'a, F>(&'a self, compare: F) -> bool
    where F: FnMut(&'a T, &'a T) -> bool,

    Checks if the elements of this slice are sorted using the given comparator function.

    Instead of using PartialOrd::partial_cmp, this function uses the given compare function to determine whether two elements are to be considered in sorted order.

    -
    §Examples
    +
    §Examples
    assert!([1, 2, 2, 9].is_sorted_by(|a, b| a <= b));
 assert!(![1, 2, 2, 9].is_sorted_by(|a, b| a < b));
 
@@ -3516,16 +3644,16 @@ function to determine whether two elements are to be considered in sorted order.
 let empty: [i32; 0] = [];
 assert!(empty.is_sorted_by(|a, b| false));
 assert!(empty.is_sorted_by(|a, b| true));
    -
    1.82.0 · Source

    pub fn is_sorted_by_key<'a, F, K>(&'a self, f: F) -> bool
    where +

    1.82.0 · Source

    pub fn is_sorted_by_key<'a, F, K>(&'a self, f: F) -> bool
    where F: FnMut(&'a T) -> K, K: PartialOrd,

    Checks if the elements of this slice are sorted using the given key extraction function.

    Instead of comparing the slice’s elements directly, this function compares the keys of the elements, as determined by f. Apart from that, it’s equivalent to is_sorted; see its documentation for more information.

    -
    §Examples
    +
    §Examples
    assert!(["c", "bb", "aaa"].is_sorted_by_key(|s| s.len()));
 assert!(![-2i32, -1, 0, 3].is_sorted_by_key(|n| n.abs()));
    -
    1.52.0 · Source

    pub fn partition_point<P>(&self, pred: P) -> usize
    where +

    1.52.0 · Source

    pub fn partition_point<P>(&self, pred: P) -> usize
    where P: FnMut(&T) -> bool,

    Returns the index of the partition point according to the given predicate (the index of the first element of the second partition).

    The slice is assumed to be partitioned according to the given predicate. @@ -3536,7 +3664,7 @@ For example, [7, 15, 3, 5, 4, 12, 6] is partitioned under the predi

    If this slice is not partitioned, the returned result is unspecified and meaningless, as this method performs a kind of binary search.

    See also binary_search, binary_search_by, and binary_search_by_key.

    -
    §Examples
    +
    §Examples
    let v = [1, 2, 3, 3, 5, 6, 7];
 let i = v.partition_point(|&x| x < 5);
 
@@ -3558,14 +3686,14 @@ sort order:
    
 let idx = s.partition_point(|&x| x <= num);
 s.insert(idx, num);
 assert_eq!(s, [0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 42, 55]);
    -
    Source

    pub fn take<'a, R>(self: &mut &'a [T], range: R) -> Option<&'a [T]>
    where +

    Source

    pub fn take<'a, R>(self: &mut &'a [T], range: R) -> Option<&'a [T]>
    where R: OneSidedRange<usize>,

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the subslice corresponding to the given range and returns a reference to it.

    Returns None and does not modify the slice if the given range is out of bounds.

    Note that this method only accepts one-sided ranges such as 2.. or ..6, but not 2..6.

    -
    §Examples
    +
    §Examples

    Taking the first three elements of a slice:

    #![feature(slice_take)]
@@ -3595,14 +3723,14 @@ range is out of bounds.
    
 assert_eq!(None, slice.take(..=4));
 let expected: &[char] = &['a', 'b', 'c', 'd'];
 assert_eq!(Some(expected), slice.take(..4));
    -
    Source

    pub fn take_mut<'a, R>(self: &mut &'a mut [T], range: R) -> Option<&'a mut [T]>
    where +

    Source

    pub fn take_mut<'a, R>(self: &mut &'a mut [T], range: R) -> Option<&'a mut [T]>
    where R: OneSidedRange<usize>,

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the subslice corresponding to the given range and returns a mutable reference to it.

    Returns None and does not modify the slice if the given range is out of bounds.

    Note that this method only accepts one-sided ranges such as 2.. or ..6, but not 2..6.

    -
    §Examples
    +
    §Examples

    Taking the first three elements of a slice:

    #![feature(slice_take)]
@@ -3632,10 +3760,10 @@ range is out of bounds.
    
 assert_eq!(None, slice.take_mut(..=4));
 let expected: &mut [_] = &mut ['a', 'b', 'c', 'd'];
 assert_eq!(Some(expected), slice.take_mut(..4));
    -
    Source

    pub fn take_first<'a>(self: &mut &'a [T]) -> Option<&'a T>

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the first element of the slice and returns a reference +

    Source

    pub fn take_first<'a>(self: &mut &'a [T]) -> Option<&'a T>

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the first element of the slice and returns a reference to it.

    Returns None if the slice is empty.

    -
    §Examples
    +
    §Examples
    #![feature(slice_take)]
 
 let mut slice: &[_] = &['a', 'b', 'c'];
@@ -3643,10 +3771,10 @@ to it.
    
 
 assert_eq!(slice, &['b', 'c']);
 assert_eq!(first, &'a');
    -
    Source

    pub fn take_first_mut<'a>(self: &mut &'a mut [T]) -> Option<&'a mut T>

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the first element of the slice and returns a mutable +

    Source

    pub fn take_first_mut<'a>(self: &mut &'a mut [T]) -> Option<&'a mut T>

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the first element of the slice and returns a mutable reference to it.

    Returns None if the slice is empty.

    -
    §Examples
    +
    §Examples
    #![feature(slice_take)]
 
 let mut slice: &mut [_] = &mut ['a', 'b', 'c'];
@@ -3655,10 +3783,10 @@ reference to it.
    
 
 assert_eq!(slice, &['b', 'c']);
 assert_eq!(first, &'d');
    -
    Source

    pub fn take_last<'a>(self: &mut &'a [T]) -> Option<&'a T>

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the last element of the slice and returns a reference +

    Source

    pub fn take_last<'a>(self: &mut &'a [T]) -> Option<&'a T>

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the last element of the slice and returns a reference to it.

    Returns None if the slice is empty.

    -
    §Examples
    +
    §Examples
    #![feature(slice_take)]
 
 let mut slice: &[_] = &['a', 'b', 'c'];
@@ -3666,10 +3794,10 @@ to it.
    
 
 assert_eq!(slice, &['a', 'b']);
 assert_eq!(last, &'c');
    -
    Source

    pub fn take_last_mut<'a>(self: &mut &'a mut [T]) -> Option<&'a mut T>

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the last element of the slice and returns a mutable +

    Source

    pub fn take_last_mut<'a>(self: &mut &'a mut [T]) -> Option<&'a mut T>

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the last element of the slice and returns a mutable reference to it.

    Returns None if the slice is empty.

    -
    §Examples
    +
    §Examples
    #![feature(slice_take)]
 
 let mut slice: &mut [_] = &mut ['a', 'b', 'c'];
@@ -3678,7 +3806,7 @@ reference to it.
    
 
 assert_eq!(slice, &['a', 'b']);
 assert_eq!(last, &'d');
    -
    Source

    pub unsafe fn get_many_unchecked_mut<I, const N: usize>( +

    Source

    pub unsafe fn get_many_unchecked_mut<I, const N: usize>( &mut self, indices: [I; N], ) -> [&mut <I as SliceIndex<[T]>>::Output; N]
    where @@ -3689,10 +3817,10 @@ If passed an array of usizes this method gives back an array of mut to single elements, while if passed an array of ranges it gives back an array of mutable references to slices.

    For a safe alternative see get_many_mut.

    -
    §Safety
    +
    §Safety

    Calling this method with overlapping or out-of-bounds indices is undefined behavior even if the resulting references are not used.

    -
    §Examples
    +
    §Examples
    #![feature(get_many_mut)]
 
 let x = &mut [1, 2, 4];
@@ -3719,7 +3847,7 @@ even if the resulting references are not used.
    
     b[0] = 1;
 }
 assert_eq!(x, &[1, 11, 111]);
    -

    Source

    pub fn get_many_mut<I, const N: usize>( +

    Source

    pub fn get_many_mut<I, const N: usize>( &mut self, indices: [I; N], ) -> Result<[&mut <I as SliceIndex<[T]>>::Output; N], GetManyMutError>
    where @@ -3734,7 +3862,7 @@ An empty range is not considered to overlap if it is located at the beginning or the end of another range, but is considered to overlap if it is located in the middle.

    This method does a O(n^2) check to check that there are no overlapping indices, so be careful when passing many indices.

    -
    §Examples
    +
    §Examples
    #![feature(get_many_mut)]
 
 let v = &mut [1, 2, 3];
@@ -3757,15 +3885,15 @@ when passing many indices.
    
     b[0] = 1;
 }
 assert_eq!(v, &[1, 11, 111]);
    -

    Source

    pub fn element_offset(&self, element: &T) -> Option<usize>

    🔬This is a nightly-only experimental API. (substr_range)

    Returns the index that an element reference points to.

    +
    Source

    pub fn element_offset(&self, element: &T) -> Option<usize>

    🔬This is a nightly-only experimental API. (substr_range)

    Returns the index that an element reference points to.

    Returns None if element does not point to the start of an element within the slice.

    This method is useful for extending slice iterators like slice::split.

    Note that this uses pointer arithmetic and does not compare elements. To find the index of an element via comparison, use .iter().position() instead.

    -
    §Panics
    +
    §Panics

    Panics if T is zero-sized.

    -
    §Examples
    +
    §Examples

    Basic usage:

    #![feature(substr_range)]
@@ -3790,7 +3918,7 @@ To find the index of an element via comparison, use
 
 assert_eq!(arr.element_offset(ok_elm), Some(0)); // Points to element 0
 assert_eq!(arr.element_offset(weird_elm), None); // Points between element 0 and 1
    -
    Source

    pub fn subslice_range(&self, subslice: &[T]) -> Option<Range<usize>>

    🔬This is a nightly-only experimental API. (substr_range)

    Returns the range of indices that a subslice points to.

    +
    Source

    pub fn subslice_range(&self, subslice: &[T]) -> Option<Range<usize>>

    🔬This is a nightly-only experimental API. (substr_range)

    Returns the range of indices that a subslice points to.

    Returns None if subslice does not point within the slice or if it is not aligned with the elements in the slice.

    This method does not compare elements. Instead, this method finds the location in the slice that @@ -3799,9 +3927,9 @@ elements in the slice.

    This method is useful for extending slice iterators like slice::split.

    Note that this may return a false positive (either Some(0..0) or Some(self.len()..self.len())) if subslice has a length of zero and points to the beginning or end of another, separate, slice.

    -
    §Panics
    +
    §Panics

    Panics if T is zero-sized.

    -
    §Examples
    +
    §Examples

    Basic usage:

    #![feature(substr_range)]
@@ -3816,13 +3944,13 @@ if subslice has a length of zero and points to the beginning or end
 assert_eq!(iter.next(), Some(1..3));
 assert_eq!(iter.next(), Some(4..4));
 assert_eq!(iter.next(), Some(5..6));
    -
    1.80.0 · Source

    pub fn as_flattened(&self) -> &[T]

    Takes a &[[T; N]], and flattens it to a &[T].

    -
    §Panics
    +
    1.80.0 · Source

    pub fn as_flattened(&self) -> &[T]

    Takes a &[[T; N]], and flattens it to a &[T].

    +
    §Panics

    This panics if the length of the resulting slice would overflow a usize.

    This is only possible when flattening a slice of arrays of zero-sized types, and thus tends to be irrelevant in practice. If size_of::<T>() > 0, this will never panic.

    -
    §Examples
    +
    §Examples
    assert_eq!([[1, 2, 3], [4, 5, 6]].as_flattened(), &[1, 2, 3, 4, 5, 6]);
 
 assert_eq!(
@@ -3835,13 +3963,13 @@ types, and thus tends to be irrelevant in practice. If
 
 let empty_slice_of_arrays: &[[u32; 10]] = &[];
 assert!(empty_slice_of_arrays.as_flattened().is_empty());
    -
    1.80.0 · Source

    pub fn as_flattened_mut(&mut self) -> &mut [T]

    Takes a &mut [[T; N]], and flattens it to a &mut [T].

    -
    §Panics
    +
    1.80.0 · Source

    pub fn as_flattened_mut(&mut self) -> &mut [T]

    Takes a &mut [[T; N]], and flattens it to a &mut [T].

    +
    §Panics

    This panics if the length of the resulting slice would overflow a usize.

    This is only possible when flattening a slice of arrays of zero-sized types, and thus tends to be irrelevant in practice. If size_of::<T>() > 0, this will never panic.

    -
    §Examples
    +
    §Examples
    fn add_5_to_all(slice: &mut [i32]) {
     for i in slice {
         *i += 5;
@@ -3851,12 +3979,12 @@ types, and thus tends to be irrelevant in practice. If
 let mut array = [[1, 2, 3], [4, 5, 6], [7, 8, 9]];
 add_5_to_all(array.as_flattened_mut());
 assert_eq!(array, [[6, 7, 8], [9, 10, 11], [12, 13, 14]]);
    -
    Source

    pub fn sort_floats(&mut self)

    🔬This is a nightly-only experimental API. (sort_floats)

    Sorts the slice of floats.

    +
    Source

    pub fn sort_floats(&mut self)

    🔬This is a nightly-only experimental API. (sort_floats)

    Sorts the slice of floats.

    This sort is in-place (i.e. does not allocate), O(n * log(n)) worst-case, and uses the ordering defined by f32::total_cmp.

    §Current implementation

    This uses the same sorting algorithm as sort_unstable_by.

    -
    §Examples
    +
    §Examples
    #![feature(sort_floats)]
 let mut v = [2.6, -5e-8, f32::NAN, 8.29, f32::INFINITY, -1.0, 0.0, -f32::INFINITY, -0.0];
 
@@ -3864,12 +3992,12 @@ v.sort_floats();
 let sorted = [-f32::INFINITY, -1.0, -5e-8, -0.0, 0.0, 2.6, 8.29, f32::INFINITY, f32::NAN];
 assert_eq!(&v[..8], &sorted[..8]);
 assert!(v[8].is_nan());
    -
    Source

    pub fn sort_floats(&mut self)

    🔬This is a nightly-only experimental API. (sort_floats)

    Sorts the slice of floats.

    +
    Source

    pub fn sort_floats(&mut self)

    🔬This is a nightly-only experimental API. (sort_floats)

    Sorts the slice of floats.

    This sort is in-place (i.e. does not allocate), O(n * log(n)) worst-case, and uses the ordering defined by f64::total_cmp.

    §Current implementation

    This uses the same sorting algorithm as sort_unstable_by.

    -
    §Examples
    +
    §Examples
    #![feature(sort_floats)]
 let mut v = [2.6, -5e-8, f64::NAN, 8.29, f64::INFINITY, -1.0, 0.0, -f64::INFINITY, -0.0];
 
@@ -3880,7 +4008,7 @@ v.sort_floats();
    1.79.0 · Source

    pub fn utf8_chunks(&self) -> Utf8Chunks<'_> ⓘ

    Creates an iterator over the contiguous valid UTF-8 ranges of this slice, and the non-UTF-8 fragments in between.

    See the Utf8Chunk type for documentation of the items yielded by this iterator.

    -
    §Examples
    +
    §Examples

    This function formats arbitrary but mostly-UTF-8 bytes into Rust source code in the form of a C-string literal (c"...").

    @@ -3933,7 +4061,7 @@ with k distinct elements, the expected time to sort the data is O(n

    The auxiliary memory allocation behavior depends on the input length. Short slices are handled without allocation, medium sized slices allocate self.len() and beyond that it clamps at self.len() / 2.

    -
    §Panics
    +
    §Panics

    May panic if the implementation of Ord for T does not implement a total order, or if the Ord implementation itself panics.

    All safe functions on slices preserve the invariant that even if the function panics, all @@ -3942,7 +4070,7 @@ mutability are observed in the input. This ensures that recovery code (for insta of a Drop or following a catch_unwind) will still have access to all the original elements. For instance, if the slice belongs to a Vec, the Vec::drop method will be able to dispose of all contained elements.

    -
    §Examples
    +
    §Examples
    let mut v = [4, -5, 1, -3, 2];
 
 v.sort();
@@ -3965,7 +4093,7 @@ with k distinct elements, the expected time to sort the data is O(n
 
    The auxiliary memory allocation behavior depends on the input length. Short slices are
 handled without allocation, medium sized slices allocate self.len() and beyond that it
 clamps at self.len() / 2.
    
-
    §Panics
    
+
    §Panics
    
 
    May panic if compare does not implement a total order, or if compare itself panics.
    
 
    All safe functions on slices preserve the invariant that even if the function panics, all
 original elements will remain in the slice and any possible modifications via interior
@@ -3973,7 +4101,7 @@ mutability are observed in the input. This ensures that recovery code (for insta
 of a Drop or following a catch_unwind) will still have access to all the original
 elements. For instance, if the slice belongs to a Vec, the Vec::drop method will be able
 to dispose of all contained elements.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [4, -5, 1, -3, 2];
 v.sort_by(|a, b| a.cmp(b));
 assert_eq!(v, [-5, -3, 1, 2, 4]);
@@ -3997,7 +4125,7 @@ with k distinct elements, the expected time to sort the data is O(n
 
    The auxiliary memory allocation behavior depends on the input length. Short slices are
 handled without allocation, medium sized slices allocate self.len() and beyond that it
 clamps at self.len() / 2.
    
-
    §Panics
    
+
    §Panics
    
 
    May panic if the implementation of Ord for K does not implement a total order, or if
 the Ord implementation or the key-function f panics.
    
 
    All safe functions on slices preserve the invariant that even if the function panics, all
@@ -4006,7 +4134,7 @@ mutability are observed in the input. This ensures that recovery code (for insta
 of a Drop or following a catch_unwind) will still have access to all the original
 elements. For instance, if the slice belongs to a Vec, the Vec::drop method will be able
 to dispose of all contained elements.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [4i32, -5, 1, -3, 2];
 
 v.sort_by_key(|k| k.abs());
@@ -4033,7 +4161,7 @@ superscalar out-of-order execution capabilities commonly found in CPUs, to effic
 perform the operation.
    
 
    In the worst case, the algorithm allocates temporary storage in a Vec<(K, usize)> the
 length of the slice.
    
-
    §Panics
    
+
    §Panics
    
 
    May panic if the implementation of Ord for K does not implement a total order, or if
 the Ord implementation panics.
    
 
    All safe functions on slices preserve the invariant that even if the function panics, all
@@ -4042,7 +4170,7 @@ mutability are observed in the input. This ensures that recovery code (for insta
 of a Drop or following a catch_unwind) will still have access to all the original
 elements. For instance, if the slice belongs to a Vec, the Vec::drop method will be able
 to dispose of all contained elements.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [4i32, -5, 1, -3, 2, 10];
 
 // Strings are sorted by lexicographical order.
@@ -4050,14 +4178,14 @@ to dispose of all contained elements.
    
 assert_eq!(v, [-3, -5, 1, 10, 2, 4]);
    1.0.0 · Source

    pub fn to_vec(&self) -> Vec<T>
    where T: Clone,

    Copies self into a new Vec.

    -
    §Examples
    +
    §Examples
    let s = [10, 40, 30];
 let x = s.to_vec();
 // Here, `s` and `x` can be modified independently.
    Source

    pub fn to_vec_in<A>(&self, alloc: A) -> Vec<T, A>
    where A: Allocator, T: Clone,

    🔬This is a nightly-only experimental API. (allocator_api)

    Copies self into a new Vec with an allocator.

    -
    §Examples
    +
    §Examples
    #![feature(allocator_api)]
 
 use std::alloc::System;
@@ -4067,9 +4195,9 @@ to dispose of all contained elements.
    
 // Here, `s` and `x` can be modified independently.
    1.40.0 · Source

    pub fn repeat(&self, n: usize) -> Vec<T>
    where T: Copy,

    Creates a vector by copying a slice n times.

    -
    §Panics
    +
    §Panics

    This function will panic if the capacity would overflow.

    -
    §Examples
    +
    §Examples

    Basic usage:

    assert_eq!([1, 2].repeat(3), vec![1, 2, 1, 2, 1, 2]);
    @@ -4080,7 +4208,7 @@ to dispose of all contained elements.

    1.0.0 · Source

    pub fn concat<Item>(&self) -> <[T] as Concat<Item>>::Output ⓘ
    where [T]: Concat<Item>, Item: ?Sized,

    Flattens a slice of T into a single value Self::Output.

    -
    §Examples
    +
    §Examples
    assert_eq!(["hello", "world"].concat(), "helloworld");
 assert_eq!([[1, 2], [3, 4]].concat(), [1, 2, 3, 4]);
    1.3.0 · Source

    pub fn join<Separator>( @@ -4089,7 +4217,7 @@ to dispose of all contained elements.

    ) -> <[T] as Join<Separator>>::Output ⓘ
    where [T]: Join<Separator>,

    Flattens a slice of T into a single value Self::Output, placing a given separator between each.

    -
    §Examples
    +
    §Examples
    assert_eq!(["hello", "world"].join(" "), "hello world");
 assert_eq!([[1, 2], [3, 4]].join(&0), [1, 2, 0, 3, 4]);
 assert_eq!([[1, 2], [3, 4]].join(&[0, 0][..]), [1, 2, 0, 0, 3, 4]);
    @@ -4099,7 +4227,7 @@ given separator between each.

    ) -> <[T] as Join<Separator>>::Output ⓘ
    where [T]: Join<Separator>,
    👎Deprecated since 1.3.0: renamed to join

    Flattens a slice of T into a single value Self::Output, placing a given separator between each.

    -
    §Examples
    +
    §Examples
    assert_eq!(["hello", "world"].connect(" "), "hello world");
 assert_eq!([[1, 2], [3, 4]].connect(&0), [1, 2, 0, 3, 4]);
    1.23.0 · Source

    pub fn to_ascii_uppercase(&self) -> Vec<u8> ⓘ

    Returns a vector containing a copy of this slice where each byte @@ -4112,11 +4240,11 @@ is mapped to its ASCII lower case equivalent.

    ASCII letters ‘A’ to ‘Z’ are mapped to ‘a’ to ‘z’, but non-ASCII letters are unchanged.

    To lowercase the value in-place, use make_ascii_lowercase.

    -

    Trait Implementations§

    1.5.0 · Source§

    impl<T, A> AsMut<[T]> for Vec<T, A>
    where - A: Allocator,

    Source§

    fn as_mut(&mut self) -> &mut [T]

    Converts this type into a mutable reference of the (usually inferred) input type.
    1.5.0 · Source§

    impl<T, A> AsMut<Vec<T, A>> for Vec<T, A>
    where - A: Allocator,

    Source§

    fn as_mut(&mut self) -> &mut Vec<T, A>

    Converts this type into a mutable reference of the (usually inferred) input type.
    1.0.0 · Source§

    impl<T, A> AsRef<[T]> for Vec<T, A>
    where - A: Allocator,

    Source§

    fn as_ref(&self) -> &[T]

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

    impl<T, A> AsRef<Vec<T, A>> for Vec<T, A>
    where - A: Allocator,

    Source§

    fn as_ref(&self) -> &Vec<T, A>

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

    impl<T, A> Borrow<[T]> for Vec<T, A>
    where +

    Trait Implementations§

    1.5.0 · Source§

    impl<T, A> AsMut<[T]> for Vec<T, A>
    where + A: Allocator,

    Source§

    fn as_mut(&mut self) -> &mut [T]

    Converts this type into a mutable reference of the (usually inferred) input type.
    1.5.0 · Source§

    impl<T, A> AsMut<Vec<T, A>> for Vec<T, A>
    where + A: Allocator,

    Source§

    fn as_mut(&mut self) -> &mut Vec<T, A>

    Converts this type into a mutable reference of the (usually inferred) input type.
    1.0.0 · Source§

    impl<T, A> AsRef<[T]> for Vec<T, A>
    where + A: Allocator,

    Source§

    fn as_ref(&self) -> &[T]

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

    impl<T, A> AsRef<Vec<T, A>> for Vec<T, A>
    where + A: Allocator,

    Source§

    fn as_ref(&self) -> &Vec<T, A>

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

    impl<T, A> Borrow<[T]> for Vec<T, A>
    where A: Allocator,

    Source§

    fn borrow(&self) -> &[T]

    Immutably borrows from an owned value. Read more
    1.0.0 · Source§

    impl<T, A> BorrowMut<[T]> for Vec<T, A>
    where A: Allocator,

    Source§

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

    Mutably borrows from an owned value. Read more
    1.0.0 · Source§

    impl<T, A> Clone for Vec<T, A>
    where T: Clone, @@ -4125,7 +4253,7 @@ but non-ASCII letters are unchanged.

    as it avoids reallocation if possible. Additionally, if the element type T overrides clone_from(), this will reuse the resources of self’s elements as well.

    -
    §Examples
    +
    §Examples
    let x = vec![5, 6, 7];
 let mut y = vec![8, 9, 10];
 let yp: *const i32 = y.as_ptr();
@@ -4137,9 +4265,9 @@ y.clone_from(&x);
 
 // And no reallocation occurred
 assert_eq!(yp, y.as_ptr());
    -

    Source§

    fn clone(&self) -> Vec<T, A>

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

    impl<T, A> Debug for Vec<T, A>
    where +

    Source§

    fn clone(&self) -> Vec<T, A>

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

    impl<T, A> Debug for Vec<T, A>
    where T: Debug, - A: Allocator,

    Source§

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

    Formats the value using the given formatter. Read more
    §

    impl Decodable for Vec<(u32, Address)>

    §

    fn consensus_decode_from_finite_reader<R>( + A: Allocator,

    Source§

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

    Formats the value using the given formatter. Read more
    §

    impl Decodable for Vec<(u32, Address)>

    §

    fn consensus_decode_from_finite_reader<R>( r: &mut R, ) -> Result<Vec<(u32, Address)>, Error>
    where R: Read + ?Sized,

    Decode Self from a size-limited reader. Read more
    §

    fn consensus_decode<R>(reader: &mut R) -> Result<Self, Error>
    where @@ -4205,7 +4333,7 @@ y.clone_from(&x); R: Read + ?Sized,

    Decode Self from a size-limited reader. Read more
    §

    fn consensus_decode<R>(reader: &mut R) -> Result<Self, Error>
    where R: Read + ?Sized,

    Decode an object with a well-defined format. Read more
    §

    impl Decodable for Vec<u8>

    §

    fn consensus_decode_from_finite_reader<R>(r: &mut R) -> Result<Vec<u8>, Error>
    where R: Read + ?Sized,

    Decode Self from a size-limited reader. Read more
    §

    fn consensus_decode<R>(reader: &mut R) -> Result<Self, Error>
    where - R: Read + ?Sized,

    Decode an object with a well-defined format. Read more
    1.0.0 · Source§

    impl<T> Default for Vec<T>

    Source§

    fn default() -> Vec<T>

    Creates an empty Vec<T>.

    + R: Read + ?Sized,
    Decode an object with a well-defined format. Read more
    1.0.0 · Source§

    impl<T> Default for Vec<T>

    Source§

    fn default() -> Vec<T>

    Creates an empty Vec<T>.

    The vector will not allocate until elements are pushed onto it.

    1.0.0 · Source§

    impl<T, A> Deref for Vec<T, A>
    where A: Allocator,

    Source§

    type Target = [T]

    The resulting type after dereferencing.
    Source§

    fn deref(&self) -> &[T]

    Dereferences the value.
    1.0.0 · Source§

    impl<T, A> DerefMut for Vec<T, A>
    where @@ -4213,8 +4341,8 @@ y.clone_from(&x); T: Deserialize<'de>,

    Source§

    fn deserialize<D>( deserializer: D, ) -> Result<Vec<T>, <D as Deserializer<'de>>::Error>
    where - D: Deserializer<'de>,

    Deserialize this value from the given Serde deserializer. Read more
    §

    impl<'a> DisplayHex for &'a Vec<u8>

    §

    type Display = DisplayByteSlice<'a>

    The type providing fmt::Display implementation. Read more
    §

    fn as_hex(self) -> <&'a Vec<u8> as DisplayHex>::Display ⓘ

    Display Self as a continuous sequence of ASCII hex chars.
    §

    fn hex_reserve_suggestion(self) -> usize

    Hints how much bytes to reserve when creating a String. Read more
    §

    fn to_lower_hex_string(self) -> String

    Create a lower-hex-encoded string. Read more
    §

    fn to_upper_hex_string(self) -> String

    Create an upper-hex-encoded string. Read more
    §

    fn to_hex_string(self, case: Case) -> String

    Create a hex-encoded string. Read more
    §

    fn append_hex_to_string(self, case: Case, string: &mut String)

    Appends hex-encoded content to an existing String. Read more
    1.0.0 · Source§

    impl<T, A> Drop for Vec<T, A>
    where - A: Allocator,

    Source§

    fn drop(&mut self)

    Executes the destructor for this type. Read more
    §

    impl Encodable for Vec<(u32, Address)>

    §

    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where + D: Deserializer<'de>,

    Deserialize this value from the given Serde deserializer. Read more
    §

    impl<'a> DisplayHex for &'a Vec<u8>

    §

    type Display = DisplayByteSlice<'a>

    The type providing fmt::Display implementation. Read more
    §

    fn as_hex(self) -> <&'a Vec<u8> as DisplayHex>::Display ⓘ

    Display Self as a continuous sequence of ASCII hex chars.
    §

    fn hex_reserve_suggestion(self) -> usize

    Hints how much bytes to reserve when creating a String. Read more
    §

    fn to_lower_hex_string(self) -> String

    Create a lower-hex-encoded string. Read more
    §

    fn to_upper_hex_string(self) -> String

    Create an upper-hex-encoded string. Read more
    §

    fn to_hex_string(self, case: Case) -> String

    Create a hex-encoded string. Read more
    §

    fn append_hex_to_string(self, case: Case, string: &mut String)

    Appends hex-encoded content to an existing String. Read more
    1.0.0 · Source§

    impl<T, A> Drop for Vec<T, A>
    where + A: Allocator,

    Source§

    fn drop(&mut self)

    Executes the destructor for this type. Read more
    §

    impl Encodable for Vec<(u32, Address)>

    §

    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where W: Write + ?Sized,

    Encodes an object with a well-defined format. Read more
    §

    impl Encodable for Vec<AddrV2Message>

    §

    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where W: Write + ?Sized,

    Encodes an object with a well-defined format. Read more
    §

    impl Encodable for Vec<BlockHash>

    §

    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where W: Write + ?Sized,

    Encodes an object with a well-defined format. Read more
    §

    impl Encodable for Vec<FilterHash>

    §

    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where @@ -4232,63 +4360,63 @@ y.clone_from(&x); W: Write + ?Sized,

    Encodes an object with a well-defined format. Read more
    §

    impl Encodable for Vec<Vec<u8>>

    §

    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where W: Write + ?Sized,

    Encodes an object with a well-defined format. Read more
    §

    impl Encodable for Vec<u64>

    §

    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where W: Write + ?Sized,

    Encodes an object with a well-defined format. Read more
    §

    impl Encodable for Vec<u8>

    §

    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where - W: Write + ?Sized,

    Encodes an object with a well-defined format. Read more
    1.2.0 · Source§

    impl<'a, T, A> Extend<&'a T> for Vec<T, A>
    where + W: Write + ?Sized,

    Encodes an object with a well-defined format. Read more
    1.2.0 · Source§

    impl<'a, T, A> Extend<&'a T> for Vec<T, A>
    where T: Copy + 'a, A: Allocator,

    Extend implementation that copies elements out of references before pushing them onto the Vec.

    This implementation is specialized for slice iterators, where it uses copy_from_slice to append the entire slice at once.

    -
    Source§

    fn extend<I>(&mut self, iter: I)
    where - I: IntoIterator<Item = &'a T>,

    Extends a collection with the contents of an iterator. Read more
    Source§

    fn extend_one(&mut self, _: &'a T)

    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    Source§

    fn extend_reserve(&mut self, additional: usize)

    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    1.0.0 · Source§

    impl<T, A> Extend<T> for Vec<T, A>
    where +
    Source§

    fn extend<I>(&mut self, iter: I)
    where + I: IntoIterator<Item = &'a T>,

    Extends a collection with the contents of an iterator. Read more
    Source§

    fn extend_one(&mut self, _: &'a T)

    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    Source§

    fn extend_reserve(&mut self, additional: usize)

    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more

    1.0.0 · Source§

    impl<T, A> Extend<T> for Vec<T, A>
    where A: Allocator,

    Source§

    fn extend<I>(&mut self, iter: I)
    where - I: IntoIterator<Item = T>,

    Extends a collection with the contents of an iterator. Read more
    Source§

    fn extend_one(&mut self, item: T)

    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    Source§

    fn extend_reserve(&mut self, additional: usize)

    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    1.0.0 · Source§

    impl<T> From<&[T]> for Vec<T>
    where - T: Clone,

    Source§

    fn from(s: &[T]) -> Vec<T>

    Allocates a Vec<T> and fills it by cloning s’s items.

    -
    §Examples
    + I: IntoIterator<Item = T>,
    Extends a collection with the contents of an iterator. Read more
    Source§

    fn extend_one(&mut self, item: T)

    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    Source§

    fn extend_reserve(&mut self, additional: usize)

    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    1.0.0 · Source§

    impl<T> From<&[T]> for Vec<T>
    where + T: Clone,

    Source§

    fn from(s: &[T]) -> Vec<T>

    Allocates a Vec<T> and fills it by cloning s’s items.

    +
    §Examples
    assert_eq!(Vec::from(&[1, 2, 3][..]), vec![1, 2, 3]);
    -
    1.74.0 · Source§

    impl<T, const N: usize> From<&[T; N]> for Vec<T>
    where - T: Clone,

    Source§

    fn from(s: &[T; N]) -> Vec<T>

    Allocates a Vec<T> and fills it by cloning s’s items.

    -
    §Examples
    +
    1.74.0 · Source§

    impl<T, const N: usize> From<&[T; N]> for Vec<T>
    where + T: Clone,

    Source§

    fn from(s: &[T; N]) -> Vec<T>

    Allocates a Vec<T> and fills it by cloning s’s items.

    +
    §Examples
    assert_eq!(Vec::from(&[1, 2, 3]), vec![1, 2, 3]);
    1.28.0 · Source§

    impl<'a, T> From<&'a Vec<T>> for Cow<'a, [T]>
    where T: Clone,

    Source§

    fn from(v: &'a Vec<T>) -> Cow<'a, [T]>

    Creates a Borrowed variant of Cow from a reference to Vec.

    This conversion does not allocate or clone the data.

    -
    1.19.0 · Source§

    impl<T> From<&mut [T]> for Vec<T>
    where - T: Clone,

    Source§

    fn from(s: &mut [T]) -> Vec<T>

    Allocates a Vec<T> and fills it by cloning s’s items.

    -
    §Examples
    +
    1.19.0 · Source§

    impl<T> From<&mut [T]> for Vec<T>
    where + T: Clone,

    Source§

    fn from(s: &mut [T]) -> Vec<T>

    Allocates a Vec<T> and fills it by cloning s’s items.

    +
    §Examples
    assert_eq!(Vec::from(&mut [1, 2, 3][..]), vec![1, 2, 3]);
    -
    1.74.0 · Source§

    impl<T, const N: usize> From<&mut [T; N]> for Vec<T>
    where - T: Clone,

    Source§

    fn from(s: &mut [T; N]) -> Vec<T>

    Allocates a Vec<T> and fills it by cloning s’s items.

    -
    §Examples
    +
    1.74.0 · Source§

    impl<T, const N: usize> From<&mut [T; N]> for Vec<T>
    where + T: Clone,

    Source§

    fn from(s: &mut [T; N]) -> Vec<T>

    Allocates a Vec<T> and fills it by cloning s’s items.

    +
    §Examples
    assert_eq!(Vec::from(&mut [1, 2, 3]), vec![1, 2, 3]);
    -
    1.0.0 · Source§

    impl From<&str> for Vec<u8>

    Source§

    fn from(s: &str) -> Vec<u8> ⓘ

    Allocates a Vec<u8> and fills it with a UTF-8 string.

    -
    §Examples
    +
    1.0.0 · Source§

    impl From<&str> for Vec<u8>

    Source§

    fn from(s: &str) -> Vec<u8> ⓘ

    Allocates a Vec<u8> and fills it with a UTF-8 string.

    +
    §Examples
    assert_eq!(Vec::from("123"), vec![b'1', b'2', b'3']);
    -
    1.44.0 · Source§

    impl<T, const N: usize> From<[T; N]> for Vec<T>

    Source§

    fn from(s: [T; N]) -> Vec<T>

    Allocates a Vec<T> and moves s’s items into it.

    -
    §Examples
    +
    1.44.0 · Source§

    impl<T, const N: usize> From<[T; N]> for Vec<T>

    Source§

    fn from(s: [T; N]) -> Vec<T>

    Allocates a Vec<T> and moves s’s items into it.

    +
    §Examples
    assert_eq!(Vec::from([1, 2, 3]), vec![1, 2, 3]);
    1.5.0 · Source§

    impl<T, A> From<BinaryHeap<T, A>> for Vec<T, A>
    where A: Allocator,

    Source§

    fn from(heap: BinaryHeap<T, A>) -> Vec<T, A>

    Converts a BinaryHeap<T> into a Vec<T>.

    This conversion requires no data movement or allocation, and has constant time complexity.

    -
    1.18.0 · Source§

    impl<T, A> From<Box<[T], A>> for Vec<T, A>
    where - A: Allocator,

    Source§

    fn from(s: Box<[T], A>) -> Vec<T, A>

    Converts a boxed slice into a vector by transferring ownership of +

    1.18.0 · Source§

    impl<T, A> From<Box<[T], A>> for Vec<T, A>
    where + A: Allocator,

    Source§

    fn from(s: Box<[T], A>) -> Vec<T, A>

    Converts a boxed slice into a vector by transferring ownership of the existing heap allocation.

    -
    §Examples
    +
    §Examples
    let b: Box<[i32]> = vec![1, 2, 3].into_boxed_slice();
 assert_eq!(Vec::from(b), vec![1, 2, 3]);
    1.7.0 · Source§

    impl From<CString> for Vec<u8>

    Source§

    fn from(s: CString) -> Vec<u8> ⓘ

    Converts a CString into a Vec<u8>.

    The conversion consumes the CString, and removes the terminating NUL byte.

    -
    1.14.0 · Source§

    impl<'a, T> From<Cow<'a, [T]>> for Vec<T>
    where - [T]: ToOwned<Owned = Vec<T>>,

    Source§

    fn from(s: Cow<'a, [T]>) -> Vec<T>

    Converts a clone-on-write slice into a vector.

    +
    1.14.0 · Source§

    impl<'a, T> From<Cow<'a, [T]>> for Vec<T>
    where + [T]: ToOwned<Owned = Vec<T>>,

    Source§

    fn from(s: Cow<'a, [T]>) -> Vec<T>

    Converts a clone-on-write slice into a vector.

    If s already owns a Vec<T>, it will be returned directly. If s is borrowing a slice, a new Vec<T> will be allocated and filled by cloning s’s items into it.

    -
    §Examples
    +
    §Examples
    let o: Cow<'_, [i32]> = Cow::Owned(vec![1, 2, 3]);
 let b: Cow<'_, [i32]> = Cow::Borrowed(&[1, 2, 3]);
 assert_eq!(Vec::from(o), Vec::from(b));
    §

    impl From<DerivationPath> for Vec<ChildNumber>

    §

    fn from(path: DerivationPath) -> Vec<ChildNumber>

    Converts to this type from the input type.
    §

    impl From<PushBytesBuf> for Vec<u8>

    §

    fn from(value: PushBytesBuf) -> Vec<u8> ⓘ

    Converts to this type from the input type.
    §

    impl From<ScriptBuf> for Vec<u8>

    §

    fn from(v: ScriptBuf) -> Vec<u8> ⓘ

    Converts to this type from the input type.
    1.14.0 · Source§

    impl From<String> for Vec<u8>

    Source§

    fn from(string: String) -> Vec<u8> ⓘ

    Converts the given String to a vector Vec that holds values of type u8.

    -
    §Examples
    +
    §Examples
    let s1 = String::from("hello world");
 let v1 = Vec::from(s1);
 
@@ -4302,8 +4430,8 @@ copying nor checking for inner nul bytes.
    
     T: Clone,
    Source§

    fn from(v: Vec<T>) -> Cow<'a, [T]>

    Creates an Owned variant of Cow from an owned instance of Vec.

    This conversion does not allocate or clone the data.

    -
    1.21.0 · Source§

    impl<T, A> From<Vec<T, A>> for Arc<[T], A>
    where - A: Allocator + Clone,

    Source§

    fn from(v: Vec<T, A>) -> Arc<[T], A>

    Allocates a reference-counted slice and moves v’s items into it.

    +
    1.21.0 · Source§

    impl<T, A> From<Vec<T, A>> for Arc<[T], A>
    where + A: Allocator + Clone,

    Source§

    fn from(v: Vec<T, A>) -> Arc<[T], A>

    Allocates a reference-counted slice and moves v’s items into it.

    §Example
    let unique: Vec<i32> = vec![1, 2, 3];
 let shared: Arc<[i32]> = Arc::from(unique);
@@ -4312,10 +4440,10 @@ from an owned instance of Ord,
     A: Allocator,
    Source§

    fn from(vec: Vec<T, A>) -> BinaryHeap<T, A>

    Converts a Vec<T> into a BinaryHeap<T>.

    This conversion happens in-place, and has O(n) time complexity.

    -
    1.20.0 · Source§

    impl<T, A> From<Vec<T, A>> for Box<[T], A>
    where - A: Allocator,

    Source§

    fn from(v: Vec<T, A>) -> Box<[T], A>

    Converts a vector into a boxed slice.

    +
    1.20.0 · Source§

    impl<T, A> From<Vec<T, A>> for Box<[T], A>
    where + A: Allocator,

    Source§

    fn from(v: Vec<T, A>) -> Box<[T], A>

    Converts a vector into a boxed slice.

    Before doing the conversion, this method discards excess capacity like Vec::shrink_to_fit.

    -
    §Examples
    +
    §Examples
    assert_eq!(Box::from(vec![1, 2, 3]), vec![1, 2, 3].into_boxed_slice());

    Any excess capacity is removed:

    @@ -4323,8 +4451,8 @@ from an owned instance of 1, 2, 3]); assert_eq!(Box::from(vec), vec![1, 2, 3].into_boxed_slice());
    -
    1.21.0 · Source§

    impl<T, A> From<Vec<T, A>> for Rc<[T], A>
    where - A: Allocator,

    Source§

    fn from(v: Vec<T, A>) -> Rc<[T], A>

    Allocates a reference-counted slice and moves v’s items into it.

    +
    1.21.0 · Source§

    impl<T, A> From<Vec<T, A>> for Rc<[T], A>
    where + A: Allocator,

    Source§

    fn from(v: Vec<T, A>) -> Rc<[T], A>

    Allocates a reference-counted slice and moves v’s items into it.

    §Example
    let unique: Vec<i32> = vec![1, 2, 3];
 let shared: Rc<[i32]> = Rc::from(unique);
@@ -4339,7 +4467,7 @@ any additional memory.
    
     A: Allocator,
    Source§

    fn from(other: VecDeque<T, A>) -> Vec<T, A>

    Turn a VecDeque<T> into a Vec<T>.

    This never needs to re-allocate, but does need to do O(n) data movement if the circular buffer doesn’t happen to be at the beginning of the allocation.

    -
    §Examples
    +
    §Examples
    use std::collections::VecDeque;
 
 // This one is *O*(1).
@@ -4421,7 +4549,7 @@ as required by the core::borrow::Borrow implementation.
    
     A: Allocator,
    Source§

    fn into_iter(self) -> <Vec<T, A> as IntoIterator>::IntoIter ⓘ

    Creates a consuming iterator, that is, one that moves each value out of the vector (from start to end). The vector cannot be used after calling this.

    -
    §Examples
    +
    §Examples
    let v = vec!["a".to_string(), "b".to_string()];
 let mut v_iter = v.into_iter();
 
@@ -4430,10 +4558,10 @@ this.
    
 assert_eq!(first_element, Some("a".to_string()));
 assert_eq!(v_iter.next(), Some("b".to_string()));
 assert_eq!(v_iter.next(), None);
    -
    Source§

    type Item = T

    The type of the elements being iterated over.
    Source§

    type IntoIter = IntoIter<T, A>

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

    impl<T> Merge for Vec<T>

    Source§

    fn merge(&mut self, other: Vec<T>)

    Merge another object of the same type onto self.
    Source§

    fn is_empty(&self) -> bool

    Returns whether the structure is considered empty.
    Source§

    fn take(&mut self) -> Option<Self>

    Take the value, replacing it with the default value.
    1.0.0 · Source§

    impl<T, A> Ord for Vec<T, A>
    where +

    Source§

    type Item = T

    The type of the elements being iterated over.
    Source§

    type IntoIter = IntoIter<T, A>

    Which kind of iterator are we turning this into?
    §

    impl<T> Merge for Vec<T>

    §

    fn merge(&mut self, other: Vec<T>)

    Merge another object of the same type onto self.
    §

    fn is_empty(&self) -> bool

    Returns whether the structure is considered empty.
    §

    fn take(&mut self) -> Option<Self>

    Take the value, replacing it with the default value.
    1.0.0 · Source§

    impl<T, A> Ord for Vec<T, A>
    where T: Ord, A: Allocator,

    Implements ordering of vectors, lexicographically.

    -
    Source§

    fn cmp(&self, other: &Vec<T, A>) -> Ordering

    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§

    fn max(self, other: Self) -> Self
    where +

    Source§

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

    Restrict a value to a certain interval. Read more
    1.0.0 · Source§

    impl<T, U, A> PartialEq<&[U]> for Vec<T, A>
    where @@ -4470,11 +4598,11 @@ and should not be overridden without very good reason.

    Allocator, A2: Allocator, T: PartialEq<U>,
    Source§

    fn eq(&self, other: &Vec<U, A2>) -> bool

    Tests for self and other values to be equal, and is used by ==.
    Source§

    fn ne(&self, other: &Vec<U, A2>) -> bool

    Tests for !=. The default implementation is almost always sufficient, -and should not be overridden without very good reason.
    1.0.0 · Source§

    impl<T, A1, A2> PartialOrd<Vec<T, A2>> for Vec<T, A1>
    where +and should not be overridden without very good reason.

    1.0.0 · Source§

    impl<T, A1, A2> PartialOrd<Vec<T, A2>> for Vec<T, A1>
    where T: PartialOrd, A1: Allocator, A2: Allocator,

    Implements comparison of vectors, lexicographically.

    -
    Source§

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

    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

    Tests less than or equal to (for self and other) and is used by the +
    Source§

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

    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

    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

    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

    Tests greater than or equal to (for self and other) and is used by the >= operator. Read more
    Source§

    impl<T> Serialize for Vec<T>
    where @@ -4490,15 +4618,15 @@ but will require a reallocation otherwise.

    §Errors

    Returns the original Vec<T> in the Err variant if boxed_slice.len() does not equal N.

    -
    §Examples
    +
    §Examples

    This can be used with vec! to create an array on the heap:

    let state: Box<[f32; 100]> = vec![1.0; 100].try_into().unwrap();
 assert_eq!(state.len(), 100);
    -

    Source§

    type Error = Vec<T>

    The type returned in the event of a conversion error.
    1.48.0 · Source§

    impl<T, A, const N: usize> TryFrom<Vec<T, A>> for [T; N]
    where - A: Allocator,

    Source§

    fn try_from(vec: Vec<T, A>) -> Result<[T; N], Vec<T, A>>

    Gets the entire contents of the Vec<T> as an array, +

    Source§

    type Error = Vec<T>

    The type returned in the event of a conversion error.
    1.48.0 · Source§

    impl<T, A, const N: usize> TryFrom<Vec<T, A>> for [T; N]
    where + A: Allocator,

    Source§

    fn try_from(vec: Vec<T, A>) -> Result<[T; N], Vec<T, A>>

    Gets the entire contents of the Vec<T> as an array, if its size exactly matches that of the requested array.

    -
    §Examples
    +
    §Examples
    assert_eq!(vec![1, 2, 3].try_into(), Ok([1, 2, 3]));
 assert_eq!(<Vec<i32>>::new().try_into(), Ok([]));

    If the length doesn’t match, the input comes back in Err:

    @@ -4514,7 +4642,7 @@ v.truncate(2); let [a, b]: [_; 2] = v.try_into().unwrap(); assert_eq!(a, b' '); assert_eq!(b, b'd');
    -
    Source§

    type Error = Vec<T, A>

    The type returned in the event of a conversion error.
    §

    impl TryFrom<Vec<TapNodeHash>> for TaprootMerkleBranch

    §

    fn try_from( +

    Source§

    type Error = Vec<T, A>

    The type returned in the event of a conversion error.
    §

    impl TryFrom<Vec<TapNodeHash>> for TaprootMerkleBranch

    §

    fn try_from( v: Vec<TapNodeHash>, ) -> Result<TaprootMerkleBranch, <TaprootMerkleBranch as TryFrom<Vec<TapNodeHash>>>::Error>

    Creates a merkle proof from list of hashes.

    §Errors
    @@ -4530,7 +4658,7 @@ implementation. Read more
    Source§

    fn write_all_vectored(&mut self, bufs: &mut [IoSlice<'_>]) -> Result<(), Error>

    🔬This is a nightly-only experimental API. (write_all_vectored)
    Attempts to write multiple buffers into this writer. Read more
    1.0.0 · Source§

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

    Writes a formatted string into this writer, returning any error encountered. Read more
    1.0.0 · Source§

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

    Creates a “by reference” adapter for this instance of Write. Read more
    Source§

    impl<T, A> DerefPure for Vec<T, A>
    where - A: Allocator,

    1.0.0 · Source§

    impl<T, A> Eq for Vec<T, A>
    where + A: Allocator,

    1.0.0 · Source§

    impl<T, A> Eq for Vec<T, A>
    where T: Eq, A: Allocator,

    Auto Trait Implementations§

    §

    impl<T, A> Freeze for Vec<T, A>
    where A: Freeze,

    §

    impl<T, A> RefUnwindSafe for Vec<T, A>
    where @@ -4555,9 +4683,9 @@ encountered. From<T> for U chooses to do.

    §

    impl<T> IntoDerivationPath for T
    where - T: Into<DerivationPath>,

    §

    fn into_derivation_path(self) -> Result<DerivationPath, Error>

    Converts a given type into a DerivationPath with possible error
    Source§

    impl<P, T> Receiver for P
    where + T: Into<DerivationPath>,

    §

    fn into_derivation_path(self) -> Result<DerivationPath, Error>

    Converts a given type into a DerivationPath with possible error
    Source§

    impl<P, T> Receiver for P
    where P: Deref<Target = T> + ?Sized, - T: ?Sized,

    Source§

    type Target = T

    🔬This is a nightly-only experimental API. (arbitrary_self_types)
    The target type on which the method may be called.
    Source§

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

    Source§

    type Target = T

    🔬This is a nightly-only experimental API. (arbitrary_self_types)
    The target type on which the method may be called.
    Source§

    impl<T> ToOwned for T
    where T: Clone,

    Source§

    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>,

    Source§

    type Error = Infallible

    The type returned in the event of a conversion 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>,

    Source§

    type Error = <U as TryFrom<T>>::Error

    The type returned in the event of a conversion error.
    Source§

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

    Performs the conversion.
    §

    impl<V, T> VZip<V> for T
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.BCRYPT.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.BCRYPT.html index 393be7a263..d490305f97 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.BCRYPT.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.BCRYPT.html @@ -1,2 +1,2 @@ -BCRYPT in bdk_chain::bitcoin::base64::alphabet - Rust
    bdk_chain::bitcoin::base64::alphabet

    Constant BCRYPT

    pub const BCRYPT: Alphabet;
    Expand description

    The bcrypt alphabet.

    +BCRYPT in bdk_chain::bitcoin::base64::alphabet - Rust
    bdk_chain::bitcoin::base64::alphabet

    Constant BCRYPT

    pub const BCRYPT: Alphabet;
    Expand description

    The bcrypt alphabet.

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.BIN_HEX.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.BIN_HEX.html index ef35d9fc09..5a96223d21 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.BIN_HEX.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.BIN_HEX.html @@ -1,3 +1,3 @@ -BIN_HEX in bdk_chain::bitcoin::base64::alphabet - Rust
    bdk_chain::bitcoin::base64::alphabet

    Constant BIN_HEX

    pub const BIN_HEX: Alphabet;
    Expand description

    The alphabet used in BinHex 4.0 files.

    +BIN_HEX in bdk_chain::bitcoin::base64::alphabet - Rust
    bdk_chain::bitcoin::base64::alphabet

    Constant BIN_HEX

    pub const BIN_HEX: Alphabet;
    Expand description

    The alphabet used in BinHex 4.0 files.

    See BinHex 4.0 Definition

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.CRYPT.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.CRYPT.html index 76706f9cc8..7be228feee 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.CRYPT.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.CRYPT.html @@ -1,3 +1,3 @@ -CRYPT in bdk_chain::bitcoin::base64::alphabet - Rust
    bdk_chain::bitcoin::base64::alphabet

    Constant CRYPT

    pub const CRYPT: Alphabet;
    Expand description

    The crypt(3) alphabet (with . and / as the first two characters).

    +CRYPT in bdk_chain::bitcoin::base64::alphabet - Rust
    bdk_chain::bitcoin::base64::alphabet

    Constant CRYPT

    pub const CRYPT: Alphabet;
    Expand description

    The crypt(3) alphabet (with . and / as the first two characters).

    Not standardized, but folk wisdom on the net asserts that this alphabet is what crypt uses.

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.IMAP_MUTF7.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.IMAP_MUTF7.html index 1af25d23f3..de23ca9ba0 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.IMAP_MUTF7.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.IMAP_MUTF7.html @@ -1,3 +1,3 @@ -IMAP_MUTF7 in bdk_chain::bitcoin::base64::alphabet - Rust
    bdk_chain::bitcoin::base64::alphabet

    Constant IMAP_MUTF7

    pub const IMAP_MUTF7: Alphabet;
    Expand description

    The alphabet used in IMAP-modified UTF-7 (with + and ,).

    +IMAP_MUTF7 in bdk_chain::bitcoin::base64::alphabet - Rust
    bdk_chain::bitcoin::base64::alphabet

    Constant IMAP_MUTF7

    pub const IMAP_MUTF7: Alphabet;
    Expand description

    The alphabet used in IMAP-modified UTF-7 (with + and ,).

    See RFC 3501

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.STANDARD.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.STANDARD.html index 57c7634d8a..09e370fba5 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.STANDARD.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.STANDARD.html @@ -1,2 +1,2 @@ -STANDARD in bdk_chain::bitcoin::base64::alphabet - Rust
    bdk_chain::bitcoin::base64::alphabet

    Constant STANDARD

    pub const STANDARD: Alphabet;
    Expand description

    The standard alphabet (with + and /) specified in RFC 4648.

    +STANDARD in bdk_chain::bitcoin::base64::alphabet - Rust
    bdk_chain::bitcoin::base64::alphabet

    Constant STANDARD

    pub const STANDARD: Alphabet;
    Expand description

    The standard alphabet (with + and /) specified in RFC 4648.

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.URL_SAFE.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.URL_SAFE.html index f9d3d395c5..129eebc36f 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.URL_SAFE.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/constant.URL_SAFE.html @@ -1,2 +1,2 @@ -URL_SAFE in bdk_chain::bitcoin::base64::alphabet - Rust
    bdk_chain::bitcoin::base64::alphabet

    Constant URL_SAFE

    pub const URL_SAFE: Alphabet;
    Expand description

    The URL-safe alphabet (with - and _) specified in RFC 4648.

    +URL_SAFE in bdk_chain::bitcoin::base64::alphabet - Rust
    bdk_chain::bitcoin::base64::alphabet

    Constant URL_SAFE

    pub const URL_SAFE: Alphabet;
    Expand description

    The URL-safe alphabet (with - and _) specified in RFC 4648.

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/enum.ParseAlphabetError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/enum.ParseAlphabetError.html index 09cc82565c..aec815df69 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/enum.ParseAlphabetError.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/enum.ParseAlphabetError.html @@ -1,4 +1,4 @@ -ParseAlphabetError in bdk_chain::bitcoin::base64::alphabet - Rust
    bdk_chain::bitcoin::base64::alphabet

    Enum ParseAlphabetError

    pub enum ParseAlphabetError {
+ParseAlphabetError in bdk_chain::bitcoin::base64::alphabet - Rust
    bdk_chain::bitcoin::base64::alphabet
    Enum ParseAlphabetError
    pub enum ParseAlphabetError {
     InvalidLength,
     DuplicatedByte(u8),
     UnprintableByte(u8),
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/index.html
index 6b5be7c7e9..a70ad97b04 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/index.html
@@ -1,2 +1,2 @@
-bdk_chain::bitcoin::base64::alphabet - Rust
    bdk_chain::bitcoin::base64
    Module alphabet
    Expand description
    Provides Alphabet and constants for alphabets commonly used in the wild.
    
+bdk_chain::bitcoin::base64::alphabet - Rust
    bdk_chain::bitcoin::base64
    Module alphabet
    Expand description
    Provides Alphabet and constants for alphabets commonly used in the wild.
    
 
    Structs§
    • Alphabet
      An alphabet defines the 64 ASCII characters (symbols) used for base64.
    Enums§
    Constants§
    • BCRYPT
      The bcrypt alphabet.
    • BIN_HEX
      The alphabet used in BinHex 4.0 files.
    • CRYPT
      The crypt(3) alphabet (with . and / as the first two characters).
    • IMAP_MUTF7
      The alphabet used in IMAP-modified UTF-7 (with + and ,).
    • STANDARD
      The standard alphabet (with + and /) specified in RFC 4648.
    • URL_SAFE
      The URL-safe alphabet (with - and _) specified in RFC 4648.
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/struct.Alphabet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/struct.Alphabet.html
index 8c5ad73b5d..add2b01a9d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/struct.Alphabet.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/alphabet/struct.Alphabet.html
@@ -1,4 +1,4 @@
-Alphabet in bdk_chain::bitcoin::base64::alphabet - Rust
    bdk_chain::bitcoin::base64::alphabet
    Struct Alphabet
    pub struct Alphabet { /* private fields */ }
    Expand description
    An alphabet defines the 64 ASCII characters (symbols) used for base64.
    
+Alphabet in bdk_chain::bitcoin::base64::alphabet - Rust
    bdk_chain::bitcoin::base64::alphabet
    Struct Alphabet
    pub struct Alphabet { /* private fields */ }
    Expand description
    An alphabet defines the 64 ASCII characters (symbols) used for base64.
    
 
    Common alphabets are provided as constants, and custom alphabets
 can be made via from_str or the TryFrom<str> implementation.
    
 
    §Examples
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/display/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/display/index.html
index a351055d9b..e405aabbea 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/display/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/display/index.html
@@ -1,4 +1,4 @@
-bdk_chain::bitcoin::base64::display - Rust
    bdk_chain::bitcoin::base64
    Module display
    Expand description
    Enables base64’d output anywhere you might use a Display implementation, like a format string.
    
+bdk_chain::bitcoin::base64::display - Rust
    bdk_chain::bitcoin::base64
    Module display
    Expand description
    Enables base64’d output anywhere you might use a Display implementation, like a format string.
    
 
 
    use base64::{display::Base64Display, engine::general_purpose::STANDARD};
 
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/display/struct.Base64Display.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/display/struct.Base64Display.html
index f90c3f5f21..6aa1d4f24d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/display/struct.Base64Display.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/display/struct.Base64Display.html
@@ -1,4 +1,4 @@
-Base64Display in bdk_chain::bitcoin::base64::display - Rust
    bdk_chain::bitcoin::base64::display
    Struct Base64Display
    pub struct Base64Display<'a, 'e, E>
    where
+Base64Display in bdk_chain::bitcoin::base64::display - Rust
    bdk_chain::bitcoin::base64::display
    Struct Base64Display
    pub struct Base64Display<'a, 'e, E>
    where
     E: Engine,
    { /* private fields */ }
    Expand description
    A convenience wrapper for base64’ing bytes into a format string without heap allocation.
    
 
    Implementations§
    §
    impl<'a, 'e, E> Base64Display<'a, 'e, E>
    where
     E: Engine,
    pub fn new(bytes: &'a [u8], engine: &'e E) -> Base64Display<'a, 'e, E>
    Create a Base64Display with the provided engine.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/enum.DecodePaddingMode.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/enum.DecodePaddingMode.html
index 3eac231918..fe729a0d1b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/enum.DecodePaddingMode.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/enum.DecodePaddingMode.html
@@ -1,4 +1,4 @@
-DecodePaddingMode in bdk_chain::bitcoin::base64::engine - Rust
    bdk_chain::bitcoin::base64::engine
    Enum DecodePaddingMode
    pub enum DecodePaddingMode {
+DecodePaddingMode in bdk_chain::bitcoin::base64::engine - Rust
    bdk_chain::bitcoin::base64::engine
    Enum DecodePaddingMode
    pub enum DecodePaddingMode {
     Indifferent,
     RequireCanonical,
     RequireNone,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.NO_PAD.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.NO_PAD.html
index 644f12ae0a..56d5999445 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.NO_PAD.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.NO_PAD.html
@@ -1,2 +1,2 @@
-NO_PAD in bdk_chain::bitcoin::base64::engine::general_purpose - Rust
    bdk_chain::bitcoin::base64::engine::general_purpose
    Constant NO_PAD
    pub const NO_PAD: GeneralPurposeConfig;
    Expand description
    Don’t add padding when encoding, and require no padding when decoding.
    
+NO_PAD in bdk_chain::bitcoin::base64::engine::general_purpose - Rust
    bdk_chain::bitcoin::base64::engine::general_purpose
    Constant NO_PAD
    pub const NO_PAD: GeneralPurposeConfig;
    Expand description
    Don’t add padding when encoding, and require no padding when decoding.
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.PAD.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.PAD.html
index e70102d00b..f429317d97 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.PAD.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.PAD.html
@@ -1,4 +1,4 @@
-PAD in bdk_chain::bitcoin::base64::engine::general_purpose - Rust
    bdk_chain::bitcoin::base64::engine::general_purpose
    Constant PAD
    pub const PAD: GeneralPurposeConfig;
    Expand description
    Include padding bytes when encoding, and require that they be present when decoding.
    
+PAD in bdk_chain::bitcoin::base64::engine::general_purpose - Rust
    bdk_chain::bitcoin::base64::engine::general_purpose
    Constant PAD
    pub const PAD: GeneralPurposeConfig;
    Expand description
    Include padding bytes when encoding, and require that they be present when decoding.
    
 
    This is the standard per the base64 RFC, but consider using NO_PAD instead as padding serves
 little purpose in practice.
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.STANDARD.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.STANDARD.html
index 10b7d243b1..cf870f1521 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.STANDARD.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.STANDARD.html
@@ -1,2 +1,2 @@
-STANDARD in bdk_chain::bitcoin::base64::engine::general_purpose - Rust
    bdk_chain::bitcoin::base64::engine::general_purpose
    Constant STANDARD
    pub const STANDARD: GeneralPurpose;
    Expand description
    A GeneralPurpose engine using the alphabet::STANDARD base64 alphabet and PAD config.
    
+STANDARD in bdk_chain::bitcoin::base64::engine::general_purpose - Rust
    bdk_chain::bitcoin::base64::engine::general_purpose
    Constant STANDARD
    pub const STANDARD: GeneralPurpose;
    Expand description
    A GeneralPurpose engine using the alphabet::STANDARD base64 alphabet and PAD config.
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.STANDARD_NO_PAD.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.STANDARD_NO_PAD.html
index 9a0184097a..1ffdc6caa0 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.STANDARD_NO_PAD.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.STANDARD_NO_PAD.html
@@ -1,2 +1,2 @@
-STANDARD_NO_PAD in bdk_chain::bitcoin::base64::engine::general_purpose - Rust
    bdk_chain::bitcoin::base64::engine::general_purpose
    Constant STANDARD_NO_PAD
    pub const STANDARD_NO_PAD: GeneralPurpose;
    Expand description
    A GeneralPurpose engine using the alphabet::STANDARD base64 alphabet and NO_PAD config.
    
+STANDARD_NO_PAD in bdk_chain::bitcoin::base64::engine::general_purpose - Rust
    bdk_chain::bitcoin::base64::engine::general_purpose
    Constant STANDARD_NO_PAD
    pub const STANDARD_NO_PAD: GeneralPurpose;
    Expand description
    A GeneralPurpose engine using the alphabet::STANDARD base64 alphabet and NO_PAD config.
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.URL_SAFE.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.URL_SAFE.html
index c37bbbdc7c..17e1535770 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.URL_SAFE.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.URL_SAFE.html
@@ -1,2 +1,2 @@
-URL_SAFE in bdk_chain::bitcoin::base64::engine::general_purpose - Rust
    bdk_chain::bitcoin::base64::engine::general_purpose
    Constant URL_SAFE
    pub const URL_SAFE: GeneralPurpose;
    Expand description
    A GeneralPurpose engine using the alphabet::URL_SAFE base64 alphabet and PAD config.
    
+URL_SAFE in bdk_chain::bitcoin::base64::engine::general_purpose - Rust
    bdk_chain::bitcoin::base64::engine::general_purpose
    Constant URL_SAFE
    pub const URL_SAFE: GeneralPurpose;
    Expand description
    A GeneralPurpose engine using the alphabet::URL_SAFE base64 alphabet and PAD config.
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.URL_SAFE_NO_PAD.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.URL_SAFE_NO_PAD.html
index f28504c1dd..10647f98d8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.URL_SAFE_NO_PAD.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/constant.URL_SAFE_NO_PAD.html
@@ -1,2 +1,2 @@
-URL_SAFE_NO_PAD in bdk_chain::bitcoin::base64::engine::general_purpose - Rust
    bdk_chain::bitcoin::base64::engine::general_purpose
    Constant URL_SAFE_NO_PAD
    pub const URL_SAFE_NO_PAD: GeneralPurpose;
    Expand description
    A GeneralPurpose engine using the alphabet::URL_SAFE base64 alphabet and NO_PAD config.
    
+URL_SAFE_NO_PAD in bdk_chain::bitcoin::base64::engine::general_purpose - Rust
    bdk_chain::bitcoin::base64::engine::general_purpose
    Constant URL_SAFE_NO_PAD
    pub const URL_SAFE_NO_PAD: GeneralPurpose;
    Expand description
    A GeneralPurpose engine using the alphabet::URL_SAFE base64 alphabet and NO_PAD config.
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/index.html
index 6679adac33..25ec590dbe 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/index.html
@@ -1,2 +1,2 @@
-bdk_chain::bitcoin::base64::engine::general_purpose - Rust
    bdk_chain::bitcoin::base64::engine
    Module general_purpose
    Expand description
    Provides the GeneralPurpose engine and associated config types.
    
+bdk_chain::bitcoin::base64::engine::general_purpose - Rust
    bdk_chain::bitcoin::base64::engine
    Module general_purpose
    Expand description
    Provides the GeneralPurpose engine and associated config types.
    
 
    Structs§
    Constants§
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/struct.GeneralPurpose.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/struct.GeneralPurpose.html
index 896d55cf58..6d4aa76c4c 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/struct.GeneralPurpose.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base64/engine/general_purpose/struct.GeneralPurpose.html
@@ -1,4 +1,4 @@
-GeneralPurpose in bdk_chain::bitcoin::base64::engine::general_purpose - Rust
    bdk_chain::bitcoin::base64::engine::general_purpose
    Struct GeneralPurpose
    pub struct GeneralPurpose { /* private fields */ }
    Expand description
    A general-purpose base64 engine.
    
+GeneralPurpose in bdk_chain::bitcoin::base64::engine::general_purpose - Rust
    bdk_chain::bitcoin::base64::engine::general_purpose
    Struct GeneralPurpose
    pub struct GeneralPurpose { /* private fields */ }
    Expand description
    A general-purpose base64 engine.

    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<P, T> Receiver for P
    where +

    Source§

    impl<P, T> Receiver for P
    where P: Deref<Target = T> + ?Sized, - T: ?Sized,

    Source§

    type Target = T

    🔬This is a nightly-only experimental API. (arbitrary_self_types)
    The target type on which the method may be called.
    Source§

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

    Source§

    type Target = T

    🔬This is a nightly-only experimental API. (arbitrary_self_types)
    The target type on which the method may be called.
    Source§

    impl<T> ToOwned for T
    where T: Clone,

    Source§

    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>,

    Source§

    type Error = Infallible

    The type returned in the event of a conversion 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>,

    Source§

    type Error = <U as TryFrom<T>>::Error

    The type returned in the event of a conversion error.
    Source§

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

    Performs the conversion.
    §

    impl<V, T> VZip<V> for T
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/serialized_signature/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/serialized_signature/index.html index a06226ec87..2d14dd7bcc 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/serialized_signature/index.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/serialized_signature/index.html @@ -1,4 +1,4 @@ -bdk_chain::bitcoin::taproot::serialized_signature - Rust
    bdk_chain::bitcoin::taproot

    Module serialized_signature

    Expand description

    Implements SerializedSignature and related types.

    +bdk_chain::bitcoin::taproot::serialized_signature - Rust
    bdk_chain::bitcoin::taproot

    Module serialized_signature

    Expand description

    Implements SerializedSignature and related types.

    Serialized Taproot signatures have the issue that they can have different lengths. We want to avoid using Vec since that would require allocations making the code slower and unable to run on platforms without an allocator. We implement a special type to encapsulate diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/serialized_signature/struct.IntoIter.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/serialized_signature/struct.IntoIter.html index 4ea93ced73..f520d34c06 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/serialized_signature/struct.IntoIter.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/serialized_signature/struct.IntoIter.html @@ -1,4 +1,4 @@ -IntoIter in bdk_chain::bitcoin::taproot::serialized_signature - Rust

    bdk_chain::bitcoin::taproot::serialized_signature

    Struct IntoIter

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

    Owned iterator over the bytes of SerializedSignature

    +IntoIter in bdk_chain::bitcoin::taproot::serialized_signature - Rust
    bdk_chain::bitcoin::taproot::serialized_signature

    Struct IntoIter

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

    Owned iterator over the bytes of SerializedSignature

    Created by IntoIterator::into_iter method.

    Implementations§

    §

    impl IntoIter

    pub fn as_slice(&self) -> &[u8] ⓘ

    Returns the remaining bytes as a slice.

    This method is analogous to core::slice::Iter::as_slice.

    diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/serialized_signature/struct.SerializedSignature.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/serialized_signature/struct.SerializedSignature.html index fdf7719ed7..97f4392bb1 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/serialized_signature/struct.SerializedSignature.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/serialized_signature/struct.SerializedSignature.html @@ -1,4 +1,4 @@ -SerializedSignature in bdk_chain::bitcoin::taproot::serialized_signature - Rust
    bdk_chain::bitcoin::taproot::serialized_signature

    Struct SerializedSignature

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

    A serialized Taproot Signature

    +SerializedSignature in bdk_chain::bitcoin::taproot::serialized_signature - Rust
    bdk_chain::bitcoin::taproot::serialized_signature

    Struct SerializedSignature

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

    A serialized Taproot Signature

    Implementations§

    §

    impl SerializedSignature

    pub fn len(&self) -> usize

    Get the len of the used data.

    pub fn to_signature(&self) -> Result<Signature, SigFromSliceError>

    Convert the serialized signature into the Signature struct. (This deserializes it)

    @@ -6,21 +6,39 @@ (this serializes it)

    pub fn write_to<W>(&self, writer: &mut W) -> Result<(), Error>
    where W: Write + ?Sized,

    Writes this serialized signature to a writer.

    -

    Methods from Deref<Target = [u8]>§

    Source

    pub fn as_str(&self) -> &str

    🔬This is a nightly-only experimental API. (ascii_char)

    Views this slice of ASCII characters as a UTF-8 str.

    -
    Source

    pub fn as_bytes(&self) -> &[u8] ⓘ

    🔬This is a nightly-only experimental API. (ascii_char)

    Views this slice of ASCII characters as a slice of u8 bytes.

    +

    Methods from Deref<Target = [u8]>§

    Source

    pub fn as_bytes(&self) -> &[MaybeUninit<u8>]

    🔬This is a nightly-only experimental API. (maybe_uninit_as_bytes)

    Returns the contents of this MaybeUninit as a slice of potentially uninitialized bytes.

    +

    Note that even if the contents of a MaybeUninit have been initialized, the value may still +contain padding bytes which are left uninitialized.

    +
    §Examples
    +
    #![feature(maybe_uninit_as_bytes, maybe_uninit_write_slice, maybe_uninit_slice)]
+use std::mem::MaybeUninit;
+
+let uninit = [MaybeUninit::new(0x1234u16), MaybeUninit::new(0x5678u16)];
+let uninit_bytes = uninit.as_bytes();
+let bytes = unsafe { uninit_bytes.assume_init_ref() };
+let val1 = u16::from_ne_bytes(bytes[0..2].try_into().unwrap());
+let val2 = u16::from_ne_bytes(bytes[2..4].try_into().unwrap());
+assert_eq!(&[val1, val2], &[0x1234u16, 0x5678u16]);
    +
    Source

    pub unsafe fn assume_init_ref(&self) -> &[T]

    🔬This is a nightly-only experimental API. (maybe_uninit_slice)

    Gets a shared reference to the contained value.

    +
    §Safety
    +

    Calling this when the content is not yet fully initialized causes undefined +behavior: it is up to the caller to guarantee that every MaybeUninit<T> in +the slice really is in an initialized state.

    +
    Source

    pub fn as_str(&self) -> &str

    🔬This is a nightly-only experimental API. (ascii_char)

    Views this slice of ASCII characters as a UTF-8 str.

    +
    Source

    pub fn as_bytes(&self) -> &[u8] ⓘ

    🔬This is a nightly-only experimental API. (ascii_char)

    Views this slice of ASCII characters as a slice of u8 bytes.

    1.23.0 · Source

    pub fn is_ascii(&self) -> bool

    Checks if all bytes in this slice are within the ASCII range.

    Source

    pub fn as_ascii(&self) -> Option<&[AsciiChar]>

    🔬This is a nightly-only experimental API. (ascii_char)

    If this slice is_ascii, returns it as a slice of ASCII characters, otherwise returns None.

    Source

    pub unsafe fn as_ascii_unchecked(&self) -> &[AsciiChar]

    🔬This is a nightly-only experimental API. (ascii_char)

    Converts this slice of bytes into a slice of ASCII characters, without checking whether they’re valid.

    -
    §Safety
    +
    §Safety

    Every byte in the slice must be in 0..=127, or else this is UB.

    1.23.0 · Source

    pub fn eq_ignore_ascii_case(&self, other: &[u8]) -> bool

    Checks that two slices are an ASCII case-insensitive match.

    Same as to_ascii_lowercase(a) == to_ascii_lowercase(b), but without allocating and copying temporaries.

    1.60.0 · Source

    pub fn escape_ascii(&self) -> EscapeAscii<'_> ⓘ

    Returns an iterator that produces an escaped version of this slice, treating it as an ASCII string.

    -
    §Examples
    +
    §Examples
    
 let s = b"0\t\r\n'\"\\\x9d";
 let escaped = s.escape_ascii().to_string();
@@ -28,14 +46,14 @@ treating it as an ASCII string.
    1.80.0 · Source

    pub fn trim_ascii_start(&self) -> &[u8] ⓘ

    Returns a byte slice with leading ASCII whitespace bytes removed.

    ‘Whitespace’ refers to the definition used by u8::is_ascii_whitespace.

    -
    §Examples
    +
    §Examples
    assert_eq!(b" \t hello world\n".trim_ascii_start(), b"hello world\n");
 assert_eq!(b"  ".trim_ascii_start(), b"");
 assert_eq!(b"".trim_ascii_start(), b"");
    1.80.0 · Source

    pub fn trim_ascii_end(&self) -> &[u8] ⓘ

    Returns a byte slice with trailing ASCII whitespace bytes removed.

    ‘Whitespace’ refers to the definition used by u8::is_ascii_whitespace.

    -
    §Examples
    +
    §Examples
    assert_eq!(b"\r hello world\n ".trim_ascii_end(), b"\r hello world");
 assert_eq!(b"  ".trim_ascii_end(), b"");
 assert_eq!(b"".trim_ascii_end(), b"");
    @@ -43,30 +61,30 @@ treating it as an ASCII string.

    removed.

    ‘Whitespace’ refers to the definition used by u8::is_ascii_whitespace.

    -
    §Examples
    +
    §Examples
    assert_eq!(b"\r hello world\n ".trim_ascii(), b"hello world");
 assert_eq!(b"  ".trim_ascii(), b"");
 assert_eq!(b"".trim_ascii(), b"");
    1.0.0 · Source

    pub fn len(&self) -> usize

    Returns the number of elements in the slice.

    -
    §Examples
    +
    §Examples
    let a = [1, 2, 3];
 assert_eq!(a.len(), 3);
    1.0.0 · Source

    pub fn is_empty(&self) -> bool

    Returns true if the slice has a length of 0.

    -
    §Examples
    +
    §Examples
    let a = [1, 2, 3];
 assert!(!a.is_empty());
 
 let b: &[i32] = &[];
 assert!(b.is_empty());
    1.0.0 · Source

    pub fn first(&self) -> Option<&T>

    Returns the first element of the slice, or None if it is empty.

    -
    §Examples
    +
    §Examples
    let v = [10, 40, 30];
 assert_eq!(Some(&10), v.first());
 
 let w: &[i32] = &[];
 assert_eq!(None, w.first());
    1.5.0 · Source

    pub fn split_first(&self) -> Option<(&T, &[T])>

    Returns the first and all the rest of the elements of the slice, or None if it is empty.

    -
    §Examples
    +
    §Examples
    let x = &[0, 1, 2];
 
 if let Some((first, elements)) = x.split_first() {
@@ -74,7 +92,7 @@ removed.
    
     assert_eq!(elements, &[1, 2]);
 }
    1.5.0 · Source

    pub fn split_last(&self) -> Option<(&T, &[T])>

    Returns the last and all the rest of the elements of the slice, or None if it is empty.

    -
    §Examples
    +
    §Examples
    let x = &[0, 1, 2];
 
 if let Some((last, elements)) = x.split_last() {
@@ -82,7 +100,7 @@ removed.
    
     assert_eq!(elements, &[0, 1]);
 }
    1.0.0 · Source

    pub fn last(&self) -> Option<&T>

    Returns the last element of the slice, or None if it is empty.

    -
    §Examples
    +
    §Examples
    let v = [10, 40, 30];
 assert_eq!(Some(&30), v.last());
 
@@ -90,7 +108,7 @@ removed.
    
 assert_eq!(None, w.last());
    1.77.0 · Source

    pub fn first_chunk<const N: usize>(&self) -> Option<&[T; N]>

    Returns an array reference to the first N items in the slice.

    If the slice is not at least N in length, this will return None.

    -
    §Examples
    +
    §Examples
    let u = [10, 40, 30];
 assert_eq!(Some(&[10, 40]), u.first_chunk::<2>());
 
@@ -101,7 +119,7 @@ removed.
    
 assert_eq!(Some(&[]), w.first_chunk::<0>());
    1.77.0 · Source

    pub fn split_first_chunk<const N: usize>(&self) -> Option<(&[T; N], &[T])>

    Returns an array reference to the first N items in the slice and the remaining slice.

    If the slice is not at least N in length, this will return None.

    -
    §Examples
    +
    §Examples
    let x = &[0, 1, 2];
 
 if let Some((first, elements)) = x.split_first_chunk::<2>() {
@@ -112,7 +130,7 @@ removed.
    
 assert_eq!(None, x.split_first_chunk::<4>());
    1.77.0 · Source

    pub fn split_last_chunk<const N: usize>(&self) -> Option<(&[T], &[T; N])>

    Returns an array reference to the last N items in the slice and the remaining slice.

    If the slice is not at least N in length, this will return None.

    -
    §Examples
    +
    §Examples
    let x = &[0, 1, 2];
 
 if let Some((elements, last)) = x.split_last_chunk::<2>() {
@@ -123,7 +141,7 @@ removed.
    
 assert_eq!(None, x.split_last_chunk::<4>());
    1.77.0 · Source

    pub fn last_chunk<const N: usize>(&self) -> Option<&[T; N]>

    Returns an array reference to the last N items in the slice.

    If the slice is not at least N in length, this will return None.

    -
    §Examples
    +
    §Examples
    let u = [10, 40, 30];
 assert_eq!(Some(&[40, 30]), u.last_chunk::<2>());
 
@@ -141,7 +159,7 @@ position or None if out of bounds.
 
  • If given a range, returns the subslice corresponding to that range,
 or None if out of bounds.
    • 
 
-
    §Examples
    
+
    §Examples
    
 
    let v = [10, 40, 30];
 assert_eq!(Some(&40), v.get(1));
 assert_eq!(Some(&[10, 40][..]), v.get(0..2));
@@ -154,14 +172,14 @@ or None if out of bounds.
     I: SliceIndex<[T]>,

    Returns a reference to an element or subslice, without doing bounds checking.

    For a safe alternative see get.

    -
    §Safety
    +
    §Safety

    Calling this method with an out-of-bounds index is undefined behavior even if the resulting reference is not used.

    You can think of this like .get(index).unwrap_unchecked(). It’s UB to call .get_unchecked(len), even if you immediately convert to a pointer. And it’s UB to call .get_unchecked(..len + 1), .get_unchecked(..=len), or similar.

    -
    §Examples
    +
    §Examples
    let x = &[1, 2, 4];
 
 unsafe {
@@ -175,7 +193,7 @@ is never written to (except inside an UnsafeCell) using this pointe
 derived from it. If you need to mutate the contents of the slice, use as_mut_ptr.
    
 
    Modifying the container referenced by this slice may cause its buffer
 to be reallocated, which would also make any pointers to it invalid.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &[1, 2, 4];
 let x_ptr = x.as_ptr();
 
@@ -208,7 +226,7 @@ element of this slice:
    
 
    If N is not exactly equal to the length of self, then this method returns None.
    1.0.0 · Source

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

    Returns an iterator over the slice.

    The iterator yields all items from start to end.

    -
    §Examples
    +
    §Examples
    let x = &[1, 2, 4];
 let mut iterator = x.iter();
 
@@ -221,7 +239,7 @@ element of this slice:
    
 size, the iterator returns no values.
    
 
    §Panics
    
 
    Panics if size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = ['l', 'o', 'r', 'e', 'm'];
 let mut iter = slice.windows(3);
 assert_eq!(iter.next().unwrap(), &['l', 'o', 'r']);
@@ -256,7 +274,7 @@ slice, then the last chunk will not have length chunk_size.
    
 slice.
    
 
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = ['l', 'o', 'r', 'e', 'm'];
 let mut iter = slice.chunks(2);
 assert_eq!(iter.next().unwrap(), &['l', 'o']);
@@ -274,7 +292,7 @@ resulting code better than in the case of rchunks_exact for the same iterator but starting at the end of the slice.
    
 
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = ['l', 'o', 'r', 'e', 'm'];
 let mut iter = slice.chunks_exact(2);
 assert_eq!(iter.next().unwrap(), &['l', 'o']);
@@ -283,13 +301,13 @@ chunk, and assert_eq!(iter.remainder(), &['m']);
    Source

    pub unsafe fn as_chunks_unchecked<const N: usize>(&self) -> &[[T; N]]

    🔬This is a nightly-only experimental API. (slice_as_chunks)

    Splits the slice into a slice of N-element arrays, assuming that there’s no remainder.

    -
    §Safety
    +
    §Safety

    This may only be called when

    • The slice splits exactly into N-element chunks (aka self.len() % N == 0).
    • N != 0.
    -
    §Examples
    +
    §Examples
    #![feature(slice_as_chunks)]
 let slice: &[char] = &['l', 'o', 'r', 'e', 'm', '!'];
 let chunks: &[[char; 1]] =
@@ -310,7 +328,7 @@ and a remainder slice with length strictly less than N.
    
 
    §Panics
    
 
    Panics if N is zero. This check will most probably get changed to a compile time
 error before this method gets stabilized.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_as_chunks)]
 let slice = ['l', 'o', 'r', 'e', 'm'];
 let (chunks, remainder) = slice.as_chunks();
@@ -331,7 +349,7 @@ and a remainder slice with length strictly less than N.
    
 
    §Panics
    
 
    Panics if N is zero. This check will most probably get changed to a compile time
 error before this method gets stabilized.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_as_chunks)]
 let slice = ['l', 'o', 'r', 'e', 'm'];
 let (remainder, chunks) = slice.as_rchunks();
@@ -346,7 +364,7 @@ retrieved from the remainder function of the iterator.
    
 
    §Panics
    
 
    Panics if N is zero. This check will most probably get changed to a compile time
 error before this method gets stabilized.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(array_chunks)]
 let slice = ['l', 'o', 'r', 'e', 'm'];
 let mut iter = slice.array_chunks();
@@ -361,7 +379,7 @@ starting at the beginning of the slice.
    
 
    §Panics
    
 
    Panics if N is zero. This check will most probably get changed to a compile time
 error before this method gets stabilized.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(array_windows)]
 let slice = [0, 1, 2, 3];
 let mut iter = slice.array_windows();
@@ -378,7 +396,7 @@ slice, then the last chunk will not have length chunk_size.
    
 of the slice.
    
 
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = ['l', 'o', 'r', 'e', 'm'];
 let mut iter = slice.rchunks(2);
 assert_eq!(iter.next().unwrap(), &['e', 'm']);
@@ -397,7 +415,7 @@ chunk, and §Panics
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = ['l', 'o', 'r', 'e', 'm'];
 let mut iter = slice.rchunks_exact(2);
 assert_eq!(iter.next().unwrap(), &['e', 'm']);
@@ -410,7 +428,7 @@ of elements using the predicate to separate them.
    
 
    The predicate is called for every pair of consecutive elements,
 meaning that it is called on slice[0] and slice[1],
 followed by slice[1] and slice[2], and so on.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = &[1, 1, 1, 3, 3, 2, 2, 2];
 
 let mut iter = slice.chunk_by(|a, b| a == b);
@@ -436,7 +454,7 @@ indices from [mid, len) (excluding the index len itsel
 
    §Panics
    
 
    Panics if mid > len.  For a non-panicking alternative see
 split_at_checked.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = ['a', 'b', 'c'];
 
 {
@@ -461,11 +479,11 @@ indices from [mid, len) (excluding the index len itsel
 the index mid itself) and the second will contain all
 indices from [mid, len) (excluding the index len itself).
    
 
    For a safe alternative see split_at.
    
-
    §Safety
    
+
    §Safety
    
 
    Calling this method with an out-of-bounds index is undefined behavior
 even if the resulting reference is not used. The caller has to ensure that
 0 <= mid <= self.len().
    
-
    §Examples
    
+
    §Examples
    
 
    let v = ['a', 'b', 'c'];
 
 unsafe {
@@ -492,7 +510,7 @@ indices from [0, mid) (excluding the index mid itself)
 second will contain all indices from [mid, len) (excluding the index
 len itself).
    
 
    Otherwise, if mid > len, returns None.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = [1, -2, 3, -4, 5, -6];
 
 {
@@ -517,7 +535,7 @@ second will contain all indices from [mid, len) (excluding the inde
    1.0.0 · Source

    pub fn split<F>(&self, pred: F) -> Split<'_, T, F> ⓘ
    where F: FnMut(&T) -> bool,

    Returns an iterator over subslices separated by elements that match pred. The matched element is not contained in the subslices.

    -
    §Examples
    +
    §Examples
    let slice = [10, 40, 33, 20];
 let mut iter = slice.split(|num| num % 3 == 0);
 
@@ -549,7 +567,7 @@ present between them:
    
     F: FnMut(&T) -> bool,

    Returns an iterator over subslices separated by elements that match pred. The matched element is contained in the end of the previous subslice as a terminator.

    -
    §Examples
    +
    §Examples
    let slice = [10, 40, 33, 20];
 let mut iter = slice.split_inclusive(|num| num % 3 == 0);
 
@@ -570,7 +588,7 @@ That slice will be the last item returned by the iterator.
    
     F: FnMut(&T) -> bool,

    Returns an iterator over subslices separated by elements that match pred, starting at the end of the slice and working backwards. The matched element is not contained in the subslices.

    -
    §Examples
    +
    §Examples
    let slice = [11, 22, 33, 0, 44, 55];
 let mut iter = slice.rsplit(|num| *num == 0);
 
@@ -593,7 +611,7 @@ slice will be the first (or last) item returned by the iterator.
    
 not contained in the subslices.
    
 
    The last element returned, if any, will contain the remainder of the
 slice.
    
-
    §Examples
    
+
    §Examples
    
 
    Print the slice split once by numbers divisible by 3 (i.e., [10, 40],
 [20, 60, 50]):
    
 
@@ -609,7 +627,7 @@ the slice and works backwards. The matched element is not contained in
 the subslices.
    
 
    The last element returned, if any, will contain the remainder of the
 slice.
    
-
    §Examples
    
+
    §Examples
    
 
    Print the slice split once, starting from the end, by numbers divisible
 by 3 (i.e., [50], [10, 40, 30, 20]):
    
 
@@ -624,7 +642,7 @@ predicate.
    
 
    If any matching elements are present in the slice, returns the prefix
 before the match and suffix after. The matching element itself is not
 included. If no elements match, returns None.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_split_once)]
 let s = [1, 2, 3, 2, 4];
 assert_eq!(s.split_once(|&x| x == 2), Some((
@@ -638,7 +656,7 @@ predicate.
    
 
    If any matching elements are present in the slice, returns the prefix
 before the match and suffix after. The matching element itself is not
 included. If no elements match, returns None.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_split_once)]
 let s = [1, 2, 3, 2, 4];
 assert_eq!(s.rsplit_once(|&x| x == 2), Some((
@@ -650,7 +668,7 @@ included. If no elements match, returns None.
    
     T: PartialEq,
    Returns true if the slice contains an element with the given value.
    
 
    This operation is O(n).
    
 
    Note that if you have a sorted slice, binary_search may be faster.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = [10, 40, 30];
 assert!(v.contains(&30));
 assert!(!v.contains(&50));
    
@@ -663,7 +681,7 @@ use iter().any:
    
 assert!(!v.iter().any(|e| e == "hi"));
    1.0.0 · Source

    pub fn starts_with(&self, needle: &[T]) -> bool
    where T: PartialEq,

    Returns true if needle is a prefix of the slice or equal to the slice.

    -
    §Examples
    +
    §Examples
    let v = [10, 40, 30];
 assert!(v.starts_with(&[10]));
 assert!(v.starts_with(&[10, 40]));
@@ -678,7 +696,7 @@ use iter().any:
    
 assert!(v.starts_with(&[]));
    1.0.0 · Source

    pub fn ends_with(&self, needle: &[T]) -> bool
    where T: PartialEq,

    Returns true if needle is a suffix of the slice or equal to the slice.

    -
    §Examples
    +
    §Examples
    let v = [10, 40, 30];
 assert!(v.ends_with(&[30]));
 assert!(v.ends_with(&[40, 30]));
@@ -698,7 +716,7 @@ use iter().any:
    
 If prefix is empty, simply returns the original slice. If prefix is equal to the
 original slice, returns an empty slice.
    
 
    If the slice does not start with prefix, returns None.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = &[10, 40, 30];
 assert_eq!(v.strip_prefix(&[10]), Some(&[40, 30][..]));
 assert_eq!(v.strip_prefix(&[10, 40]), Some(&[30][..]));
@@ -716,7 +734,7 @@ original slice, returns an empty slice.
    
 If suffix is empty, simply returns the original slice. If suffix is equal to the
 original slice, returns an empty slice.
    
 
    If the slice does not end with suffix, returns None.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = &[10, 40, 30];
 assert_eq!(v.strip_suffix(&[30]), Some(&[10, 40][..]));
 assert_eq!(v.strip_suffix(&[40, 30]), Some(&[10][..]));
@@ -735,7 +753,7 @@ If the value is not found then binary_search_by, binary_search_by_key, and partition_point.
    
-
    §Examples
    
+
    §Examples
    
 
    Looks up a series of four elements. The first is found, with a
 uniquely determined position; the second and third are not
 found; the fourth could match any position in [1, 4].
    
@@ -794,7 +812,7 @@ If the value is not found then binary_search, binary_search_by_key, and partition_point.
    
-
    §Examples
    
+
    §Examples
    
 
    Looks up a series of four elements. The first is found, with a
 uniquely determined position; the second and third are not
 found; the fourth could match any position in [1, 4].
    
@@ -829,7 +847,7 @@ If the value is not found then binary_search, binary_search_by, and partition_point.
    
-
    §Examples
    
+
    §Examples
    
 
    Looks up a series of four elements in a slice of pairs sorted by
 their second elements. The first is found, with a uniquely
 determined position; the second and third are not found; the
@@ -844,17 +862,17 @@ fourth could match any position in [1, 4].
    
 assert_eq!(s.binary_search_by_key(&100, |&(a, b)| b), Err(13));
 let r = s.binary_search_by_key(&1, |&(a, b)| b);
 assert!(match r { Ok(1..=4) => true, _ => false, });
    
-
    1.30.0 · Source

    pub unsafe fn align_to<U>(&self) -> (&[T], &[U], &[T])

    Transmutes the slice to a slice of another type, ensuring alignment of the types is +

    1.30.0 · Source

    pub unsafe fn align_to<U>(&self) -> (&[T], &[U], &[T])

    Transmutes the slice to a slice of another type, ensuring alignment of the types is maintained.

    This method splits the slice into three distinct slices: prefix, correctly aligned middle slice of a new type, and the suffix slice. The middle part will be as big as possible under the given alignment constraint and element size.

    This method has no purpose when either input element T or output element U are zero-sized and will return the original slice without splitting anything.

    -
    §Safety
    +
    §Safety

    This method is essentially a transmute with respect to the elements in the returned middle slice, so all the usual caveats pertaining to transmute::<T, U> also apply here.

    -
    §Examples
    +
    §Examples

    Basic usage:

    unsafe {
@@ -864,7 +882,7 @@ middle slice, so all the usual caveats pertaining to transmute::<T, U&g
     // more_efficient_algorithm_for_aligned_shorts(shorts);
     // less_efficient_algorithm_for_bytes(suffix);
 }
    -
    Source

    pub fn as_simd<const LANES: usize>(&self) -> (&[T], &[Simd<T, LANES>], &[T])
    where +

    Source

    pub fn as_simd<const LANES: usize>(&self) -> (&[T], &[Simd<T, LANES>], &[T])
    where Simd<T, LANES>: AsRef<[T; LANES]>, T: SimdElement, LaneCount<LANES>: SupportedLaneCount,

    🔬This is a nightly-only experimental API. (portable_simd)

    Splits a slice into a prefix, a middle of aligned SIMD types, and a suffix.

    @@ -878,7 +896,7 @@ that from ever happening, as only power-of-two numbers of lanes are supported. It’s possible that, in the future, those restrictions might be lifted in a way that would make it possible to see panics from this method for something like LANES == 3.

    -
    §Examples
    +
    §Examples
    #![feature(portable_simd)]
 use core::simd::prelude::*;
 
@@ -905,14 +923,14 @@ method for something like LANES == 3.
    
 
 let numbers: Vec<f32> = (1..101).map(|x| x as _).collect();
 assert_eq!(basic_simd_sum(&numbers[1..99]), 4949.0);
    -
    1.82.0 · Source

    pub fn is_sorted(&self) -> bool
    where +

    1.82.0 · Source

    pub fn is_sorted(&self) -> bool
    where T: PartialOrd,

    Checks if the elements of this slice are sorted.

    That is, for each element a and its following element b, a <= b must hold. If the slice yields exactly zero or one element, true is returned.

    Note that if Self::Item is only PartialOrd, but not Ord, the above definition implies that this function returns false if any two consecutive items are not comparable.

    -
    §Examples
    +
    §Examples
    let empty: [i32; 0] = [];
 
 assert!([1, 2, 2, 9].is_sorted());
@@ -920,11 +938,11 @@ comparable.
    
 assert!([0].is_sorted());
 assert!(empty.is_sorted());
 assert!(![0.0, 1.0, f32::NAN].is_sorted());
    -
    1.82.0 · Source

    pub fn is_sorted_by<'a, F>(&'a self, compare: F) -> bool
    where +

    1.82.0 · Source

    pub fn is_sorted_by<'a, F>(&'a self, compare: F) -> bool
    where F: FnMut(&'a T, &'a T) -> bool,

    Checks if the elements of this slice are sorted using the given comparator function.

    Instead of using PartialOrd::partial_cmp, this function uses the given compare function to determine whether two elements are to be considered in sorted order.

    -
    §Examples
    +
    §Examples
    assert!([1, 2, 2, 9].is_sorted_by(|a, b| a <= b));
 assert!(![1, 2, 2, 9].is_sorted_by(|a, b| a < b));
 
@@ -934,16 +952,16 @@ function to determine whether two elements are to be considered in sorted order.
 let empty: [i32; 0] = [];
 assert!(empty.is_sorted_by(|a, b| false));
 assert!(empty.is_sorted_by(|a, b| true));
    -
    1.82.0 · Source

    pub fn is_sorted_by_key<'a, F, K>(&'a self, f: F) -> bool
    where +

    1.82.0 · Source

    pub fn is_sorted_by_key<'a, F, K>(&'a self, f: F) -> bool
    where F: FnMut(&'a T) -> K, K: PartialOrd,

    Checks if the elements of this slice are sorted using the given key extraction function.

    Instead of comparing the slice’s elements directly, this function compares the keys of the elements, as determined by f. Apart from that, it’s equivalent to is_sorted; see its documentation for more information.

    -
    §Examples
    +
    §Examples
    assert!(["c", "bb", "aaa"].is_sorted_by_key(|s| s.len()));
 assert!(![-2i32, -1, 0, 3].is_sorted_by_key(|n| n.abs()));
    -
    1.52.0 · Source

    pub fn partition_point<P>(&self, pred: P) -> usize
    where +

    1.52.0 · Source

    pub fn partition_point<P>(&self, pred: P) -> usize
    where P: FnMut(&T) -> bool,

    Returns the index of the partition point according to the given predicate (the index of the first element of the second partition).

    The slice is assumed to be partitioned according to the given predicate. @@ -954,7 +972,7 @@ For example, [7, 15, 3, 5, 4, 12, 6] is partitioned under the predi

    If this slice is not partitioned, the returned result is unspecified and meaningless, as this method performs a kind of binary search.

    See also binary_search, binary_search_by, and binary_search_by_key.

    -
    §Examples
    +
    §Examples
    let v = [1, 2, 3, 3, 5, 6, 7];
 let i = v.partition_point(|&x| x < 5);
 
@@ -976,7 +994,7 @@ sort order:
    
 let idx = s.partition_point(|&x| x <= num);
 s.insert(idx, num);
 assert_eq!(s, [0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 42, 55]);
    -
    Source

    pub fn element_offset(&self, element: &T) -> Option<usize>

    🔬This is a nightly-only experimental API. (substr_range)

    Returns the index that an element reference points to.

    +
    Source

    pub fn element_offset(&self, element: &T) -> Option<usize>

    🔬This is a nightly-only experimental API. (substr_range)

    Returns the index that an element reference points to.

    Returns None if element does not point to the start of an element within the slice.

    This method is useful for extending slice iterators like slice::split.

    Note that this uses pointer arithmetic and does not compare elements. @@ -984,7 +1002,7 @@ To find the index of an element via comparison, use .iter().position() instead.

    §Panics

    Panics if T is zero-sized.

    -
    §Examples
    +
    §Examples

    Basic usage:

    #![feature(substr_range)]
@@ -1009,7 +1027,7 @@ To find the index of an element via comparison, use
 
 assert_eq!(arr.element_offset(ok_elm), Some(0)); // Points to element 0
 assert_eq!(arr.element_offset(weird_elm), None); // Points between element 0 and 1
    -
    Source

    pub fn subslice_range(&self, subslice: &[T]) -> Option<Range<usize>>

    🔬This is a nightly-only experimental API. (substr_range)

    Returns the range of indices that a subslice points to.

    +
    Source

    pub fn subslice_range(&self, subslice: &[T]) -> Option<Range<usize>>

    🔬This is a nightly-only experimental API. (substr_range)

    Returns the range of indices that a subslice points to.

    Returns None if subslice does not point within the slice or if it is not aligned with the elements in the slice.

    This method does not compare elements. Instead, this method finds the location in the slice that @@ -1020,7 +1038,7 @@ elements in the slice.

    if subslice has a length of zero and points to the beginning or end of another, separate, slice.

    §Panics

    Panics if T is zero-sized.

    -
    §Examples
    +
    §Examples

    Basic usage:

    #![feature(substr_range)]
@@ -1035,13 +1053,13 @@ if subslice has a length of zero and points to the beginning or end
 assert_eq!(iter.next(), Some(1..3));
 assert_eq!(iter.next(), Some(4..4));
 assert_eq!(iter.next(), Some(5..6));
    -
    1.80.0 · Source

    pub fn as_flattened(&self) -> &[T]

    Takes a &[[T; N]], and flattens it to a &[T].

    +
    1.80.0 · Source

    pub fn as_flattened(&self) -> &[T]

    Takes a &[[T; N]], and flattens it to a &[T].

    §Panics

    This panics if the length of the resulting slice would overflow a usize.

    This is only possible when flattening a slice of arrays of zero-sized types, and thus tends to be irrelevant in practice. If size_of::<T>() > 0, this will never panic.

    -
    §Examples
    +
    §Examples
    assert_eq!([[1, 2, 3], [4, 5, 6]].as_flattened(), &[1, 2, 3, 4, 5, 6]);
 
 assert_eq!(
@@ -1057,7 +1075,7 @@ types, and thus tends to be irrelevant in practice. If
    1.79.0 · Source

    pub fn utf8_chunks(&self) -> Utf8Chunks<'_> ⓘ

    Creates an iterator over the contiguous valid UTF-8 ranges of this slice, and the non-UTF-8 fragments in between.

    See the Utf8Chunk type for documentation of the items yielded by this iterator.

    -
    §Examples
    +
    §Examples

    This function formats arbitrary but mostly-UTF-8 bytes into Rust source code in the form of a C-string literal (c"...").

    @@ -1086,14 +1104,14 @@ code in the form of a C-string literal (c"...").

    }
    1.0.0 · Source

    pub fn to_vec(&self) -> Vec<T>
    where T: Clone,

    Copies self into a new Vec.

    -
    §Examples
    +
    §Examples
    let s = [10, 40, 30];
 let x = s.to_vec();
 // Here, `s` and `x` can be modified independently.
    Source

    pub fn to_vec_in<A>(&self, alloc: A) -> Vec<T, A>
    where A: Allocator, T: Clone,

    🔬This is a nightly-only experimental API. (allocator_api)

    Copies self into a new Vec with an allocator.

    -
    §Examples
    +
    §Examples
    #![feature(allocator_api)]
 
 use std::alloc::System;
@@ -1105,7 +1123,7 @@ code in the form of a C-string literal (c"...").
    
     T: Copy,

    Creates a vector by copying a slice n times.

    §Panics

    This function will panic if the capacity would overflow.

    -
    §Examples
    +
    §Examples

    Basic usage:

    assert_eq!([1, 2].repeat(3), vec![1, 2, 1, 2, 1, 2]);
    @@ -1116,7 +1134,7 @@ code in the form of a C-string literal (c"...").

    1.0.0 · Source

    pub fn concat<Item>(&self) -> <[T] as Concat<Item>>::Output ⓘ
    where [T]: Concat<Item>, Item: ?Sized,

    Flattens a slice of T into a single value Self::Output.

    -
    §Examples
    +
    §Examples
    assert_eq!(["hello", "world"].concat(), "helloworld");
 assert_eq!([[1, 2], [3, 4]].concat(), [1, 2, 3, 4]);
    1.3.0 · Source

    pub fn join<Separator>( @@ -1125,7 +1143,7 @@ code in the form of a C-string literal (c"...").

    ) -> <[T] as Join<Separator>>::Output ⓘ
    where [T]: Join<Separator>,

    Flattens a slice of T into a single value Self::Output, placing a given separator between each.

    -
    §Examples
    +
    §Examples
    assert_eq!(["hello", "world"].join(" "), "hello world");
 assert_eq!([[1, 2], [3, 4]].join(&0), [1, 2, 0, 3, 4]);
 assert_eq!([[1, 2], [3, 4]].join(&[0, 0][..]), [1, 2, 0, 0, 3, 4]);
    @@ -1135,7 +1153,7 @@ given separator between each.

    ) -> <[T] as Join<Separator>>::Output ⓘ
    where [T]: Join<Separator>,
    👎Deprecated since 1.3.0: renamed to join

    Flattens a slice of T into a single value Self::Output, placing a given separator between each.

    -
    §Examples
    +
    §Examples
    assert_eq!(["hello", "world"].connect(" "), "hello world");
 assert_eq!([[1, 2], [3, 4]].connect(&0), [1, 2, 0, 3, 4]);
    1.23.0 · Source

    pub fn to_ascii_uppercase(&self) -> Vec<u8> ⓘ

    Returns a vector containing a copy of this slice where each byte @@ -1181,9 +1199,9 @@ the >= operator. 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<P, T> Receiver for P
    where +

    Source§

    impl<P, T> Receiver for P
    where P: Deref<Target = T> + ?Sized, - T: ?Sized,

    Source§

    type Target = T

    🔬This is a nightly-only experimental API. (arbitrary_self_types)
    The target type on which the method may be called.
    Source§

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

    Source§

    type Target = T

    🔬This is a nightly-only experimental API. (arbitrary_self_types)
    The target type on which the method may be called.
    Source§

    impl<T> ToOwned for T
    where T: Clone,

    Source§

    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§

    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>,

    Source§

    type Error = Infallible

    The type returned in the event of a conversion 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 diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.ControlBlock.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.ControlBlock.html index 4636eff35c..3f9bd5e18b 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.ControlBlock.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.ControlBlock.html @@ -1,4 +1,4 @@ -ControlBlock in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot

    Struct ControlBlock

    pub struct ControlBlock {
+ControlBlock in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct ControlBlock
    pub struct ControlBlock {
     pub leaf_version: LeafVersion,
     pub output_key_parity: Parity,
     pub internal_key: XOnlyPublicKey,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.FutureLeafVersion.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.FutureLeafVersion.html
index 32cb9bf542..dcffbeccdc 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.FutureLeafVersion.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.FutureLeafVersion.html
@@ -1,4 +1,4 @@
-FutureLeafVersion in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct FutureLeafVersion
    pub struct FutureLeafVersion(/* private fields */);
    Expand description
    Inner type representing future (non-tapscript) leaf versions. See LeafVersion::Future.
    
+FutureLeafVersion in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct FutureLeafVersion
    pub struct FutureLeafVersion(/* private fields */);
    Expand description
    Inner type representing future (non-tapscript) leaf versions. See LeafVersion::Future.
    
 
    NB: NO PUBLIC CONSTRUCTOR!
 The only way to construct this is by converting u8 to LeafVersion and then extracting it.
    
 
    Implementations§
    §
    impl FutureLeafVersion
    pub fn to_consensus(self) -> u8
    Returns the consensus representation of this FutureLeafVersion.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.LeafNode.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.LeafNode.html
index 063527540f..fb9e5e2a4d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.LeafNode.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.LeafNode.html
@@ -1,4 +1,4 @@
-LeafNode in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct LeafNode
    pub struct LeafNode { /* private fields */ }
    Expand description
    Store information about taproot leaf node.
    
+LeafNode in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct LeafNode
    pub struct LeafNode { /* private fields */ }
    Expand description
    Store information about taproot leaf node.
    
 
    Implementations§
    §
    impl LeafNode
    pub fn new_script(script: ScriptBuf, ver: LeafVersion) -> LeafNode
    Creates an new ScriptLeaf from script and ver and no merkle branch.
    
 
    pub fn new_hidden(hash: TapNodeHash) -> LeafNode
    Creates an new ScriptLeaf from hash and no merkle branch.
    
 
    pub fn depth(&self) -> u8
    Returns the depth of this script leaf in the tap tree.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.LeafNodes.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.LeafNodes.html
index f86673c7f1..e5c708ed31 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.LeafNodes.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.LeafNodes.html
@@ -1,4 +1,4 @@
-LeafNodes in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct LeafNodes
    pub struct LeafNodes<'a> { /* private fields */ }
    Expand description
    Iterator for a taproot script tree, operating in DFS order yielding LeafNode.
    
+LeafNodes in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct LeafNodes
    pub struct LeafNodes<'a> { /* private fields */ }
    Expand description
    Iterator for a taproot script tree, operating in DFS order yielding LeafNode.
    
 
    Returned by NodeInfo::leaf_nodes. This can potentially yield hidden nodes.
    
 
    Trait Implementations§
    §
    impl<'tree> DoubleEndedIterator for LeafNodes<'tree>
    §
    fn next_back(&mut self) -> Option<<LeafNodes<'tree> as Iterator>::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,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.NodeInfo.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.NodeInfo.html
index 0302fe8837..74df85d4dc 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.NodeInfo.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.NodeInfo.html
@@ -1,4 +1,4 @@
-NodeInfo in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct NodeInfo
    pub struct NodeInfo { /* private fields */ }
    Expand description
    Represents the node information in taproot tree. In contrast to TapTree, this
+NodeInfo in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct NodeInfo
    pub struct NodeInfo { /* private fields */ }
    Expand description
    Represents the node information in taproot tree. In contrast to TapTree, this
 is allowed to have hidden leaves as children.
    
 
    Helper type used in merkle tree construction allowing one to build sparse merkle trees. The node
 represents part of the tree that has information about all of its descendants.
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.ScriptLeaf.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.ScriptLeaf.html
index 1427be1c5f..f752c9cec1 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.ScriptLeaf.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.ScriptLeaf.html
@@ -1,4 +1,4 @@
-ScriptLeaf in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct ScriptLeaf
    pub struct ScriptLeaf<'leaf> { /* private fields */ }
    Expand description
    Script leaf node in a taproot tree along with the merkle proof to get this node.
+ScriptLeaf in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct ScriptLeaf
    pub struct ScriptLeaf<'leaf> { /* private fields */ }
    Expand description
    Script leaf node in a taproot tree along with the merkle proof to get this node.
 Returned by TapTree::script_leaves
    
 
    Implementations§
    §
    impl<'leaf> ScriptLeaf<'leaf>
    pub fn version(&self) -> LeafVersion
    Obtains the version of the script leaf.
    
 
    pub fn script(&self) -> &Script
    Obtains a reference to the script inside the leaf.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.ScriptLeaves.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.ScriptLeaves.html
index 7933d2a6ed..4a9e7e9e3c 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.ScriptLeaves.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.ScriptLeaves.html
@@ -1,4 +1,4 @@
-ScriptLeaves in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct ScriptLeaves
    pub struct ScriptLeaves<'tree> { /* private fields */ }
    Expand description
    Iterator for a taproot script tree, operating in DFS order yielding ScriptLeaf.
    
+ScriptLeaves in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct ScriptLeaves
    pub struct ScriptLeaves<'tree> { /* private fields */ }
    Expand description
    Iterator for a taproot script tree, operating in DFS order yielding ScriptLeaf.
    
 
    Returned by TapTree::script_leaves. TapTree does not allow hidden nodes,
 so this iterator is guaranteed to yield all known leaves.
    
 
    Trait Implementations§
    §
    impl<'tree> DoubleEndedIterator for ScriptLeaves<'tree>
    §
    fn next_back(&mut self) -> Option<<ScriptLeaves<'tree> as Iterator>::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
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.Signature.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.Signature.html
index edc8a46ce3..3cb3a987b5 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.Signature.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.Signature.html
@@ -1,4 +1,4 @@
-Signature in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct Signature
    pub struct Signature {
+Signature in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct Signature
    pub struct Signature {
     pub signature: Signature,
     pub sighash_type: TapSighashType,
 }
    Expand description
    A BIP340-341 serialized taproot signature with the corresponding hash type.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapBranchTag.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapBranchTag.html
index c37c7bdf5e..6d47243770 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapBranchTag.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapBranchTag.html
@@ -1,4 +1,4 @@
-TapBranchTag in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct TapBranchTag
    pub struct TapBranchTag;
    Expand description
    The tag used for TapNodeHash
    
+TapBranchTag in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct TapBranchTag
    pub struct TapBranchTag;
    Expand description
    The tag used for TapNodeHash
    
 
    Trait Implementations§
    §
    impl Clone for TapBranchTag
    §
    fn clone(&self) -> TapBranchTag
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    §
    impl Default for TapBranchTag
    §
    fn default() -> TapBranchTag
    Returns the “default value” for a type. Read more
    §
    impl Hash for TapBranchTag
    §
    fn hash<__H>(&self, state: &mut __H)
    where
     __H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · Source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where
     H: Hasher,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapLeafHash.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapLeafHash.html
index 4d61da0696..cdb8226e54 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapLeafHash.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapLeafHash.html
@@ -1,4 +1,4 @@
-TapLeafHash in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct TapLeafHash
    pub struct TapLeafHash(/* private fields */);
    Expand description
    Taproot-tagged hash with tag "TapLeaf".
    
+TapLeafHash in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct TapLeafHash
    pub struct TapLeafHash(/* private fields */);
    Expand description
    Taproot-tagged hash with tag "TapLeaf".
    
 
    This is used for computing tapscript script spend hash.
    
 
    Implementations§
    §
    impl TapLeafHash
    pub fn from_raw_hash(inner: Hash<TapLeafTag>) -> TapLeafHash
    Creates this wrapper type from the inner hash type.
    
 
    pub fn to_raw_hash(self) -> Hash<TapLeafTag>
    Returns the inner hash (sha256, sh256d etc.).
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapLeafTag.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapLeafTag.html
index 9314fc2cd6..1883a88f8a 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapLeafTag.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapLeafTag.html
@@ -1,4 +1,4 @@
-TapLeafTag in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct TapLeafTag
    pub struct TapLeafTag;
    Expand description
    The tag used for TapLeafHash
    
+TapLeafTag in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct TapLeafTag
    pub struct TapLeafTag;
    Expand description
    The tag used for TapLeafHash
    
 
    Trait Implementations§
    §
    impl Clone for TapLeafTag
    §
    fn clone(&self) -> TapLeafTag
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    §
    impl Default for TapLeafTag
    §
    fn default() -> TapLeafTag
    Returns the “default value” for a type. Read more
    §
    impl Hash for TapLeafTag
    §
    fn hash<__H>(&self, state: &mut __H)
    where
     __H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · Source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where
     H: Hasher,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapNodeHash.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapNodeHash.html
index 21090c031a..818a8383d4 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapNodeHash.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapNodeHash.html
@@ -1,4 +1,4 @@
-TapNodeHash in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct TapNodeHash
    pub struct TapNodeHash(/* private fields */);
    Expand description
    Tagged hash used in taproot trees.
    
+TapNodeHash in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct TapNodeHash
    pub struct TapNodeHash(/* private fields */);
    Expand description
    Tagged hash used in taproot trees.
    
 
    See BIP-340 for tagging rules.
    
 
    Implementations§
    §
    impl TapNodeHash
    pub fn from_raw_hash(inner: Hash<TapBranchTag>) -> TapNodeHash
    Creates this wrapper type from the inner hash type.
    
 
    pub fn to_raw_hash(self) -> Hash<TapBranchTag>
    Returns the inner hash (sha256, sh256d etc.).
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapTree.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapTree.html
index 452dd9fda5..478e75ef29 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapTree.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapTree.html
@@ -1,4 +1,4 @@
-TapTree in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct TapTree
    pub struct TapTree(/* private fields */);
    Expand description
    Taproot Tree representing a complete binary tree without any hidden nodes.
    
+TapTree in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct TapTree
    pub struct TapTree(/* private fields */);
    Expand description
    Taproot Tree representing a complete binary tree without any hidden nodes.
    
 
    This is in contrast to NodeInfo, which allows hidden nodes.
 The implementations for Eq, PartialEq and Hash compare the merkle root of the tree
    
 
    Implementations§
    §
    impl TapTree
    pub fn node_info(&self) -> &NodeInfo
    Gets the reference to inner NodeInfo of this tree root.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapTweakHash.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapTweakHash.html
index b923a7a7bf..dd458bcfa4 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapTweakHash.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapTweakHash.html
@@ -1,4 +1,4 @@
-TapTweakHash in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct TapTweakHash
    pub struct TapTweakHash(/* private fields */);
    Expand description
    Taproot-tagged hash with tag "TapTweak".
    
+TapTweakHash in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct TapTweakHash
    pub struct TapTweakHash(/* private fields */);
    Expand description
    Taproot-tagged hash with tag "TapTweak".
    
 
    This hash type is used while computing the tweaked public key.
    
 
    Implementations§
    §
    impl TapTweakHash
    pub fn from_raw_hash(inner: Hash<TapTweakTag>) -> TapTweakHash
    Creates this wrapper type from the inner hash type.
    
 
    pub fn to_raw_hash(self) -> Hash<TapTweakTag>
    Returns the inner hash (sha256, sh256d etc.).
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapTweakTag.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapTweakTag.html
index e7467ebe59..cfe6364272 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapTweakTag.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TapTweakTag.html
@@ -1,4 +1,4 @@
-TapTweakTag in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct TapTweakTag
    pub struct TapTweakTag;
    Expand description
    The tag used for TapTweakHash
    
+TapTweakTag in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct TapTweakTag
    pub struct TapTweakTag;
    Expand description
    The tag used for TapTweakHash
    
 
    Trait Implementations§
    §
    impl Clone for TapTweakTag
    §
    fn clone(&self) -> TapTweakTag
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    §
    impl Default for TapTweakTag
    §
    fn default() -> TapTweakTag
    Returns the “default value” for a type. Read more
    §
    impl Hash for TapTweakTag
    §
    fn hash<__H>(&self, state: &mut __H)
    where
     __H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · Source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where
     H: Hasher,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TaprootBuilder.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TaprootBuilder.html
index b082c613d4..6f064e7785 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TaprootBuilder.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TaprootBuilder.html
@@ -1,4 +1,4 @@
-TaprootBuilder in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct TaprootBuilder
    pub struct TaprootBuilder { /* private fields */ }
    Expand description
    Builder for building taproot iteratively. Users can specify tap leaf or omitted/hidden branches
+TaprootBuilder in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct TaprootBuilder
    pub struct TaprootBuilder { /* private fields */ }
    Expand description
    Builder for building taproot iteratively. Users can specify tap leaf or omitted/hidden branches
 in a depth-first search (DFS) walk order to construct this tree.
    
 
    See Wikipedia for more details on DFS.
    
 
    Implementations§
    §
    impl TaprootBuilder
    pub fn new() -> TaprootBuilder
    Creates a new instance of TaprootBuilder.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TaprootMerkleBranch.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TaprootMerkleBranch.html
index 0d9cf7a05d..1142c767be 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TaprootMerkleBranch.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TaprootMerkleBranch.html
@@ -1,4 +1,4 @@
-TaprootMerkleBranch in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct TaprootMerkleBranch
    pub struct TaprootMerkleBranch(/* private fields */);
    Expand description
    The merkle proof for inclusion of a tree in a taptree hash.
    
+TaprootMerkleBranch in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot
    Struct TaprootMerkleBranch
    pub struct TaprootMerkleBranch(/* private fields */);
    Expand description
    The merkle proof for inclusion of a tree in a taptree hash.
    
 
    Implementations§
    §
    impl TaprootMerkleBranch
    pub fn as_inner(&self) -> &[TapNodeHash]
    👎Deprecated since 0.32.0: Use as_slice instead
    Returns a reference to the slice of hashes.
    
 
    pub fn as_slice(&self) -> &[TapNodeHash]
    Returns a reference to the slice of hashes.
    
 
    pub fn len(&self) -> usize
    Returns the number of nodes in this merkle proof.
    
@@ -16,14 +16,135 @@ if the number of hashes exceeds 128.
    
 
    pub fn serialize(&self) -> Vec<u8> ⓘ
    Serializes self as bytes.
    
 
    pub fn into_inner(self) -> Vec<TapNodeHash>
    👎Deprecated since 0.32.0: Use into_vec instead
    Returns the inner list of hashes.
    
 
    pub fn into_vec(self) -> Vec<TapNodeHash>
    Returns the list of hashes stored in a Vec.
    
-
    Methods from Deref<Target = [TapNodeHash]>§
    Source
    pub fn as_str(&self) -> &str
    🔬This is a nightly-only experimental API. (ascii_char)
    Views this slice of ASCII characters as a UTF-8 str.
    
-
    Source
    pub fn as_bytes(&self) -> &[u8] ⓘ
    🔬This is a nightly-only experimental API. (ascii_char)
    Views this slice of ASCII characters as a slice of u8 bytes.
    
+
    Methods from Deref<Target = [TapNodeHash]>§
    Source
    pub fn write_copy_of_slice(&mut self, src: &[T]) -> &mut [T]
    where
+    T: Copy,
    🔬This is a nightly-only experimental API. (maybe_uninit_write_slice)
    Copies the elements from src to self,
+returning a mutable reference to the now initialized contents of self.
    
+
    If T does not implement Copy, use write_clone_of_slice instead.
    
+
    This is similar to slice::copy_from_slice.
    
+
    §Panics
    
+
    This function will panic if the two slices have different lengths.
    
+
    §Examples
    
+
    #![feature(maybe_uninit_write_slice)]
+use std::mem::MaybeUninit;
+
+let mut dst = [MaybeUninit::uninit(); 32];
+let src = [0; 32];
+
+let init = dst.write_copy_of_slice(&src);
+
+assert_eq!(init, src);
    
+
+
    #![feature(maybe_uninit_write_slice)]
+
+let mut vec = Vec::with_capacity(32);
+let src = [0; 16];
+
+vec.spare_capacity_mut()[..src.len()].write_copy_of_slice(&src);
+
+// SAFETY: we have just copied all the elements of len into the spare capacity
+// the first src.len() elements of the vec are valid now.
+unsafe {
+    vec.set_len(src.len());
+}
+
+assert_eq!(vec, src);
    
+
    Source
    pub fn write_clone_of_slice(&mut self, src: &[T]) -> &mut [T]
    where
+    T: Clone,
    🔬This is a nightly-only experimental API. (maybe_uninit_write_slice)
    Clones the elements from src to self,
+returning a mutable reference to the now initialized contents of self.
+Any already initialized elements will not be dropped.
    
+
    If T implements Copy, use write_copy_of_slice instead.
    
+
    This is similar to slice::clone_from_slice but does not drop existing elements.
    
+
    §Panics
    
+
    This function will panic if the two slices have different lengths, or if the implementation of Clone panics.
    
+
    If there is a panic, the already cloned elements will be dropped.
    
+
    §Examples
    
+
    #![feature(maybe_uninit_write_slice)]
+use std::mem::MaybeUninit;
+
+let mut dst = [const { MaybeUninit::uninit() }; 5];
+let src = ["wibbly", "wobbly", "timey", "wimey", "stuff"].map(|s| s.to_string());
+
+let init = dst.write_clone_of_slice(&src);
+
+assert_eq!(init, src);
+
    
+
+
    #![feature(maybe_uninit_write_slice)]
+
+let mut vec = Vec::with_capacity(32);
+let src = ["rust", "is", "a", "pretty", "cool", "language"].map(|s| s.to_string());
+
+vec.spare_capacity_mut()[..src.len()].write_clone_of_slice(&src);
+
+// SAFETY: we have just cloned all the elements of len into the spare capacity
+// the first src.len() elements of the vec are valid now.
+unsafe {
+    vec.set_len(src.len());
+}
+
+assert_eq!(vec, src);
    
+
    Source
    pub fn as_bytes(&self) -> &[MaybeUninit<u8>]
    🔬This is a nightly-only experimental API. (maybe_uninit_as_bytes)
    Returns the contents of this MaybeUninit as a slice of potentially uninitialized bytes.
    
+
    Note that even if the contents of a MaybeUninit have been initialized, the value may still
+contain padding bytes which are left uninitialized.
    
+
    §Examples
    
+
    #![feature(maybe_uninit_as_bytes, maybe_uninit_write_slice, maybe_uninit_slice)]
+use std::mem::MaybeUninit;
+
+let uninit = [MaybeUninit::new(0x1234u16), MaybeUninit::new(0x5678u16)];
+let uninit_bytes = uninit.as_bytes();
+let bytes = unsafe { uninit_bytes.assume_init_ref() };
+let val1 = u16::from_ne_bytes(bytes[0..2].try_into().unwrap());
+let val2 = u16::from_ne_bytes(bytes[2..4].try_into().unwrap());
+assert_eq!(&[val1, val2], &[0x1234u16, 0x5678u16]);
    
+
    Source
    pub fn as_bytes_mut(&mut self) -> &mut [MaybeUninit<u8>]
    🔬This is a nightly-only experimental API. (maybe_uninit_as_bytes)
    Returns the contents of this MaybeUninit slice as a mutable slice of potentially
+uninitialized bytes.
    
+
    Note that even if the contents of a MaybeUninit have been initialized, the value may still
+contain padding bytes which are left uninitialized.
    
+
    §Examples
    
+
    #![feature(maybe_uninit_as_bytes, maybe_uninit_write_slice, maybe_uninit_slice)]
+use std::mem::MaybeUninit;
+
+let mut uninit = [MaybeUninit::<u16>::uninit(), MaybeUninit::<u16>::uninit()];
+let uninit_bytes = MaybeUninit::slice_as_bytes_mut(&mut uninit);
+uninit_bytes.write_copy_of_slice(&[0x12, 0x34, 0x56, 0x78]);
+let vals = unsafe { uninit.assume_init_ref() };
+if cfg!(target_endian = "little") {
+    assert_eq!(vals, &[0x3412u16, 0x7856u16]);
+} else {
+    assert_eq!(vals, &[0x1234u16, 0x5678u16]);
+}
    
+
    Source
    pub unsafe fn assume_init_drop(&mut self)
    🔬This is a nightly-only experimental API. (maybe_uninit_slice)
    Drops the contained values in place.
    
+
    §Safety
    
+
    It is up to the caller to guarantee that every MaybeUninit<T> in the slice
+really is in an initialized state. Calling this when the content is not yet
+fully initialized causes undefined behavior.
    
+
    On top of that, all additional invariants of the type T must be
+satisfied, as the Drop implementation of T (or its members) may
+rely on this. For example, setting a Vec<T> to an invalid but
+non-null address makes it initialized (under the current implementation;
+this does not constitute a stable guarantee), because the only
+requirement the compiler knows about it is that the data pointer must be
+non-null. Dropping such a Vec<T> however will cause undefined
+behaviour.
    
+
    Source
    pub unsafe fn assume_init_ref(&self) -> &[T]
    🔬This is a nightly-only experimental API. (maybe_uninit_slice)
    Gets a shared reference to the contained value.
    
+
    §Safety
    
+
    Calling this when the content is not yet fully initialized causes undefined
+behavior: it is up to the caller to guarantee that every MaybeUninit<T> in
+the slice really is in an initialized state.
    
+
    Source
    pub unsafe fn assume_init_mut(&mut self) -> &mut [T]
    🔬This is a nightly-only experimental API. (maybe_uninit_slice)
    Gets a mutable (unique) reference to the contained value.
    
+
    §Safety
    
+
    Calling this when the content is not yet fully initialized causes undefined
+behavior: it is up to the caller to guarantee that every MaybeUninit<T> in the
+slice really is in an initialized state. For instance, .assume_init_mut() cannot
+be used to initialize a MaybeUninit slice.
    
+
    Source
    pub fn as_str(&self) -> &str
    🔬This is a nightly-only experimental API. (ascii_char)
    Views this slice of ASCII characters as a UTF-8 str.
    
+
    Source
    pub fn as_bytes(&self) -> &[u8] ⓘ
    🔬This is a nightly-only experimental API. (ascii_char)
    Views this slice of ASCII characters as a slice of u8 bytes.
    
 
    1.23.0 · Source
    pub fn is_ascii(&self) -> bool
    Checks if all bytes in this slice are within the ASCII range.
    
 
    Source
    pub fn as_ascii(&self) -> Option<&[AsciiChar]>
    🔬This is a nightly-only experimental API. (ascii_char)
    If this slice is_ascii, returns it as a slice of
 ASCII characters, otherwise returns None.
    
 
    Source
    pub unsafe fn as_ascii_unchecked(&self) -> &[AsciiChar]
    🔬This is a nightly-only experimental API. (ascii_char)
    Converts this slice of bytes into a slice of ASCII characters,
 without checking whether they’re valid.
    
-
    §Safety
    
+
    §Safety
    
 
    Every byte in the slice must be in 0..=127, or else this is UB.
    
 
    1.23.0 · Source
    pub fn eq_ignore_ascii_case(&self, other: &[u8]) -> bool
    Checks that two slices are an ASCII case-insensitive match.
    
 
    Same as to_ascii_lowercase(a) == to_ascii_lowercase(b),
@@ -40,7 +161,7 @@ but non-ASCII letters are unchanged.
    
 to_ascii_lowercase.
    
 
    1.60.0 · Source
    pub fn escape_ascii(&self) -> EscapeAscii<'_> ⓘ
    Returns an iterator that produces an escaped version of this slice,
 treating it as an ASCII string.
    
-
    §Examples
    
+
    §Examples
    
 
    
 let s = b"0\t\r\n'\"\\\x9d";
 let escaped = s.escape_ascii().to_string();
@@ -48,14 +169,14 @@ treating it as an ASCII string.
    
 
    1.80.0 · Source
    pub fn trim_ascii_start(&self) -> &[u8] ⓘ
    Returns a byte slice with leading ASCII whitespace bytes removed.
    
 
    ‘Whitespace’ refers to the definition used by
 u8::is_ascii_whitespace.
    
-
    §Examples
    
+
    §Examples
    
 
    assert_eq!(b" \t hello world\n".trim_ascii_start(), b"hello world\n");
 assert_eq!(b"  ".trim_ascii_start(), b"");
 assert_eq!(b"".trim_ascii_start(), b"");
    
 
    1.80.0 · Source
    pub fn trim_ascii_end(&self) -> &[u8] ⓘ
    Returns a byte slice with trailing ASCII whitespace bytes removed.
    
 
    ‘Whitespace’ refers to the definition used by
 u8::is_ascii_whitespace.
    
-
    §Examples
    
+
    §Examples
    
 
    assert_eq!(b"\r hello world\n ".trim_ascii_end(), b"\r hello world");
 assert_eq!(b"  ".trim_ascii_end(), b"");
 assert_eq!(b"".trim_ascii_end(), b"");
    
@@ -63,30 +184,30 @@ treating it as an ASCII string.
    
 removed.
    
 
    ‘Whitespace’ refers to the definition used by
 u8::is_ascii_whitespace.
    
-
    §Examples
    
+
    §Examples
    
 
    assert_eq!(b"\r hello world\n ".trim_ascii(), b"hello world");
 assert_eq!(b"  ".trim_ascii(), b"");
 assert_eq!(b"".trim_ascii(), b"");
    
 
    1.0.0 · Source
    pub fn len(&self) -> usize
    Returns the number of elements in the slice.
    
-
    §Examples
    
+
    §Examples
    
 
    let a = [1, 2, 3];
 assert_eq!(a.len(), 3);
    
 
    1.0.0 · Source
    pub fn is_empty(&self) -> bool
    Returns true if the slice has a length of 0.
    
-
    §Examples
    
+
    §Examples
    
 
    let a = [1, 2, 3];
 assert!(!a.is_empty());
 
 let b: &[i32] = &[];
 assert!(b.is_empty());
    
 
    1.0.0 · Source
    pub fn first(&self) -> Option<&T>
    Returns the first element of the slice, or None if it is empty.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = [10, 40, 30];
 assert_eq!(Some(&10), v.first());
 
 let w: &[i32] = &[];
 assert_eq!(None, w.first());
    
 
    1.0.0 · Source
    pub fn first_mut(&mut self) -> Option<&mut T>
    Returns a mutable reference to the first element of the slice, or None if it is empty.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &mut [0, 1, 2];
 
 if let Some(first) = x.first_mut() {
@@ -97,7 +218,7 @@ removed.
    
 let y: &mut [i32] = &mut [];
 assert_eq!(None, y.first_mut());
    
 
    1.5.0 · Source
    pub fn split_first(&self) -> Option<(&T, &[T])>
    Returns the first and all the rest of the elements of the slice, or None if it is empty.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &[0, 1, 2];
 
 if let Some((first, elements)) = x.split_first() {
@@ -105,7 +226,7 @@ removed.
    
     assert_eq!(elements, &[1, 2]);
 }
    
 
    1.5.0 · Source
    pub fn split_first_mut(&mut self) -> Option<(&mut T, &mut [T])>
    Returns the first and all the rest of the elements of the slice, or None if it is empty.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &mut [0, 1, 2];
 
 if let Some((first, elements)) = x.split_first_mut() {
@@ -115,7 +236,7 @@ removed.
    
 }
 assert_eq!(x, &[3, 4, 5]);
    
 
    1.5.0 · Source
    pub fn split_last(&self) -> Option<(&T, &[T])>
    Returns the last and all the rest of the elements of the slice, or None if it is empty.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &[0, 1, 2];
 
 if let Some((last, elements)) = x.split_last() {
@@ -123,7 +244,7 @@ removed.
    
     assert_eq!(elements, &[0, 1]);
 }
    
 
    1.5.0 · Source
    pub fn split_last_mut(&mut self) -> Option<(&mut T, &mut [T])>
    Returns the last and all the rest of the elements of the slice, or None if it is empty.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &mut [0, 1, 2];
 
 if let Some((last, elements)) = x.split_last_mut() {
@@ -133,14 +254,14 @@ removed.
    
 }
 assert_eq!(x, &[4, 5, 3]);
    
 
    1.0.0 · Source
    pub fn last(&self) -> Option<&T>
    Returns the last element of the slice, or None if it is empty.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = [10, 40, 30];
 assert_eq!(Some(&30), v.last());
 
 let w: &[i32] = &[];
 assert_eq!(None, w.last());
    
 
    1.0.0 · Source
    pub fn last_mut(&mut self) -> Option<&mut T>
    Returns a mutable reference to the last item in the slice, or None if it is empty.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &mut [0, 1, 2];
 
 if let Some(last) = x.last_mut() {
@@ -152,7 +273,7 @@ removed.
    
 assert_eq!(None, y.last_mut());
    
 
    1.77.0 · Source
    pub fn first_chunk<const N: usize>(&self) -> Option<&[T; N]>
    Returns an array reference to the first N items in the slice.
    
 
    If the slice is not at least N in length, this will return None.
    
-
    §Examples
    
+
    §Examples
    
 
    let u = [10, 40, 30];
 assert_eq!(Some(&[10, 40]), u.first_chunk::<2>());
 
@@ -163,7 +284,7 @@ removed.
    
 assert_eq!(Some(&[]), w.first_chunk::<0>());
    
 
    1.77.0 · Source
    pub fn first_chunk_mut<const N: usize>(&mut self) -> Option<&mut [T; N]>
    Returns a mutable array reference to the first N items in the slice.
    
 
    If the slice is not at least N in length, this will return None.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &mut [0, 1, 2];
 
 if let Some(first) = x.first_chunk_mut::<2>() {
@@ -175,7 +296,7 @@ removed.
    
 assert_eq!(None, x.first_chunk_mut::<4>());
    
 
    1.77.0 · Source
    pub fn split_first_chunk<const N: usize>(&self) -> Option<(&[T; N], &[T])>
    Returns an array reference to the first N items in the slice and the remaining slice.
    
 
    If the slice is not at least N in length, this will return None.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &[0, 1, 2];
 
 if let Some((first, elements)) = x.split_first_chunk::<2>() {
@@ -189,7 +310,7 @@ removed.
    
 ) -> Option<(&mut [T; N], &mut [T])>
    Returns a mutable array reference to the first N items in the slice and the remaining
 slice.
    
 
    If the slice is not at least N in length, this will return None.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &mut [0, 1, 2];
 
 if let Some((first, elements)) = x.split_first_chunk_mut::<2>() {
@@ -202,7 +323,7 @@ slice.
    
 assert_eq!(None, x.split_first_chunk_mut::<4>());
    
 
    1.77.0 · Source
    pub fn split_last_chunk<const N: usize>(&self) -> Option<(&[T], &[T; N])>
    Returns an array reference to the last N items in the slice and the remaining slice.
    
 
    If the slice is not at least N in length, this will return None.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &[0, 1, 2];
 
 if let Some((elements, last)) = x.split_last_chunk::<2>() {
@@ -216,7 +337,7 @@ slice.
    
 ) -> Option<(&mut [T], &mut [T; N])>
    Returns a mutable array reference to the last N items in the slice and the remaining
 slice.
    
 
    If the slice is not at least N in length, this will return None.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &mut [0, 1, 2];
 
 if let Some((elements, last)) = x.split_last_chunk_mut::<2>() {
@@ -229,7 +350,7 @@ slice.
    
 assert_eq!(None, x.split_last_chunk_mut::<4>());
    
 
    1.77.0 · Source
    pub fn last_chunk<const N: usize>(&self) -> Option<&[T; N]>
    Returns an array reference to the last N items in the slice.
    
 
    If the slice is not at least N in length, this will return None.
    
-
    §Examples
    
+
    §Examples
    
 
    let u = [10, 40, 30];
 assert_eq!(Some(&[40, 30]), u.last_chunk::<2>());
 
@@ -240,7 +361,7 @@ slice.
    
 assert_eq!(Some(&[]), w.last_chunk::<0>());
    
 
    1.77.0 · Source
    pub fn last_chunk_mut<const N: usize>(&mut self) -> Option<&mut [T; N]>
    Returns a mutable array reference to the last N items in the slice.
    
 
    If the slice is not at least N in length, this will return None.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &mut [0, 1, 2];
 
 if let Some(last) = x.last_chunk_mut::<2>() {
@@ -259,7 +380,7 @@ position or None if out of bounds.
 
  • If given a range, returns the subslice corresponding to that range,
 or None if out of bounds.
    • 
 
-
    §Examples
    
+
    §Examples
    
 
    let v = [10, 40, 30];
 assert_eq!(Some(&40), v.get(1));
 assert_eq!(Some(&[10, 40][..]), v.get(0..2));
@@ -271,7 +392,7 @@ or None if out of bounds.
 ) -> Option<&mut <I as SliceIndex<[T]>>::Output>
    where
     I: SliceIndex<[T]>,
    Returns a mutable reference to an element or subslice depending on the
 type of index (see get) or None if the index is out of bounds.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &mut [0, 1, 2];
 
 if let Some(elem) = x.get_mut(1) {
@@ -285,14 +406,14 @@ type of index (see SliceIndex<[T]>,
    Returns a reference to an element or subslice, without doing bounds
 checking.
    
 
    For a safe alternative see get.
    
-
    §Safety
    
+
    §Safety
    
 
    Calling this method with an out-of-bounds index is undefined behavior
 even if the resulting reference is not used.
    
 
    You can think of this like .get(index).unwrap_unchecked().  It’s UB
 to call .get_unchecked(len), even if you immediately convert to a
 pointer.  And it’s UB to call .get_unchecked(..len + 1),
 .get_unchecked(..=len), or similar.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &[1, 2, 4];
 
 unsafe {
@@ -305,14 +426,14 @@ pointer.  And it’s UB to call .get_unchecked(..len + 1),
     I: SliceIndex<[T]>,
    Returns a mutable reference to an element or subslice, without doing
 bounds checking.
    
 
    For a safe alternative see get_mut.
    
-
    §Safety
    
+
    §Safety
    
 
    Calling this method with an out-of-bounds index is undefined behavior
 even if the resulting reference is not used.
    
 
    You can think of this like .get_mut(index).unwrap_unchecked().  It’s
 UB to call .get_unchecked_mut(len), even if you immediately convert
 to a pointer.  And it’s UB to call .get_unchecked_mut(..len + 1),
 .get_unchecked_mut(..=len), or similar.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &mut [1, 2, 4];
 
 unsafe {
@@ -328,7 +449,7 @@ is never written to (except inside an UnsafeCell) using this pointe
 derived from it. If you need to mutate the contents of the slice, use as_mut_ptr.
    
 
    Modifying the container referenced by this slice may cause its buffer
 to be reallocated, which would also make any pointers to it invalid.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &[1, 2, 4];
 let x_ptr = x.as_ptr();
 
@@ -342,7 +463,7 @@ to be reallocated, which would also make any pointers to it invalid.
    
 function returns, or else it will end up dangling.
    
 
    Modifying the container referenced by this slice may cause its buffer
 to be reallocated, which would also make any pointers to it invalid.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &mut [1, 2, 4];
 let x_ptr = x.as_mut_ptr();
 
@@ -394,9 +515,9 @@ common in C++.
    
 
  • a - The index of the first element
    • 
 
  • b - The index of the second element
    • 
 
-
    §Panics
    
+
    §Panics
    
 
    Panics if a or b are out of bounds.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = ["a", "b", "c", "d", "e"];
 v.swap(2, 4);
 assert!(v == ["a", "b", "e", "d", "c"]);
    
@@ -407,10 +528,10 @@ v.swap(2, 4);
 
  • a - The index of the first element
    • 
 
  • b - The index of the second element
    • 
 
-
    §Safety
    
+
    §Safety
    
 
    Calling this method with an out-of-bounds index is undefined behavior.
 The caller has to ensure that a < self.len() and b < self.len().
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_swap_unchecked)]
 
 let mut v = ["a", "b", "c", "d"];
@@ -418,13 +539,13 @@ The caller has to ensure that a < self.len() and b < se
 unsafe { v.swap_unchecked(1, 3) };
 assert!(v == ["a", "d", "c", "b"]);
    
 
    1.0.0 · Source
    pub fn reverse(&mut self)
    Reverses the order of elements in the slice, in place.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [1, 2, 3];
 v.reverse();
 assert!(v == [3, 2, 1]);
    
 
    1.0.0 · Source
    pub fn iter(&self) -> Iter<'_, T> ⓘ
    Returns an iterator over the slice.
    
 
    The iterator yields all items from start to end.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &[1, 2, 4];
 let mut iterator = x.iter();
 
@@ -434,7 +555,7 @@ v.reverse();
 assert_eq!(iterator.next(), None);
    
 
    1.0.0 · Source
    pub fn iter_mut(&mut self) -> IterMut<'_, T> ⓘ
    Returns an iterator that allows modifying each value.
    
 
    The iterator yields all items from start to end.
    
-
    §Examples
    
+
    §Examples
    
 
    let x = &mut [1, 2, 4];
 for elem in x.iter_mut() {
     *elem += 2;
@@ -443,9 +564,9 @@ v.reverse();
 
    1.0.0 · Source
    pub fn windows(&self, size: usize) -> Windows<'_, T> ⓘ
    Returns an iterator over all contiguous windows of length
 size. The windows overlap. If the slice is shorter than
 size, the iterator returns no values.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = ['l', 'o', 'r', 'e', 'm'];
 let mut iter = slice.windows(3);
 assert_eq!(iter.next().unwrap(), &['l', 'o', 'r']);
@@ -478,9 +599,9 @@ slice, then the last chunk will not have length chunk_size.
    
 
    See chunks_exact for a variant of this iterator that returns chunks of always exactly
 chunk_size elements, and rchunks for the same iterator but starting at the end of the
 slice.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = ['l', 'o', 'r', 'e', 'm'];
 let mut iter = slice.chunks(2);
 assert_eq!(iter.next().unwrap(), &['l', 'o']);
@@ -494,9 +615,9 @@ length of the slice, then the last chunk will not have length chunk_sizeSee chunks_exact_mut for a variant of this iterator that returns chunks of always
 exactly chunk_size elements, and rchunks_mut for the same iterator but starting at
 the end of the slice.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = &mut [0, 0, 0, 0, 0];
 let mut count = 1;
 
@@ -516,9 +637,9 @@ from the remainder function of the iterator.
    
 resulting code better than in the case of chunks.
    
 
    See chunks for a variant of this iterator that also returns the remainder as a smaller
 chunk, and rchunks_exact for the same iterator but starting at the end of the slice.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = ['l', 'o', 'r', 'e', 'm'];
 let mut iter = slice.chunks_exact(2);
 assert_eq!(iter.next().unwrap(), &['l', 'o']);
@@ -535,9 +656,9 @@ resulting code better than in the case of chunks_mut for a variant of this iterator that also returns the remainder as a
 smaller chunk, and rchunks_exact_mut for the same iterator but starting at the end of
 the slice.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = &mut [0, 0, 0, 0, 0];
 let mut count = 1;
 
@@ -550,13 +671,13 @@ the slice.
    
 assert_eq!(v, &[1, 1, 2, 2, 0]);
    
 
    Source
    pub unsafe fn as_chunks_unchecked<const N: usize>(&self) -> &[[T; N]]
    🔬This is a nightly-only experimental API. (slice_as_chunks)
    Splits the slice into a slice of N-element arrays,
 assuming that there’s no remainder.
    
-
    §Safety
    
+
    §Safety
    
 
    This may only be called when
    
 
      
 
    • The slice splits exactly into N-element chunks (aka self.len() % N == 0).
      • 
 
    • N != 0.
      • 
 
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_as_chunks)]
 let slice: &[char] = &['l', 'o', 'r', 'e', 'm', '!'];
 let chunks: &[[char; 1]] =
@@ -574,10 +695,10 @@ assuming that there’s no remainder.
    
 
    Source
    pub fn as_chunks<const N: usize>(&self) -> (&[[T; N]], &[T])
    🔬This is a nightly-only experimental API. (slice_as_chunks)
    Splits the slice into a slice of N-element arrays,
 starting at the beginning of the slice,
 and a remainder slice with length strictly less than N.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if N is zero. This check will most probably get changed to a compile time
 error before this method gets stabilized.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_as_chunks)]
 let slice = ['l', 'o', 'r', 'e', 'm'];
 let (chunks, remainder) = slice.as_chunks();
@@ -595,10 +716,10 @@ error before this method gets stabilized.
    
 
    Source
    pub fn as_rchunks<const N: usize>(&self) -> (&[T], &[[T; N]])
    🔬This is a nightly-only experimental API. (slice_as_chunks)
    Splits the slice into a slice of N-element arrays,
 starting at the end of the slice,
 and a remainder slice with length strictly less than N.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if N is zero. This check will most probably get changed to a compile time
 error before this method gets stabilized.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_as_chunks)]
 let slice = ['l', 'o', 'r', 'e', 'm'];
 let (remainder, chunks) = slice.as_rchunks();
@@ -610,10 +731,10 @@ beginning of the slice.
    
 length of the slice, then the last up to N-1 elements will be omitted and can be
 retrieved from the remainder function of the iterator.
    
 
    This method is the const generic equivalent of chunks_exact.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if N is zero. This check will most probably get changed to a compile time
 error before this method gets stabilized.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(array_chunks)]
 let slice = ['l', 'o', 'r', 'e', 'm'];
 let mut iter = slice.array_chunks();
@@ -625,13 +746,13 @@ error before this method gets stabilized.
    
     &mut self,
 ) -> &mut [[T; N]]

    🔬This is a nightly-only experimental API. (slice_as_chunks)

    Splits the slice into a slice of N-element arrays, assuming that there’s no remainder.

    -
    §Safety
    +
    §Safety

    This may only be called when

    • The slice splits exactly into N-element chunks (aka self.len() % N == 0).
    • N != 0.
    -
    §Examples
    +
    §Examples
    #![feature(slice_as_chunks)]
 let slice: &mut [char] = &mut ['l', 'o', 'r', 'e', 'm', '!'];
 let chunks: &mut [[char; 1]] =
@@ -651,10 +772,10 @@ chunks[1] = ['a',
    Source

    pub fn as_chunks_mut<const N: usize>(&mut self) -> (&mut [[T; N]], &mut [T])

    🔬This is a nightly-only experimental API. (slice_as_chunks)

    Splits the slice into a slice of N-element arrays, starting at the beginning of the slice, and a remainder slice with length strictly less than N.

    -
    §Panics
    +
    §Panics

    Panics if N is zero. This check will most probably get changed to a compile time error before this method gets stabilized.

    -
    §Examples
    +
    §Examples
    #![feature(slice_as_chunks)]
 let v = &mut [0, 0, 0, 0, 0];
 let mut count = 1;
@@ -669,10 +790,10 @@ remainder[0] = 9;
    Source

    pub fn as_rchunks_mut<const N: usize>(&mut self) -> (&mut [T], &mut [[T; N]])

    🔬This is a nightly-only experimental API. (slice_as_chunks)

    Splits the slice into a slice of N-element arrays, starting at the end of the slice, and a remainder slice with length strictly less than N.

    -
    §Panics
    +
    §Panics

    Panics if N is zero. This check will most probably get changed to a compile time error before this method gets stabilized.

    -
    §Examples
    +
    §Examples
    #![feature(slice_as_chunks)]
 let v = &mut [0, 0, 0, 0, 0];
 let mut count = 1;
@@ -690,10 +811,10 @@ beginning of the slice.
    
 the length of the slice, then the last up to N-1 elements will be omitted and
 can be retrieved from the into_remainder function of the iterator.
    
 
    This method is the const generic equivalent of chunks_exact_mut.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if N is zero. This check will most probably get changed to a compile time
 error before this method gets stabilized.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(array_chunks)]
 let v = &mut [0, 0, 0, 0, 0];
 let mut count = 1;
@@ -707,10 +828,10 @@ error before this method gets stabilized.
    
 starting at the beginning of the slice.
    
 
    This is the const generic equivalent of windows.
    
 
    If N is greater than the size of the slice, it will return no windows.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if N is zero. This check will most probably get changed to a compile time
 error before this method gets stabilized.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(array_windows)]
 let slice = [0, 1, 2, 3];
 let mut iter = slice.array_windows();
@@ -725,9 +846,9 @@ slice, then the last chunk will not have length chunk_size.
    
 
    See rchunks_exact for a variant of this iterator that returns chunks of always exactly
 chunk_size elements, and chunks for the same iterator but starting at the beginning
 of the slice.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = ['l', 'o', 'r', 'e', 'm'];
 let mut iter = slice.rchunks(2);
 assert_eq!(iter.next().unwrap(), &['e', 'm']);
@@ -741,9 +862,9 @@ length of the slice, then the last chunk will not have length chunk_sizeSee rchunks_exact_mut for a variant of this iterator that returns chunks of always
 exactly chunk_size elements, and chunks_mut for the same iterator but starting at the
 beginning of the slice.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = &mut [0, 0, 0, 0, 0];
 let mut count = 1;
 
@@ -764,9 +885,9 @@ resulting code better than in the case of rchunks for a variant of this iterator that also returns the remainder as a smaller
 chunk, and chunks_exact for the same iterator but starting at the beginning of the
 slice.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = ['l', 'o', 'r', 'e', 'm'];
 let mut iter = slice.rchunks_exact(2);
 assert_eq!(iter.next().unwrap(), &['e', 'm']);
@@ -783,9 +904,9 @@ resulting code better than in the case of rchunks_mut for a variant of this iterator that also returns the remainder as a
 smaller chunk, and chunks_exact_mut for the same iterator but starting at the beginning
 of the slice.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if chunk_size is zero.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = &mut [0, 0, 0, 0, 0];
 let mut count = 1;
 
@@ -802,7 +923,7 @@ of elements using the predicate to separate them.
    
 
    The predicate is called for every pair of consecutive elements,
 meaning that it is called on slice[0] and slice[1],
 followed by slice[1] and slice[2], and so on.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = &[1, 1, 1, 3, 3, 2, 2, 2];
 
 let mut iter = slice.chunk_by(|a, b| a == b);
@@ -827,7 +948,7 @@ runs of elements using the predicate to separate them.
    
 
    The predicate is called for every pair of consecutive elements,
 meaning that it is called on slice[0] and slice[1],
 followed by slice[1] and slice[2], and so on.
    
-
    §Examples
    
+
    §Examples
    
 
    let slice = &mut [1, 1, 1, 3, 3, 2, 2, 2];
 
 let mut iter = slice.chunk_by_mut(|a, b| a == b);
@@ -850,10 +971,10 @@ followed by slice[1] and slice[2], and so on.
    
 
    The first will contain all indices from [0, mid) (excluding
 the index mid itself) and the second will contain all
 indices from [mid, len) (excluding the index len itself).
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if mid > len.  For a non-panicking alternative see
 split_at_checked.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = ['a', 'b', 'c'];
 
 {
@@ -877,10 +998,10 @@ indices from [mid, len) (excluding the index len itsel
 
    The first will contain all indices from [0, mid) (excluding
 the index mid itself) and the second will contain all
 indices from [mid, len) (excluding the index len itself).
    
-
    §Panics
    
+
    §Panics
    
 
    Panics if mid > len.  For a non-panicking alternative see
 split_at_mut_checked.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [1, 0, 3, 0, 5, 6];
 let (left, right) = v.split_at_mut(2);
 assert_eq!(left, [1, 0]);
@@ -893,11 +1014,11 @@ right[1] = 4;
 the index mid itself) and the second will contain all
 indices from [mid, len) (excluding the index len itself).
    
 
    For a safe alternative see split_at.
    
-
    §Safety
    
+
    §Safety
    
 
    Calling this method with an out-of-bounds index is undefined behavior
 even if the resulting reference is not used. The caller has to ensure that
 0 <= mid <= self.len().
    
-
    §Examples
    
+
    §Examples
    
 
    let v = ['a', 'b', 'c'];
 
 unsafe {
@@ -925,11 +1046,11 @@ even if the resulting reference is not used. The caller has to ensure that
 the index mid itself) and the second will contain all
 indices from [mid, len) (excluding the index len itself).
    
 
    For a safe alternative see split_at_mut.
    
-
    §Safety
    
+
    §Safety
    
 
    Calling this method with an out-of-bounds index is undefined behavior
 even if the resulting reference is not used. The caller has to ensure that
 0 <= mid <= self.len().
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [1, 0, 3, 0, 5, 6];
 // scoped to restrict the lifetime of the borrows
 unsafe {
@@ -947,7 +1068,7 @@ indices from [0, mid) (excluding the index mid itself)
 second will contain all indices from [mid, len) (excluding the index
 len itself).
    
 
    Otherwise, if mid > len, returns None.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = [1, -2, 3, -4, 5, -6];
 
 {
@@ -979,7 +1100,7 @@ indices from [0, mid) (excluding the index mid itself)
 second will contain all indices from [mid, len) (excluding the index
 len itself).
    
 
    Otherwise, if mid > len, returns None.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [1, 0, 3, 0, 5, 6];
 
 if let Some((left, right)) = v.split_at_mut_checked(2) {
@@ -994,7 +1115,7 @@ second will contain all indices from [mid, len) (excluding the inde
    1.0.0 · Source

    pub fn split<F>(&self, pred: F) -> Split<'_, T, F> ⓘ
    where F: FnMut(&T) -> bool,

    Returns an iterator over subslices separated by elements that match pred. The matched element is not contained in the subslices.

    -
    §Examples
    +
    §Examples
    let slice = [10, 40, 33, 20];
 let mut iter = slice.split(|num| num % 3 == 0);
 
@@ -1025,7 +1146,7 @@ present between them:
    1.0.0 · Source

    pub fn split_mut<F>(&mut self, pred: F) -> SplitMut<'_, T, F> ⓘ
    where F: FnMut(&T) -> bool,

    Returns an iterator over mutable subslices separated by elements that match pred. The matched element is not contained in the subslices.

    -
    §Examples
    +
    §Examples
    let mut v = [10, 40, 30, 20, 60, 50];
 
 for group in v.split_mut(|num| *num % 3 == 0) {
@@ -1036,7 +1157,7 @@ match pred. The matched element is not contained in the subslices.<
     F: FnMut(&T) -> bool,

    Returns an iterator over subslices separated by elements that match pred. The matched element is contained in the end of the previous subslice as a terminator.

    -
    §Examples
    +
    §Examples
    let slice = [10, 40, 33, 20];
 let mut iter = slice.split_inclusive(|num| num % 3 == 0);
 
@@ -1057,7 +1178,7 @@ That slice will be the last item returned by the iterator.
    
     F: FnMut(&T) -> bool,

    Returns an iterator over mutable subslices separated by elements that match pred. The matched element is contained in the previous subslice as a terminator.

    -
    §Examples
    +
    §Examples
    let mut v = [10, 40, 30, 20, 60, 50];
 
 for group in v.split_inclusive_mut(|num| *num % 3 == 0) {
@@ -1069,7 +1190,7 @@ subslice as a terminator.
    
     F: FnMut(&T) -> bool,

    Returns an iterator over subslices separated by elements that match pred, starting at the end of the slice and working backwards. The matched element is not contained in the subslices.

    -
    §Examples
    +
    §Examples
    let slice = [11, 22, 33, 0, 44, 55];
 let mut iter = slice.rsplit(|num| *num == 0);
 
@@ -1090,7 +1211,7 @@ slice will be the first (or last) item returned by the iterator.
    
     F: FnMut(&T) -> bool,

    Returns an iterator over mutable subslices separated by elements that match pred, starting at the end of the slice and working backwards. The matched element is not contained in the subslices.

    -
    §Examples
    +
    §Examples
    let mut v = [100, 400, 300, 200, 600, 500];
 
 let mut count = 0;
@@ -1105,7 +1226,7 @@ backwards. The matched element is not contained in the subslices.
    
 not contained in the subslices.
    
 
    The last element returned, if any, will contain the remainder of the
 slice.
    
-
    §Examples
    
+
    §Examples
    
 
    Print the slice split once by numbers divisible by 3 (i.e., [10, 40],
 [20, 60, 50]):
    
 
@@ -1120,7 +1241,7 @@ slice.
    
 not contained in the subslices.
    
 
    The last element returned, if any, will contain the remainder of the
 slice.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [10, 40, 30, 20, 60, 50];
 
 for group in v.splitn_mut(2, |num| *num % 3 == 0) {
@@ -1134,7 +1255,7 @@ the slice and works backwards. The matched element is not contained in
 the subslices.
    
 
    The last element returned, if any, will contain the remainder of the
 slice.
    
-
    §Examples
    
+
    §Examples
    
 
    Print the slice split once, starting from the end, by numbers divisible
 by 3 (i.e., [50], [10, 40, 30, 20]):
    
 
@@ -1150,7 +1271,7 @@ the slice and works backwards. The matched element is not contained in
 the subslices.
    
 
    The last element returned, if any, will contain the remainder of the
 slice.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut s = [10, 40, 30, 20, 60, 50];
 
 for group in s.rsplitn_mut(2, |num| *num % 3 == 0) {
@@ -1163,7 +1284,7 @@ predicate.
    
 
    If any matching elements are present in the slice, returns the prefix
 before the match and suffix after. The matching element itself is not
 included. If no elements match, returns None.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_split_once)]
 let s = [1, 2, 3, 2, 4];
 assert_eq!(s.split_once(|&x| x == 2), Some((
@@ -1177,7 +1298,7 @@ predicate.
    
 
    If any matching elements are present in the slice, returns the prefix
 before the match and suffix after. The matching element itself is not
 included. If no elements match, returns None.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_split_once)]
 let s = [1, 2, 3, 2, 4];
 assert_eq!(s.rsplit_once(|&x| x == 2), Some((
@@ -1189,7 +1310,7 @@ included. If no elements match, returns None.
    
     T: PartialEq,
    Returns true if the slice contains an element with the given value.
    
 
    This operation is O(n).
    
 
    Note that if you have a sorted slice, binary_search may be faster.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = [10, 40, 30];
 assert!(v.contains(&30));
 assert!(!v.contains(&50));
    
@@ -1202,7 +1323,7 @@ use iter().any:
    
 assert!(!v.iter().any(|e| e == "hi"));
    1.0.0 · Source

    pub fn starts_with(&self, needle: &[T]) -> bool
    where T: PartialEq,

    Returns true if needle is a prefix of the slice or equal to the slice.

    -
    §Examples
    +
    §Examples
    let v = [10, 40, 30];
 assert!(v.starts_with(&[10]));
 assert!(v.starts_with(&[10, 40]));
@@ -1217,7 +1338,7 @@ use iter().any:
    
 assert!(v.starts_with(&[]));
    1.0.0 · Source

    pub fn ends_with(&self, needle: &[T]) -> bool
    where T: PartialEq,

    Returns true if needle is a suffix of the slice or equal to the slice.

    -
    §Examples
    +
    §Examples
    let v = [10, 40, 30];
 assert!(v.ends_with(&[30]));
 assert!(v.ends_with(&[40, 30]));
@@ -1237,7 +1358,7 @@ use iter().any:
    
 If prefix is empty, simply returns the original slice. If prefix is equal to the
 original slice, returns an empty slice.
    
 
    If the slice does not start with prefix, returns None.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = &[10, 40, 30];
 assert_eq!(v.strip_prefix(&[10]), Some(&[40, 30][..]));
 assert_eq!(v.strip_prefix(&[10, 40]), Some(&[30][..]));
@@ -1255,7 +1376,7 @@ original slice, returns an empty slice.
    
 If suffix is empty, simply returns the original slice. If suffix is equal to the
 original slice, returns an empty slice.
    
 
    If the slice does not end with suffix, returns None.
    
-
    §Examples
    
+
    §Examples
    
 
    let v = &[10, 40, 30];
 assert_eq!(v.strip_suffix(&[30]), Some(&[10, 40][..]));
 assert_eq!(v.strip_suffix(&[40, 30]), Some(&[10][..]));
@@ -1274,7 +1395,7 @@ If the value is not found then binary_search_by, binary_search_by_key, and partition_point.
    
-
    §Examples
    
+
    §Examples
    
 
    Looks up a series of four elements. The first is found, with a
 uniquely determined position; the second and third are not
 found; the fourth could match any position in [1, 4].
    
@@ -1333,7 +1454,7 @@ If the value is not found then binary_search, binary_search_by_key, and partition_point.
    
-
    §Examples
    
+
    §Examples
    
 
    Looks up a series of four elements. The first is found, with a
 uniquely determined position; the second and third are not
 found; the fourth could match any position in [1, 4].
    
@@ -1368,7 +1489,7 @@ If the value is not found then binary_search, binary_search_by, and partition_point.
    
-
    §Examples
    
+
    §Examples
    
 
    Looks up a series of four elements in a slice of pairs sorted by
 their second elements. The first is found, with a uniquely
 determined position; the second and third are not found; the
@@ -1405,9 +1526,9 @@ linear time on fully sorted and reversed inputs. On inputs with k distinct eleme
 expected time to sort the data is O(n * log(k)).
    
 
    It is typically faster than stable sorting, except in a few special cases, e.g., when the
 slice is partially sorted.
    
-
    §Panics
    
+
    §Panics
    
 
    May panic if the implementation of Ord for T does not implement a total order.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [4, -5, 1, -3, 2];
 
 v.sort_unstable();
@@ -1431,9 +1552,9 @@ linear time on fully sorted and reversed inputs. On inputs with k distinct eleme
 expected time to sort the data is O(n * log(k)).
    
 
    It is typically faster than stable sorting, except in a few special cases, e.g., when the
 slice is partially sorted.
    
-
    §Panics
    
+
    §Panics
    
 
    May panic if compare does not implement a total order.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [4, -5, 1, -3, 2];
 v.sort_unstable_by(|a, b| a.cmp(b));
 assert_eq!(v, [-5, -3, 1, 2, 4]);
@@ -1458,9 +1579,9 @@ linear time on fully sorted and reversed inputs. On inputs with k distinct eleme
 expected time to sort the data is O(n * log(k)).
    
 
    It is typically faster than stable sorting, except in a few special cases, e.g., when the
 slice is partially sorted.
    
-
    §Panics
    
+
    §Panics
    
 
    May panic if the implementation of Ord for K does not implement a total order.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [4i32, -5, 1, -3, 2];
 
 v.sort_unstable_by_key(|k| k.abs());
@@ -1485,10 +1606,10 @@ greater-than-or-equal-to the value of the element at index.
    
 and Orson Peters, which is also the basis for sort_unstable. The fallback algorithm is
 Median of Medians using Tukey’s Ninther for pivot selection, which guarantees linear runtime
 for all inputs.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics when index >= len(), meaning it always panics on empty slices.
    
 
    May panic if the implementation of Ord for T does not implement a total order.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [-5i32, 4, 2, -3, 1];
 
 // Find the items less than or equal to the median, the median, and greater than or equal to
@@ -1526,10 +1647,10 @@ less-than-or-equal-to and greater-than-or-equal-to the value of the element at <
 and Orson Peters, which is also the basis for sort_unstable. The fallback algorithm is
 Median of Medians using Tukey’s Ninther for pivot selection, which guarantees linear runtime
 for all inputs.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics when index >= len(), meaning it always panics on empty slices.
    
 
    May panic if compare does not implement a total order.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [-5i32, 4, 2, -3, 1];
 
 // Find the items less than or equal to the median, the median, and greater than or equal to
@@ -1568,10 +1689,10 @@ less-than-or-equal-to and greater-than-or-equal-to the value of the element at <
 and Orson Peters, which is also the basis for sort_unstable. The fallback algorithm is
 Median of Medians using Tukey’s Ninther for pivot selection, which guarantees linear runtime
 for all inputs.
    
-
    §Panics
    
+
    §Panics
    
 
    Panics when index >= len(), meaning it always panics on empty slices.
    
 
    May panic if K: Ord does not implement a total order.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [-5i32, 4, 1, -3, 2];
 
 // Find the items less than or equal to the median, the median, and greater than or equal to
@@ -1594,7 +1715,7 @@ for all inputs.
    
 
    Returns two slices. The first contains no consecutive repeated elements.
 The second contains all the duplicates in no specified order.
    
 
    If the slice is sorted, the first returned slice contains no duplicates.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_partition_dedup)]
 
 let mut slice = [1, 2, 2, 3, 3, 2, 1, 1];
@@ -1613,7 +1734,7 @@ must determine if the elements compare equal. The elements are passed in opposit
 from their order in the slice, so if same_bucket(a, b) returns true, a is moved
 at the end of the slice.
    
 
    If the slice is sorted, the first returned slice contains no duplicates.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_partition_dedup)]
 
 let mut slice = ["foo", "Foo", "BAZ", "Bar", "bar", "baz", "BAZ"];
@@ -1629,7 +1750,7 @@ to the same key.
    
 
    Returns two slices. The first contains no consecutive repeated elements.
 The second contains all the duplicates in no specified order.
    
 
    If the slice is sorted, the first returned slice contains no duplicates.
    
-
    §Examples
    
+
    §Examples
    
 
    #![feature(slice_partition_dedup)]
 
 let mut slice = [10, 20, 21, 30, 30, 20, 11, 13];
@@ -1643,13 +1764,13 @@ slice move to the end while the last self.len() - mid elements move
 the front.
    
 
    After calling rotate_left, the element previously at index mid will
 become the first element in the slice.
    
-
    §Panics
    
+
    §Panics
    
 
    This function will panic if mid is greater than the length of the
 slice. Note that mid == self.len() does not panic and is a no-op
 rotation.
    
 
    §Complexity
    
 
    Takes linear (in self.len()) time.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut a = ['a', 'b', 'c', 'd', 'e', 'f'];
 a.rotate_left(2);
 assert_eq!(a, ['c', 'd', 'e', 'f', 'a', 'b']);
    
@@ -1663,13 +1784,13 @@ elements of the slice move to the end while the last k elements mov
 to the front.
    
 
    After calling rotate_right, the element previously at index
 self.len() - k will become the first element in the slice.
    
-
    §Panics
    
+
    §Panics
    
 
    This function will panic if k is greater than the length of the
 slice. Note that k == self.len() does not panic and is a no-op
 rotation.
    
 
    §Complexity
    
 
    Takes linear (in self.len()) time.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut a = ['a', 'b', 'c', 'd', 'e', 'f'];
 a.rotate_right(2);
 assert_eq!(a, ['e', 'f', 'a', 'b', 'c', 'd']);
    
@@ -1680,7 +1801,7 @@ a[1..5].rotate_right(assert_eq!(a, ['a', 'e', 'b', 'c', 'd', 'f']);
    1.50.0 · Source

    pub fn fill(&mut self, value: T)
    where T: Clone,

    Fills self with elements by cloning value.

    -
    §Examples
    +
    §Examples
    let mut buf = vec![0; 10];
 buf.fill(1);
 assert_eq!(buf, vec![1; 10]);
    @@ -1690,16 +1811,16 @@ buf.fill(1); Clone a given value, use fill. If you want to use the Default trait to generate values, you can pass Default::default as the argument.

    -
    §Examples
    +
    §Examples
    let mut buf = vec![1; 10];
 buf.fill_with(Default::default);
 assert_eq!(buf, vec![0; 10]);
    1.7.0 · Source

    pub fn clone_from_slice(&mut self, src: &[T])
    where T: Clone,

    Copies the elements from src into self.

    The length of src must be the same as self.

    -
    §Panics
    +
    §Panics

    This function will panic if the two slices have different lengths.

    -
    §Examples
    +
    §Examples

    Cloning two elements from a slice into another:

    let src = [1, 2, 3, 4];
@@ -1731,13 +1852,13 @@ sub-slices from a slice:
    
 }
 
 assert_eq!(slice, [4, 5, 3, 4, 5]);
    -
    1.9.0 · Source

    pub fn copy_from_slice(&mut self, src: &[T])
    where +

    1.9.0 · Source

    pub fn copy_from_slice(&mut self, src: &[T])
    where T: Copy,

    Copies all elements from src into self, using a memcpy.

    The length of src must be the same as self.

    If T does not implement Copy, use clone_from_slice.

    -
    §Panics
    +
    §Panics

    This function will panic if the two slices have different lengths.

    -
    §Examples
    +
    §Examples

    Copying two elements from a slice into another:

    let src = [1, 2, 3, 4];
@@ -1769,7 +1890,7 @@ sub-slices from a slice:
    
 }
 
 assert_eq!(slice, [4, 5, 3, 4, 5]);
    -
    1.37.0 · Source

    pub fn copy_within<R>(&mut self, src: R, dest: usize)
    where +

    1.37.0 · Source

    pub fn copy_within<R>(&mut self, src: R, dest: usize)
    where R: RangeBounds<usize>, T: Copy,

    Copies elements from one part of the slice to another part of itself, using a memmove.

    @@ -1777,10 +1898,10 @@ using a memmove.

    index of the range within self to copy to, which will have the same length as src. The two ranges may overlap. The ends of the two ranges must be less than or equal to self.len().

    -
    §Panics
    +
    §Panics

    This function will panic if either range exceeds the end of the slice, or if the end of src is before the start.

    -
    §Examples
    +
    §Examples

    Copying four bytes within a slice:

    let mut bytes = *b"Hello, World!";
@@ -1788,9 +1909,9 @@ or if the end of src is before the start.
    
 bytes.copy_within(1..5, 8);
 
 assert_eq!(&bytes, b"Hello, Wello!");
    -
    1.27.0 · Source

    pub fn swap_with_slice(&mut self, other: &mut [T])

    Swaps all elements in self with those in other.

    +
    1.27.0 · Source

    pub fn swap_with_slice(&mut self, other: &mut [T])

    Swaps all elements in self with those in other.

    The length of other must be the same as self.

    -
    §Panics
    +
    §Panics

    This function will panic if the two slices have different lengths.

    §Example

    Swapping two elements across slices:

    @@ -1820,17 +1941,17 @@ mutable sub-slices from a slice:

    } assert_eq!(slice, [4, 5, 3, 1, 2]);
    -
    1.30.0 · Source

    pub unsafe fn align_to<U>(&self) -> (&[T], &[U], &[T])

    Transmutes the slice to a slice of another type, ensuring alignment of the types is +

    1.30.0 · Source

    pub unsafe fn align_to<U>(&self) -> (&[T], &[U], &[T])

    Transmutes the slice to a slice of another type, ensuring alignment of the types is maintained.

    This method splits the slice into three distinct slices: prefix, correctly aligned middle slice of a new type, and the suffix slice. The middle part will be as big as possible under the given alignment constraint and element size.

    This method has no purpose when either input element T or output element U are zero-sized and will return the original slice without splitting anything.

    -
    §Safety
    +
    §Safety

    This method is essentially a transmute with respect to the elements in the returned middle slice, so all the usual caveats pertaining to transmute::<T, U> also apply here.

    -
    §Examples
    +
    §Examples

    Basic usage:

    unsafe {
@@ -1840,17 +1961,17 @@ middle slice, so all the usual caveats pertaining to transmute::<T, U&g
     // more_efficient_algorithm_for_aligned_shorts(shorts);
     // less_efficient_algorithm_for_bytes(suffix);
 }
    -
    1.30.0 · Source

    pub unsafe fn align_to_mut<U>(&mut self) -> (&mut [T], &mut [U], &mut [T])

    Transmutes the mutable slice to a mutable slice of another type, ensuring alignment of the +

    1.30.0 · Source

    pub unsafe fn align_to_mut<U>(&mut self) -> (&mut [T], &mut [U], &mut [T])

    Transmutes the mutable slice to a mutable slice of another type, ensuring alignment of the types is maintained.

    This method splits the slice into three distinct slices: prefix, correctly aligned middle slice of a new type, and the suffix slice. The middle part will be as big as possible under the given alignment constraint and element size.

    This method has no purpose when either input element T or output element U are zero-sized and will return the original slice without splitting anything.

    -
    §Safety
    +
    §Safety

    This method is essentially a transmute with respect to the elements in the returned middle slice, so all the usual caveats pertaining to transmute::<T, U> also apply here.

    -
    §Examples
    +
    §Examples

    Basic usage:

    unsafe {
@@ -1860,13 +1981,13 @@ middle slice, so all the usual caveats pertaining to transmute::<T, U&g
     // more_efficient_algorithm_for_aligned_shorts(shorts);
     // less_efficient_algorithm_for_bytes(suffix);
 }
    -
    Source

    pub fn as_simd<const LANES: usize>(&self) -> (&[T], &[Simd<T, LANES>], &[T])
    where +

    Source

    pub fn as_simd<const LANES: usize>(&self) -> (&[T], &[Simd<T, LANES>], &[T])
    where Simd<T, LANES>: AsRef<[T; LANES]>, T: SimdElement, LaneCount<LANES>: SupportedLaneCount,

    🔬This is a nightly-only experimental API. (portable_simd)

    Splits a slice into a prefix, a middle of aligned SIMD types, and a suffix.

    This is a safe wrapper around slice::align_to, so inherits the same guarantees as that method.

    -
    §Panics
    +
    §Panics

    This will panic if the size of the SIMD type is different from LANES times that of the scalar.

    At the time of writing, the trait restrictions on Simd<T, LANES> keeps @@ -1874,7 +1995,7 @@ that from ever happening, as only power-of-two numbers of lanes are supported. It’s possible that, in the future, those restrictions might be lifted in a way that would make it possible to see panics from this method for something like LANES == 3.

    -
    §Examples
    +
    §Examples
    #![feature(portable_simd)]
 use core::simd::prelude::*;
 
@@ -1901,7 +2022,7 @@ method for something like LANES == 3.
    
 
 let numbers: Vec<f32> = (1..101).map(|x| x as _).collect();
 assert_eq!(basic_simd_sum(&numbers[1..99]), 4949.0);
    -
    Source

    pub fn as_simd_mut<const LANES: usize>( +

    Source

    pub fn as_simd_mut<const LANES: usize>( &mut self, ) -> (&mut [T], &mut [Simd<T, LANES>], &mut [T])
    where Simd<T, LANES>: AsMut<[T; LANES]>, @@ -1911,7 +2032,7 @@ and a mutable suffix.

    This is a safe wrapper around slice::align_to_mut, so inherits the same guarantees as that method.

    This is the mutable version of slice::as_simd; see that for examples.

    -
    §Panics
    +
    §Panics

    This will panic if the size of the SIMD type is different from LANES times that of the scalar.

    At the time of writing, the trait restrictions on Simd<T, LANES> keeps @@ -1919,14 +2040,14 @@ that from ever happening, as only power-of-two numbers of lanes are supported. It’s possible that, in the future, those restrictions might be lifted in a way that would make it possible to see panics from this method for something like LANES == 3.

    -

    1.82.0 · Source

    pub fn is_sorted(&self) -> bool
    where +

    1.82.0 · Source

    pub fn is_sorted(&self) -> bool
    where T: PartialOrd,

    Checks if the elements of this slice are sorted.

    That is, for each element a and its following element b, a <= b must hold. If the slice yields exactly zero or one element, true is returned.

    Note that if Self::Item is only PartialOrd, but not Ord, the above definition implies that this function returns false if any two consecutive items are not comparable.

    -
    §Examples
    +
    §Examples
    let empty: [i32; 0] = [];
 
 assert!([1, 2, 2, 9].is_sorted());
@@ -1934,11 +2055,11 @@ comparable.
    
 assert!([0].is_sorted());
 assert!(empty.is_sorted());
 assert!(![0.0, 1.0, f32::NAN].is_sorted());
    -
    1.82.0 · Source

    pub fn is_sorted_by<'a, F>(&'a self, compare: F) -> bool
    where +

    1.82.0 · Source

    pub fn is_sorted_by<'a, F>(&'a self, compare: F) -> bool
    where F: FnMut(&'a T, &'a T) -> bool,

    Checks if the elements of this slice are sorted using the given comparator function.

    Instead of using PartialOrd::partial_cmp, this function uses the given compare function to determine whether two elements are to be considered in sorted order.

    -
    §Examples
    +
    §Examples
    assert!([1, 2, 2, 9].is_sorted_by(|a, b| a <= b));
 assert!(![1, 2, 2, 9].is_sorted_by(|a, b| a < b));
 
@@ -1948,16 +2069,16 @@ function to determine whether two elements are to be considered in sorted order.
 let empty: [i32; 0] = [];
 assert!(empty.is_sorted_by(|a, b| false));
 assert!(empty.is_sorted_by(|a, b| true));
    -
    1.82.0 · Source

    pub fn is_sorted_by_key<'a, F, K>(&'a self, f: F) -> bool
    where +

    1.82.0 · Source

    pub fn is_sorted_by_key<'a, F, K>(&'a self, f: F) -> bool
    where F: FnMut(&'a T) -> K, K: PartialOrd,

    Checks if the elements of this slice are sorted using the given key extraction function.

    Instead of comparing the slice’s elements directly, this function compares the keys of the elements, as determined by f. Apart from that, it’s equivalent to is_sorted; see its documentation for more information.

    -
    §Examples
    +
    §Examples
    assert!(["c", "bb", "aaa"].is_sorted_by_key(|s| s.len()));
 assert!(![-2i32, -1, 0, 3].is_sorted_by_key(|n| n.abs()));
    -
    1.52.0 · Source

    pub fn partition_point<P>(&self, pred: P) -> usize
    where +

    1.52.0 · Source

    pub fn partition_point<P>(&self, pred: P) -> usize
    where P: FnMut(&T) -> bool,

    Returns the index of the partition point according to the given predicate (the index of the first element of the second partition).

    The slice is assumed to be partitioned according to the given predicate. @@ -1968,7 +2089,7 @@ For example, [7, 15, 3, 5, 4, 12, 6] is partitioned under the predi

    If this slice is not partitioned, the returned result is unspecified and meaningless, as this method performs a kind of binary search.

    See also binary_search, binary_search_by, and binary_search_by_key.

    -
    §Examples
    +
    §Examples
    let v = [1, 2, 3, 3, 5, 6, 7];
 let i = v.partition_point(|&x| x < 5);
 
@@ -1990,14 +2111,14 @@ sort order:
    
 let idx = s.partition_point(|&x| x <= num);
 s.insert(idx, num);
 assert_eq!(s, [0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 42, 55]);
    -
    Source

    pub fn take<'a, R>(self: &mut &'a [T], range: R) -> Option<&'a [T]>
    where +

    Source

    pub fn take<'a, R>(self: &mut &'a [T], range: R) -> Option<&'a [T]>
    where R: OneSidedRange<usize>,

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the subslice corresponding to the given range and returns a reference to it.

    Returns None and does not modify the slice if the given range is out of bounds.

    Note that this method only accepts one-sided ranges such as 2.. or ..6, but not 2..6.

    -
    §Examples
    +
    §Examples

    Taking the first three elements of a slice:

    #![feature(slice_take)]
@@ -2027,14 +2148,14 @@ range is out of bounds.
    
 assert_eq!(None, slice.take(..=4));
 let expected: &[char] = &['a', 'b', 'c', 'd'];
 assert_eq!(Some(expected), slice.take(..4));
    -
    Source

    pub fn take_mut<'a, R>(self: &mut &'a mut [T], range: R) -> Option<&'a mut [T]>
    where +

    Source

    pub fn take_mut<'a, R>(self: &mut &'a mut [T], range: R) -> Option<&'a mut [T]>
    where R: OneSidedRange<usize>,

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the subslice corresponding to the given range and returns a mutable reference to it.

    Returns None and does not modify the slice if the given range is out of bounds.

    Note that this method only accepts one-sided ranges such as 2.. or ..6, but not 2..6.

    -
    §Examples
    +
    §Examples

    Taking the first three elements of a slice:

    #![feature(slice_take)]
@@ -2064,10 +2185,10 @@ range is out of bounds.
    
 assert_eq!(None, slice.take_mut(..=4));
 let expected: &mut [_] = &mut ['a', 'b', 'c', 'd'];
 assert_eq!(Some(expected), slice.take_mut(..4));
    -
    Source

    pub fn take_first<'a>(self: &mut &'a [T]) -> Option<&'a T>

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the first element of the slice and returns a reference +

    Source

    pub fn take_first<'a>(self: &mut &'a [T]) -> Option<&'a T>

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the first element of the slice and returns a reference to it.

    Returns None if the slice is empty.

    -
    §Examples
    +
    §Examples
    #![feature(slice_take)]
 
 let mut slice: &[_] = &['a', 'b', 'c'];
@@ -2075,10 +2196,10 @@ to it.
    
 
 assert_eq!(slice, &['b', 'c']);
 assert_eq!(first, &'a');
    -
    Source

    pub fn take_first_mut<'a>(self: &mut &'a mut [T]) -> Option<&'a mut T>

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the first element of the slice and returns a mutable +

    Source

    pub fn take_first_mut<'a>(self: &mut &'a mut [T]) -> Option<&'a mut T>

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the first element of the slice and returns a mutable reference to it.

    Returns None if the slice is empty.

    -
    §Examples
    +
    §Examples
    #![feature(slice_take)]
 
 let mut slice: &mut [_] = &mut ['a', 'b', 'c'];
@@ -2087,10 +2208,10 @@ reference to it.
    
 
 assert_eq!(slice, &['b', 'c']);
 assert_eq!(first, &'d');
    -
    Source

    pub fn take_last<'a>(self: &mut &'a [T]) -> Option<&'a T>

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the last element of the slice and returns a reference +

    Source

    pub fn take_last<'a>(self: &mut &'a [T]) -> Option<&'a T>

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the last element of the slice and returns a reference to it.

    Returns None if the slice is empty.

    -
    §Examples
    +
    §Examples
    #![feature(slice_take)]
 
 let mut slice: &[_] = &['a', 'b', 'c'];
@@ -2098,10 +2219,10 @@ to it.
    
 
 assert_eq!(slice, &['a', 'b']);
 assert_eq!(last, &'c');
    -
    Source

    pub fn take_last_mut<'a>(self: &mut &'a mut [T]) -> Option<&'a mut T>

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the last element of the slice and returns a mutable +

    Source

    pub fn take_last_mut<'a>(self: &mut &'a mut [T]) -> Option<&'a mut T>

    🔬This is a nightly-only experimental API. (slice_take)

    Removes the last element of the slice and returns a mutable reference to it.

    Returns None if the slice is empty.

    -
    §Examples
    +
    §Examples
    #![feature(slice_take)]
 
 let mut slice: &mut [_] = &mut ['a', 'b', 'c'];
@@ -2110,7 +2231,7 @@ reference to it.
    
 
 assert_eq!(slice, &['a', 'b']);
 assert_eq!(last, &'d');
    -
    Source

    pub unsafe fn get_many_unchecked_mut<I, const N: usize>( +

    Source

    pub unsafe fn get_many_unchecked_mut<I, const N: usize>( &mut self, indices: [I; N], ) -> [&mut <I as SliceIndex<[T]>>::Output; N]
    where @@ -2121,10 +2242,10 @@ If passed an array of usizes this method gives back an array of mut to single elements, while if passed an array of ranges it gives back an array of mutable references to slices.

    For a safe alternative see get_many_mut.

    -
    §Safety
    +
    §Safety

    Calling this method with overlapping or out-of-bounds indices is undefined behavior even if the resulting references are not used.

    -
    §Examples
    +
    §Examples
    #![feature(get_many_mut)]
 
 let x = &mut [1, 2, 4];
@@ -2151,7 +2272,7 @@ even if the resulting references are not used.
    
     b[0] = 1;
 }
 assert_eq!(x, &[1, 11, 111]);
    -

    Source

    pub fn get_many_mut<I, const N: usize>( +

    Source

    pub fn get_many_mut<I, const N: usize>( &mut self, indices: [I; N], ) -> Result<[&mut <I as SliceIndex<[T]>>::Output; N], GetManyMutError>
    where @@ -2166,7 +2287,7 @@ An empty range is not considered to overlap if it is located at the beginning or the end of another range, but is considered to overlap if it is located in the middle.

    This method does a O(n^2) check to check that there are no overlapping indices, so be careful when passing many indices.

    -
    §Examples
    +
    §Examples
    #![feature(get_many_mut)]
 
 let v = &mut [1, 2, 3];
@@ -2189,15 +2310,15 @@ when passing many indices.
    
     b[0] = 1;
 }
 assert_eq!(v, &[1, 11, 111]);
    -

    Source

    pub fn element_offset(&self, element: &T) -> Option<usize>

    🔬This is a nightly-only experimental API. (substr_range)

    Returns the index that an element reference points to.

    +
    Source

    pub fn element_offset(&self, element: &T) -> Option<usize>

    🔬This is a nightly-only experimental API. (substr_range)

    Returns the index that an element reference points to.

    Returns None if element does not point to the start of an element within the slice.

    This method is useful for extending slice iterators like slice::split.

    Note that this uses pointer arithmetic and does not compare elements. To find the index of an element via comparison, use .iter().position() instead.

    -
    §Panics
    +
    §Panics

    Panics if T is zero-sized.

    -
    §Examples
    +
    §Examples

    Basic usage:

    #![feature(substr_range)]
@@ -2222,7 +2343,7 @@ To find the index of an element via comparison, use
 
 assert_eq!(arr.element_offset(ok_elm), Some(0)); // Points to element 0
 assert_eq!(arr.element_offset(weird_elm), None); // Points between element 0 and 1
    -
    Source

    pub fn subslice_range(&self, subslice: &[T]) -> Option<Range<usize>>

    🔬This is a nightly-only experimental API. (substr_range)

    Returns the range of indices that a subslice points to.

    +
    Source

    pub fn subslice_range(&self, subslice: &[T]) -> Option<Range<usize>>

    🔬This is a nightly-only experimental API. (substr_range)

    Returns the range of indices that a subslice points to.

    Returns None if subslice does not point within the slice or if it is not aligned with the elements in the slice.

    This method does not compare elements. Instead, this method finds the location in the slice that @@ -2231,9 +2352,9 @@ elements in the slice.

    This method is useful for extending slice iterators like slice::split.

    Note that this may return a false positive (either Some(0..0) or Some(self.len()..self.len())) if subslice has a length of zero and points to the beginning or end of another, separate, slice.

    -
    §Panics
    +
    §Panics

    Panics if T is zero-sized.

    -
    §Examples
    +
    §Examples

    Basic usage:

    #![feature(substr_range)]
@@ -2248,13 +2369,13 @@ if subslice has a length of zero and points to the beginning or end
 assert_eq!(iter.next(), Some(1..3));
 assert_eq!(iter.next(), Some(4..4));
 assert_eq!(iter.next(), Some(5..6));
    -
    1.80.0 · Source

    pub fn as_flattened(&self) -> &[T]

    Takes a &[[T; N]], and flattens it to a &[T].

    -
    §Panics
    +
    1.80.0 · Source

    pub fn as_flattened(&self) -> &[T]

    Takes a &[[T; N]], and flattens it to a &[T].

    +
    §Panics

    This panics if the length of the resulting slice would overflow a usize.

    This is only possible when flattening a slice of arrays of zero-sized types, and thus tends to be irrelevant in practice. If size_of::<T>() > 0, this will never panic.

    -
    §Examples
    +
    §Examples
    assert_eq!([[1, 2, 3], [4, 5, 6]].as_flattened(), &[1, 2, 3, 4, 5, 6]);
 
 assert_eq!(
@@ -2267,13 +2388,13 @@ types, and thus tends to be irrelevant in practice. If
 
 let empty_slice_of_arrays: &[[u32; 10]] = &[];
 assert!(empty_slice_of_arrays.as_flattened().is_empty());
    -
    1.80.0 · Source

    pub fn as_flattened_mut(&mut self) -> &mut [T]

    Takes a &mut [[T; N]], and flattens it to a &mut [T].

    -
    §Panics
    +
    1.80.0 · Source

    pub fn as_flattened_mut(&mut self) -> &mut [T]

    Takes a &mut [[T; N]], and flattens it to a &mut [T].

    +
    §Panics

    This panics if the length of the resulting slice would overflow a usize.

    This is only possible when flattening a slice of arrays of zero-sized types, and thus tends to be irrelevant in practice. If size_of::<T>() > 0, this will never panic.

    -
    §Examples
    +
    §Examples
    fn add_5_to_all(slice: &mut [i32]) {
     for i in slice {
         *i += 5;
@@ -2283,12 +2404,12 @@ types, and thus tends to be irrelevant in practice. If
 let mut array = [[1, 2, 3], [4, 5, 6], [7, 8, 9]];
 add_5_to_all(array.as_flattened_mut());
 assert_eq!(array, [[6, 7, 8], [9, 10, 11], [12, 13, 14]]);
    -
    Source

    pub fn sort_floats(&mut self)

    🔬This is a nightly-only experimental API. (sort_floats)

    Sorts the slice of floats.

    +
    Source

    pub fn sort_floats(&mut self)

    🔬This is a nightly-only experimental API. (sort_floats)

    Sorts the slice of floats.

    This sort is in-place (i.e. does not allocate), O(n * log(n)) worst-case, and uses the ordering defined by f32::total_cmp.

    §Current implementation

    This uses the same sorting algorithm as sort_unstable_by.

    -
    §Examples
    +
    §Examples
    #![feature(sort_floats)]
 let mut v = [2.6, -5e-8, f32::NAN, 8.29, f32::INFINITY, -1.0, 0.0, -f32::INFINITY, -0.0];
 
@@ -2296,12 +2417,12 @@ v.sort_floats();
 let sorted = [-f32::INFINITY, -1.0, -5e-8, -0.0, 0.0, 2.6, 8.29, f32::INFINITY, f32::NAN];
 assert_eq!(&v[..8], &sorted[..8]);
 assert!(v[8].is_nan());
    -
    Source

    pub fn sort_floats(&mut self)

    🔬This is a nightly-only experimental API. (sort_floats)

    Sorts the slice of floats.

    +
    Source

    pub fn sort_floats(&mut self)

    🔬This is a nightly-only experimental API. (sort_floats)

    Sorts the slice of floats.

    This sort is in-place (i.e. does not allocate), O(n * log(n)) worst-case, and uses the ordering defined by f64::total_cmp.

    §Current implementation

    This uses the same sorting algorithm as sort_unstable_by.

    -
    §Examples
    +
    §Examples
    #![feature(sort_floats)]
 let mut v = [2.6, -5e-8, f64::NAN, 8.29, f64::INFINITY, -1.0, 0.0, -f64::INFINITY, -0.0];
 
@@ -2312,7 +2433,7 @@ v.sort_floats();
    1.79.0 · Source

    pub fn utf8_chunks(&self) -> Utf8Chunks<'_> ⓘ

    Creates an iterator over the contiguous valid UTF-8 ranges of this slice, and the non-UTF-8 fragments in between.

    See the Utf8Chunk type for documentation of the items yielded by this iterator.

    -
    §Examples
    +
    §Examples

    This function formats arbitrary but mostly-UTF-8 bytes into Rust source code in the form of a C-string literal (c"...").

    @@ -2365,7 +2486,7 @@ with k distinct elements, the expected time to sort the data is O(n

    The auxiliary memory allocation behavior depends on the input length. Short slices are handled without allocation, medium sized slices allocate self.len() and beyond that it clamps at self.len() / 2.

    -
    §Panics
    +
    §Panics

    May panic if the implementation of Ord for T does not implement a total order, or if the Ord implementation itself panics.

    All safe functions on slices preserve the invariant that even if the function panics, all @@ -2374,7 +2495,7 @@ mutability are observed in the input. This ensures that recovery code (for insta of a Drop or following a catch_unwind) will still have access to all the original elements. For instance, if the slice belongs to a Vec, the Vec::drop method will be able to dispose of all contained elements.

    -
    §Examples
    +
    §Examples
    let mut v = [4, -5, 1, -3, 2];
 
 v.sort();
@@ -2397,7 +2518,7 @@ with k distinct elements, the expected time to sort the data is O(n
 
    The auxiliary memory allocation behavior depends on the input length. Short slices are
 handled without allocation, medium sized slices allocate self.len() and beyond that it
 clamps at self.len() / 2.
    
-
    §Panics
    
+
    §Panics
    
 
    May panic if compare does not implement a total order, or if compare itself panics.
    
 
    All safe functions on slices preserve the invariant that even if the function panics, all
 original elements will remain in the slice and any possible modifications via interior
@@ -2405,7 +2526,7 @@ mutability are observed in the input. This ensures that recovery code (for insta
 of a Drop or following a catch_unwind) will still have access to all the original
 elements. For instance, if the slice belongs to a Vec, the Vec::drop method will be able
 to dispose of all contained elements.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [4, -5, 1, -3, 2];
 v.sort_by(|a, b| a.cmp(b));
 assert_eq!(v, [-5, -3, 1, 2, 4]);
@@ -2429,7 +2550,7 @@ with k distinct elements, the expected time to sort the data is O(n
 
    The auxiliary memory allocation behavior depends on the input length. Short slices are
 handled without allocation, medium sized slices allocate self.len() and beyond that it
 clamps at self.len() / 2.
    
-
    §Panics
    
+
    §Panics
    
 
    May panic if the implementation of Ord for K does not implement a total order, or if
 the Ord implementation or the key-function f panics.
    
 
    All safe functions on slices preserve the invariant that even if the function panics, all
@@ -2438,7 +2559,7 @@ mutability are observed in the input. This ensures that recovery code (for insta
 of a Drop or following a catch_unwind) will still have access to all the original
 elements. For instance, if the slice belongs to a Vec, the Vec::drop method will be able
 to dispose of all contained elements.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [4i32, -5, 1, -3, 2];
 
 v.sort_by_key(|k| k.abs());
@@ -2465,7 +2586,7 @@ superscalar out-of-order execution capabilities commonly found in CPUs, to effic
 perform the operation.
    
 
    In the worst case, the algorithm allocates temporary storage in a Vec<(K, usize)> the
 length of the slice.
    
-
    §Panics
    
+
    §Panics
    
 
    May panic if the implementation of Ord for K does not implement a total order, or if
 the Ord implementation panics.
    
 
    All safe functions on slices preserve the invariant that even if the function panics, all
@@ -2474,7 +2595,7 @@ mutability are observed in the input. This ensures that recovery code (for insta
 of a Drop or following a catch_unwind) will still have access to all the original
 elements. For instance, if the slice belongs to a Vec, the Vec::drop method will be able
 to dispose of all contained elements.
    
-
    §Examples
    
+
    §Examples
    
 
    let mut v = [4i32, -5, 1, -3, 2, 10];
 
 // Strings are sorted by lexicographical order.
@@ -2482,14 +2603,14 @@ to dispose of all contained elements.
    
 assert_eq!(v, [-3, -5, 1, 10, 2, 4]);
    1.0.0 · Source

    pub fn to_vec(&self) -> Vec<T>
    where T: Clone,

    Copies self into a new Vec.

    -
    §Examples
    +
    §Examples
    let s = [10, 40, 30];
 let x = s.to_vec();
 // Here, `s` and `x` can be modified independently.
    Source

    pub fn to_vec_in<A>(&self, alloc: A) -> Vec<T, A>
    where A: Allocator, T: Clone,

    🔬This is a nightly-only experimental API. (allocator_api)

    Copies self into a new Vec with an allocator.

    -
    §Examples
    +
    §Examples
    #![feature(allocator_api)]
 
 use std::alloc::System;
@@ -2499,9 +2620,9 @@ to dispose of all contained elements.
    
 // Here, `s` and `x` can be modified independently.
    1.40.0 · Source

    pub fn repeat(&self, n: usize) -> Vec<T>
    where T: Copy,

    Creates a vector by copying a slice n times.

    -
    §Panics
    +
    §Panics

    This function will panic if the capacity would overflow.

    -
    §Examples
    +
    §Examples

    Basic usage:

    assert_eq!([1, 2].repeat(3), vec![1, 2, 1, 2, 1, 2]);
    @@ -2512,7 +2633,7 @@ to dispose of all contained elements.

    1.0.0 · Source

    pub fn concat<Item>(&self) -> <[T] as Concat<Item>>::Output ⓘ
    where [T]: Concat<Item>, Item: ?Sized,

    Flattens a slice of T into a single value Self::Output.

    -
    §Examples
    +
    §Examples
    assert_eq!(["hello", "world"].concat(), "helloworld");
 assert_eq!([[1, 2], [3, 4]].concat(), [1, 2, 3, 4]);
    1.3.0 · Source

    pub fn join<Separator>( @@ -2521,7 +2642,7 @@ to dispose of all contained elements.

    ) -> <[T] as Join<Separator>>::Output ⓘ
    where [T]: Join<Separator>,

    Flattens a slice of T into a single value Self::Output, placing a given separator between each.

    -
    §Examples
    +
    §Examples
    assert_eq!(["hello", "world"].join(" "), "hello world");
 assert_eq!([[1, 2], [3, 4]].join(&0), [1, 2, 0, 3, 4]);
 assert_eq!([[1, 2], [3, 4]].join(&[0, 0][..]), [1, 2, 0, 0, 3, 4]);
    @@ -2531,7 +2652,7 @@ given separator between each.

    ) -> <[T] as Join<Separator>>::Output ⓘ
    where [T]: Join<Separator>,
    👎Deprecated since 1.3.0: renamed to join

    Flattens a slice of T into a single value Self::Output, placing a given separator between each.

    -
    §Examples
    +
    §Examples
    assert_eq!(["hello", "world"].connect(" "), "hello world");
 assert_eq!([[1, 2], [3, 4]].connect(&0), [1, 2, 0, 3, 4]);
    1.23.0 · Source

    pub fn to_ascii_uppercase(&self) -> Vec<u8> ⓘ

    Returns a vector containing a copy of this slice where each byte @@ -2587,9 +2708,9 @@ the >= operator. 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<P, T> Receiver for P
    where +

    Source§

    impl<P, T> Receiver for P
    where P: Deref<Target = T> + ?Sized, - T: ?Sized,

    Source§

    type Target = T

    🔬This is a nightly-only experimental API. (arbitrary_self_types)
    The target type on which the method may be called.
    Source§

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

    Source§

    type Target = T

    🔬This is a nightly-only experimental API. (arbitrary_self_types)
    The target type on which the method may be called.
    Source§

    impl<T> ToOwned for T
    where T: Clone,

    Source§

    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>,

    Source§

    type Error = Infallible

    The type returned in the event of a conversion 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>,

    Source§

    type Error = <U as TryFrom<T>>::Error

    The type returned in the event of a conversion error.
    Source§

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

    Performs the conversion.
    §

    impl<V, T> VZip<V> for T
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TaprootSpendInfo.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TaprootSpendInfo.html index 4a1fffb7b0..f6987a4f2f 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TaprootSpendInfo.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/taproot/struct.TaprootSpendInfo.html @@ -1,4 +1,4 @@ -TaprootSpendInfo in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot

    Struct TaprootSpendInfo

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

    Represents taproot spending information.

    +TaprootSpendInfo in bdk_chain::bitcoin::taproot - Rust
    bdk_chain::bitcoin::taproot

    Struct TaprootSpendInfo

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

    Represents taproot spending information.

    Taproot output corresponds to a combination of a single public key condition (known as the internal key), and zero or more general conditions encoded in scripts organized in the form of a binary tree.

    diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/constant.BIP32_MAX_INDEX.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/constant.BIP32_MAX_INDEX.html index be70a21473..a8e22d75db 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/constant.BIP32_MAX_INDEX.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/constant.BIP32_MAX_INDEX.html @@ -1,2 +1,2 @@ -BIP32_MAX_INDEX in bdk_chain - Rust
    bdk_chain

    Constant BIP32_MAX_INDEX

    Source 
    pub const BIP32_MAX_INDEX: u32 = _; // 2_147_483_647u32
    Expand description

    Maximum BIP32 derivation index.

    +BIP32_MAX_INDEX in bdk_chain - Rust
    bdk_chain

    Constant BIP32_MAX_INDEX

    Source 
    pub const BIP32_MAX_INDEX: u32 = _; // 2_147_483_647u32
    Expand description

    Maximum BIP32 derivation index.

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/enum.CanonicalReason.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/enum.CanonicalReason.html index b260c6e45d..7ca53d17f5 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/enum.CanonicalReason.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/enum.CanonicalReason.html @@ -1,4 +1,4 @@ -CanonicalReason in bdk_chain - Rust
    bdk_chain

    Enum CanonicalReason

    Source 
    pub enum CanonicalReason<A> {
+CanonicalReason in bdk_chain - Rust
    bdk_chain
    Enum CanonicalReason
    Source 
    pub enum CanonicalReason<A> {
     Anchor {
         anchor: A,
         descendant: Option<Txid>,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/enum.ChainPosition.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/enum.ChainPosition.html
index a9ae1d7b4d..f27ef81059 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/enum.ChainPosition.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/enum.ChainPosition.html
@@ -1,4 +1,4 @@
-ChainPosition in bdk_chain - Rust
    bdk_chain
    Enum ChainPosition
    Source 
    pub enum ChainPosition<A> {
+ChainPosition in bdk_chain - Rust
    bdk_chain
    Enum ChainPosition
    Source 
    pub enum ChainPosition<A> {
     Confirmed {
         anchor: A,
         transitively: Option<Txid>,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/enum.ObservedIn.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/enum.ObservedIn.html
index 87e035a7ec..641f090e47 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/enum.ObservedIn.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/enum.ObservedIn.html
@@ -1,4 +1,4 @@
-ObservedIn in bdk_chain - Rust
    bdk_chain
    Enum ObservedIn
    Source 
    pub enum ObservedIn {
+ObservedIn in bdk_chain - Rust
    bdk_chain
    Enum ObservedIn
    Source 
    pub enum ObservedIn {
     Block(u32),
     Mempool(u64),
 }
    Expand description
    Represents when and where a transaction was last observed in.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/index.html
index 3cede43cdf..f7de2d2da3 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/index.html
@@ -1,4 +1,4 @@
-bdk_chain - Rust
    Crate bdk_chain
    Source 
    Expand description
    This crate is a collection of core structures for Bitcoin Dev Kit.
    
+bdk_chain - Rust
    Crate bdk_chain
    Source 
    Expand description
    This crate is a collection of core structures for Bitcoin Dev Kit.
    
 
    The goal of this crate is to give wallets the mechanisms needed to:
    
 
      
 
    1. Figure out what data they need to fetch.
      2. 
@@ -14,6 +14,6 @@ consistently.
 
    2. Data persistence agnostic – bdk_chain does not care where you cache on-chain data, what you
 cache or how you retrieve it from persistent storage.
      3. 
 
    
-
    Re-exports§
    Modules§
    Re-exports§
    Modules§
    Structs§
    • Balance
      Balance, differentiated into various categories.
    • BlockId
      A reference to a block in the canonical chain.
    • CanonicalIter
      Iterates over canonical txs.
    • CheckPoint
      A checkpoint is a node of a reference-counted linked list of BlockIds.
    • CheckPointIter
      Iterates over checkpoints backwards.
    • ConfirmationBlockTime
      Represents the confirmation block and time of a transaction.
    • DescriptorId
      Represents the unique ID of a descriptor.
    • FullTxOut
      A TxOut with as much data as we can retrieve about it
    • Impl
      A wrapper that we use to impl remote traits for types in our crate or dependency crates.
    • SpkIterator
      An iterator for derived script pubkeys.
    • TxPosInBlock
      Set of parameters sufficient to construct an Anchor.
    • TxUpdate
      Data object used to communicate updates about relevant transactions from some chain data source
 to the core model (usually a bdk_chain::TxGraph).
    Enums§
    • CanonicalReason
      The reason why a transaction is canonical.
    • ChainPosition
      Represents the observed position of some chain data.
    • ObservedIn
      Represents when and where a transaction was last observed in.
    Constants§
    Traits§
    • Anchor
      Trait that “anchors” blockchain data to a specific block of height and hash.
    • ChainOracle
      Represents a service that tracks the blockchain.
    • DescriptorExt
      A trait to extend the functionality of a miniscript descriptor.
    • Merge
      Trait that makes an object mergeable.
    Type Aliases§
    • Indexed
      A tuple of keychain index and T representing the indexed value.
    • KeychainIndexed
      A tuple of keychain K, derivation index (u32) and a T associated with them.
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexed_tx_graph/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexed_tx_graph/index.html
index 0e90d6153d..3355526c09 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexed_tx_graph/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexed_tx_graph/index.html
@@ -1,3 +1,3 @@
-bdk_chain::indexed_tx_graph - Rust
    bdk_chain
    Module indexed_tx_graph
    Source 
    Expand description
    Contains the IndexedTxGraph and associated types. Refer to the
+bdk_chain::indexed_tx_graph - Rust
    bdk_chain
    Module indexed_tx_graph
    Source 
    Expand description
    Contains the IndexedTxGraph and associated types. Refer to the
 IndexedTxGraph documentation for more.
    
 
    Structs§
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexed_tx_graph/struct.ChangeSet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexed_tx_graph/struct.ChangeSet.html
index 96522d4a02..cceb59e217 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexed_tx_graph/struct.ChangeSet.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexed_tx_graph/struct.ChangeSet.html
@@ -1,4 +1,4 @@
-ChangeSet in bdk_chain::indexed_tx_graph - Rust
    bdk_chain::indexed_tx_graph
    Struct ChangeSet
    Source 
    pub struct ChangeSet<A, IA> {
+ChangeSet in bdk_chain::indexed_tx_graph - Rust
    bdk_chain::indexed_tx_graph
    Struct ChangeSet
    Source 
    pub struct ChangeSet<A, IA> {
     pub tx_graph: ChangeSet<A>,
     pub indexer: IA,
 }
    Expand description
    Represents changes to an IndexedTxGraph.
    
@@ -7,7 +7,7 @@
 
    Trait Implementations§
    Source§
    impl<A: Clone, IA: Clone> Clone for ChangeSet<A, IA>
    Source§
    fn clone(&self) -> ChangeSet<A, IA>
    Returns a copy of 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, IA: Debug> Debug for ChangeSet<A, IA>
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    Source§
    impl<A, IA: Default> Default for ChangeSet<A, IA>
    Source§
    fn default() -> Self
    Returns the “default value” for a type. Read more
    Source§
    impl<'de, A, IA> Deserialize<'de> for ChangeSet<A, IA>
    where
     A: Ord + Deserialize<'de>,
     IA: Deserialize<'de>,
    Source§
    fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
    where
-    __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    Source§
    impl<A, IA: Default> From<ChangeSet<A>> for ChangeSet<A, IA>
    Source§
    fn from(graph: ChangeSet<A>) -> Self
    Converts to this type from the input type.
    Source§
    impl<A> From<ChangeSet> for ChangeSet<A, ChangeSet>
    Source§
    fn from(indexer: ChangeSet) -> Self
    Converts to this type from the input type.
    Source§
    impl<A: Anchor, IA: Merge> Merge for ChangeSet<A, IA>
    Source§
    fn merge(&mut self, other: Self)
    Merge another object of the same type onto self.
    Source§
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    Source§
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    Source§
    impl<A: PartialEq, IA: PartialEq> PartialEq for ChangeSet<A, IA>
    Source§
    fn eq(&self, other: &ChangeSet<A, IA>) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,
+    __D: Deserializer<'de>,

    Deserialize this value from the given Serde deserializer. Read more
    Source§

    impl<A, IA: Default> From<ChangeSet<A>> for ChangeSet<A, IA>

    Source§

    fn from(graph: ChangeSet<A>) -> Self

    Converts to this type from the input type.
    Source§

    impl<A> From<ChangeSet> for ChangeSet<A, ChangeSet>

    Source§

    fn from(indexer: ChangeSet) -> Self

    Converts to this type from the input type.
    Source§

    impl<A: Anchor, IA: Merge> Merge for ChangeSet<A, IA>

    Source§

    fn merge(&mut self, other: Self)

    Merge another object of the same type onto self.
    Source§

    fn is_empty(&self) -> bool

    Returns whether the structure is considered empty.
    §

    fn take(&mut self) -> Option<Self>

    Take the value, replacing it with the default value.
    Source§

    impl<A: PartialEq, IA: PartialEq> PartialEq for ChangeSet<A, IA>

    Source§

    fn eq(&self, other: &ChangeSet<A, IA>) -> bool

    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§

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

    Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
    Source§

    impl<A, IA> Serialize for ChangeSet<A, IA>
    where A: Ord + Serialize, IA: Serialize,

    Source§

    fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexed_tx_graph/struct.IndexedTxGraph.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexed_tx_graph/struct.IndexedTxGraph.html index db2c8126ff..423dd2739d 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexed_tx_graph/struct.IndexedTxGraph.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexed_tx_graph/struct.IndexedTxGraph.html @@ -1,4 +1,4 @@ -IndexedTxGraph in bdk_chain::indexed_tx_graph - Rust
    bdk_chain::indexed_tx_graph

    Struct IndexedTxGraph

    Source 
    pub struct IndexedTxGraph<A, I> {
+IndexedTxGraph in bdk_chain::indexed_tx_graph - Rust
    bdk_chain::indexed_tx_graph
    Struct IndexedTxGraph
    Source 
    pub struct IndexedTxGraph<A, I> {
     pub index: I,
     /* private fields */
 }
    Expand description
    The IndexedTxGraph combines a TxGraph and an Indexer implementation.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/index.html
index ab384e9891..787e726140 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/index.html
@@ -1,3 +1,3 @@
-bdk_chain::indexer - Rust
    bdk_chain
    Module indexer
    Source 
    Expand description
    Indexer provides utilities for indexing transaction data.
    
+bdk_chain::indexer - Rust
    bdk_chain
    Module indexer
    Source 
    Expand description
    Indexer provides utilities for indexing transaction data.
    
 
    Modules§
    Traits§
    • Indexer
      Utilities for indexing transaction data.
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/constant.DEFAULT_LOOKAHEAD.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/constant.DEFAULT_LOOKAHEAD.html
index 9c70996722..c18d1a23f5 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/constant.DEFAULT_LOOKAHEAD.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/constant.DEFAULT_LOOKAHEAD.html
@@ -1,2 +1,2 @@
-DEFAULT_LOOKAHEAD in bdk_chain::indexer::keychain_txout - Rust
    bdk_chain::indexer::keychain_txout
    Constant DEFAULT_LOOKAHEAD
    Source 
    pub const DEFAULT_LOOKAHEAD: u32 = 25;
    Expand description
    The default lookahead for a KeychainTxOutIndex
    
+DEFAULT_LOOKAHEAD in bdk_chain::indexer::keychain_txout - Rust
    bdk_chain::indexer::keychain_txout
    Constant DEFAULT_LOOKAHEAD
    Source 
    pub const DEFAULT_LOOKAHEAD: u32 = 25;
    Expand description
    The default lookahead for a KeychainTxOutIndex
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/enum.InsertDescriptorError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/enum.InsertDescriptorError.html
index 1fe61ac9c0..9f5b85985f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/enum.InsertDescriptorError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/enum.InsertDescriptorError.html
@@ -1,4 +1,4 @@
-InsertDescriptorError in bdk_chain::indexer::keychain_txout - Rust
    bdk_chain::indexer::keychain_txout
    Enum InsertDescriptorError
    Source 
    pub enum InsertDescriptorError<K> {
+InsertDescriptorError in bdk_chain::indexer::keychain_txout - Rust
    bdk_chain::indexer::keychain_txout
    Enum InsertDescriptorError
    Source 
    pub enum InsertDescriptorError<K> {
     DescriptorAlreadyAssigned {
         descriptor: Descriptor<DescriptorPublicKey>,
         existing_assignment: K,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/index.html
index 74fe0ebc0b..50d2b3296e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/index.html
@@ -1,4 +1,4 @@
-bdk_chain::indexer::keychain_txout - Rust
    bdk_chain::indexer
    Module keychain_txout
    Source 
    Expand description
    KeychainTxOutIndex controls how script pubkeys are revealed for multiple keychains and
+bdk_chain::indexer::keychain_txout - Rust
    bdk_chain::indexer
    Module keychain_txout
    Source 
    Expand description
    KeychainTxOutIndex controls how script pubkeys are revealed for multiple keychains and
 indexes TxOuts with them.
    
 
    Structs§
    Trait Implementations§
    Source§
    impl Clone for ChangeSet
    Source§
    fn clone(&self) -> ChangeSet
    Returns a copy of 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 ChangeSet
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    Source§
    impl Default for ChangeSet
    Source§
    fn default() -> ChangeSet
    Returns the “default value” for a type. Read more
    Source§
    impl<'de> Deserialize<'de> for ChangeSet
    Source§
    fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
    where
     __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    Source§
    impl<A> From<ChangeSet> for ChangeSet<A, ChangeSet>
    Source§
    fn from(indexer: ChangeSet) -> Self
    Converts to this type from the input type.
    Source§
    impl Merge for ChangeSet
    Source§
    fn merge(&mut self, other: Self)
    Merge another ChangeSet into self.
    
 
    Source§
    fn is_empty(&self) -> bool
    Returns whether the changeset are empty.
    
-
    Source§
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    Source§
    impl PartialEq for ChangeSet
    Source§
    fn eq(&self, other: &ChangeSet) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,
+
    §
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    Source§
    impl PartialEq for ChangeSet
    Source§
    fn eq(&self, other: &ChangeSet) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
    Source§
    impl Serialize for ChangeSet
    Source§
    fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
    where
     __S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    Source§
    impl StructuralPartialEq for ChangeSet
    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/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/struct.KeychainTxOutIndex.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/struct.KeychainTxOutIndex.html
index b37ef85ca1..6271ca0502 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/struct.KeychainTxOutIndex.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/struct.KeychainTxOutIndex.html
@@ -1,4 +1,4 @@
-KeychainTxOutIndex in bdk_chain::indexer::keychain_txout - Rust
    bdk_chain::indexer::keychain_txout
    Struct KeychainTxOutIndex
    Source 
    pub struct KeychainTxOutIndex<K> { /* private fields */ }
    Expand description
    KeychainTxOutIndex controls how script pubkeys are revealed for multiple keychains, and
+KeychainTxOutIndex in bdk_chain::indexer::keychain_txout - Rust
    bdk_chain::indexer::keychain_txout
    Struct KeychainTxOutIndex
    Source 
    pub struct KeychainTxOutIndex<K> { /* private fields */ }
    Expand description
    KeychainTxOutIndex controls how script pubkeys are revealed for multiple keychains, and
 indexes TxOuts with them.
    
 
    A single keychain is a chain of script pubkeys derived from a single Descriptor. Keychains
 are identified using the K generic. Script pubkeys are identified by the keychain that they
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/trait.FullScanRequestBuilderExt.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/trait.FullScanRequestBuilderExt.html
index 602341f622..87a1aa0c44 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/trait.FullScanRequestBuilderExt.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/trait.FullScanRequestBuilderExt.html
@@ -1,4 +1,4 @@
-FullScanRequestBuilderExt in bdk_chain::indexer::keychain_txout - Rust
    bdk_chain::indexer::keychain_txout
    Trait FullScanRequestBuilderExt
    Source 
    pub trait FullScanRequestBuilderExt<K> {
+FullScanRequestBuilderExt in bdk_chain::indexer::keychain_txout - Rust
    bdk_chain::indexer::keychain_txout
    Trait FullScanRequestBuilderExt
    Source 
    pub trait FullScanRequestBuilderExt<K> {
     // Required method
     fn spks_from_indexer(self, indexer: &KeychainTxOutIndex<K>) -> Self;
 }
    Expand description
    Trait to extend FullScanRequestBuilder.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/trait.SyncRequestBuilderExt.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/trait.SyncRequestBuilderExt.html
index 85e5439edd..e2a0cfff9c 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/trait.SyncRequestBuilderExt.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/trait.SyncRequestBuilderExt.html
@@ -1,4 +1,4 @@
-SyncRequestBuilderExt in bdk_chain::indexer::keychain_txout - Rust
    bdk_chain::indexer::keychain_txout
    Trait SyncRequestBuilderExt
    Source 
    pub trait SyncRequestBuilderExt<K> {
+SyncRequestBuilderExt in bdk_chain::indexer::keychain_txout - Rust
    bdk_chain::indexer::keychain_txout
    Trait SyncRequestBuilderExt
    Source 
    pub trait SyncRequestBuilderExt<K> {
     // Required methods
     fn revealed_spks_from_indexer<R>(
         self,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/spk_txout/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/spk_txout/index.html
index 1fe6967619..f8437f4857 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/spk_txout/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/spk_txout/index.html
@@ -1,2 +1,2 @@
-bdk_chain::indexer::spk_txout - Rust
    bdk_chain::indexer
    Module spk_txout
    Source 
    Expand description
    SpkTxOutIndex is an index storing TxOuts that have a script pubkey that matches those in a list.
    
+bdk_chain::indexer::spk_txout - Rust
    bdk_chain::indexer
    Module spk_txout
    Source 
    Expand description
    SpkTxOutIndex is an index storing TxOuts that have a script pubkey that matches those in a list.
    
 
    Structs§
    • SpkTxOutIndex
      An index storing TxOuts that have a script pubkey that matches those in a list.
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/spk_txout/struct.SpkTxOutIndex.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/spk_txout/struct.SpkTxOutIndex.html
index a7f2e9a8f5..7768f6cb8c 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/spk_txout/struct.SpkTxOutIndex.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/spk_txout/struct.SpkTxOutIndex.html
@@ -1,4 +1,4 @@
-SpkTxOutIndex in bdk_chain::indexer::spk_txout - Rust
    bdk_chain::indexer::spk_txout
    Struct SpkTxOutIndex
    Source 
    pub struct SpkTxOutIndex<I> { /* private fields */ }
    Expand description
    An index storing TxOuts that have a script pubkey that matches those in a list.
    
+SpkTxOutIndex in bdk_chain::indexer::spk_txout - Rust
    bdk_chain::indexer::spk_txout
    Struct SpkTxOutIndex
    Source 
    pub struct SpkTxOutIndex<I> { /* private fields */ }
    Expand description
    An index storing TxOuts that have a script pubkey that matches those in a list.
    
 
    The basic idea is that you insert script pubkeys you care about into the index with
 insert_spk and then when you call Indexer::index_tx or Indexer::index_txout, the
 index will look at any txouts you pass in and store and index any txouts matching one of its
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/trait.Indexer.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/trait.Indexer.html
index 646ed29f60..ca7200343f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/trait.Indexer.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/trait.Indexer.html
@@ -1,4 +1,4 @@
-Indexer in bdk_chain::indexer - Rust
    bdk_chain::indexer
    Trait Indexer
    Source 
    pub trait Indexer {
+Indexer in bdk_chain::indexer - Rust
    bdk_chain::indexer
    Trait Indexer
    Source 
    pub trait Indexer {
     type ChangeSet;
 
     // Required methods
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/enum.ApplyHeaderError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/enum.ApplyHeaderError.html
index a90c417255..cb341bc27a 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/enum.ApplyHeaderError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/enum.ApplyHeaderError.html
@@ -1,4 +1,4 @@
-ApplyHeaderError in bdk_chain::local_chain - Rust
    bdk_chain::local_chain
    Enum ApplyHeaderError
    Source 
    pub enum ApplyHeaderError {
+ApplyHeaderError in bdk_chain::local_chain - Rust
    bdk_chain::local_chain
    Enum ApplyHeaderError
    Source 
    pub enum ApplyHeaderError {
     InconsistentBlocks,
     CannotConnect(CannotConnectError),
 }
    Expand description
    The error type for LocalChain::apply_header_connected_to.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/index.html
index ce43acd265..4e47335dfb 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/index.html
@@ -1,2 +1,2 @@
-bdk_chain::local_chain - Rust
    bdk_chain
    Module local_chain
    Source 
    Expand description
    The LocalChain is a local implementation of ChainOracle.
    
+bdk_chain::local_chain - Rust
    bdk_chain
    Module local_chain
    Source 
    Expand description
    The LocalChain is a local implementation of ChainOracle.
    
 
    Structs§
    Enums§
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.AlterCheckPointError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.AlterCheckPointError.html
index 21a4cdb9cb..f9223eb0ff 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.AlterCheckPointError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.AlterCheckPointError.html
@@ -1,4 +1,4 @@
-AlterCheckPointError in bdk_chain::local_chain - Rust
    bdk_chain::local_chain
    Struct AlterCheckPointError
    Source 
    pub struct AlterCheckPointError {
+AlterCheckPointError in bdk_chain::local_chain - Rust
    bdk_chain::local_chain
    Struct AlterCheckPointError
    Source 
    pub struct AlterCheckPointError {
     pub height: u32,
     pub original_hash: BlockHash,
     pub update_hash: Option<BlockHash>,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CannotConnectError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CannotConnectError.html
index 4831e32017..d073f90943 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CannotConnectError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CannotConnectError.html
@@ -1,4 +1,4 @@
-CannotConnectError in bdk_chain::local_chain - Rust
    bdk_chain::local_chain
    Struct CannotConnectError
    Source 
    pub struct CannotConnectError {
+CannotConnectError in bdk_chain::local_chain - Rust
    bdk_chain::local_chain
    Struct CannotConnectError
    Source 
    pub struct CannotConnectError {
     pub try_include_height: u32,
 }
    Expand description
    Occurs when an update does not have a common checkpoint with the original chain.
    
 
    Fields§
    §try_include_height: u32
    The suggested checkpoint to include to connect the two chains.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.ChangeSet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.ChangeSet.html
index c8816f6254..006779db62 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.ChangeSet.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.ChangeSet.html
@@ -1,4 +1,4 @@
-ChangeSet in bdk_chain::local_chain - Rust
    bdk_chain::local_chain
    Struct ChangeSet
    Source 
    pub struct ChangeSet {
+ChangeSet in bdk_chain::local_chain - Rust
    bdk_chain::local_chain
    Struct ChangeSet
    Source 
    pub struct ChangeSet {
     pub blocks: BTreeMap<u32, Option<BlockHash>>,
 }
    Expand description
    The ChangeSet represents changes to LocalChain.
    
 
    Fields§
    §blocks: BTreeMap<u32, Option<BlockHash>>
    Changes to the LocalChain blocks.
    
@@ -13,7 +13,7 @@
 
    Source
    pub fn persist_to_sqlite(&self, db_tx: &Transaction<'_>) -> Result<()>
    Persist changeset to the sqlite database.
    
 
    Remember to call Self::init_sqlite_tables beforehand.
    
 
    Trait Implementations§
    Source§
    impl Clone for ChangeSet
    Source§
    fn clone(&self) -> ChangeSet
    Returns a copy of 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 ChangeSet
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    Source§
    impl Default for ChangeSet
    Source§
    fn default() -> ChangeSet
    Returns the “default value” for a type. Read more
    Source§
    impl<'de> Deserialize<'de> for ChangeSet
    Source§
    fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
    where
-    __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    Source§
    impl<B: IntoIterator<Item = (u32, Option<BlockHash>)>> From<B> for ChangeSet
    Source§
    fn from(blocks: B) -> Self
    Converts to this type from the input type.
    Source§
    impl FromIterator<(u32, BlockHash)> for ChangeSet
    Source§
    fn from_iter<T: IntoIterator<Item = (u32, BlockHash)>>(iter: T) -> Self
    Creates a value from an iterator. Read more
    Source§
    impl FromIterator<(u32, Option<BlockHash>)> for ChangeSet
    Source§
    fn from_iter<T: IntoIterator<Item = (u32, Option<BlockHash>)>>(iter: T) -> Self
    Creates a value from an iterator. Read more
    Source§
    impl Merge for ChangeSet
    Source§
    fn merge(&mut self, other: Self)
    Merge another object of the same type onto self.
    Source§
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    Source§
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    Source§
    impl PartialEq for ChangeSet
    Source§
    fn eq(&self, other: &ChangeSet) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,
+    __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    Source§
    impl<B: IntoIterator<Item = (u32, Option<BlockHash>)>> From<B> for ChangeSet
    Source§
    fn from(blocks: B) -> Self
    Converts to this type from the input type.
    Source§
    impl FromIterator<(u32, BlockHash)> for ChangeSet
    Source§
    fn from_iter<T: IntoIterator<Item = (u32, BlockHash)>>(iter: T) -> Self
    Creates a value from an iterator. Read more
    Source§
    impl FromIterator<(u32, Option<BlockHash>)> for ChangeSet
    Source§
    fn from_iter<T: IntoIterator<Item = (u32, Option<BlockHash>)>>(iter: T) -> Self
    Creates a value from an iterator. Read more
    Source§
    impl Merge for ChangeSet
    Source§
    fn merge(&mut self, other: Self)
    Merge another object of the same type onto self.
    Source§
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    §
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    Source§
    impl PartialEq for ChangeSet
    Source§
    fn eq(&self, other: &ChangeSet) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
    Source§
    impl Serialize for ChangeSet
    Source§
    fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
    where
     __S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    Source§
    impl StructuralPartialEq for ChangeSet
    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/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CheckPoint.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CheckPoint.html
index 94337773d0..b46693ba6e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CheckPoint.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CheckPoint.html
@@ -1,8 +1,8 @@
-CheckPoint in bdk_chain::local_chain - Rust
    bdk_chain::local_chain
    Struct CheckPoint
    Source 
    pub struct CheckPoint(/* private fields */);
    Expand description
    A checkpoint is a node of a reference-counted linked list of BlockIds.
    
+CheckPoint in bdk_chain::local_chain - Rust
    bdk_chain::local_chain
    Struct CheckPoint
    pub struct CheckPoint(/* private fields */);
    Expand description
    A checkpoint is a node of a reference-counted linked list of BlockIds.
    
 
    Checkpoints are cheaply cloneable and are useful to find the agreement point between two sparse
 block chains.
    
-
    Implementations§
    Source§
    impl CheckPoint
    Source
    pub fn new(block: BlockId) -> CheckPoint
    Construct a new base block at the front of a linked list.
    
-
    Source
    pub fn from_block_ids(
+
    Implementations§
    §
    impl CheckPoint
    pub fn new(block: BlockId) -> CheckPoint
    Construct a new base block at the front of a linked list.
    
+
    pub fn from_block_ids(
     block_ids: impl IntoIterator<Item = BlockId>,
 ) -> Result<CheckPoint, Option<CheckPoint>>
    Construct a checkpoint from a list of BlockIds in ascending height order.
    
 
    §Errors
    
@@ -13,30 +13,30 @@ block chains.
    
 
  • The blocks iterator contains multiple BlockIds of the same height.
    • 
 
 
    The error type is the last successful checkpoint constructed (if any).
    
-
    Source
    pub fn from_header(header: &Header, height: u32) -> CheckPoint
    Construct a checkpoint from the given header and block height.
    
+
    pub fn from_header(header: &Header, height: u32) -> CheckPoint
    Construct a checkpoint from the given header and block height.
    
 
    If header is of the genesis block, the checkpoint won’t have a prev node. Otherwise,
 we return a checkpoint linked with the previous block.
    
-
    Source
    pub fn push(self, block: BlockId) -> Result<CheckPoint, CheckPoint>
    Puts another checkpoint onto the linked list representing the blockchain.
    
+
    pub fn push(self, block: BlockId) -> Result<CheckPoint, CheckPoint>
    Puts another checkpoint onto the linked list representing the blockchain.
    
 
    Returns an Err(self) if the block you are pushing on is not at a greater height that the one you
 are pushing on to.
    
-
    Source
    pub fn extend(
+
    pub fn extend(
     self,
     blocks: impl IntoIterator<Item = BlockId>,
 ) -> Result<CheckPoint, CheckPoint>
    Extends the checkpoint linked list by a iterator of block ids.
    
 
    Returns an Err(self) if there is block which does not have a greater height than the
 previous one.
    
-
    Source
    pub fn block_id(&self) -> BlockId
    Get the BlockId of the checkpoint.
    
-
    Source
    pub fn height(&self) -> u32
    Get the height of the checkpoint.
    
-
    Source
    pub fn hash(&self) -> BlockHash
    Get the block hash of the checkpoint.
    
-
    Source
    pub fn prev(&self) -> Option<CheckPoint>
    Get the previous checkpoint in the chain
    
-
    Source
    pub fn iter(&self) -> CheckPointIter ⓘ
    Iterate from this checkpoint in descending height.
    
-
    Source
    pub fn get(&self, height: u32) -> Option<CheckPoint>
    Get checkpoint at height.
    
+
    pub fn block_id(&self) -> BlockId
    Get the BlockId of the checkpoint.
    
+
    pub fn height(&self) -> u32
    Get the height of the checkpoint.
    
+
    pub fn hash(&self) -> BlockHash
    Get the block hash of the checkpoint.
    
+
    pub fn prev(&self) -> Option<CheckPoint>
    Get the previous checkpoint in the chain
    
+
    pub fn iter(&self) -> CheckPointIter ⓘ
    Iterate from this checkpoint in descending height.
    
+
    pub fn get(&self, height: u32) -> Option<CheckPoint>
    Get checkpoint at height.
    
 
    Returns None if checkpoint at height does not exist`.
    
-
    Source
    pub fn range<R>(&self, range: R) -> impl Iterator<Item = CheckPoint>
    where
+
    pub fn range<R>(&self, range: R) -> impl Iterator<Item = CheckPoint>
    where
     R: RangeBounds<u32>,
    Iterate checkpoints over a height range.
    
 
    Note that we always iterate checkpoints in reverse height order (iteration starts at tip
 height).
    
-
    Source
    pub fn insert(self, block_id: BlockId) -> CheckPoint
    Inserts block_id at its height within the chain.
    
+
    pub fn insert(self, block_id: BlockId) -> CheckPoint
    Inserts block_id at its height within the chain.
    
 
    The effect of insert depends on whether a height already exists. If it doesn’t the
 block_id we inserted and all pre-existing blocks higher than it will be re-inserted after
 it. If the height already existed and has a conflicting block hash then it will be purged
@@ -44,8 +44,8 @@ along with all block following it. The returned chain will have a tip of the block_id was already present then this just returns self.
    
 
    §Panics
    
 
    This panics if called with a genesis block that differs from that of self.
    
-
    Source
    pub fn eq_ptr(&self, other: &CheckPoint) -> bool
    This method tests for self and other to have equal internal pointers.
    
-
    Trait Implementations§
    Source§
    impl Clone for CheckPoint
    Source§
    fn clone(&self) -> CheckPoint
    Returns a copy of 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 CheckPoint
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    Source§
    impl IntoIterator for CheckPoint
    Source§
    type Item = CheckPoint
    The type of the elements being iterated over.
    Source§
    type IntoIter = CheckPointIter
    Which kind of iterator are we turning this into?
    Source§
    fn into_iter(self) -> <CheckPoint as IntoIterator>::IntoIter
    Creates an iterator from a value. Read more
    Source§
    impl PartialEq for CheckPoint
    Source§
    fn eq(&self, other: &CheckPoint) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,
+
    pub fn eq_ptr(&self, other: &CheckPoint) -> bool
    This method tests for self and other to have equal internal pointers.
    
+
    Trait Implementations§
    §
    impl Clone for CheckPoint
    §
    fn clone(&self) -> CheckPoint
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    §
    impl Debug for CheckPoint
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    §
    impl IntoIterator for CheckPoint
    §
    type Item = CheckPoint
    The type of the elements being iterated over.
    §
    type IntoIter = CheckPointIter
    Which kind of iterator are we turning this into?
    §
    fn into_iter(self) -> <CheckPoint as IntoIterator>::IntoIter
    Creates an iterator from a value. Read more
    §
    impl PartialEq for CheckPoint
    §
    fn eq(&self, other: &CheckPoint) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
    Auto Trait Implementations§
    Blanket Implementations§
    Source§
    impl<T> Any for T
    where
     T: 'static + ?Sized,
    Source§
    fn type_id(&self) -> TypeId
    Gets the TypeId of self. Read more
    Source§
    impl<T> Borrow<T> for T
    where
     T: ?Sized,
    Source§
    fn borrow(&self) -> &T
    Immutably borrows from an owned value. Read more
    Source§
    impl<T> BorrowMut<T> for T
    where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CheckPointIter.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CheckPointIter.html
index 16f594cfad..ff24db7a52 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CheckPointIter.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CheckPointIter.html
@@ -1,5 +1,5 @@
-CheckPointIter in bdk_chain::local_chain - Rust
    bdk_chain::local_chain
    Struct CheckPointIter
    Source 
    pub struct CheckPointIter { /* private fields */ }
    Expand description
    Iterates over checkpoints backwards.
    
-
    Trait Implementations§
    Source§
    impl Iterator for CheckPointIter
    Source§
    type Item = CheckPoint
    The type of the elements being iterated over.
    Source§
    fn next(&mut self) -> Option<<CheckPointIter as Iterator>::Item>
    Advances the iterator and returns the next value. Read more
    Source§
    fn next_chunk<const N: usize>(
+CheckPointIter in bdk_chain::local_chain - Rust
    bdk_chain::local_chain
    Struct CheckPointIter
    pub struct CheckPointIter { /* private fields */ }
    Expand description
    Iterates over checkpoints backwards.
    
+
    Trait Implementations§
    §
    impl Iterator for CheckPointIter
    §
    type Item = CheckPoint
    The type of the elements being iterated over.
    §
    fn next(&mut self) -> Option<<CheckPointIter as Iterator>::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/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.LocalChain.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.LocalChain.html
index 5f6f271024..4f59ada503 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.LocalChain.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.LocalChain.html
@@ -1,4 +1,4 @@
-LocalChain in bdk_chain::local_chain - Rust
    bdk_chain::local_chain
    Struct LocalChain
    Source 
    pub struct LocalChain { /* private fields */ }
    Expand description
    This is a local implementation of ChainOracle.
    
+LocalChain in bdk_chain::local_chain - Rust
    bdk_chain::local_chain
    Struct LocalChain
    Source 
    pub struct LocalChain { /* private fields */ }
    Expand description
    This is a local implementation of ChainOracle.
    
 
    Implementations§
    Source§
    impl LocalChain
    Source
    pub fn genesis_hash(&self) -> BlockHash
    Get the genesis hash.
    
 
    Source
    pub fn from_genesis_hash(hash: BlockHash) -> (Self, ChangeSet)
    Construct LocalChain from genesis hash.
    
 
    Source
    pub fn from_changeset(changeset: ChangeSet) -> Result<Self, MissingGenesisError>
    Construct a LocalChain from an initial changeset.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.MissingGenesisError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.MissingGenesisError.html
index cd5c796400..9ad8805d3f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.MissingGenesisError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.MissingGenesisError.html
@@ -1,4 +1,4 @@
-MissingGenesisError in bdk_chain::local_chain - Rust
    bdk_chain::local_chain
    Struct MissingGenesisError
    Source 
    pub struct MissingGenesisError;
    Expand description
    An error which occurs when a LocalChain is constructed without a genesis checkpoint.
    
+MissingGenesisError in bdk_chain::local_chain - Rust
    bdk_chain::local_chain
    Struct MissingGenesisError
    Source 
    pub struct MissingGenesisError;
    Expand description
    An error which occurs when a LocalChain is constructed without a genesis checkpoint.
    
 
    Trait Implementations§
    Source§
    impl Clone for MissingGenesisError
    Source§
    fn clone(&self) -> MissingGenesisError
    Returns a copy of 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 MissingGenesisError
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    Source§
    impl Display for MissingGenesisError
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    Source§
    impl Error for MissingGenesisError
    1.30.0 · Source§
    fn source(&self) -> Option<&(dyn Error + 'static)>
    Returns 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 MissingGenesisError
    Source§
    fn eq(&self, other: &MissingGenesisError) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
    Source§
    impl StructuralPartialEq for MissingGenesisError
    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/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/rusqlite_impl/constant.SCHEMAS_TABLE_NAME.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/rusqlite_impl/constant.SCHEMAS_TABLE_NAME.html
index aba587e17a..dc433e8265 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/rusqlite_impl/constant.SCHEMAS_TABLE_NAME.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/rusqlite_impl/constant.SCHEMAS_TABLE_NAME.html
@@ -1,2 +1,2 @@
-SCHEMAS_TABLE_NAME in bdk_chain::rusqlite_impl - Rust
    bdk_chain::rusqlite_impl
    Constant SCHEMAS_TABLE_NAME
    Source 
    pub const SCHEMAS_TABLE_NAME: &str = "bdk_schemas";
    Expand description
    Table name for schemas.
    
+SCHEMAS_TABLE_NAME in bdk_chain::rusqlite_impl - Rust
    bdk_chain::rusqlite_impl
    Constant SCHEMAS_TABLE_NAME
    Source 
    pub const SCHEMAS_TABLE_NAME: &str = "bdk_schemas";
    Expand description
    Table name for schemas.
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/rusqlite_impl/fn.migrate_schema.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/rusqlite_impl/fn.migrate_schema.html
index 41c26c3ea1..3c8c981c18 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/rusqlite_impl/fn.migrate_schema.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/rusqlite_impl/fn.migrate_schema.html
@@ -1,4 +1,4 @@
-migrate_schema in bdk_chain::rusqlite_impl - Rust
    bdk_chain::rusqlite_impl
    Function migrate_schema
    Source 
    pub fn migrate_schema(
+migrate_schema in bdk_chain::rusqlite_impl - Rust
    bdk_chain::rusqlite_impl
    Function migrate_schema
    Source 
    pub fn migrate_schema(
     db_tx: &Transaction<'_>,
     schema_name: &str,
     versioned_scripts: &[&str],
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/rusqlite_impl/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/rusqlite_impl/index.html
index 25dd0603e1..3bdef66a77 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/rusqlite_impl/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/rusqlite_impl/index.html
@@ -1,2 +1,2 @@
-bdk_chain::rusqlite_impl - Rust
    bdk_chain
    Module rusqlite_impl
    Source 
    Expand description
    Support for persisting bdk_chain structures to SQLite using [rusqlite].
    
+bdk_chain::rusqlite_impl - Rust
    bdk_chain
    Module rusqlite_impl
    Source 
    Expand description
    Support for persisting bdk_chain structures to SQLite using [rusqlite].
    
 
    Constants§
    Functions§
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/enum.SyncItem.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/enum.SyncItem.html
index 5882203914..109059cd55 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/enum.SyncItem.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/enum.SyncItem.html
@@ -1,4 +1,4 @@
-SyncItem in bdk_chain::spk_client - Rust
    bdk_chain::spk_client
    Enum SyncItem
    Source 
    pub enum SyncItem<'i, I> {
+SyncItem in bdk_chain::spk_client - Rust
    bdk_chain::spk_client
    Enum SyncItem
    pub enum SyncItem<'i, I> {
     Spk(I, &'i Script),
     Txid(Txid),
     OutPoint(OutPoint),
@@ -6,26 +6,26 @@
 
    Variants§
    §
    Spk(I, &'i Script)
    Script pubkey sync item.
    
 
    §
    Txid(Txid)
    Txid sync item.
    
 
    §
    OutPoint(OutPoint)
    Outpoint sync item.
    
-
    Trait Implementations§
    Source§
    impl<'i, I> Clone for SyncItem<'i, I>
    where
-    I: Clone,
    Source§
    fn clone(&self) -> SyncItem<'i, 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, I> Debug for SyncItem<'i, I>
    where
-    I: Debug,
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    Source§
    impl<I> Display for SyncItem<'_, I>
    where
-    I: Debug + Any,
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    Source§
    impl<'i, I> Hash for SyncItem<'i, I>
    where
-    I: Hash,
    Source§
    fn hash<__H>(&self, state: &mut __H)
    where
+
    Trait Implementations§
    §
    impl<'i, I> Clone for SyncItem<'i, I>
    where
+    I: Clone,
    §
    fn clone(&self) -> SyncItem<'i, 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
    §
    impl<'i, I> Debug for SyncItem<'i, I>
    where
+    I: Debug,
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    §
    impl<I> Display for SyncItem<'_, I>
    where
+    I: Debug + Any,
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    §
    impl<'i, I> Hash for SyncItem<'i, I>
    where
+    I: Hash,
    §
    fn hash<__H>(&self, state: &mut __H)
    where
     __H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · Source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where
     H: Hasher,
-    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    Source§
    impl<'i, I> Ord for SyncItem<'i, I>
    where
-    I: Ord,
    Source§
    fn cmp(&self, other: &SyncItem<'i, I>) -> 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
    §
    impl<'i, I> Ord for SyncItem<'i, I>
    where
+    I: Ord,
    §
    fn cmp(&self, other: &SyncItem<'i, I>) -> 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,
    Restrict a value to a certain interval. Read more
    Source§
    impl<'i, I> PartialEq for SyncItem<'i, I>
    where
-    I: PartialEq,
    Source§
    fn eq(&self, other: &SyncItem<'i, I>) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,
-and should not be overridden without very good reason.
    Source§
    impl<'i, I> PartialOrd for SyncItem<'i, I>
    where
-    I: PartialOrd,
    Source§
    fn partial_cmp(&self, other: &SyncItem<'i, I>) -> 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
    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
    Tests less than or equal to (for self and other) and is used by the
+    Self: Sized,
    Restrict a value to a certain interval. Read more
    §
    impl<'i, I> PartialEq for SyncItem<'i, I>
    where
+    I: PartialEq,
    §
    fn eq(&self, other: &SyncItem<'i, I>) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,
+and should not be overridden without very good reason.
    §
    impl<'i, I> PartialOrd for SyncItem<'i, I>
    where
+    I: PartialOrd,
    §
    fn partial_cmp(&self, other: &SyncItem<'i, I>) -> 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
    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
    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
    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
    Tests greater than or equal to (for self and other) and is used by
-the >= operator. Read more
    Source§
    impl<'i, I> Copy for SyncItem<'i, I>
    where
-    I: Copy,
    Source§
    impl<'i, I> Eq for SyncItem<'i, I>
    where
-    I: Eq,
    Source§
    impl<'i, I> StructuralPartialEq for SyncItem<'i, I>
    Auto Trait Implementations§
    §
    impl<'i, I> Freeze for SyncItem<'i, I>
    where
+the >= operator. Read more
    §
    impl<'i, I> Copy for SyncItem<'i, I>
    where
+    I: Copy,
    §
    impl<'i, I> Eq for SyncItem<'i, I>
    where
+    I: Eq,
    §
    impl<'i, I> StructuralPartialEq for SyncItem<'i, I>
    Auto Trait Implementations§
    §
    impl<'i, I> Freeze for SyncItem<'i, I>
    where
     I: Freeze,
    §
    impl<'i, I> RefUnwindSafe for SyncItem<'i, I>
    where
     I: RefUnwindSafe,
    §
    impl<'i, I> Send for SyncItem<'i, I>
    where
     I: Send,
    §
    impl<'i, I> Sync for SyncItem<'i, I>
    where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/index.html
index 74a52f5026..6d311b3698 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/index.html
@@ -1,2 +1,2 @@
-bdk_chain::spk_client - Rust
    bdk_chain
    Module spk_client
    Source 
    Expand description
    Helper types for spk-based blockchain clients.
    
+bdk_chain::spk_client - Rust
    bdk_chain
    Module spk_client
    Expand description
    Helper types for spk-based blockchain clients.
    
 
    Structs§
    Enums§
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanRequest.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanRequest.html
index 149aea14d4..db55423aea 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanRequest.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanRequest.html
@@ -1,20 +1,20 @@
-FullScanRequest in bdk_chain::spk_client - Rust
    bdk_chain::spk_client
    Struct FullScanRequest
    Source 
    pub struct FullScanRequest<K> { /* private fields */ }
    Expand description
    Data required to perform a spk-based blockchain client full scan.
    
+FullScanRequest in bdk_chain::spk_client - Rust
    bdk_chain::spk_client
    Struct FullScanRequest
    pub struct FullScanRequest<K> { /* private fields */ }
    Expand description
    Data required to perform a spk-based blockchain client full scan.
    
 
    A client full scan iterates through all the scripts for the given keychains, fetching relevant
 data until some stop gap number of scripts is found that have no data. This operation is
 generally only used when importing or restoring previously used keychains in which the list of
 used scripts is not known. The full scan process also updates the chain from the given
 chain_tip (if provided).
    
-
    Implementations§
    Source§
    impl<K> FullScanRequest<K>
    where
-    K: Ord + Clone,
    Source
    pub fn builder() -> FullScanRequestBuilder<K>
    Start building a FullScanRequest.
    
-
    Source
    pub fn chain_tip(&self) -> Option<CheckPoint>
    Get the chain tip CheckPoint of this request (if any).
    
-
    Source
    pub fn keychains(&self) -> Vec<K>
    List all keychains contained in this request.
    
-
    Source
    pub fn next_spk(&mut self, keychain: K) -> Option<(u32, ScriptBuf)>
    Advances the full scan request and returns the next indexed ScriptBuf of the given
+
    Implementations§
    §
    impl<K> FullScanRequest<K>
    where
+    K: Ord + Clone,
    pub fn builder() -> FullScanRequestBuilder<K>
    Start building a FullScanRequest.
    
+
    pub fn chain_tip(&self) -> Option<CheckPoint>
    Get the chain tip CheckPoint of this request (if any).
    
+
    pub fn keychains(&self) -> Vec<K>
    List all keychains contained in this request.
    
+
    pub fn next_spk(&mut self, keychain: K) -> Option<(u32, ScriptBuf)>
    Advances the full scan request and returns the next indexed ScriptBuf of the given
 keychain.
    
-
    Source
    pub fn iter_spks(
+
    pub fn iter_spks(
     &mut self,
     keychain: K,
 ) -> impl Iterator<Item = (u32, ScriptBuf)>
    Iterate over indexed ScriptBufs contained in this request of the given keychain.
    
-
    Trait Implementations§
    Source§
    impl<K> Default for FullScanRequest<K>
    Source§
    fn default() -> FullScanRequest<K>
    Returns the “default value” for a type. Read more
    Source§
    impl<K> From<FullScanRequestBuilder<K>> for FullScanRequest<K>
    Source§
    fn from(builder: FullScanRequestBuilder<K>) -> FullScanRequest<K>
    Converts to this type from the input type.
    Auto Trait Implementations§
    §
    impl<K> Freeze for FullScanRequest<K>
    §
    impl<K> !RefUnwindSafe for FullScanRequest<K>
    §
    impl<K> Send for FullScanRequest<K>
    where
+
    Trait Implementations§
    §
    impl<K> Default for FullScanRequest<K>
    §
    fn default() -> FullScanRequest<K>
    Returns the “default value” for a type. Read more
    §
    impl<K> From<FullScanRequestBuilder<K>> for FullScanRequest<K>
    §
    fn from(builder: FullScanRequestBuilder<K>) -> FullScanRequest<K>
    Converts to this type from the input type.
    Auto Trait Implementations§
    §
    impl<K> Freeze for FullScanRequest<K>
    §
    impl<K> !RefUnwindSafe for FullScanRequest<K>
    §
    impl<K> Send for FullScanRequest<K>
    where
     K: Send,
    §
    impl<K> !Sync for FullScanRequest<K>
    §
    impl<K> Unpin for FullScanRequest<K>
    §
    impl<K> !UnwindSafe for FullScanRequest<K>
    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/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanRequestBuilder.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanRequestBuilder.html
index 85d78a07dc..c09c31023b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanRequestBuilder.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanRequestBuilder.html
@@ -1,16 +1,16 @@
-FullScanRequestBuilder in bdk_chain::spk_client - Rust
    bdk_chain::spk_client
    Struct FullScanRequestBuilder
    Source 
    pub struct FullScanRequestBuilder<K> { /* private fields */ }
    Expand description
    Builds a FullScanRequest.
    
-
    Implementations§
    Source§
    impl<K> FullScanRequestBuilder<K>
    where
-    K: Ord,
    Source
    pub fn chain_tip(self, tip: CheckPoint) -> FullScanRequestBuilder<K>
    Set the initial chain tip for the full scan request.
    
+FullScanRequestBuilder in bdk_chain::spk_client - Rust
    bdk_chain::spk_client
    Struct FullScanRequestBuilder
    pub struct FullScanRequestBuilder<K> { /* private fields */ }
    Expand description
    Builds a FullScanRequest.
    
+
    Implementations§
    §
    impl<K> FullScanRequestBuilder<K>
    where
+    K: Ord,
    pub fn chain_tip(self, tip: CheckPoint) -> FullScanRequestBuilder<K>
    Set the initial chain tip for the full scan request.
    
 
    This is used to update LocalChain.
    
-
    Source
    pub fn spks_for_keychain(
+
    pub fn spks_for_keychain(
     self,
     keychain: K,
     spks: impl IntoIterator<IntoIter = impl Iterator<Item = (u32, ScriptBuf)> + Send + 'static>,
 ) -> FullScanRequestBuilder<K>
    Set the spk iterator for a given keychain.
    
-
    Source
    pub fn inspect<F>(self, inspect: F) -> FullScanRequestBuilder<K>
    where
+
    pub fn inspect<F>(self, inspect: F) -> FullScanRequestBuilder<K>
    where
     F: FnMut(K, u32, &Script) + Send + 'static,
    Set the closure that will inspect every sync item visited.
    
-
    Source
    pub fn build(self) -> FullScanRequest<K>
    Build the FullScanRequest.
    
-
    Trait Implementations§
    Source§
    impl<K> Default for FullScanRequestBuilder<K>
    Source§
    fn default() -> FullScanRequestBuilder<K>
    Returns the “default value” for a type. Read more
    Source§
    impl<K> From<FullScanRequestBuilder<K>> for FullScanRequest<K>
    Source§
    fn from(builder: FullScanRequestBuilder<K>) -> FullScanRequest<K>
    Converts to this type from the input type.
    Source§
    impl<K: Clone + Ord + Debug> FullScanRequestBuilderExt<K> for FullScanRequestBuilder<K>
    Source§
    fn spks_from_indexer(self, indexer: &KeychainTxOutIndex<K>) -> Self
    Add spk iterators for each keychain tracked in indexer.
    Auto Trait Implementations§
    pub fn build(self) -> FullScanRequest<K>
    Build the FullScanRequest.
    
+
    Trait Implementations§
    §
    impl<K> Default for FullScanRequestBuilder<K>
    §
    fn default() -> FullScanRequestBuilder<K>
    Returns the “default value” for a type. Read more
    §
    impl<K> From<FullScanRequestBuilder<K>> for FullScanRequest<K>
    §
    fn from(builder: FullScanRequestBuilder<K>) -> FullScanRequest<K>
    Converts to this type from the input type.
    Source§
    impl<K: Clone + Ord + Debug> FullScanRequestBuilderExt<K> for FullScanRequestBuilder<K>
    Source§
    fn spks_from_indexer(self, indexer: &KeychainTxOutIndex<K>) -> Self
    Add spk iterators for each keychain tracked in indexer.
    Auto Trait Implementations§
    Blanket Implementations§
    Source§
    impl<T> Any for T
    where
     T: 'static + ?Sized,
    Source§
    fn type_id(&self) -> TypeId
    Gets the TypeId of self. Read more
    Source§
    impl<T> Borrow<T> for T
    where
     T: ?Sized,
    Source§
    fn borrow(&self) -> &T
    Immutably borrows from an owned value. Read more
    Source§
    impl<T> BorrowMut<T> for T
    where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanResponse.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanResponse.html
index 31e0669ba6..3d92af4e95 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanResponse.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanResponse.html
@@ -1,4 +1,4 @@
-FullScanResponse in bdk_chain::spk_client - Rust
    bdk_chain::spk_client
    Struct FullScanResponse
    Source 
    pub struct FullScanResponse<K, A = ConfirmationBlockTime> {
+FullScanResponse in bdk_chain::spk_client - Rust
    bdk_chain::spk_client
    Struct FullScanResponse
    pub struct FullScanResponse<K, A = ConfirmationBlockTime> {
     pub tx_update: TxUpdate<A>,
     pub last_active_indices: BTreeMap<K, u32>,
     pub chain_update: Option<CheckPoint>,
@@ -8,9 +8,9 @@
 
    §last_active_indices: BTreeMap<K, u32>
    Last active indices for the corresponding keychains (K). An index is active if it had a
 transaction associated with the script pubkey at that index.
    
 
    §chain_update: Option<CheckPoint>
    Changes to the chain discovered during the scan.
    
-
    Trait Implementations§
    Source§
    impl<K, A> Debug for FullScanResponse<K, A>
    where
+
    Trait Implementations§
    §
    impl<K, A> Debug for FullScanResponse<K, A>
    where
     K: Debug,
-    A: Debug,
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    Source§
    impl<K, A> Default for FullScanResponse<K, A>
    Source§
    fn default() -> FullScanResponse<K, A>
    Returns the “default value” for a type. Read more
    Auto Trait Implementations§
    §
    impl<K, A> Freeze for FullScanResponse<K, A>
    §
    impl<K, A> RefUnwindSafe for FullScanResponse<K, A>
    where
+    A: Debug,
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    §
    impl<K, A> Default for FullScanResponse<K, A>
    §
    fn default() -> FullScanResponse<K, A>
    Returns the “default value” for a type. Read more
    Auto Trait Implementations§
    §
    impl<K, A> Freeze for FullScanResponse<K, A>
    §
    impl<K, A> RefUnwindSafe for FullScanResponse<K, A>
    where
     K: RefUnwindSafe,
     A: RefUnwindSafe,
    §
    impl<K, A> Send for FullScanResponse<K, A>
    where
     K: Send,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncProgress.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncProgress.html
index 054cd098dc..c070dda566 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncProgress.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncProgress.html
@@ -1,4 +1,4 @@
-SyncProgress in bdk_chain::spk_client - Rust
    bdk_chain::spk_client
    Struct SyncProgress
    Source 
    pub struct SyncProgress {
+SyncProgress in bdk_chain::spk_client - Rust
    bdk_chain::spk_client
    Struct SyncProgress
    pub struct SyncProgress {
     pub spks_consumed: usize,
     pub spks_remaining: usize,
     pub txids_consumed: usize,
@@ -12,13 +12,13 @@
 
    §txids_remaining: usize
    Txids remaining in the request.
    
 
    §outpoints_consumed: usize
    Outpoints consumed by the request.
    
 
    §outpoints_remaining: usize
    Outpoints remaining in the request.
    
-
    Implementations§
    Source§
    impl SyncProgress
    Source
    pub fn total(&self) -> usize
    Total items, consumed and remaining, of the request.
    
-
    Source
    pub fn total_spks(&self) -> usize
    Total script pubkeys, consumed and remaining, of the request.
    
-
    Source
    pub fn total_txids(&self) -> usize
    Total txids, consumed and remaining, of the request.
    
-
    Source
    pub fn total_outpoints(&self) -> usize
    Total outpoints, consumed and remaining, of the request.
    
-
    Source
    pub fn consumed(&self) -> usize
    Total consumed items of the request.
    
-
    Source
    pub fn remaining(&self) -> usize
    Total remaining items of the request.
    
-
    Trait Implementations§
    Source§
    impl Clone for SyncProgress
    Source§
    fn clone(&self) -> SyncProgress
    Returns a copy of 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 SyncProgress
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    Auto Trait Implementations§
    Blanket Implementations§
    Source§
    impl<T> Any for T
    where
+
    Implementations§
    §
    impl SyncProgress
    pub fn total(&self) -> usize
    Total items, consumed and remaining, of the request.
    
+
    pub fn total_spks(&self) -> usize
    Total script pubkeys, consumed and remaining, of the request.
    
+
    pub fn total_txids(&self) -> usize
    Total txids, consumed and remaining, of the request.
    
+
    pub fn total_outpoints(&self) -> usize
    Total outpoints, consumed and remaining, of the request.
    
+
    pub fn consumed(&self) -> usize
    Total consumed items of the request.
    
+
    pub fn remaining(&self) -> usize
    Total remaining items of the request.
    
+
    Trait Implementations§
    §
    impl Clone for SyncProgress
    §
    fn clone(&self) -> SyncProgress
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    §
    impl Debug for SyncProgress
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    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> CloneToUninit for T
    where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncRequest.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncRequest.html
index c5eac121e3..79e5252c54 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncRequest.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncRequest.html
@@ -1,4 +1,4 @@
-SyncRequest in bdk_chain::spk_client - Rust
    bdk_chain::spk_client
    Struct SyncRequest
    Source 
    pub struct SyncRequest<I = ()> { /* private fields */ }
    Expand description
    Data required to perform a spk-based blockchain client sync.
    
+SyncRequest in bdk_chain::spk_client - Rust
    bdk_chain::spk_client
    Struct SyncRequest
    pub struct SyncRequest<I = ()> { /* private fields */ }
    Expand description
    Data required to perform a spk-based blockchain client sync.
    
 
    A client sync fetches relevant chain data for a known list of scripts, transaction ids and
 outpoints. The sync process also updates the chain from the given
 chain_tip (if provided).
    
@@ -13,19 +13,19 @@ outpoints. The sync process also updates the chain from the given
     .inspect(|item, progress| println!("{} (remaining: {})", item, progress.remaining()))
     // Finish constructing the sync request.
     .build();
    
-
    Implementations§
    Source§
    impl<I> SyncRequest<I>
    Source
    pub fn builder() -> SyncRequestBuilder<I>
    Start building a SyncRequest.
    
-
    Source
    pub fn progress(&self) -> SyncProgress
    Get the SyncProgress of this request.
    
-
    Source
    pub fn chain_tip(&self) -> Option<CheckPoint>
    Get the chain tip CheckPoint of this request (if any).
    
-
    Source
    pub fn next_spk(&mut self) -> Option<ScriptBuf>
    Advances the sync request and returns the next ScriptBuf.
    
+
    Implementations§
    §
    impl<I> SyncRequest<I>
    pub fn builder() -> SyncRequestBuilder<I>
    Start building a SyncRequest.
    
+
    pub fn progress(&self) -> SyncProgress
    Get the SyncProgress of this request.
    
+
    pub fn chain_tip(&self) -> Option<CheckPoint>
    Get the chain tip CheckPoint of this request (if any).
    
+
    pub fn next_spk(&mut self) -> Option<ScriptBuf>
    Advances the sync request and returns the next ScriptBuf.
    
 
    Returns None when there are no more scripts remaining in the request.
    
-
    Source
    pub fn next_txid(&mut self) -> Option<Txid>
    Advances the sync request and returns the next Txid.
    
+
    pub fn next_txid(&mut self) -> Option<Txid>
    Advances the sync request and returns the next Txid.
    
 
    Returns None when there are no more txids remaining in the request.
    
-
    Source
    pub fn next_outpoint(&mut self) -> Option<OutPoint>
    Advances the sync request and returns the next OutPoint.
    
+
    pub fn next_outpoint(&mut self) -> Option<OutPoint>
    Advances the sync request and returns the next OutPoint.
    
 
    Returns None when there are no more outpoints in the request.
    
-
    Source
    pub fn iter_spks(&mut self) -> impl ExactSizeIterator
    Iterate over ScriptBufs contained in this request.
    
-
    Source
    pub fn iter_txids(&mut self) -> impl ExactSizeIterator
    Iterate over Txids contained in this request.
    
-
    Source
    pub fn iter_outpoints(&mut self) -> impl ExactSizeIterator
    Iterate over OutPoints contained in this request.
    
-
    Trait Implementations§
    Source§
    impl<I> Default for SyncRequest<I>
    Source§
    fn default() -> SyncRequest<I>
    Returns the “default value” for a type. Read more
    Source§
    impl<I> From<SyncRequestBuilder<I>> for SyncRequest<I>
    Source§
    fn from(builder: SyncRequestBuilder<I>) -> SyncRequest<I>
    Converts to this type from the input type.
    Auto Trait Implementations§
    §
    impl<I> Freeze for SyncRequest<I>
    §
    impl<I = ()> !RefUnwindSafe for SyncRequest<I>
    §
    impl<I> Send for SyncRequest<I>
    where
+
    pub fn iter_spks(&mut self) -> impl ExactSizeIterator
    Iterate over ScriptBufs contained in this request.
    
+
    pub fn iter_txids(&mut self) -> impl ExactSizeIterator
    Iterate over Txids contained in this request.
    
+
    pub fn iter_outpoints(&mut self) -> impl ExactSizeIterator
    Iterate over OutPoints contained in this request.
    
+
    Trait Implementations§
    §
    impl<I> Default for SyncRequest<I>
    §
    fn default() -> SyncRequest<I>
    Returns the “default value” for a type. Read more
    §
    impl<I> From<SyncRequestBuilder<I>> for SyncRequest<I>
    §
    fn from(builder: SyncRequestBuilder<I>) -> SyncRequest<I>
    Converts to this type from the input type.
    Auto Trait Implementations§
    §
    impl<I> Freeze for SyncRequest<I>
    §
    impl<I = ()> !RefUnwindSafe for SyncRequest<I>
    §
    impl<I> Send for SyncRequest<I>
    where
     I: Send,
    §
    impl<I = ()> !Sync for SyncRequest<I>
    §
    impl<I> Unpin for SyncRequest<I>
    where
     I: Unpin,
    §
    impl<I = ()> !UnwindSafe for SyncRequest<I>
    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/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncRequestBuilder.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncRequestBuilder.html
index 19f9af683e..c945e07a2e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncRequestBuilder.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncRequestBuilder.html
@@ -1,11 +1,11 @@
-SyncRequestBuilder in bdk_chain::spk_client - Rust
    bdk_chain::spk_client
    Struct SyncRequestBuilder
    Source 
    pub struct SyncRequestBuilder<I = ()> { /* private fields */ }
    Expand description
    Builds a SyncRequest.
    
-
    Implementations§
    Source§
    impl SyncRequestBuilder
    Source
    pub fn spks(
+SyncRequestBuilder in bdk_chain::spk_client - Rust
    bdk_chain::spk_client
    Struct SyncRequestBuilder
    pub struct SyncRequestBuilder<I = ()> { /* private fields */ }
    Expand description
    Builds a SyncRequest.
    
+
    Implementations§
    §
    impl SyncRequestBuilder
    pub fn spks(
     self,
     spks: impl IntoIterator<Item = ScriptBuf>,
 ) -> SyncRequestBuilder
    Add Scripts that will be synced against.
    
-
    Source§
    impl<I> SyncRequestBuilder<I>
    Source
    pub fn chain_tip(self, cp: CheckPoint) -> SyncRequestBuilder<I>
    Set the initial chain tip for the sync request.
    
+
    §
    impl<I> SyncRequestBuilder<I>
    pub fn chain_tip(self, cp: CheckPoint) -> SyncRequestBuilder<I>
    Set the initial chain tip for the sync request.
    
 
    This is used to update LocalChain.
    
-
    Source
    pub fn spks_with_indexes(
+
    pub fn spks_with_indexes(
     self,
     spks: impl IntoIterator<Item = (I, ScriptBuf)>,
 ) -> SyncRequestBuilder<I>
    Add Scripts coupled with associated indexes that will be synced against.
    
@@ -35,18 +35,18 @@ indexer.insert_descriptor("descriptor_b", descriptor
 let _request = SyncRequest::builder()
     .spks_with_indexes(all_revealed_spks)
     .build();
    -

    Source

    pub fn txids( +

    pub fn txids( self, txids: impl IntoIterator<Item = Txid>, ) -> SyncRequestBuilder<I>

    Add Txids that will be synced against.

    -
    Source

    pub fn outpoints( +

    pub fn outpoints( self, outpoints: impl IntoIterator<Item = OutPoint>, ) -> SyncRequestBuilder<I>

    Add OutPoints that will be synced against.

    -
    Source

    pub fn inspect<F>(self, inspect: F) -> SyncRequestBuilder<I>
    where +

    pub fn inspect<F>(self, inspect: F) -> SyncRequestBuilder<I>
    where F: FnMut(SyncItem<'_, I>, SyncProgress) + Send + 'static,

    Set the closure that will inspect every sync item visited.

    -
    Source

    pub fn build(self) -> SyncRequest<I>

    Build the SyncRequest.

    -

    Trait Implementations§

    Source§

    impl<I> Default for SyncRequestBuilder<I>

    Source§

    fn default() -> SyncRequestBuilder<I>

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

    impl<I> From<SyncRequestBuilder<I>> for SyncRequest<I>

    Source§

    fn from(builder: SyncRequestBuilder<I>) -> SyncRequest<I>

    Converts to this type from the input type.
    Source§

    impl<K: Clone + Ord + Debug> SyncRequestBuilderExt<K> for SyncRequestBuilder<(K, u32)>

    Source§

    fn revealed_spks_from_indexer<R>( +

    pub fn build(self) -> SyncRequest<I>

    Build the SyncRequest.

    +

    Trait Implementations§

    §

    impl<I> Default for SyncRequestBuilder<I>

    §

    fn default() -> SyncRequestBuilder<I>

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

    impl<I> From<SyncRequestBuilder<I>> for SyncRequest<I>

    §

    fn from(builder: SyncRequestBuilder<I>) -> SyncRequest<I>

    Converts to this type from the input type.
    Source§

    impl<K: Clone + Ord + Debug> SyncRequestBuilderExt<K> for SyncRequestBuilder<(K, u32)>

    Source§

    fn revealed_spks_from_indexer<R>( self, indexer: &KeychainTxOutIndex<K>, spk_range: R, diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncResponse.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncResponse.html index 7a54230e00..b58b9e1f9f 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncResponse.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncResponse.html @@ -1,12 +1,12 @@ -SyncResponse in bdk_chain::spk_client - Rust
    bdk_chain::spk_client

    Struct SyncResponse

    Source 
    pub struct SyncResponse<A = ConfirmationBlockTime> {
+SyncResponse in bdk_chain::spk_client - Rust
    bdk_chain::spk_client
    Struct SyncResponse
    pub struct SyncResponse<A = ConfirmationBlockTime> {
     pub tx_update: TxUpdate<A>,
     pub chain_update: Option<CheckPoint>,
 }
    Expand description
    Data returned from a spk-based blockchain client sync.
    
 
    See also SyncRequest.
    
 
    Fields§
    §tx_update: TxUpdate<A>
    Relevant transaction data discovered during the scan.
    
 
    §chain_update: Option<CheckPoint>
    Changes to the chain discovered during the scan.
    
-
    Trait Implementations§
    Source§
    impl<A> Debug for SyncResponse<A>
    where
-    A: Debug,
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    Source§
    impl<A> Default for SyncResponse<A>
    Source§
    fn default() -> SyncResponse<A>
    Returns the “default value” for a type. Read more
    Auto Trait Implementations§
    §
    impl<A> Freeze for SyncResponse<A>
    §
    impl<A> RefUnwindSafe for SyncResponse<A>
    where
+
    Trait Implementations§
    §
    impl<A> Debug for SyncResponse<A>
    where
+    A: Debug,
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    §
    impl<A> Default for SyncResponse<A>
    §
    fn default() -> SyncResponse<A>
    Returns the “default value” for a type. Read more
    Auto Trait Implementations§
    §
    impl<A> Freeze for SyncResponse<A>
    §
    impl<A> RefUnwindSafe for SyncResponse<A>
    where
     A: RefUnwindSafe,
    §
    impl<A> Send for SyncResponse<A>
    where
     A: Send,
    §
    impl<A> Sync for SyncResponse<A>
    where
     A: Sync,
    §
    impl<A> Unpin for SyncResponse<A>
    §
    impl<A> UnwindSafe for SyncResponse<A>
    where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.Balance.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.Balance.html
index 346b75628a..894aa5c619 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.Balance.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.Balance.html
@@ -1,4 +1,4 @@
-Balance in bdk_chain - Rust
    bdk_chain
    Struct Balance
    Source 
    pub struct Balance {
+Balance in bdk_chain - Rust
    bdk_chain
    Struct Balance
    Source 
    pub struct Balance {
     pub immature: Amount,
     pub trusted_pending: Amount,
     pub untrusted_pending: Amount,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.BlockId.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.BlockId.html
index 90aeb56a53..7fd0cec481 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.BlockId.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.BlockId.html
@@ -1,27 +1,27 @@
-BlockId in bdk_chain - Rust
    bdk_chain
    Struct BlockId
    Source 
    pub struct BlockId {
+BlockId in bdk_chain - Rust
    bdk_chain
    Struct BlockId
    pub struct BlockId {
     pub height: u32,
     pub hash: BlockHash,
 }
    Expand description
    A reference to a block in the canonical chain.
    
 
    Fields§
    §height: u32
    The height of the block.
    
 
    §hash: BlockHash
    The hash of the block.
    
-
    Trait Implementations§
    Source§
    impl Anchor for BlockId
    Source§
    fn anchor_block(&self) -> Self
    Returns the BlockId that the associated blockchain data is “anchored” in.
    Source§
    fn confirmation_height_upper_bound(&self) -> u32
    Get the upper bound of the chain data’s confirmation height. Read more
    Source§
    impl Clone for BlockId
    Source§
    fn clone(&self) -> BlockId
    Returns a copy of 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 BlockId
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    Source§
    impl Default for BlockId
    Source§
    fn default() -> BlockId
    Returns the “default value” for a type. Read more
    Source§
    impl<'de> Deserialize<'de> for BlockId
    Source§
    fn deserialize<__D>(
+
    Trait Implementations§
    Source§
    impl Anchor for BlockId
    Source§
    fn anchor_block(&self) -> Self
    Returns the BlockId that the associated blockchain data is “anchored” in.
    Source§
    fn confirmation_height_upper_bound(&self) -> u32
    Get the upper bound of the chain data’s confirmation height. Read more
    §
    impl Clone for BlockId
    §
    fn clone(&self) -> BlockId
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    §
    impl Debug for BlockId
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    §
    impl Default for BlockId
    §
    fn default() -> BlockId
    Returns the “default value” for a type. Read more
    §
    impl<'de> Deserialize<'de> for BlockId
    §
    fn deserialize<__D>(
     __deserializer: __D,
 ) -> Result<BlockId, <__D as Deserializer<'de>>::Error>
    where
-    __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    Source§
    impl From<(&u32, &BlockHash)> for BlockId
    Source§
    fn from(_: (&u32, &BlockHash)) -> BlockId
    Converts to this type from the input type.
    Source§
    impl From<(u32, BlockHash)> for BlockId
    Source§
    fn from(_: (u32, BlockHash)) -> BlockId
    Converts to this type from the input type.
    Source§
    impl From<BlockId> for (u32, BlockHash)
    Source§
    fn from(block_id: BlockId) -> (u32, BlockHash)
    Converts to this type from the input type.
    Source§
    impl From<TxPosInBlock<'_>> for BlockId
    Source§
    fn from(pos: TxPosInBlock<'_>) -> Self
    Converts to this type from the input type.
    Source§
    impl Hash for BlockId
    Source§
    fn hash<__H>(&self, state: &mut __H)
    where
+    __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    §
    impl From<(&u32, &BlockHash)> for BlockId
    §
    fn from(_: (&u32, &BlockHash)) -> BlockId
    Converts to this type from the input type.
    §
    impl From<(u32, BlockHash)> for BlockId
    §
    fn from(_: (u32, BlockHash)) -> BlockId
    Converts to this type from the input type.
    §
    impl From<BlockId> for (u32, BlockHash)
    §
    fn from(block_id: BlockId) -> (u32, BlockHash)
    Converts to this type from the input type.
    Source§
    impl From<TxPosInBlock<'_>> for BlockId
    Source§
    fn from(pos: TxPosInBlock<'_>) -> Self
    Converts to this type from the input type.
    §
    impl Hash for BlockId
    §
    fn hash<__H>(&self, state: &mut __H)
    where
     __H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · Source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where
     H: Hasher,
-    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    Source§
    impl Ord for BlockId
    Source§
    fn cmp(&self, other: &BlockId) -> 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
    §
    impl Ord for BlockId
    §
    fn cmp(&self, other: &BlockId) -> 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,
    Restrict a value to a certain interval. Read more
    Source§
    impl PartialEq for BlockId
    Source§
    fn eq(&self, other: &BlockId) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,
-and should not be overridden without very good reason.
    Source§
    impl PartialOrd for BlockId
    Source§
    fn partial_cmp(&self, other: &BlockId) -> 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
    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
    Tests less than or equal to (for self and other) and is used by the
+    Self: Sized,

    Restrict a value to a certain interval. Read more
    §

    impl PartialEq for BlockId

    §

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

    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§

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

    Tests for !=. The default implementation is almost always sufficient, +and should not be overridden without very good reason.
    §

    impl PartialOrd for BlockId

    §

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

    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

    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

    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

    Tests greater than or equal to (for self and other) and is used by -the >= operator. Read more
    Source§

    impl Serialize for BlockId

    Source§

    fn serialize<__S>( +the >= operator. Read more

    §

    impl Serialize for BlockId

    §

    fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>
    where - __S: Serializer,

    Serialize this value into the given Serde serializer. Read more
    Source§

    impl Copy for BlockId

    Source§

    impl Eq for BlockId

    Source§

    impl StructuralPartialEq for BlockId

    Auto Trait Implementations§

    Blanket Implementations§

    Source§

    impl<T> Any for T
    where + __S: Serializer,

    Serialize this value into the given Serde serializer. Read more
    §

    impl Copy for BlockId

    §

    impl Eq for BlockId

    §

    impl StructuralPartialEq for BlockId

    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> CloneToUninit for T
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CanonicalIter.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CanonicalIter.html index 70331896e9..42d9db5b4b 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CanonicalIter.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CanonicalIter.html @@ -1,4 +1,4 @@ -CanonicalIter in bdk_chain - Rust
    bdk_chain

    Struct CanonicalIter

    Source 
    pub struct CanonicalIter<'g, A, C> { /* private fields */ }
    Expand description

    Iterates over canonical txs.

    +CanonicalIter in bdk_chain - Rust
    bdk_chain

    Struct CanonicalIter

    Source 
    pub struct CanonicalIter<'g, A, C> { /* private fields */ }
    Expand description

    Iterates over canonical txs.

    Implementations§

    Source§

    impl<'g, A: Anchor, C: ChainOracle> CanonicalIter<'g, A, C>

    Source

    pub fn new(tx_graph: &'g TxGraph<A>, chain: &'g C, chain_tip: BlockId) -> Self

    Constructs CanonicalIter.

    Trait Implementations§

    Source§

    impl<A: Anchor, C: ChainOracle> Iterator for CanonicalIter<'_, A, C>

    Source§

    type Item = Result<(Txid, Arc<Transaction>, CanonicalReason<A>), <C as ChainOracle>::Error>

    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, diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CheckPoint.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CheckPoint.html index 356746e48c..f122a9e686 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CheckPoint.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CheckPoint.html @@ -1,8 +1,8 @@ -CheckPoint in bdk_chain - Rust
    bdk_chain

    Struct CheckPoint

    Source 
    pub struct CheckPoint(/* private fields */);
    Expand description

    A checkpoint is a node of a reference-counted linked list of BlockIds.

    +CheckPoint in bdk_chain - Rust
    bdk_chain

    Struct CheckPoint

    pub struct CheckPoint(/* private fields */);
    Expand description

    A checkpoint is a node of a reference-counted linked list of BlockIds.

    Checkpoints are cheaply cloneable and are useful to find the agreement point between two sparse block chains.

    -

    Implementations§

    Source§

    impl CheckPoint

    Source

    pub fn new(block: BlockId) -> CheckPoint

    Construct a new base block at the front of a linked list.

    -
    Source

    pub fn from_block_ids( +

    Implementations§

    §

    impl CheckPoint

    pub fn new(block: BlockId) -> CheckPoint

    Construct a new base block at the front of a linked list.

    +

    pub fn from_block_ids( block_ids: impl IntoIterator<Item = BlockId>, ) -> Result<CheckPoint, Option<CheckPoint>>

    Construct a checkpoint from a list of BlockIds in ascending height order.

    §Errors
    @@ -13,30 +13,30 @@ block chains.

  • The blocks iterator contains multiple BlockIds of the same height.

    • The error type is the last successful checkpoint constructed (if any).

    -
    Source

    pub fn from_header(header: &Header, height: u32) -> CheckPoint

    Construct a checkpoint from the given header and block height.

    +

    pub fn from_header(header: &Header, height: u32) -> CheckPoint

    Construct a checkpoint from the given header and block height.

    If header is of the genesis block, the checkpoint won’t have a prev node. Otherwise, we return a checkpoint linked with the previous block.

    -
    Source

    pub fn push(self, block: BlockId) -> Result<CheckPoint, CheckPoint>

    Puts another checkpoint onto the linked list representing the blockchain.

    +

    pub fn push(self, block: BlockId) -> Result<CheckPoint, CheckPoint>

    Puts another checkpoint onto the linked list representing the blockchain.

    Returns an Err(self) if the block you are pushing on is not at a greater height that the one you are pushing on to.

    -
    Source

    pub fn extend( +

    pub fn extend( self, blocks: impl IntoIterator<Item = BlockId>, ) -> Result<CheckPoint, CheckPoint>

    Extends the checkpoint linked list by a iterator of block ids.

    Returns an Err(self) if there is block which does not have a greater height than the previous one.

    -
    Source

    pub fn block_id(&self) -> BlockId

    Get the BlockId of the checkpoint.

    -
    Source

    pub fn height(&self) -> u32

    Get the height of the checkpoint.

    -
    Source

    pub fn hash(&self) -> BlockHash

    Get the block hash of the checkpoint.

    -
    Source

    pub fn prev(&self) -> Option<CheckPoint>

    Get the previous checkpoint in the chain

    -
    Source

    pub fn iter(&self) -> CheckPointIter ⓘ

    Iterate from this checkpoint in descending height.

    -
    Source

    pub fn get(&self, height: u32) -> Option<CheckPoint>

    Get checkpoint at height.

    +

    pub fn block_id(&self) -> BlockId

    Get the BlockId of the checkpoint.

    +

    pub fn height(&self) -> u32

    Get the height of the checkpoint.

    +

    pub fn hash(&self) -> BlockHash

    Get the block hash of the checkpoint.

    +

    pub fn prev(&self) -> Option<CheckPoint>

    Get the previous checkpoint in the chain

    +

    pub fn iter(&self) -> CheckPointIter ⓘ

    Iterate from this checkpoint in descending height.

    +

    pub fn get(&self, height: u32) -> Option<CheckPoint>

    Get checkpoint at height.

    Returns None if checkpoint at height does not exist`.

    -
    Source

    pub fn range<R>(&self, range: R) -> impl Iterator<Item = CheckPoint>
    where +

    pub fn range<R>(&self, range: R) -> impl Iterator<Item = CheckPoint>
    where R: RangeBounds<u32>,

    Iterate checkpoints over a height range.

    Note that we always iterate checkpoints in reverse height order (iteration starts at tip height).

    -
    Source

    pub fn insert(self, block_id: BlockId) -> CheckPoint

    Inserts block_id at its height within the chain.

    +

    pub fn insert(self, block_id: BlockId) -> CheckPoint

    Inserts block_id at its height within the chain.

    The effect of insert depends on whether a height already exists. If it doesn’t the block_id we inserted and all pre-existing blocks higher than it will be re-inserted after it. If the height already existed and has a conflicting block hash then it will be purged @@ -44,8 +44,8 @@ along with all block following it. The returned chain will have a tip of the block_id was already present then this just returns self.

    §Panics

    This panics if called with a genesis block that differs from that of self.

    -
    Source

    pub fn eq_ptr(&self, other: &CheckPoint) -> bool

    This method tests for self and other to have equal internal pointers.

    -

    Trait Implementations§

    Source§

    impl Clone for CheckPoint

    Source§

    fn clone(&self) -> CheckPoint

    Returns a copy of 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 CheckPoint

    Source§

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

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

    impl IntoIterator for CheckPoint

    Source§

    type Item = CheckPoint

    The type of the elements being iterated over.
    Source§

    type IntoIter = CheckPointIter

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

    fn into_iter(self) -> <CheckPoint as IntoIterator>::IntoIter

    Creates an iterator from a value. Read more
    Source§

    impl PartialEq for CheckPoint

    Source§

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

    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§

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

    Tests for !=. The default implementation is almost always sufficient, +

    pub fn eq_ptr(&self, other: &CheckPoint) -> bool

    This method tests for self and other to have equal internal pointers.

    +

    Trait Implementations§

    §

    impl Clone for CheckPoint

    §

    fn clone(&self) -> CheckPoint

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

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

    Performs copy-assignment from source. Read more
    §

    impl Debug for CheckPoint

    §

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

    Formats the value using the given formatter. Read more
    §

    impl IntoIterator for CheckPoint

    §

    type Item = CheckPoint

    The type of the elements being iterated over.
    §

    type IntoIter = CheckPointIter

    Which kind of iterator are we turning this into?
    §

    fn into_iter(self) -> <CheckPoint as IntoIterator>::IntoIter

    Creates an iterator from a value. Read more
    §

    impl PartialEq for CheckPoint

    §

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

    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§

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

    Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

    Auto Trait Implementations§

    Blanket Implementations§

    Source§

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

    Source§

    fn type_id(&self) -> TypeId

    Gets the TypeId of self. Read more
    Source§

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

    Source§

    fn borrow(&self) -> &T

    Immutably borrows from an owned value. Read more
    Source§

    impl<T> BorrowMut<T> for T
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CheckPointIter.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CheckPointIter.html index ff1ef246a3..57852185c0 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CheckPointIter.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CheckPointIter.html @@ -1,5 +1,5 @@ -CheckPointIter in bdk_chain - Rust
    bdk_chain

    Struct CheckPointIter

    Source 
    pub struct CheckPointIter { /* private fields */ }
    Expand description

    Iterates over checkpoints backwards.

    -

    Trait Implementations§

    Source§

    impl Iterator for CheckPointIter

    Source§

    type Item = CheckPoint

    The type of the elements being iterated over.
    Source§

    fn next(&mut self) -> Option<<CheckPointIter as Iterator>::Item>

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

    fn next_chunk<const N: usize>( +CheckPointIter in bdk_chain - Rust
    bdk_chain

    Struct CheckPointIter

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

    Iterates over checkpoints backwards.

    +

    Trait Implementations§

    §

    impl Iterator for CheckPointIter

    §

    type Item = CheckPoint

    The type of the elements being iterated over.
    §

    fn next(&mut self) -> Option<<CheckPointIter as Iterator>::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/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.ConfirmationBlockTime.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.ConfirmationBlockTime.html index 83c3e39237..56df4cbc8f 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.ConfirmationBlockTime.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.ConfirmationBlockTime.html @@ -1,27 +1,27 @@ -ConfirmationBlockTime in bdk_chain - Rust
    bdk_chain

    Struct ConfirmationBlockTime

    Source 
    pub struct ConfirmationBlockTime {
+ConfirmationBlockTime in bdk_chain - Rust
    bdk_chain
    Struct ConfirmationBlockTime
    pub struct ConfirmationBlockTime {
     pub block_id: BlockId,
     pub confirmation_time: u64,
 }
    Expand description
    Represents the confirmation block and time of a transaction.
    
 
    Fields§
    §block_id: BlockId
    The anchor block.
    
 
    §confirmation_time: u64
    The confirmation time of the transaction being anchored.
    
-
    Trait Implementations§
    Source§
    impl Anchor for ConfirmationBlockTime
    Source§
    fn anchor_block(&self) -> BlockId
    Returns the BlockId that the associated blockchain data is “anchored” in.
    Source§
    fn confirmation_height_upper_bound(&self) -> u32
    Get the upper bound of the chain data’s confirmation height. Read more
    Source§
    impl Clone for ConfirmationBlockTime
    Source§
    fn clone(&self) -> ConfirmationBlockTime
    Returns a copy of 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 ConfirmationBlockTime
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    Source§
    impl Default for ConfirmationBlockTime
    Source§
    fn default() -> ConfirmationBlockTime
    Returns the “default value” for a type. Read more
    Source§
    impl<'de> Deserialize<'de> for ConfirmationBlockTime
    Source§
    fn deserialize<__D>(
+
    Trait Implementations§
    Source§
    impl Anchor for ConfirmationBlockTime
    Source§
    fn anchor_block(&self) -> BlockId
    Returns the BlockId that the associated blockchain data is “anchored” in.
    Source§
    fn confirmation_height_upper_bound(&self) -> u32
    Get the upper bound of the chain data’s confirmation height. Read more
    §
    impl Clone for ConfirmationBlockTime
    §
    fn clone(&self) -> ConfirmationBlockTime
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    §
    impl Debug for ConfirmationBlockTime
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    §
    impl Default for ConfirmationBlockTime
    §
    fn default() -> ConfirmationBlockTime
    Returns the “default value” for a type. Read more
    §
    impl<'de> Deserialize<'de> for ConfirmationBlockTime
    §
    fn deserialize<__D>(
     __deserializer: __D,
 ) -> Result<ConfirmationBlockTime, <__D as Deserializer<'de>>::Error>
    where
-    __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    Source§
    impl From<TxPosInBlock<'_>> for ConfirmationBlockTime
    Source§
    fn from(pos: TxPosInBlock<'_>) -> Self
    Converts to this type from the input type.
    Source§
    impl Hash for ConfirmationBlockTime
    Source§
    fn hash<__H>(&self, state: &mut __H)
    where
+    __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    Source§
    impl From<TxPosInBlock<'_>> for ConfirmationBlockTime
    Source§
    fn from(pos: TxPosInBlock<'_>) -> Self
    Converts to this type from the input type.
    §
    impl Hash for ConfirmationBlockTime
    §
    fn hash<__H>(&self, state: &mut __H)
    where
     __H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · Source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where
     H: Hasher,
-    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    Source§
    impl Ord for ConfirmationBlockTime
    Source§
    fn cmp(&self, other: &ConfirmationBlockTime) -> 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
    §
    impl Ord for ConfirmationBlockTime
    §
    fn cmp(&self, other: &ConfirmationBlockTime) -> 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,
    Restrict a value to a certain interval. Read more
    Source§
    impl PartialEq for ConfirmationBlockTime
    Source§
    fn eq(&self, other: &ConfirmationBlockTime) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,
-and should not be overridden without very good reason.
    Source§
    impl PartialOrd for ConfirmationBlockTime
    Source§
    fn partial_cmp(&self, other: &ConfirmationBlockTime) -> 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
    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
    Tests less than or equal to (for self and other) and is used by the
+    Self: Sized,

    Restrict a value to a certain interval. Read more
    §

    impl PartialEq for ConfirmationBlockTime

    §

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

    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§

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

    Tests for !=. The default implementation is almost always sufficient, +and should not be overridden without very good reason.
    §

    impl PartialOrd for ConfirmationBlockTime

    §

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

    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

    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

    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

    Tests greater than or equal to (for self and other) and is used by -the >= operator. Read more
    Source§

    impl Serialize for ConfirmationBlockTime

    Source§

    fn serialize<__S>( +the >= operator. Read more

    §

    impl Serialize for ConfirmationBlockTime

    §

    fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>
    where - __S: Serializer,

    Serialize this value into the given Serde serializer. Read more
    Source§

    impl Copy for ConfirmationBlockTime

    Source§

    impl Eq for ConfirmationBlockTime

    Source§

    impl StructuralPartialEq for ConfirmationBlockTime

    Auto Trait Implementations§

    Blanket Implementations§

    Source§

    impl<T> Any for T
    where + __S: Serializer,

    Serialize this value into the given Serde serializer. Read more
    §

    impl Copy for ConfirmationBlockTime

    §

    impl Eq for ConfirmationBlockTime

    §

    impl StructuralPartialEq for ConfirmationBlockTime

    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> CloneToUninit for T
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.DescriptorId.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.DescriptorId.html index 2ba020e61c..85834ed18a 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.DescriptorId.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.DescriptorId.html @@ -1,4 +1,4 @@ -DescriptorId in bdk_chain - Rust
    bdk_chain

    Struct DescriptorId

    Source 
    pub struct DescriptorId(pub Hash);
    Expand description

    Represents the unique ID of a descriptor.

    +DescriptorId in bdk_chain - Rust
    bdk_chain

    Struct DescriptorId

    Source 
    pub struct DescriptorId(pub Hash);
    Expand description

    Represents the unique ID of a descriptor.

    This is useful for having a fixed-length unique representation of a descriptor, in particular, we use it to persist application state changes related to the descriptor without having to re-write the whole descriptor each time.

    diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.FullTxOut.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.FullTxOut.html index 7567af8f47..015b2665b5 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.FullTxOut.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.FullTxOut.html @@ -1,4 +1,4 @@ -FullTxOut in bdk_chain - Rust
    bdk_chain

    Struct FullTxOut

    Source 
    pub struct FullTxOut<A> {
+FullTxOut in bdk_chain - Rust
    bdk_chain
    Struct FullTxOut
    Source 
    pub struct FullTxOut<A> {
     pub chain_position: ChainPosition<A>,
     pub outpoint: OutPoint,
     pub txout: TxOut,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.Impl.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.Impl.html
index 564ad604f7..06fbc417d0 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.Impl.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.Impl.html
@@ -1,4 +1,4 @@
-Impl in bdk_chain - Rust
    bdk_chain
    Struct Impl
    Source 
    pub struct Impl<T>(pub T);
    Expand description
    A wrapper that we use to impl remote traits for types in our crate or dependency crates.
    
+Impl in bdk_chain - Rust
    bdk_chain
    Struct Impl
    Source 
    pub struct Impl<T>(pub T);
    Expand description
    A wrapper that we use to impl remote traits for types in our crate or dependency crates.
    
 
    Tuple Fields§
    §0: T
    Implementations§
    Source§
    impl<T> Impl<T>
    Source
    pub fn into_inner(self) -> T
    Returns the inner T.
    
 
    Trait Implementations§
    Source§
    impl<T> Deref for Impl<T>
    Source§
    type Target = T
    The resulting type after dereferencing.
    Source§
    fn deref(&self) -> &Self::Target
    Dereferences the value.
    Source§
    impl<T> From<T> for Impl<T>
    Source§
    fn from(value: T) -> Self
    Converts to this type from the input type.
    Source§
    impl FromSql for Impl<Amount>
    Source§
    fn column_result(value: ValueRef<'_>) -> FromSqlResult<Self>
    Converts SQLite value into Rust value.
    Source§
    impl FromSql for Impl<BlockHash>
    Source§
    fn column_result(value: ValueRef<'_>) -> FromSqlResult<Self>
    Converts SQLite value into Rust value.
    Source§
    impl FromSql for Impl<Descriptor<DescriptorPublicKey>>
    Source§
    fn column_result(value: ValueRef<'_>) -> FromSqlResult<Self>
    Converts SQLite value into Rust value.
    Source§
    impl FromSql for Impl<DescriptorId>
    Source§
    fn column_result(value: ValueRef<'_>) -> FromSqlResult<Self>
    Converts SQLite value into Rust value.
    Source§
    impl FromSql for Impl<Network>
    Source§
    fn column_result(value: ValueRef<'_>) -> FromSqlResult<Self>
    Converts SQLite value into Rust value.
    Source§
    impl FromSql for Impl<ScriptBuf>
    Source§
    fn column_result(value: ValueRef<'_>) -> FromSqlResult<Self>
    Converts SQLite value into Rust value.
    Source§
    impl FromSql for Impl<Transaction>
    Source§
    fn column_result(value: ValueRef<'_>) -> FromSqlResult<Self>
    Converts SQLite value into Rust value.
    Source§
    impl FromSql for Impl<Txid>
    Source§
    fn column_result(value: ValueRef<'_>) -> FromSqlResult<Self>
    Converts SQLite value into Rust value.
    Source§
    impl ToSql for Impl<Amount>
    Source§
    fn to_sql(&self) -> Result<ToSqlOutput<'_>>
    Converts Rust value to SQLite value
    Source§
    impl ToSql for Impl<BlockHash>
    Source§
    fn to_sql(&self) -> Result<ToSqlOutput<'_>>
    Converts Rust value to SQLite value
    Source§
    impl ToSql for Impl<Descriptor<DescriptorPublicKey>>
    Source§
    fn to_sql(&self) -> Result<ToSqlOutput<'_>>
    Converts Rust value to SQLite value
    Source§
    impl ToSql for Impl<DescriptorId>
    Source§
    fn to_sql(&self) -> Result<ToSqlOutput<'_>>
    Converts Rust value to SQLite value
    Source§
    impl ToSql for Impl<Network>
    Source§
    fn to_sql(&self) -> Result<ToSqlOutput<'_>>
    Converts Rust value to SQLite value
    Source§
    impl ToSql for Impl<ScriptBuf>
    Source§
    fn to_sql(&self) -> Result<ToSqlOutput<'_>>
    Converts Rust value to SQLite value
    Source§
    impl ToSql for Impl<Transaction>
    Source§
    fn to_sql(&self) -> Result<ToSqlOutput<'_>>
    Converts Rust value to SQLite value
    Source§
    impl ToSql for Impl<Txid>
    Source§
    fn to_sql(&self) -> Result<ToSqlOutput<'_>>
    Converts Rust value to SQLite value
    Auto Trait Implementations§
    §
    impl<T> Freeze for Impl<T>
    where
     T: Freeze,
    §
    impl<T> RefUnwindSafe for Impl<T>
    where
@@ -14,9 +14,9 @@
     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<P, T> Receiver for P
    where +

    Source§

    impl<P, T> Receiver for P
    where P: Deref<Target = T> + ?Sized, - T: ?Sized,

    Source§

    type Target = T

    🔬This is a nightly-only experimental API. (arbitrary_self_types)
    The target type on which the method may be called.
    Source§

    impl<T, U> TryFrom<U> for T
    where + T: ?Sized,

    Source§

    type Target = T

    🔬This is a nightly-only experimental API. (arbitrary_self_types)
    The target type on which the method may be called.
    Source§

    impl<T, U> TryFrom<U> for T
    where U: Into<T>,

    Source§

    type Error = Infallible

    The type returned in the event of a conversion 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>,

    Source§

    type Error = <U as TryFrom<T>>::Error

    The type returned in the event of a conversion error.
    Source§

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

    Performs the conversion.
    §

    impl<V, T> VZip<V> for T
    where V: MultiLane<T>,

    §

    fn vzip(self) -> V

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.SpkIterator.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.SpkIterator.html index f9989dd747..3000eb026f 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.SpkIterator.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.SpkIterator.html @@ -1,4 +1,4 @@ -SpkIterator in bdk_chain - Rust
    bdk_chain

    Struct SpkIterator

    Source 
    pub struct SpkIterator<D> { /* private fields */ }
    Expand description

    An iterator for derived script pubkeys.

    +SpkIterator in bdk_chain - Rust
    bdk_chain

    Struct SpkIterator

    Source 
    pub struct SpkIterator<D> { /* private fields */ }
    Expand description

    An iterator for derived script pubkeys.

    SpkIterator is an implementation of the Iterator trait which possesses its own next() and nth() functions, both of which circumvent the unnecessary intermediate derivations required when using their default implementations.

    diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.TxPosInBlock.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.TxPosInBlock.html index 8d8c4e8dd8..d783e706e6 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.TxPosInBlock.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.TxPosInBlock.html @@ -1,4 +1,4 @@ -TxPosInBlock in bdk_chain - Rust
    bdk_chain

    Struct TxPosInBlock

    Source 
    pub struct TxPosInBlock<'b> {
+TxPosInBlock in bdk_chain - Rust
    bdk_chain
    Struct TxPosInBlock
    Source 
    pub struct TxPosInBlock<'b> {
     pub block: &'b Block,
     pub block_id: BlockId,
     pub tx_pos: usize,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.TxUpdate.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.TxUpdate.html
index 3731ca73fe..eafc1070b8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.TxUpdate.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.TxUpdate.html
@@ -1,4 +1,4 @@
-TxUpdate in bdk_chain - Rust
    bdk_chain
    Struct TxUpdate
    Source 
    pub struct TxUpdate<A = ()> {
+TxUpdate in bdk_chain - Rust
    bdk_chain
    Struct TxUpdate
    pub struct TxUpdate<A = ()> {
     pub txs: Vec<Arc<Transaction>>,
     pub txouts: BTreeMap<OutPoint, TxOut>,
     pub anchors: BTreeSet<(A, Txid)>,
@@ -14,16 +14,16 @@ the fee of a wallet transaction.
    
 confirmed.
    
 
    §seen_ats: HashMap<Txid, u64>
    Seen at times for transactions. This records when a transaction was most recently seen in
 the user’s mempool for the sake of tie-breaking other conflicting transactions.
    
-
    Implementations§
    Source§
    impl<A> TxUpdate<A>
    where
-    A: Ord,
    Source
    pub fn map_anchors<A2, F>(self, map: F) -> TxUpdate<A2>
    where
+
    Implementations§
    §
    impl<A> TxUpdate<A>
    where
+    A: Ord,
    pub fn map_anchors<A2, F>(self, map: F) -> TxUpdate<A2>
    where
     A2: Ord,
     F: FnMut(A) -> A2,
    Transforms the TxUpdate to have anchors (A) of another type (A2).
    
 
    This takes in a closure with signature FnMut(A) -> A2 which is called for each anchor to
 transform it.
    
-
    Source
    pub fn extend(&mut self, other: TxUpdate<A>)
    Extend this update with other.
    
-
    Trait Implementations§
    Source§
    impl<A> Clone for TxUpdate<A>
    where
-    A: Clone,
    Source§
    fn clone(&self) -> TxUpdate<A>
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    Source§
    impl<A> Debug for TxUpdate<A>
    where
-    A: Debug,
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    Source§
    impl<A> Default for TxUpdate<A>
    Source§
    fn default() -> TxUpdate<A>
    Returns the “default value” for a type. Read more
    Source§
    impl<A: Ord> From<TxGraph<A>> for TxUpdate<A>
    Source§
    fn from(graph: TxGraph<A>) -> Self
    Converts to this type from the input type.
    Source§
    impl<A: Anchor> From<TxUpdate<A>> for TxGraph<A>
    Source§
    fn from(update: TxUpdate<A>) -> Self
    Converts to this type from the input type.
    Auto Trait Implementations§
    §
    impl<A> Freeze for TxUpdate<A>
    §
    impl<A> RefUnwindSafe for TxUpdate<A>
    where
+
    pub fn extend(&mut self, other: TxUpdate<A>)
    Extend this update with other.
    
+
    Trait Implementations§
    §
    impl<A> Clone for TxUpdate<A>
    where
+    A: Clone,
    §
    fn clone(&self) -> TxUpdate<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
    §
    impl<A> Debug for TxUpdate<A>
    where
+    A: Debug,
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    §
    impl<A> Default for TxUpdate<A>
    §
    fn default() -> TxUpdate<A>
    Returns the “default value” for a type. Read more
    Source§
    impl<A: Ord> From<TxGraph<A>> for TxUpdate<A>
    Source§
    fn from(graph: TxGraph<A>) -> Self
    Converts to this type from the input type.
    Source§
    impl<A: Anchor> From<TxUpdate<A>> for TxGraph<A>
    Source§
    fn from(update: TxUpdate<A>) -> Self
    Converts to this type from the input type.
    Auto Trait Implementations§
    §
    impl<A> Freeze for TxUpdate<A>
    §
    impl<A> RefUnwindSafe for TxUpdate<A>
    where
     A: RefUnwindSafe,
    §
    impl<A> Send for TxUpdate<A>
    where
     A: Send,
    §
    impl<A> Sync for TxUpdate<A>
    where
     A: Sync,
    §
    impl<A> Unpin for TxUpdate<A>
    §
    impl<A> UnwindSafe for TxUpdate<A>
    where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.Anchor.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.Anchor.html
index ab3e07d442..52ca86baaf 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.Anchor.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.Anchor.html
@@ -1,4 +1,4 @@
-Anchor in bdk_chain - Rust
    bdk_chain
    Trait Anchor
    Source 
    pub trait Anchor:
+Anchor in bdk_chain - Rust
    bdk_chain
    Trait Anchor
    Source 
    pub trait Anchor:
     Debug
     + Clone
     + Eq
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.ChainOracle.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.ChainOracle.html
index 78abbdd00d..f76b032ad9 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.ChainOracle.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.ChainOracle.html
@@ -1,4 +1,4 @@
-ChainOracle in bdk_chain - Rust
    bdk_chain
    Trait ChainOracle
    Source 
    pub trait ChainOracle {
+ChainOracle in bdk_chain - Rust
    bdk_chain
    Trait ChainOracle
    Source 
    pub trait ChainOracle {
     type Error: Debug;
 
     // Required methods
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.DescriptorExt.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.DescriptorExt.html
index bde698adcf..59ad655b1f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.DescriptorExt.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.DescriptorExt.html
@@ -1,4 +1,4 @@
-DescriptorExt in bdk_chain - Rust
    bdk_chain
    Trait DescriptorExt
    Source 
    pub trait DescriptorExt {
+DescriptorExt in bdk_chain - Rust
    bdk_chain
    Trait DescriptorExt
    Source 
    pub trait DescriptorExt {
     // Required methods
     fn dust_value(&self) -> Amount;
     fn descriptor_id(&self) -> DescriptorId;
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.Merge.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.Merge.html
index 7aca91cd05..d534a99758 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.Merge.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.Merge.html
@@ -1,4 +1,4 @@
-Merge in bdk_chain - Rust
    bdk_chain
    Trait Merge
    Source 
    pub trait Merge: Default {
+Merge in bdk_chain - Rust
    bdk_chain
    Trait Merge
    pub trait Merge: Default {
     // Required methods
     fn merge(&mut self, other: Self);
     fn is_empty(&self) -> bool;
@@ -6,39 +6,39 @@
     // Provided method
     fn take(&mut self) -> Option<Self> { ... }
 }
    Expand description
    Trait that makes an object mergeable.
    
-
    Required Methods§
    Source
    fn merge(&mut self, other: Self)
    Merge another object of the same type onto self.
    
-
    Source
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    
-
    Provided Methods§
    Source
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    
-
    Dyn Compatibility§
    This trait is not dyn compatible.
    In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.
    Implementations on Foreign Types§
    Source§
    impl Merge for ()
    Source§
    fn merge(&mut self, _other: ())
    Source§
    fn is_empty(&self) -> bool
    Source§
    impl<K, V> Merge for BTreeMap<K, V>
    where
-    K: Ord,
    Source§
    fn merge(&mut self, other: BTreeMap<K, V>)
    Source§
    fn is_empty(&self) -> bool
    Source§
    impl<T0> Merge for (T0,)
    where
-    T0: Merge,
    Source§
    fn merge(&mut self, _other: (T0,))
    Source§
    fn is_empty(&self) -> bool
    Source§
    impl<T0, T1> Merge for (T0, T1)
    where
+
    Required Methods§
    fn merge(&mut self, other: Self)
    Merge another object of the same type onto self.
    
+
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    
+
    Provided Methods§
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    
+
    Dyn Compatibility§
    This trait is not dyn compatible.
    In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.
    Implementations on Foreign Types§
    §
    impl Merge for ()
    §
    fn merge(&mut self, _other: ())
    §
    fn is_empty(&self) -> bool
    §
    impl<K, V> Merge for BTreeMap<K, V>
    where
+    K: Ord,
    §
    fn merge(&mut self, other: BTreeMap<K, V>)
    §
    fn is_empty(&self) -> bool
    §
    impl<T0> Merge for (T0,)
    where
+    T0: Merge,
    §
    fn merge(&mut self, _other: (T0,))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1> Merge for (T0, T1)
    where
     T0: Merge,
-    T1: Merge,
    Source§
    fn merge(&mut self, _other: (T0, T1))
    Source§
    fn is_empty(&self) -> bool
    Source§
    impl<T0, T1, T2> Merge for (T0, T1, T2)
    where
+    T1: Merge,
    §
    fn merge(&mut self, _other: (T0, T1))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1, T2> Merge for (T0, T1, T2)
    where
     T0: Merge,
     T1: Merge,
-    T2: Merge,
    Source§
    fn merge(&mut self, _other: (T0, T1, T2))
    Source§
    fn is_empty(&self) -> bool
    Source§
    impl<T0, T1, T2, T3> Merge for (T0, T1, T2, T3)
    where
+    T2: Merge,
    §
    fn merge(&mut self, _other: (T0, T1, T2))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1, T2, T3> Merge for (T0, T1, T2, T3)
    where
     T0: Merge,
     T1: Merge,
     T2: Merge,
-    T3: Merge,
    Source§
    fn merge(&mut self, _other: (T0, T1, T2, T3))
    Source§
    fn is_empty(&self) -> bool
    Source§
    impl<T0, T1, T2, T3, T4> Merge for (T0, T1, T2, T3, T4)
    where
+    T3: Merge,
    §
    fn merge(&mut self, _other: (T0, T1, T2, T3))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1, T2, T3, T4> Merge for (T0, T1, T2, T3, T4)
    where
     T0: Merge,
     T1: Merge,
     T2: Merge,
     T3: Merge,
-    T4: Merge,
    Source§
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4))
    Source§
    fn is_empty(&self) -> bool
    Source§
    impl<T0, T1, T2, T3, T4, T5> Merge for (T0, T1, T2, T3, T4, T5)
    where
+    T4: Merge,
    §
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1, T2, T3, T4, T5> Merge for (T0, T1, T2, T3, T4, T5)
    where
     T0: Merge,
     T1: Merge,
     T2: Merge,
     T3: Merge,
     T4: Merge,
-    T5: Merge,
    Source§
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5))
    Source§
    fn is_empty(&self) -> bool
    Source§
    impl<T0, T1, T2, T3, T4, T5, T6> Merge for (T0, T1, T2, T3, T4, T5, T6)
    where
+    T5: Merge,
    §
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1, T2, T3, T4, T5, T6> Merge for (T0, T1, T2, T3, T4, T5, T6)
    where
     T0: Merge,
     T1: Merge,
     T2: Merge,
     T3: Merge,
     T4: Merge,
     T5: Merge,
-    T6: Merge,
    Source§
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6))
    Source§
    fn is_empty(&self) -> bool
    Source§
    impl<T0, T1, T2, T3, T4, T5, T6, T7> Merge for (T0, T1, T2, T3, T4, T5, T6, T7)
    where
+    T6: Merge,
    §
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1, T2, T3, T4, T5, T6, T7> Merge for (T0, T1, T2, T3, T4, T5, T6, T7)
    where
     T0: Merge,
     T1: Merge,
     T2: Merge,
@@ -46,7 +46,7 @@
     T4: Merge,
     T5: Merge,
     T6: Merge,
-    T7: Merge,
    Source§
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6, T7))
    Source§
    fn is_empty(&self) -> bool
    Source§
    impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Merge for (T0, T1, T2, T3, T4, T5, T6, T7, T8)
    where
+    T7: Merge,
    §
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6, T7))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Merge for (T0, T1, T2, T3, T4, T5, T6, T7, T8)
    where
     T0: Merge,
     T1: Merge,
     T2: Merge,
@@ -55,7 +55,7 @@
     T5: Merge,
     T6: Merge,
     T7: Merge,
-    T8: Merge,
    Source§
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6, T7, T8))
    Source§
    fn is_empty(&self) -> bool
    Source§
    impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Merge for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)
    where
+    T8: Merge,
    §
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6, T7, T8))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Merge for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)
    where
     T0: Merge,
     T1: Merge,
     T2: Merge,
@@ -65,7 +65,7 @@
     T6: Merge,
     T7: Merge,
     T8: Merge,
-    T9: Merge,
    Source§
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9))
    Source§
    fn is_empty(&self) -> bool
    Source§
    impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Merge for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)
    where
+    T9: Merge,
    §
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Merge for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)
    where
     T0: Merge,
     T1: Merge,
     T2: Merge,
@@ -76,5 +76,5 @@
     T7: Merge,
     T8: Merge,
     T9: Merge,
-    T10: Merge,
    Source§
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10))
    Source§
    fn is_empty(&self) -> bool
    Source§
    impl<T> Merge for BTreeSet<T>
    where
-    T: Ord,
    Source§
    fn merge(&mut self, other: BTreeSet<T>)
    Source§
    fn is_empty(&self) -> bool
    Implementors§
    Source§
    impl Merge for bdk_chain::indexer::keychain_txout::ChangeSet
    Source§
    impl Merge for bdk_chain::local_chain::ChangeSet
    Source§
    impl<A: Ord> Merge for bdk_chain::tx_graph::ChangeSet<A>
    Source§
    impl<A: Anchor, IA: Merge> Merge for bdk_chain::indexed_tx_graph::ChangeSet<A, IA>
    Source§
    impl<T> Merge for Vec<T>
    
\ No newline at end of file
+    T10: Merge,

    §

    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10))

    §

    fn is_empty(&self) -> bool

    §

    impl<T> Merge for BTreeSet<T>
    where + T: Ord,

    §

    fn merge(&mut self, other: BTreeSet<T>)

    §

    fn is_empty(&self) -> bool

    Implementors§

    Source§

    impl Merge for bdk_chain::indexer::keychain_txout::ChangeSet

    Source§

    impl Merge for bdk_chain::local_chain::ChangeSet

    Source§

    impl<A: Ord> Merge for bdk_chain::tx_graph::ChangeSet<A>

    Source§

    impl<A: Anchor, IA: Merge> Merge for bdk_chain::indexed_tx_graph::ChangeSet<A, IA>

    §

    impl<T> Merge for Vec<T>

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/enum.CalculateFeeError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/enum.CalculateFeeError.html index 3366a2e1fa..46a4b6530c 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/enum.CalculateFeeError.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/enum.CalculateFeeError.html @@ -1,4 +1,4 @@ -CalculateFeeError in bdk_chain::tx_graph - Rust
    bdk_chain::tx_graph

    Enum CalculateFeeError

    Source 
    pub enum CalculateFeeError {
+CalculateFeeError in bdk_chain::tx_graph - Rust
    bdk_chain::tx_graph
    Enum CalculateFeeError
    Source 
    pub enum CalculateFeeError {
     MissingTxOut(Vec<OutPoint>),
     NegativeFee(SignedAmount),
 }
    Expand description
    Errors returned by TxGraph::calculate_fee.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/index.html
index d0d03d47e1..9ce5e25060 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/index.html
@@ -1,4 +1,4 @@
-bdk_chain::tx_graph - Rust
    bdk_chain
    Module tx_graph
    Source 
    Expand description
    Module for structures that store and traverse transactions.
    
+bdk_chain::tx_graph - Rust
    bdk_chain
    Module tx_graph
    Source 
    Expand description
    Module for structures that store and traverse transactions.
    
 
    TxGraph contains transactions and indexes them so you can easily traverse the graph of
 those transactions. TxGraph is monotone in that you can always insert a transaction – it
 does not care whether that transaction is in the current best chain or whether it conflicts with
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.CanonicalTx.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.CanonicalTx.html
index c7ae3c9dca..2f2ddc770e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.CanonicalTx.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.CanonicalTx.html
@@ -1,4 +1,4 @@
-CanonicalTx in bdk_chain::tx_graph - Rust
    bdk_chain::tx_graph
    Struct CanonicalTx
    Source 
    pub struct CanonicalTx<'a, T, A> {
+CanonicalTx in bdk_chain::tx_graph - Rust
    bdk_chain::tx_graph
    Struct CanonicalTx
    Source 
    pub struct CanonicalTx<'a, T, A> {
     pub chain_position: ChainPosition<A>,
     pub tx_node: TxNode<'a, T, A>,
 }
    Expand description
    A transaction that is deemed to be part of the canonical history.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.ChangeSet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.ChangeSet.html
index 34b1b3a3c1..7520ca2cdd 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.ChangeSet.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.ChangeSet.html
@@ -1,4 +1,4 @@
-ChangeSet in bdk_chain::tx_graph - Rust
    bdk_chain::tx_graph
    Struct ChangeSet
    Source 
    pub struct ChangeSet<A = ()> {
+ChangeSet in bdk_chain::tx_graph - Rust
    bdk_chain::tx_graph
    Struct ChangeSet
    Source 
    pub struct ChangeSet<A = ()> {
     pub txs: BTreeSet<Arc<Transaction>>,
     pub txouts: BTreeMap<OutPoint, TxOut>,
     pub anchors: BTreeSet<(A, Txid)>,
@@ -33,7 +33,7 @@ transform it.
    
 
    Remember to call Self::init_sqlite_tables beforehand.
    
 
    Trait Implementations§
    Source§
    impl<A: Clone> Clone for ChangeSet<A>
    Source§
    fn clone(&self) -> ChangeSet<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 ChangeSet<A>
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    Source§
    impl<A> Default for ChangeSet<A>
    Source§
    fn default() -> Self
    Returns the “default value” for a type. Read more
    Source§
    impl<'de, A> Deserialize<'de> for ChangeSet<A>
    where
     A: Ord + Deserialize<'de>,
    Source§
    fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
    where
-    __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    Source§
    impl<A, IA: Default> From<ChangeSet<A>> for ChangeSet<A, IA>
    Source§
    fn from(graph: ChangeSet<A>) -> Self
    Converts to this type from the input type.
    Source§
    impl<A: Ord> Merge for ChangeSet<A>
    Source§
    fn merge(&mut self, other: Self)
    Merge another object of the same type onto self.
    Source§
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    Source§
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    Source§
    impl<A: PartialEq> PartialEq for ChangeSet<A>
    Source§
    fn eq(&self, other: &ChangeSet<A>) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,
+    __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    Source§
    impl<A, IA: Default> From<ChangeSet<A>> for ChangeSet<A, IA>
    Source§
    fn from(graph: ChangeSet<A>) -> Self
    Converts to this type from the input type.
    Source§
    impl<A: Ord> Merge for ChangeSet<A>
    Source§
    fn merge(&mut self, other: Self)
    Merge another object of the same type onto self.
    Source§
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    §
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    Source§
    impl<A: PartialEq> PartialEq for ChangeSet<A>
    Source§
    fn eq(&self, other: &ChangeSet<A>) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
    Source§
    impl<A> Serialize for ChangeSet<A>
    where
     A: Ord + Serialize,
    Source§
    fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
    where
     __S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    Source§
    impl<A> StructuralPartialEq for ChangeSet<A>

    Auto Trait Implementations§

    §

    impl<A> Freeze for ChangeSet<A>

    §

    impl<A> RefUnwindSafe for ChangeSet<A>
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxAncestors.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxAncestors.html index ff545a19dc..4a0f5c9d1d 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxAncestors.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxAncestors.html @@ -1,4 +1,4 @@ -TxAncestors in bdk_chain::tx_graph - Rust
    bdk_chain::tx_graph

    Struct TxAncestors

    Source 
    pub struct TxAncestors<'g, A, F, O>
    where
+TxAncestors in bdk_chain::tx_graph - Rust
    bdk_chain::tx_graph
    Struct TxAncestors
    Source 
    pub struct TxAncestors<'g, A, F, O>
    where
     F: FnMut(usize, Arc<Transaction>) -> Option<O>,
    { /* private fields */ }
    Expand description
    An iterator that traverses ancestors of a given root transaction.
    
 
    The iterator excludes partial transactions.
    
 
    Returned by the walk_ancestors method of TxGraph.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxDescendants.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxDescendants.html
index 692562c774..af9f1e36be 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxDescendants.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxDescendants.html
@@ -1,4 +1,4 @@
-TxDescendants in bdk_chain::tx_graph - Rust
    bdk_chain::tx_graph
    Struct TxDescendants
    Source 
    pub struct TxDescendants<'g, A, F, O>
    where
+TxDescendants in bdk_chain::tx_graph - Rust
    bdk_chain::tx_graph
    Struct TxDescendants
    Source 
    pub struct TxDescendants<'g, A, F, O>
    where
     F: FnMut(usize, Txid) -> Option<O>,
    { /* private fields */ }
    Expand description
    An iterator that traverses transaction descendants.
    
 
    Returned by the walk_descendants method of TxGraph.
    
 
    Implementations§
    Source§
    impl<'g, A, F, O> TxDescendants<'g, A, F, O>
    where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxGraph.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxGraph.html
index 19b1eda727..bccdac8760 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxGraph.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxGraph.html
@@ -1,4 +1,4 @@
-TxGraph in bdk_chain::tx_graph - Rust
    bdk_chain::tx_graph
    Struct TxGraph
    Source 
    pub struct TxGraph<A = ConfirmationBlockTime> { /* private fields */ }
    Expand description
    A graph of transactions and spends.
    
+TxGraph in bdk_chain::tx_graph - Rust
    bdk_chain::tx_graph
    Struct TxGraph
    Source 
    pub struct TxGraph<A = ConfirmationBlockTime> { /* private fields */ }
    Expand description
    A graph of transactions and spends.
    
 
    See the module-level documentation for more.
    
 
    Implementations§
    Source§
    impl<A> TxGraph<A>
    Source
    pub fn all_txouts(&self) -> impl Iterator<Item = (OutPoint, &TxOut)>
    Iterate over all tx outputs known by TxGraph.
    
 
    This includes txouts of both full transactions as well as floating transactions.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxNode.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxNode.html
index baf8bfa203..a4470e4f05 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxNode.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxNode.html
@@ -1,4 +1,4 @@
-TxNode in bdk_chain::tx_graph - Rust
    bdk_chain::tx_graph
    Struct TxNode
    Source 
    pub struct TxNode<'a, T, A> {
+TxNode in bdk_chain::tx_graph - Rust
    bdk_chain::tx_graph
    Struct TxNode
    Source 
    pub struct TxNode<'a, T, A> {
     pub txid: Txid,
     pub tx: T,
     pub anchors: &'a BTreeSet<A>,
@@ -36,9 +36,9 @@ the >= operator. 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<P, T> Receiver for P
    where
+
    Source§
    impl<P, T> Receiver for P
    where
     P: Deref<Target = T> + ?Sized,
-    T: ?Sized,
    Source§
    type Target = T
    🔬This is a nightly-only experimental API. (arbitrary_self_types)
    The target type on which the method may be called.
    Source§
    impl<T> ToOwned for T
    where
+    T: ?Sized,
    Source§
    type Target = T
    🔬This is a nightly-only experimental API. (arbitrary_self_types)
    The target type on which the method may be called.
    Source§
    impl<T> ToOwned for T
    where
     T: Clone,
    Source§
    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>,
    Source§
    type Error = Infallible
    The type returned in the event of a conversion 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>,
    Source§
    type Error = <U as TryFrom<T>>::Error
    The type returned in the event of a conversion error.
    Source§
    fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
    Performs the conversion.
    §
    impl<V, T> VZip<V> for T
    where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxUpdate.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxUpdate.html
index 333e186a53..f9e87bd049 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxUpdate.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxUpdate.html
@@ -1,4 +1,4 @@
-TxUpdate in bdk_chain::tx_graph - Rust
    bdk_chain::tx_graph
    Struct TxUpdate
    Source 
    pub struct TxUpdate<A = ()> {
+TxUpdate in bdk_chain::tx_graph - Rust
    bdk_chain::tx_graph
    Struct TxUpdate
    pub struct TxUpdate<A = ()> {
     pub txs: Vec<Arc<Transaction>>,
     pub txouts: BTreeMap<OutPoint, TxOut>,
     pub anchors: BTreeSet<(A, Txid)>,
@@ -14,16 +14,16 @@ the fee of a wallet transaction.
    
 confirmed.
    
 
    §seen_ats: HashMap<Txid, u64>
    Seen at times for transactions. This records when a transaction was most recently seen in
 the user’s mempool for the sake of tie-breaking other conflicting transactions.
    
-
    Implementations§
    Source§
    impl<A> TxUpdate<A>
    where
-    A: Ord,
    Source
    pub fn map_anchors<A2, F>(self, map: F) -> TxUpdate<A2>
    where
+
    Implementations§
    §
    impl<A> TxUpdate<A>
    where
+    A: Ord,
    pub fn map_anchors<A2, F>(self, map: F) -> TxUpdate<A2>
    where
     A2: Ord,
     F: FnMut(A) -> A2,
    Transforms the TxUpdate to have anchors (A) of another type (A2).
    
 
    This takes in a closure with signature FnMut(A) -> A2 which is called for each anchor to
 transform it.
    
-
    Source
    pub fn extend(&mut self, other: TxUpdate<A>)
    Extend this update with other.
    
-
    Trait Implementations§
    Source§
    impl<A> Clone for TxUpdate<A>
    where
-    A: Clone,
    Source§
    fn clone(&self) -> TxUpdate<A>
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    Source§
    impl<A> Debug for TxUpdate<A>
    where
-    A: Debug,
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    Source§
    impl<A> Default for TxUpdate<A>
    Source§
    fn default() -> TxUpdate<A>
    Returns the “default value” for a type. Read more
    Source§
    impl<A: Ord> From<TxGraph<A>> for TxUpdate<A>
    Source§
    fn from(graph: TxGraph<A>) -> Self
    Converts to this type from the input type.
    Source§
    impl<A: Anchor> From<TxUpdate<A>> for TxGraph<A>
    Source§
    fn from(update: TxUpdate<A>) -> Self
    Converts to this type from the input type.
    Auto Trait Implementations§
    §
    impl<A> Freeze for TxUpdate<A>
    §
    impl<A> RefUnwindSafe for TxUpdate<A>
    where
+
    pub fn extend(&mut self, other: TxUpdate<A>)
    Extend this update with other.
    
+
    Trait Implementations§
    §
    impl<A> Clone for TxUpdate<A>
    where
+    A: Clone,
    §
    fn clone(&self) -> TxUpdate<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
    §
    impl<A> Debug for TxUpdate<A>
    where
+    A: Debug,
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    §
    impl<A> Default for TxUpdate<A>
    §
    fn default() -> TxUpdate<A>
    Returns the “default value” for a type. Read more
    Source§
    impl<A: Ord> From<TxGraph<A>> for TxUpdate<A>
    Source§
    fn from(graph: TxGraph<A>) -> Self
    Converts to this type from the input type.
    Source§
    impl<A: Anchor> From<TxUpdate<A>> for TxGraph<A>
    Source§
    fn from(update: TxUpdate<A>) -> Self
    Converts to this type from the input type.
    Auto Trait Implementations§
    §
    impl<A> Freeze for TxUpdate<A>
    §
    impl<A> RefUnwindSafe for TxUpdate<A>
    where
     A: RefUnwindSafe,
    §
    impl<A> Send for TxUpdate<A>
    where
     A: Send,
    §
    impl<A> Sync for TxUpdate<A>
    where
     A: Sync,
    §
    impl<A> Unpin for TxUpdate<A>
    §
    impl<A> UnwindSafe for TxUpdate<A>
    where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/type.Indexed.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/type.Indexed.html
index 52eba7c099..b0f4bba4a1 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/type.Indexed.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/type.Indexed.html
@@ -1,2 +1,2 @@
-Indexed in bdk_chain - Rust
    bdk_chain
    Type Alias Indexed
    Source 
    pub type Indexed<T> = (u32, T);
    Expand description
    A tuple of keychain index and T representing the indexed value.
    
+Indexed in bdk_chain - Rust
    bdk_chain
    Type Alias Indexed
    pub type Indexed<T> = (u32, T);
    Expand description
    A tuple of keychain index and T representing the indexed value.
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/type.KeychainIndexed.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/type.KeychainIndexed.html
index f8645bfd54..d8cc519af0 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/type.KeychainIndexed.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/type.KeychainIndexed.html
@@ -1,2 +1,2 @@
-KeychainIndexed in bdk_chain - Rust
    bdk_chain
    Type Alias KeychainIndexed
    Source 
    pub type KeychainIndexed<K, T> = ((K, u32), T);
    Expand description
    A tuple of keychain K, derivation index (u32) and a T associated with them.
    
+KeychainIndexed in bdk_chain - Rust
    bdk_chain
    Type Alias KeychainIndexed
    pub type KeychainIndexed<K, T> = ((K, u32), T);
    Expand description
    A tuple of keychain K, derivation index (u32) and a T associated with them.
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/all.html
index 9c5a636ce8..f2e931e5db 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/all.html
@@ -1 +1 @@
-List of all items in this crate
    List of all items
    Structs
    Enums
    Traits
    Type Aliases
    
\ No newline at end of file
+List of all items in this crate
    List of all items
    Structs
    Enums
    Traits
    Type Aliases
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/index.html
index 9b6d8eb4b6..126d044f8f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/index.html
@@ -1,3 +1,3 @@
-bdk_core - Rust
    Crate bdk_core
    Source 
    Expand description
    This crate is a collection of core structures for [Bitcoin Dev Kit].
    
+bdk_core - Rust
    Crate bdk_core
    Source 
    Expand description
    This crate is a collection of core structures for [Bitcoin Dev Kit].
    
 
    Re-exports§
    • pub extern crate serde;
    • pub use bitcoin;
    Modules§
    • spk_client
      Helper types for spk-based blockchain clients.
    Structs§
    • BlockId
      A reference to a block in the canonical chain.
    • CheckPoint
      A checkpoint is a node of a reference-counted linked list of BlockIds.
    • CheckPointIter
      Iterates over checkpoints backwards.
    • ConfirmationBlockTime
      Represents the confirmation block and time of a transaction.
    • TxUpdate
      Data object used to communicate updates about relevant transactions from some chain data source
 to the core model (usually a bdk_chain::TxGraph).
    Traits§
    • Merge
      Trait that makes an object mergeable.
    Type Aliases§
    • Indexed
      A tuple of keychain index and T representing the indexed value.
    • KeychainIndexed
      A tuple of keychain K, derivation index (u32) and a T associated with them.
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/enum.SyncItem.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/enum.SyncItem.html
index 0358e0686d..9344a481b8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/enum.SyncItem.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/enum.SyncItem.html
@@ -1,4 +1,4 @@
-SyncItem in bdk_core::spk_client - Rust
    bdk_core::spk_client
    Enum SyncItem
    Source 
    pub enum SyncItem<'i, I> {
+SyncItem in bdk_core::spk_client - Rust
    bdk_core::spk_client
    Enum SyncItem
    Source 
    pub enum SyncItem<'i, I> {
     Spk(I, &'i Script),
     Txid(Txid),
     OutPoint(OutPoint),
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/index.html
index 397393bd78..91e418f9ab 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/index.html
@@ -1,2 +1,2 @@
-bdk_core::spk_client - Rust
    bdk_core
    Module spk_client
    Source 
    Expand description
    Helper types for spk-based blockchain clients.
    
+bdk_core::spk_client - Rust
    bdk_core
    Module spk_client
    Source 
    Expand description
    Helper types for spk-based blockchain clients.
    
 
    Structs§
    Enums§
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.FullScanRequest.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.FullScanRequest.html
index 08d74324c2..4904c23341 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.FullScanRequest.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.FullScanRequest.html
@@ -1,4 +1,4 @@
-FullScanRequest in bdk_core::spk_client - Rust
    bdk_core::spk_client
    Struct FullScanRequest
    Source 
    pub struct FullScanRequest<K> { /* private fields */ }
    Expand description
    Data required to perform a spk-based blockchain client full scan.
    
+FullScanRequest in bdk_core::spk_client - Rust
    bdk_core::spk_client
    Struct FullScanRequest
    Source 
    pub struct FullScanRequest<K> { /* private fields */ }
    Expand description
    Data required to perform a spk-based blockchain client full scan.
    
 
    A client full scan iterates through all the scripts for the given keychains, fetching relevant
 data until some stop gap number of scripts is found that have no data. This operation is
 generally only used when importing or restoring previously used keychains in which the list of
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.FullScanRequestBuilder.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.FullScanRequestBuilder.html
index c09f64e078..810f5b2749 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.FullScanRequestBuilder.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.FullScanRequestBuilder.html
@@ -1,4 +1,4 @@
-FullScanRequestBuilder in bdk_core::spk_client - Rust
    bdk_core::spk_client
    Struct FullScanRequestBuilder
    Source 
    pub struct FullScanRequestBuilder<K> { /* private fields */ }
    Expand description
    Builds a FullScanRequest.
    
+FullScanRequestBuilder in bdk_core::spk_client - Rust
    bdk_core::spk_client
    Struct FullScanRequestBuilder
    Source 
    pub struct FullScanRequestBuilder<K> { /* private fields */ }
    Expand description
    Builds a FullScanRequest.
    
 
    Implementations§
    Source§
    impl<K: Ord> FullScanRequestBuilder<K>
    Source
    pub fn chain_tip(self, tip: CheckPoint) -> Self
    Set the initial chain tip for the full scan request.
    
 
    This is used to update LocalChain.
    
 
    Source
    pub fn spks_for_keychain(
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.FullScanResponse.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.FullScanResponse.html
index 89ffb075de..af91b2ad14 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.FullScanResponse.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.FullScanResponse.html
@@ -1,4 +1,4 @@
-FullScanResponse in bdk_core::spk_client - Rust
    bdk_core::spk_client
    Struct FullScanResponse
    Source 
    pub struct FullScanResponse<K, A = ConfirmationBlockTime> {
+FullScanResponse in bdk_core::spk_client - Rust
    bdk_core::spk_client
    Struct FullScanResponse
    Source 
    pub struct FullScanResponse<K, A = ConfirmationBlockTime> {
     pub tx_update: TxUpdate<A>,
     pub last_active_indices: BTreeMap<K, u32>,
     pub chain_update: Option<CheckPoint>,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.SyncProgress.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.SyncProgress.html
index 92b36757c3..d8205eaeb5 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.SyncProgress.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.SyncProgress.html
@@ -1,4 +1,4 @@
-SyncProgress in bdk_core::spk_client - Rust
    bdk_core::spk_client
    Struct SyncProgress
    Source 
    pub struct SyncProgress {
+SyncProgress in bdk_core::spk_client - Rust
    bdk_core::spk_client
    Struct SyncProgress
    Source 
    pub struct SyncProgress {
     pub spks_consumed: usize,
     pub spks_remaining: usize,
     pub txids_consumed: usize,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.SyncRequest.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.SyncRequest.html
index 7b1327726f..457c80c8b5 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.SyncRequest.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.SyncRequest.html
@@ -1,4 +1,4 @@
-SyncRequest in bdk_core::spk_client - Rust
    bdk_core::spk_client
    Struct SyncRequest
    Source 
    pub struct SyncRequest<I = ()> { /* private fields */ }
    Expand description
    Data required to perform a spk-based blockchain client sync.
    
+SyncRequest in bdk_core::spk_client - Rust
    bdk_core::spk_client
    Struct SyncRequest
    Source 
    pub struct SyncRequest<I = ()> { /* private fields */ }
    Expand description
    Data required to perform a spk-based blockchain client sync.
    
 
    A client sync fetches relevant chain data for a known list of scripts, transaction ids and
 outpoints. The sync process also updates the chain from the given
 chain_tip (if provided).
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.SyncRequestBuilder.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.SyncRequestBuilder.html
index a854c8caab..f9efbf5581 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.SyncRequestBuilder.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.SyncRequestBuilder.html
@@ -1,4 +1,4 @@
-SyncRequestBuilder in bdk_core::spk_client - Rust
    bdk_core::spk_client
    Struct SyncRequestBuilder
    Source 
    pub struct SyncRequestBuilder<I = ()> { /* private fields */ }
    Expand description
    Builds a SyncRequest.
    
+SyncRequestBuilder in bdk_core::spk_client - Rust
    bdk_core::spk_client
    Struct SyncRequestBuilder
    Source 
    pub struct SyncRequestBuilder<I = ()> { /* private fields */ }
    Expand description
    Builds a SyncRequest.
    
 
    Implementations§
    Source§
    impl SyncRequestBuilder<()>
    Source
    pub fn spks(self, spks: impl IntoIterator<Item = ScriptBuf>) -> Self
    Add [Script]s that will be synced against.
    
 
    Source§
    impl<I> SyncRequestBuilder<I>
    Source
    pub fn chain_tip(self, cp: CheckPoint) -> Self
    Set the initial chain tip for the sync request.
    
 
    This is used to update LocalChain.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.SyncResponse.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.SyncResponse.html
index af7cb6b495..7da34824c0 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.SyncResponse.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/spk_client/struct.SyncResponse.html
@@ -1,4 +1,4 @@
-SyncResponse in bdk_core::spk_client - Rust
    bdk_core::spk_client
    Struct SyncResponse
    Source 
    pub struct SyncResponse<A = ConfirmationBlockTime> {
+SyncResponse in bdk_core::spk_client - Rust
    bdk_core::spk_client
    Struct SyncResponse
    Source 
    pub struct SyncResponse<A = ConfirmationBlockTime> {
     pub tx_update: TxUpdate<A>,
     pub chain_update: Option<CheckPoint>,
 }
    Expand description
    Data returned from a spk-based blockchain client sync.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.BlockId.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.BlockId.html
index 1927bdc444..bfc8f559e7 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.BlockId.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.BlockId.html
@@ -1,4 +1,4 @@
-BlockId in bdk_core - Rust
    bdk_core
    Struct BlockId
    Source 
    pub struct BlockId {
+BlockId in bdk_core - Rust
    bdk_core
    Struct BlockId
    Source 
    pub struct BlockId {
     pub height: u32,
     pub hash: BlockHash,
 }
    Expand description
    A reference to a block in the canonical chain.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.CheckPoint.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.CheckPoint.html
index 7ca3e12788..e59045dd09 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.CheckPoint.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.CheckPoint.html
@@ -1,4 +1,4 @@
-CheckPoint in bdk_core - Rust
    bdk_core
    Struct CheckPoint
    Source 
    pub struct CheckPoint(/* private fields */);
    Expand description
    A checkpoint is a node of a reference-counted linked list of BlockIds.
    
+CheckPoint in bdk_core - Rust
    bdk_core
    Struct CheckPoint
    Source 
    pub struct CheckPoint(/* private fields */);
    Expand description
    A checkpoint is a node of a reference-counted linked list of BlockIds.
    
 
    Checkpoints are cheaply cloneable and are useful to find the agreement point between two sparse
 block chains.
    
 
    Implementations§
    Source§
    impl CheckPoint
    Source
    pub fn new(block: BlockId) -> Self
    Construct a new base block at the front of a linked list.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.CheckPointIter.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.CheckPointIter.html
index fd569582e3..a6fd20b54a 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.CheckPointIter.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.CheckPointIter.html
@@ -1,4 +1,4 @@
-CheckPointIter in bdk_core - Rust
    bdk_core
    Struct CheckPointIter
    Source 
    pub struct CheckPointIter { /* private fields */ }
    Expand description
    Iterates over checkpoints backwards.
    
+CheckPointIter in bdk_core - Rust
    bdk_core
    Struct CheckPointIter
    Source 
    pub struct CheckPointIter { /* private fields */ }
    Expand description
    Iterates over checkpoints backwards.
    
 
    Trait Implementations§
    Source§
    impl Iterator for CheckPointIter
    Source§
    type Item = CheckPoint
    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
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.ConfirmationBlockTime.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.ConfirmationBlockTime.html
index fc7143967e..7e8cbbcf24 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.ConfirmationBlockTime.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.ConfirmationBlockTime.html
@@ -1,4 +1,4 @@
-ConfirmationBlockTime in bdk_core - Rust
    bdk_core
    Struct ConfirmationBlockTime
    Source 
    pub struct ConfirmationBlockTime {
+ConfirmationBlockTime in bdk_core - Rust
    bdk_core
    Struct ConfirmationBlockTime
    Source 
    pub struct ConfirmationBlockTime {
     pub block_id: BlockId,
     pub confirmation_time: u64,
 }
    Expand description
    Represents the confirmation block and time of a transaction.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.TxUpdate.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.TxUpdate.html
index ce60248acd..58cd285968 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.TxUpdate.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/struct.TxUpdate.html
@@ -1,4 +1,4 @@
-TxUpdate in bdk_core - Rust
    bdk_core
    Struct TxUpdate
    Source 
    pub struct TxUpdate<A = ()> {
+TxUpdate in bdk_core - Rust
    bdk_core
    Struct TxUpdate
    Source 
    pub struct TxUpdate<A = ()> {
     pub txs: Vec<Arc<Transaction>>,
     pub txouts: BTreeMap<OutPoint, TxOut>,
     pub anchors: BTreeSet<(A, Txid)>,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/trait.Merge.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/trait.Merge.html
index 1c8bc0eb8d..9dc76e58cb 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/trait.Merge.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/trait.Merge.html
@@ -1,4 +1,4 @@
-Merge in bdk_core - Rust
    bdk_core
    Trait Merge
    Source 
    pub trait Merge: Default {
+Merge in bdk_core - Rust
    bdk_core
    Trait Merge
    Source 
    pub trait Merge: Default {
     // Required methods
     fn merge(&mut self, other: Self);
     fn is_empty(&self) -> bool;
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/type.Indexed.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/type.Indexed.html
index 1329f3813f..8c6c1b516c 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/type.Indexed.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/type.Indexed.html
@@ -1,2 +1,2 @@
-Indexed in bdk_core - Rust
    bdk_core
    Type Alias Indexed
    Source 
    pub type Indexed<T> = (u32, T);
    Expand description
    A tuple of keychain index and T representing the indexed value.
    
+Indexed in bdk_core - Rust
    bdk_core
    Type Alias Indexed
    Source 
    pub type Indexed<T> = (u32, T);
    Expand description
    A tuple of keychain index and T representing the indexed value.
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/type.KeychainIndexed.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/type.KeychainIndexed.html
index 859dbd8de8..d4db30ec5f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/type.KeychainIndexed.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_core/type.KeychainIndexed.html
@@ -1,2 +1,2 @@
-KeychainIndexed in bdk_core - Rust
    bdk_core
    Type Alias KeychainIndexed
    Source 
    pub type KeychainIndexed<K, T> = ((K, u32), T);
    Expand description
    A tuple of keychain K, derivation index (u32) and a T associated with them.
    
+KeychainIndexed in bdk_core - Rust
    bdk_core
    Type Alias KeychainIndexed
    Source 
    pub type KeychainIndexed<K, T> = ((K, u32), T);
    Expand description
    A tuple of keychain K, derivation index (u32) and a T associated with them.
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/all.html
index c0de3f7452..4de097a4d2 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/all.html
@@ -1 +1 @@
-List of all items in this crate
    List of all items
    Structs
    
\ No newline at end of file
+List of all items in this crate
    List of all items
    Structs
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/index.html
index 13adbb900a..ac522e7d2d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/index.html
@@ -1,4 +1,4 @@
-bdk_electrum - Rust
    Crate bdk_electrum
    Source 
    Expand description
    This crate is used for returning updates from Electrum servers.
    
+bdk_electrum - Rust
    Crate bdk_electrum
    Source 
    Expand description
    This crate is used for returning updates from Electrum servers.
    
 
    Updates are returned as either a SyncResponse (if BdkElectrumClient::sync() is called),
 or a FullScanResponse (if BdkElectrumClient::full_scan() is called).
    
 
    In most cases BdkElectrumClient::sync() is used to sync the transaction histories of scripts
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/struct.BdkElectrumClient.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/struct.BdkElectrumClient.html
index 067c056184..1bae2e7bc5 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/struct.BdkElectrumClient.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/struct.BdkElectrumClient.html
@@ -1,4 +1,4 @@
-BdkElectrumClient in bdk_electrum - Rust
    bdk_electrum
    Struct BdkElectrumClient
    Source 
    pub struct BdkElectrumClient<E> {
+BdkElectrumClient in bdk_electrum - Rust
    bdk_electrum
    Struct BdkElectrumClient
    Source 
    pub struct BdkElectrumClient<E> {
     pub inner: E,
     /* private fields */
 }
    Expand description
    Wrapper around an [electrum_client::ElectrumApi] which includes an internal in-memory
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/all.html
index 5d96825cd2..a408812b08 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/all.html
@@ -1 +1 @@
-List of all items in this crate
    List of all items
    Traits
    Type Aliases
    
\ No newline at end of file
+List of all items in this crate
    List of all items
    Traits
    Type Aliases
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/index.html
index 04fbe8fde2..e0fe752aa8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/index.html
@@ -1,8 +1,8 @@
-bdk_esplora - Rust
    Crate bdk_esplora
    Source 
    Expand description
    §BDK Esplora
    
+bdk_esplora - Rust
    Crate bdk_esplora
    Source 
    Expand description
    §BDK Esplora
    
 
    BDK Esplora extends esplora-client (with extension traits: EsploraExt and
 EsploraAsyncExt) to update bdk_chain structures from an Esplora server.
    
-
    The extension traits are primarily intended to satisfy SyncRequests with sync and
-FullScanRequests with full_scan.
    
+
    The extension traits are primarily intended to satisfy SyncRequests with sync and
+FullScanRequests with full_scan.
    
 
    §Usage
    
 
    For blocking-only:
    
 
    bdk_esplora = { version = "0.19", features = ["blocking"] }
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/trait.EsploraAsyncExt.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/trait.EsploraAsyncExt.html
index fb031604ae..e29b112014 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/trait.EsploraAsyncExt.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/trait.EsploraAsyncExt.html
@@ -1,22 +1,22 @@
-EsploraAsyncExt in bdk_esplora - Rust
    bdk_esplora
    Trait EsploraAsyncExt
    Source 
    pub trait EsploraAsyncExt {
+EsploraAsyncExt in bdk_esplora - Rust
    bdk_esplora
    Trait EsploraAsyncExt
    Source 
    pub trait EsploraAsyncExt {
     // Required methods
     fn full_scan<'life0, 'async_trait, K, R>(
         &'life0 self,
         request: R,
         stop_gap: usize,
         parallel_requests: usize,
-    ) -> Pin<Box<dyn Future<Output = Result<FullScanResponse<K>, Box<Error>>> + Send + 'async_trait>>
+    ) -> Pin<Box<dyn Future<Output = Result<FullScanResponse<K>, Box<Error>>> + Send + 'async_trait>>
        where K: 'async_trait + Ord + Clone + Send,
-             R: 'async_trait + Into<FullScanRequest<K>> + Send,
+             R: 'async_trait + Into<FullScanRequest<K>> + Send,
              Self: 'async_trait,
              'life0: 'async_trait;
     fn sync<'life0, 'async_trait, I, R>(
         &'life0 self,
         request: R,
         parallel_requests: usize,
-    ) -> Pin<Box<dyn Future<Output = Result<SyncResponse, Box<Error>>> + Send + 'async_trait>>
+    ) -> Pin<Box<dyn Future<Output = Result<SyncResponse, Box<Error>>> + Send + 'async_trait>>
        where I: 'async_trait + Send,
-             R: 'async_trait + Into<SyncRequest<I>> + Send,
+             R: 'async_trait + Into<SyncRequest<I>> + Send,
              Self: 'async_trait,
              'life0: 'async_trait;
 }
    Expand description
    Trait to extend the functionality of [esplora_client::AsyncClient].
    
@@ -26,14 +26,14 @@
     request: R,
     stop_gap: usize,
     parallel_requests: usize,
-) -> Pin<Box<dyn Future<Output = Result<FullScanResponse<K>, Box<Error>>> + Send + 'async_trait>>
    where
+) -> Pin<Box<dyn Future<Output = Result<FullScanResponse<K>, Box<Error>>> + Send + 'async_trait>>
    where
     K: 'async_trait + Ord + Clone + Send,
-    R: 'async_trait + Into<FullScanRequest<K>> + Send,
+    R: 'async_trait + Into<FullScanRequest<K>> + Send,
     Self: 'async_trait,
     'life0: 'async_trait,
    Scan keychain scripts for transactions against Esplora, returning an update that can be
 applied to the receiving structures.
    
 
    request provides the data required to perform a script-pubkey-based full scan
-(see FullScanRequest). The full scan for each keychain (K) stops after a gap of
+(see [FullScanRequest]). The full scan for each keychain (K) stops after a gap of
 stop_gap script pubkeys with no associated transactions. parallel_requests specifies
 the maximum number of HTTP requests to make in parallel.
    
 
    Refer to crate-level docs for more.
    
@@ -41,13 +41,13 @@ the maximum number of HTTP requests to make in parallel.
    
     &'life0 self,
     request: R,
     parallel_requests: usize,
-) -> Pin<Box<dyn Future<Output = Result<SyncResponse, Box<Error>>> + Send + 'async_trait>>
    where
+) -> Pin<Box<dyn Future<Output = Result<SyncResponse, Box<Error>>> + Send + 'async_trait>>
    where
     I: 'async_trait + Send,
-    R: 'async_trait + Into<SyncRequest<I>> + Send,
+    R: 'async_trait + Into<SyncRequest<I>> + Send,
     Self: 'async_trait,
     'life0: 'async_trait,
    Sync a set of scripts, txids, and/or outpoints against Esplora.
    
 
    request provides the data required to perform a script-pubkey-based sync (see
-SyncRequest). parallel_requests specifies the maximum number of HTTP requests to make
+[SyncRequest]). parallel_requests specifies the maximum number of HTTP requests to make
 in parallel.
    
 
    Refer to crate-level docs for more.
    
 
    Dyn Compatibility§
    This trait is not dyn compatible.
    In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.
    Implementations on Foreign Types§
    Source§
    impl<S> EsploraAsyncExt for AsyncClient<S>
    where
@@ -57,16 +57,16 @@ in parallel.
    
     request: R,
     stop_gap: usize,
     parallel_requests: usize,
-) -> Pin<Box<dyn Future<Output = Result<FullScanResponse<K>, Box<Error>>> + Send + 'async_trait>>
    where
+) -> Pin<Box<dyn Future<Output = Result<FullScanResponse<K>, Box<Error>>> + Send + 'async_trait>>
    where
     K: 'async_trait + Ord + Clone + Send,
-    R: 'async_trait + Into<FullScanRequest<K>> + Send,
+    R: 'async_trait + Into<FullScanRequest<K>> + Send,
     Self: 'async_trait,
     'life0: 'async_trait,
    Source§
    fn sync<'life0, 'async_trait, I, R>(
     &'life0 self,
     request: R,
     parallel_requests: usize,
-) -> Pin<Box<dyn Future<Output = Result<SyncResponse, Box<Error>>> + Send + 'async_trait>>
    where
+) -> Pin<Box<dyn Future<Output = Result<SyncResponse, Box<Error>>> + Send + 'async_trait>>
    where
     I: 'async_trait + Send,
-    R: 'async_trait + Into<SyncRequest<I>> + Send,
+    R: 'async_trait + Into<SyncRequest<I>> + Send,
     Self: 'async_trait,
     'life0: 'async_trait,
    Implementors§
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/trait.EsploraExt.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/trait.EsploraExt.html
index 8e94c08b2d..5b7f693bd6 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/trait.EsploraExt.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/trait.EsploraExt.html
@@ -1,46 +1,46 @@
-EsploraExt in bdk_esplora - Rust
    bdk_esplora
    Trait EsploraExt
    Source 
    pub trait EsploraExt {
+EsploraExt in bdk_esplora - Rust
    bdk_esplora
    Trait EsploraExt
    Source 
    pub trait EsploraExt {
     // Required methods
-    fn full_scan<K: Ord + Clone, R: Into<FullScanRequest<K>>>(
+    fn full_scan<K: Ord + Clone, R: Into<FullScanRequest<K>>>(
         &self,
         request: R,
         stop_gap: usize,
         parallel_requests: usize,
-    ) -> Result<FullScanResponse<K>, Error>;
-    fn sync<I: 'static, R: Into<SyncRequest<I>>>(
+    ) -> Result<FullScanResponse<K>, Error>;
+    fn sync<I: 'static, R: Into<SyncRequest<I>>>(
         &self,
         request: R,
         parallel_requests: usize,
-    ) -> Result<SyncResponse, Error>;
+    ) -> Result<SyncResponse, Error>;
 }
    Expand description
    Trait to extend the functionality of [esplora_client::BlockingClient].
    
 
    Refer to crate-level documentation for more.
    
-
    Required Methods§
    Source
    fn full_scan<K: Ord + Clone, R: Into<FullScanRequest<K>>>(
+
    Required Methods§
    Source
    fn full_scan<K: Ord + Clone, R: Into<FullScanRequest<K>>>(
     &self,
     request: R,
     stop_gap: usize,
     parallel_requests: usize,
-) -> Result<FullScanResponse<K>, Error>
    Scan keychain scripts for transactions against Esplora, returning an update that can be
+) -> Result<FullScanResponse<K>, Error>
    Scan keychain scripts for transactions against Esplora, returning an update that can be
 applied to the receiving structures.
    
 
    request provides the data required to perform a script-pubkey-based full scan
-(see FullScanRequest). The full scan for each keychain (K) stops after a gap of
+(see [FullScanRequest]). The full scan for each keychain (K) stops after a gap of
 stop_gap script pubkeys with no associated transactions. parallel_requests specifies
 the maximum number of HTTP requests to make in parallel.
    
 
    Refer to crate-level docs for more.
    
-
    Source
    fn sync<I: 'static, R: Into<SyncRequest<I>>>(
+
    Source
    fn sync<I: 'static, R: Into<SyncRequest<I>>>(
     &self,
     request: R,
     parallel_requests: usize,
-) -> Result<SyncResponse, Error>
    Sync a set of scripts, txids, and/or outpoints against Esplora.
    
+) -> Result<SyncResponse, Error>

    Sync a set of scripts, txids, and/or outpoints against Esplora.

    request provides the data required to perform a script-pubkey-based sync (see -SyncRequest). parallel_requests specifies the maximum number of HTTP requests to make +[SyncRequest]). parallel_requests specifies the maximum number of HTTP requests to make in parallel.

    Refer to crate-level docs for more.

    -

    Dyn Compatibility§

    This trait is not dyn compatible.

    In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

    Implementations on Foreign Types§

    Source§

    impl EsploraExt for BlockingClient

    Source§

    fn full_scan<K: Ord + Clone, R: Into<FullScanRequest<K>>>( +

    Dyn Compatibility§

    This trait is not dyn compatible.

    In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

    Implementations on Foreign Types§

    Source§

    impl EsploraExt for BlockingClient

    Source§

    fn full_scan<K: Ord + Clone, R: Into<FullScanRequest<K>>>( &self, request: R, stop_gap: usize, parallel_requests: usize, -) -> Result<FullScanResponse<K>, Error>

    Source§

    fn sync<I: 'static, R: Into<SyncRequest<I>>>( +) -> Result<FullScanResponse<K>, Error>

    Source§

    fn sync<I: 'static, R: Into<SyncRequest<I>>>( &self, request: R, parallel_requests: usize, -) -> Result<SyncResponse, Error>

    Implementors§

    \ No newline at end of file +) -> Result<SyncResponse, Error>

    Implementors§

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/type.Error.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/type.Error.html index f2e3695e9d..135b109eed 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/type.Error.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/type.Error.html @@ -1,2 +1,2 @@ -Error in bdk_esplora - Rust
    bdk_esplora

    Type Alias Error

    Source 
    pub type Error = Box<Error>;
    Expand description

    [esplora_client::Error]

    +Error in bdk_esplora - Rust
    bdk_esplora

    Type Alias Error

    Source 
    pub type Error = Box<Error>;
    Expand description

    [esplora_client::Error]

    Aliased Type§

    struct Error(/* private fields */);
    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/all.html index 60d623f238..85bbbee1d7 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/all.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/all.html @@ -1 +1 @@ -List of all items in this crate

    List of all items

    Structs

    Enums

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

    List of all items

    Structs

    Enums

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/enum.FileError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/enum.FileError.html index 43c39fc448..e2fa6699f4 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/enum.FileError.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/enum.FileError.html @@ -1,4 +1,4 @@ -FileError in bdk_file_store - Rust
    bdk_file_store

    Enum FileError

    Source 
    pub enum FileError {
+FileError in bdk_file_store - Rust
    bdk_file_store
    Enum FileError
    Source 
    pub enum FileError {
     Io(Error),
     InvalidMagicBytes {
         got: Vec<u8>,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/enum.IterError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/enum.IterError.html
index 44d7cf2564..10703bd8b2 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/enum.IterError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/enum.IterError.html
@@ -1,4 +1,4 @@
-IterError in bdk_file_store - Rust
    bdk_file_store
    Enum IterError
    Source 
    pub enum IterError {
+IterError in bdk_file_store - Rust
    bdk_file_store
    Enum IterError
    Source 
    pub enum IterError {
     Io(Error),
     Bincode(ErrorKind),
 }
    Expand description
    Error type for EntryIter.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/index.html
index 88da66bb71..ea36157444 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/index.html
@@ -1,4 +1,4 @@
-bdk_file_store - Rust
    Crate bdk_file_store
    Source 
    Expand description
    §BDK File Store
    
+bdk_file_store - Rust
    Crate bdk_file_store
    Source 
    Expand description
    §BDK File Store
    
 
    
 
    ⚠ bdk_file_store is a development/testing database. It does not natively support backwards compatible BDK version upgrades so should not be used in production.
    
 
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/struct.AggregateChangesetsError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/struct.AggregateChangesetsError.html
index 61865d33db..baf932b779 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/struct.AggregateChangesetsError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/struct.AggregateChangesetsError.html
@@ -1,4 +1,4 @@
-AggregateChangesetsError in bdk_file_store - Rust
    bdk_file_store
    Struct AggregateChangesetsError
    Source 
    pub struct AggregateChangesetsError<C> {
+AggregateChangesetsError in bdk_file_store - Rust
    bdk_file_store
    Struct AggregateChangesetsError
    Source 
    pub struct AggregateChangesetsError<C> {
     pub changeset: Option<C>,
     pub iter_error: IterError,
 }
    Expand description
    Error type for Store::aggregate_changesets.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/struct.EntryIter.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/struct.EntryIter.html
index 0bbdf81b47..298e16a483 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/struct.EntryIter.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/struct.EntryIter.html
@@ -1,4 +1,4 @@
-EntryIter in bdk_file_store - Rust
    bdk_file_store
    Struct EntryIter
    Source 
    pub struct EntryIter<'t, T> { /* private fields */ }
    Expand description
    Iterator over entries in a file store.
    
+EntryIter in bdk_file_store - Rust
    bdk_file_store
    Struct EntryIter
    Source 
    pub struct EntryIter<'t, T> { /* private fields */ }
    Expand description
    Iterator over entries in a file store.
    
 
    Reads and returns an entry each time next is called. If an error occurs while reading the
 iterator will yield a Result::Err(_) instead and then None for the next call to next.
    
 
    Implementations§
    Source§
    impl<'t, T> EntryIter<'t, T>
    Source
    pub fn new(start_pos: u64, db_file: &'t mut File) -> Self
    Trait Implementations§
    Source§
    impl<T> Drop for EntryIter<'_, T>
    Source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    Source§
    impl<T> Iterator for EntryIter<'_, T>
    where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/struct.Store.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/struct.Store.html
index ab0a362726..5392d94b7d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/struct.Store.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/struct.Store.html
@@ -1,11 +1,11 @@
-Store in bdk_file_store - Rust
    bdk_file_store
    Struct Store
    Source 
    pub struct Store<C>
    where
+Store in bdk_file_store - Rust
    bdk_file_store
    Struct Store
    Source 
    pub struct Store<C>
    where
     C: Sync + Send,
    { /* private fields */ }
    Expand description
    Persists an append-only list of changesets (C) to a single file.
    
 
    
 
    ⚠ This is a development/testing database. It does not natively support backwards compatible
 BDK version upgrades so should not be used in production.
    
 
    
 
    Implementations§
    Source§
    impl<C> Store<C>
    where
-    C: Merge + Serialize + DeserializeOwned + Send + Sync,
    Source
    pub fn create_new<P>(magic: &[u8], file_path: P) -> Result<Self, FileError>
    where
+    C: Merge + Serialize + DeserializeOwned + Send + Sync,
    Source
    pub fn create_new<P>(magic: &[u8], file_path: P) -> Result<Self, FileError>
    where
     P: AsRef<Path>,
    Create a new Store file in write-only mode; error if the file exists.
    
 
    magic is the prefixed bytes to write to the new file. This will be checked when opening
 the Store in the future with open.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_testenv/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_testenv/all.html
index ea013032ea..3f479eccb9 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_testenv/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_testenv/all.html
@@ -1 +1 @@
-List of all items in this crate
    List of all items
    Structs
    Macros
    Functions
    Constants
    
\ No newline at end of file
+List of all items in this crate
    List of all items
    Structs
    Macros
    Functions
    Constants
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_testenv/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_testenv/index.html
index de9d1e60b7..6bf4eaddee 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_testenv/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_testenv/index.html
@@ -1,2 +1,2 @@
-bdk_testenv - Rust
    Crate bdk_testenv
    Source 
    Re-exports§
    • pub use electrsd;
    • pub use electrsd::bitcoind;
    • pub use electrsd::bitcoind::anyhow;
    • pub use electrsd::bitcoind::bitcoincore_rpc;
    • pub use electrsd::electrum_client;
    Modules§
    Macros§
    Structs§
    
 
    Source
    pub fn keymap(self, keychain: KeychainKind, keymap: KeyMap) -> Self
    Extend the given keychain’s keymap.
    
 
    Source
    pub fn network(self, network: Network) -> Self
    Set network.
    
@@ -28,7 +28,7 @@ also DEFAULT_LOOKAHEAD is sufficient.
    
+the default value [DEFAULT_LOOKAHEAD] is sufficient.
    
 
    Source
    pub fn create_wallet<P>(
     self,
     persister: &mut P,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.LoadParams.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.LoadParams.html
index fdc2ef27d9..eef164719b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.LoadParams.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.LoadParams.html
@@ -1,6 +1,6 @@
-LoadParams in bdk_wallet - Rust
    bdk_wallet
    Struct LoadParams
    Source 
    pub struct LoadParams { /* private fields */ }
    Expand description
    Parameters for Wallet::load or PersistedWallet::load.
    
+LoadParams in bdk_wallet - Rust
    bdk_wallet
    Struct LoadParams
    Source 
    pub struct LoadParams { /* private fields */ }
    Expand description
    Parameters for Wallet::load or PersistedWallet::load.
    
 
    Implementations§
    Source§
    impl LoadParams
    Source
    pub fn new() -> Self
    Construct parameters with default values.
    
-
    Default values: lookahead = DEFAULT_LOOKAHEAD
    
+
    Default values: lookahead = [DEFAULT_LOOKAHEAD]
    
 
    Source
    pub fn keymap(self, keychain: KeychainKind, keymap: KeyMap) -> Self
    Extend the given keychain’s keymap.
    
 
    Source
    pub fn descriptor<D>(
     self,
@@ -17,7 +17,7 @@ for an expected descriptor containing secrets.
    
 
    The lookahead defines a number of script pubkeys to derive over and above the last
 revealed index. Without a lookahead the indexer will miss outputs you own when processing
 transactions whose output script pubkeys lie beyond the last revealed index. In most cases
-the default value DEFAULT_LOOKAHEAD is sufficient.
    
+the default value [DEFAULT_LOOKAHEAD] is sufficient.
    
 
    Source
    pub fn extract_keys(self) -> Self
    Whether to try extracting private keys from the provided descriptors upon loading.
 See also LoadParams::descriptor.
    
 
    Source
    pub fn load_wallet<P>(
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.LocalOutput.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.LocalOutput.html
index 0127ba1df3..16f026cfea 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.LocalOutput.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.LocalOutput.html
@@ -1,17 +1,17 @@
-LocalOutput in bdk_wallet - Rust
    bdk_wallet
    Struct LocalOutput
    Source 
    pub struct LocalOutput {
+LocalOutput in bdk_wallet - Rust
    bdk_wallet
    Struct LocalOutput
    Source 
    pub struct LocalOutput {
     pub outpoint: OutPoint,
     pub txout: TxOut,
     pub keychain: KeychainKind,
     pub is_spent: bool,
     pub derivation_index: u32,
-    pub chain_position: ChainPosition<ConfirmationBlockTime>,
+    pub chain_position: ChainPosition<ConfirmationBlockTime>,
 }
    Expand description
    An unspent output owned by a Wallet.
    
 
    Fields§
    §outpoint: OutPoint
    Reference to a transaction output
    
 
    §txout: TxOut
    Transaction output
    
 
    §keychain: KeychainKind
    Type of keychain
    
 
    §is_spent: bool
    Whether this UTXO is spent or not
    
 
    §derivation_index: u32
    The derivation index for the script pubkey in the wallet
    
-
    §chain_position: ChainPosition<ConfirmationBlockTime>
    The position of the output in the blockchain.
    
+
    §chain_position: ChainPosition<ConfirmationBlockTime>
    The position of the output in the blockchain.
    
 
    Trait Implementations§
    Source§
    impl Clone for LocalOutput
    Source§
    fn clone(&self) -> LocalOutput
    Returns a copy of 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 LocalOutput
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    Source§
    impl<'de> Deserialize<'de> for LocalOutput
    Source§
    fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
    where
     __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    Source§
    impl Hash for LocalOutput
    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,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.PersistedWallet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.PersistedWallet.html
index 4917ebb5ec..0e703254ac 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.PersistedWallet.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.PersistedWallet.html
@@ -1,4 +1,4 @@
-PersistedWallet in bdk_wallet - Rust
    bdk_wallet
    Struct PersistedWallet
    Source 
    pub struct PersistedWallet<P> { /* private fields */ }
    Expand description
    Represents a persisted wallet which persists into type P.
    
+PersistedWallet in bdk_wallet - Rust
    bdk_wallet
    Struct PersistedWallet
    Source 
    pub struct PersistedWallet<P> { /* private fields */ }
    Expand description
    Represents a persisted wallet which persists into type P.
    
 
    This is a light wrapper around Wallet that enforces some level of safety-checking when used
 with a WalletPersister or AsyncWalletPersister implementation. Safety checks assume that
 WalletPersister and/or AsyncWalletPersister are implemented correctly.
    
@@ -104,11 +104,11 @@ by using 
    Source
    pub fn list_unspent(&self) -> impl Iterator<Item = LocalOutput> + '_
    Return the list of unspent outputs of this wallet
    
 
    Source
    pub fn list_output(&self) -> impl Iterator<Item = LocalOutput> + '_
    List all relevant outputs (includes both spent and unspent, confirmed and unconfirmed).
    
 
    To list only unspent outputs (UTXOs), use Wallet::list_unspent instead.
    
-
    Source
    pub fn checkpoints(&self) -> CheckPointIter
    Get all the checkpoints the wallet is currently storing indexed by height.
    
-
    Source
    pub fn latest_checkpoint(&self) -> CheckPoint
    Returns the latest checkpoint.
    
+
    Source
    pub fn checkpoints(&self) -> CheckPointIter
    Get all the checkpoints the wallet is currently storing indexed by height.
    
+
    Source
    pub fn latest_checkpoint(&self) -> CheckPoint
    Returns the latest checkpoint.
    
 
    Source
    pub fn all_unbounded_spk_iters(
     &self,
-) -> BTreeMap<KeychainKind, impl Iterator<Item = Indexed<ScriptBuf>> + Clone>
    Get unbounded script pubkey iterators for both Internal and External keychains.
    
+) -> BTreeMap<KeychainKind, impl Iterator<Item = Indexed<ScriptBuf>> + Clone>
    Get unbounded script pubkey iterators for both Internal and External keychains.
    
 
    This is intended to be used when doing a full scan of your addresses (e.g. after restoring
 from seed words). You pass the BTreeMap of iterators to a blockchain data source (e.g.
 electrum server) which will go through each address until it reaches a stop gap.
    
@@ -117,7 +117,7 @@ script pubkeys the wallet is storing internally).
    
 
    Source
    pub fn unbounded_spk_iter(
     &self,
     keychain: KeychainKind,
-) -> impl Iterator<Item = Indexed<ScriptBuf>> + Clone
    Get an unbounded script pubkey iterator for the given keychain.
    
+) -> impl Iterator<Item = Indexed<ScriptBuf>> + Clone
    Get an unbounded script pubkey iterator for the given keychain.
    
 
    See all_unbounded_spk_iters for more documentation
    
 
    Source
    pub fn get_utxo(&self, op: OutPoint) -> Option<LocalOutput>
    Returns the utxo owned by this wallet corresponding to outpoint if it exists in the
 wallet’s database.
    
@@ -133,7 +133,7 @@ See 
    Source
    pub fn calculate_fee(
     &self,
     tx: &Transaction,
-) -> Result<Amount, CalculateFeeError>
    Calculates the fee of a given transaction. Returns [Amount::ZERO] if tx is a coinbase transaction.
    
+) -> Result<Amount, CalculateFeeError>
    Calculates the fee of a given transaction. Returns [Amount::ZERO] if tx is a coinbase transaction.
    
 
    To calculate the fee for a [Transaction] with inputs not owned by this wallet you must
 manually insert the TxOut(s) into the tx graph using the insert_txout function.
    
 
    Note tx does not have to be in the graph for this to work.
    
@@ -146,7 +146,7 @@ manually insert the TxOut(s) into the tx graph using the 
    Source
    pub fn calculate_fee_rate(
     &self,
     tx: &Transaction,
-) -> Result<FeeRate, CalculateFeeError>
    Calculate the [FeeRate] for a given transaction.
    
+) -> Result<FeeRate, CalculateFeeError>
    Calculate the [FeeRate] for a given transaction.
    
 
    To calculate the fee rate for a [Transaction] with inputs not owned by this wallet you must
 manually insert the TxOut(s) into the tx graph using the insert_txout function.
    
 
    Note tx does not have to be in the graph for this to work.
    
@@ -169,9 +169,9 @@ of this tx’s outputs that send to script pubkeys tracked by this wallet.
    
 
    Source
    pub fn get_tx(&self, txid: Txid) -> Option<WalletTx<'_>>
    Get a single transaction from the wallet as a WalletTx (if the transaction exists).
    
 
    WalletTx contains the full transaction alongside meta-data such as:
    
 
      
-
    • Blocks that the transaction is Anchored in. These may or may not be blocks that exist
+
    • Blocks that the transaction is Anchored in. These may or may not be blocks that exist
 in the best chain.
      • 
-
    • The ChainPosition of the transaction in the best chain - whether the transaction is
+
    • The [ChainPosition] of the transaction in the best chain - whether the transaction is
 confirmed or unconfirmed. If the transaction is confirmed, the anchor which proves the
 confirmation is provided. If the transaction is unconfirmed, the unix timestamp of when
 the transaction was last seen in the mempool is provided.
      • 
@@ -219,9 +219,9 @@ the transaction was last seen in the mempool is provided.
 transaction is canonical when it is confirmed in the best chain, or does not conflict
 with any transaction confirmed in the best chain.
      
 
      To iterate over all transactions, including those that are irrelevant and not canonical, use
-TxGraph::full_txs.
      
+[TxGraph::full_txs].
      
 
      To iterate over all canonical transactions, including those that are irrelevant, use
-TxGraph::list_canonical_txs.
      
+[TxGraph::list_canonical_txs].
      
 
    Source
    pub fn transactions_sort_by<F>(&self, compare: F) -> Vec<WalletTx<'_>>
    where
     F: FnMut(&WalletTx<'_>, &WalletTx<'_>) -> Ordering,
    Array of relevant and canonical transactions in the wallet sorted with a comparator
 function.
    
@@ -352,7 +352,7 @@ Otherwise, it will return the index of the highest address it has derived.
    
 
    Source
    pub fn apply_update(
     &mut self,
     update: impl Into<Update>,
-) -> Result<(), CannotConnectError>
    Available on crate feature std only.
    Applies an update to the wallet and stages the changes (but does not persist them).
    
+) -> Result<(), CannotConnectError>
    Available on crate feature std only.
    Applies an update to the wallet and stages the changes (but does not persist them).
    
 
    Usually you create an update by interacting with some blockchain data source and inserting
 transactions related to your wallet into it.
    
 
    After applying updates you should persist the staged wallet changes. For an example of how
@@ -361,7 +361,7 @@ to persist staged wallet changes see Into<Update>,
     seen_at: u64,
-) -> Result<(), CannotConnectError>
    Applies an update alongside a seen_at timestamp and stages the changes.
    
+) -> Result<(), CannotConnectError>
    Applies an update alongside a seen_at timestamp and stages the changes.
    
 
    seen_at represents when the update is seen (in unix seconds). It is used to determine the
 last_seens for all transactions in the update which have no corresponding anchor(s). The
 last_seen value is used internally to determine precedence of conflicting unconfirmed
@@ -372,14 +372,14 @@ the current time.
    
 
    Source
    pub fn staged(&self) -> Option<&ChangeSet>
    Get a reference of the staged ChangeSet that is yet to be committed (if any).
    
 
    Source
    pub fn staged_mut(&mut self) -> Option<&mut ChangeSet>
    Get a mutable reference of the staged ChangeSet that is yet to be committed (if any).
    
 
    Source
    pub fn take_staged(&mut self) -> Option<ChangeSet>
    Take the staged ChangeSet to be persisted now (if any).
    
-
    Source
    pub fn tx_graph(&self) -> &TxGraph<ConfirmationBlockTime>
    Get a reference to the inner TxGraph.
    
-
    Source
    pub fn spk_index(&self) -> &KeychainTxOutIndex<KeychainKind>
    Get a reference to the inner KeychainTxOutIndex.
    
-
    Source
    pub fn local_chain(&self) -> &LocalChain
    Get a reference to the inner LocalChain.
    
+
    Source
    pub fn tx_graph(&self) -> &TxGraph<ConfirmationBlockTime>
    Get a reference to the inner [TxGraph].
    
+
    Source
    pub fn spk_index(&self) -> &KeychainTxOutIndex<KeychainKind>
    Get a reference to the inner [KeychainTxOutIndex].
    
+
    Source
    pub fn local_chain(&self) -> &LocalChain
    Get a reference to the inner [LocalChain].
    
 
    Source
    pub fn apply_block(
     &mut self,
     block: &Block,
     height: u32,
-) -> Result<(), CannotConnectError>
    Introduces a block of height to the wallet, and tries to connect it to the
+) -> Result<(), CannotConnectError>
    Introduces a block of height to the wallet, and tries to connect it to the
 prev_blockhash of the block’s header.
    
 
    This is a convenience method that is equivalent to calling apply_block_connected_to
 with prev_blockhash and height-1 as the connected_to parameter.
    
@@ -387,12 +387,12 @@ with prev_blockhash and height-1 as the connecte
     &mut self,
     block: &Block,
     height: u32,
-    connected_to: BlockId,
-) -> Result<(), ApplyHeaderError>
    Applies relevant transactions from block of height to the wallet, and connects the
+    connected_to: BlockId,
+) -> Result<(), ApplyHeaderError>
    Applies relevant transactions from block of height to the wallet, and connects the
 block to the internal chain.
    
 
    The connected_to parameter informs the wallet how this block connects to the internal
-LocalChain. Relevant transactions are filtered from the block and inserted into the
-internal TxGraph.
    
+[LocalChain]. Relevant transactions are filtered from the block and inserted into the
+internal [TxGraph].
    
 
    WARNING: You must persist the changes resulting from one or more calls to this method
 if you need the inserted block data to be reloaded after closing the wallet.
 See Wallet::reveal_next_address.
    
@@ -410,13 +410,13 @@ if you need the applied unconfirmed transactions to be reloaded after closing th
 See Wallet::reveal_next_address.
    Source

    pub fn start_sync_with_revealed_spks( &self, -) -> SyncRequestBuilder<(KeychainKind, u32)>

    Create a partial SyncRequest for this wallet for all revealed spks.

    +) -> SyncRequestBuilder<(KeychainKind, u32)>

    Create a partial [SyncRequest] for this wallet for all revealed spks.

    This is the first step when performing a spk-based wallet partial sync, the returned -SyncRequest collects all revealed script pubkeys from the wallet keychain needed to +[SyncRequest] collects all revealed script pubkeys from the wallet keychain needed to start a blockchain sync with a spk based blockchain client.

    -
    Source

    pub fn start_full_scan(&self) -> FullScanRequestBuilder<KeychainKind>

    Create a `FullScanRequest for this wallet.

    +
    Source

    pub fn start_full_scan(&self) -> FullScanRequestBuilder<KeychainKind>

    Create a [`FullScanRequest] for this wallet.

    This is the first step when performing a spk-based wallet full scan, the returned -`FullScanRequest collects iterators for the wallet’s keychain script pub keys needed to +[`FullScanRequest] collects iterators for the wallet’s keychain script pub keys needed to start a blockchain full scan with a spk based blockchain client.

    This operation is generally only used when importing or restoring a previously used wallet in which the list of used scripts is not known.

    @@ -431,9 +431,9 @@ in which the list of used scripts is not known.

    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<P, T> Receiver for P
    where +

    Source§

    impl<P, T> Receiver for P
    where P: Deref<Target = T> + ?Sized, - T: ?Sized,

    Source§

    type Target = T

    🔬This is a nightly-only experimental API. (arbitrary_self_types)
    The target type on which the method may be called.
    Source§

    impl<T, U> TryFrom<U> for T
    where + T: ?Sized,

    Source§

    type Target = T

    🔬This is a nightly-only experimental API. (arbitrary_self_types)
    The target type on which the method may be called.
    Source§

    impl<T, U> TryFrom<U> for T
    where U: Into<T>,

    Source§

    type Error = Infallible

    The type returned in the event of a conversion 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>,

    Source§

    type Error = <U as TryFrom<T>>::Error

    The type returned in the event of a conversion error.
    Source§

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

    Performs the conversion.
    §

    impl<V, T> VZip<V> for T
    where V: MultiLane<T>,

    §

    fn vzip(self) -> V

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.SignOptions.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.SignOptions.html index 1ffc159829..e9c18842f2 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.SignOptions.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.SignOptions.html @@ -1,4 +1,4 @@ -SignOptions in bdk_wallet - Rust
    bdk_wallet

    Struct SignOptions

    Source 
    pub struct SignOptions {
+SignOptions in bdk_wallet - Rust
    bdk_wallet
    Struct SignOptions
    Source 
    pub struct SignOptions {
     pub trust_witness_utxo: bool,
     pub assume_height: Option<u32>,
     pub allow_all_sighashes: bool,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.TxBuilder.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.TxBuilder.html
index e3699bc17c..5a718a9ac1 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.TxBuilder.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.TxBuilder.html
@@ -1,4 +1,4 @@
-TxBuilder in bdk_wallet - Rust
    bdk_wallet
    Struct TxBuilder
    Source 
    pub struct TxBuilder<'a, Cs> { /* private fields */ }
    Expand description
    A transaction builder
    
+TxBuilder in bdk_wallet - Rust
    bdk_wallet
    Struct TxBuilder
    Source 
    pub struct TxBuilder<'a, Cs> { /* private fields */ }
    Expand description
    A transaction builder
    
 
    A TxBuilder is created by calling build_tx or build_fee_bump on a wallet. After
 assigning it, you set options on it until finally calling finish to consume the builder and
 generate the transaction.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.Update.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.Update.html
index db485dc5e6..4a48f1a637 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.Update.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.Update.html
@@ -1,14 +1,14 @@
-Update in bdk_wallet - Rust
    bdk_wallet
    Struct Update
    Source 
    pub struct Update {
+Update in bdk_wallet - Rust
    bdk_wallet
    Struct Update
    Source 
    pub struct Update {
     pub last_active_indices: BTreeMap<KeychainKind, u32>,
-    pub tx_update: TxUpdate<ConfirmationBlockTime>,
-    pub chain: Option<CheckPoint>,
+    pub tx_update: TxUpdate<ConfirmationBlockTime>,
+    pub chain: Option<CheckPoint>,
 }
    Expand description
    An update to Wallet.
    
-
    It updates KeychainTxOutIndex, bdk_chain::TxGraph and LocalChain atomically.
    
+
    It updates [KeychainTxOutIndex], [bdk_chain::TxGraph] and [LocalChain] atomically.
    
 
    Fields§
    §last_active_indices: BTreeMap<KeychainKind, u32>
    Contains the last active derivation indices per keychain (K), which is used to update the
-KeychainTxOutIndex.
    
-
    §tx_update: TxUpdate<ConfirmationBlockTime>
    Update for the wallet’s internal TxGraph.
    
-
    §chain: Option<CheckPoint>
    Update for the wallet’s internal LocalChain.
    
-
    Trait Implementations§
    Source§
    impl Clone for Update
    Source§
    fn clone(&self) -> Update
    Returns a copy of 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 Update
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    Source§
    impl Default for Update
    Source§
    fn default() -> Update
    Returns the “default value” for a type. Read more
    Source§
    impl From<FullScanResponse<KeychainKind>> for Update
    Source§
    fn from(value: FullScanResponse<KeychainKind>) -> Self
    Converts to this type from the input type.
    Source§
    impl From<SyncResponse> for Update
    Source§
    fn from(value: SyncResponse) -> Self
    Converts to this type from the input type.
    Auto Trait Implementations§
    Blanket Implementations§
    Source§
    impl<T> Any for T
    where
+[KeychainTxOutIndex].
    
+
    §tx_update: TxUpdate<ConfirmationBlockTime>
    Update for the wallet’s internal [TxGraph].
    
+
    §chain: Option<CheckPoint>
    Update for the wallet’s internal [LocalChain].
    
+
    Trait Implementations§
    Source§
    impl Clone for Update
    Source§
    fn clone(&self) -> Update
    Returns a copy of 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 Update
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    Source§
    impl Default for Update
    Source§
    fn default() -> Update
    Returns the “default value” for a type. Read more
    Source§
    impl From<FullScanResponse<KeychainKind>> for Update
    Source§
    fn from(value: FullScanResponse<KeychainKind>) -> Self
    Converts to this type from the input type.
    Source§
    impl From<SyncResponse> for Update
    Source§
    fn from(value: SyncResponse) -> Self
    Converts to this type from the input type.
    Auto Trait Implementations§
    Blanket Implementations§
    Source§
    impl<T> Any for T
    where
     T: 'static + ?Sized,
    Source§
    fn type_id(&self) -> TypeId
    Gets the TypeId of self. Read more
    Source§
    impl<T> Borrow<T> for T
    where
     T: ?Sized,
    Source§
    fn borrow(&self) -> &T
    Immutably borrows from an owned value. Read more
    Source§
    impl<T> BorrowMut<T> for T
    where
     T: ?Sized,
    Source§
    fn borrow_mut(&mut self) -> &mut T
    Mutably borrows from an owned value. Read more
    Source§
    impl<T> CloneToUninit for T
    where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.Wallet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.Wallet.html
index baecacf19e..3fff8f6a78 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.Wallet.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.Wallet.html
@@ -1,4 +1,4 @@
-Wallet in bdk_wallet - Rust
    bdk_wallet
    Struct Wallet
    Source 
    pub struct Wallet { /* private fields */ }
    Expand description
    A Bitcoin wallet
    
+Wallet in bdk_wallet - Rust
    bdk_wallet
    Struct Wallet
    Source 
    pub struct Wallet { /* private fields */ }
    Expand description
    A Bitcoin wallet
    
 
    The Wallet acts as a way of coherently interfacing with output descriptors and related transactions.
 Its main components are:
    
 
      
@@ -9,7 +9,7 @@ Its main components are:
      
 ChangeSets (see take_staged). Also see individual functions and example for instructions
 on when Wallet state needs to be persisted.
      
 
      The Wallet descriptor (external) and change descriptor (internal) must not derive the same
-script pubkeys. See KeychainTxOutIndex::insert_descriptor() for more details.
      
+script pubkeys. See [KeychainTxOutIndex::insert_descriptor()] for more details.
      
 
    Implementations§
    Source§
    impl Wallet
    Source
    pub fn create_single<D>(descriptor: D) -> CreateParams
    where
     D: IntoWalletDescriptor + Send + Clone + 'static,
    Build a new single descriptor Wallet.
    
 
    If you have previously created a wallet, use load instead.
    
@@ -147,11 +147,11 @@ by using 
    Source
    pub fn list_unspent(&self) -> impl Iterator<Item = LocalOutput> + '_
    Return the list of unspent outputs of this wallet
    
 
    Source
    pub fn list_output(&self) -> impl Iterator<Item = LocalOutput> + '_
    List all relevant outputs (includes both spent and unspent, confirmed and unconfirmed).
    
 
    To list only unspent outputs (UTXOs), use Wallet::list_unspent instead.
    
-
    Source
    pub fn checkpoints(&self) -> CheckPointIter
    Get all the checkpoints the wallet is currently storing indexed by height.
    
-
    Source
    pub fn latest_checkpoint(&self) -> CheckPoint
    Returns the latest checkpoint.
    
+
    Source
    pub fn checkpoints(&self) -> CheckPointIter
    Get all the checkpoints the wallet is currently storing indexed by height.
    
+
    Source
    pub fn latest_checkpoint(&self) -> CheckPoint
    Returns the latest checkpoint.
    
 
    Source
    pub fn all_unbounded_spk_iters(
     &self,
-) -> BTreeMap<KeychainKind, impl Iterator<Item = Indexed<ScriptBuf>> + Clone>
    Get unbounded script pubkey iterators for both Internal and External keychains.
    
+) -> BTreeMap<KeychainKind, impl Iterator<Item = Indexed<ScriptBuf>> + Clone>
    Get unbounded script pubkey iterators for both Internal and External keychains.
    
 
    This is intended to be used when doing a full scan of your addresses (e.g. after restoring
 from seed words). You pass the BTreeMap of iterators to a blockchain data source (e.g.
 electrum server) which will go through each address until it reaches a stop gap.
    
@@ -160,7 +160,7 @@ script pubkeys the wallet is storing internally).
    
 
    Source
    pub fn unbounded_spk_iter(
     &self,
     keychain: KeychainKind,
-) -> impl Iterator<Item = Indexed<ScriptBuf>> + Clone
    Get an unbounded script pubkey iterator for the given keychain.
    
+) -> impl Iterator<Item = Indexed<ScriptBuf>> + Clone
    Get an unbounded script pubkey iterator for the given keychain.
    
 
    See all_unbounded_spk_iters for more documentation
    
 
    Source
    pub fn get_utxo(&self, op: OutPoint) -> Option<LocalOutput>
    Returns the utxo owned by this wallet corresponding to outpoint if it exists in the
 wallet’s database.
    
@@ -176,7 +176,7 @@ See 
    Source
    pub fn calculate_fee(
     &self,
     tx: &Transaction,
-) -> Result<Amount, CalculateFeeError>
    Calculates the fee of a given transaction. Returns [Amount::ZERO] if tx is a coinbase transaction.
    
+) -> Result<Amount, CalculateFeeError>
    Calculates the fee of a given transaction. Returns [Amount::ZERO] if tx is a coinbase transaction.
    
 
    To calculate the fee for a [Transaction] with inputs not owned by this wallet you must
 manually insert the TxOut(s) into the tx graph using the insert_txout function.
    
 
    Note tx does not have to be in the graph for this to work.
    
@@ -189,7 +189,7 @@ manually insert the TxOut(s) into the tx graph using the 
    Source
    pub fn calculate_fee_rate(
     &self,
     tx: &Transaction,
-) -> Result<FeeRate, CalculateFeeError>
    Calculate the [FeeRate] for a given transaction.
    
+) -> Result<FeeRate, CalculateFeeError>
    Calculate the [FeeRate] for a given transaction.
    
 
    To calculate the fee rate for a [Transaction] with inputs not owned by this wallet you must
 manually insert the TxOut(s) into the tx graph using the insert_txout function.
    
 
    Note tx does not have to be in the graph for this to work.
    
@@ -212,9 +212,9 @@ of this tx’s outputs that send to script pubkeys tracked by this wallet.
    
 
    Source
    pub fn get_tx(&self, txid: Txid) -> Option<WalletTx<'_>>
    Get a single transaction from the wallet as a WalletTx (if the transaction exists).
    
 
    WalletTx contains the full transaction alongside meta-data such as:
    
 
      
-
    • Blocks that the transaction is Anchored in. These may or may not be blocks that exist
+
    • Blocks that the transaction is Anchored in. These may or may not be blocks that exist
 in the best chain.
      • 
-
    • The ChainPosition of the transaction in the best chain - whether the transaction is
+
    • The [ChainPosition] of the transaction in the best chain - whether the transaction is
 confirmed or unconfirmed. If the transaction is confirmed, the anchor which proves the
 confirmation is provided. If the transaction is unconfirmed, the unix timestamp of when
 the transaction was last seen in the mempool is provided.
      • 
@@ -262,9 +262,9 @@ the transaction was last seen in the mempool is provided.
 transaction is canonical when it is confirmed in the best chain, or does not conflict
 with any transaction confirmed in the best chain.
      
 
      To iterate over all transactions, including those that are irrelevant and not canonical, use
-TxGraph::full_txs.
      
+[TxGraph::full_txs].
      
 
      To iterate over all canonical transactions, including those that are irrelevant, use
-TxGraph::list_canonical_txs.
      
+[TxGraph::list_canonical_txs].
      
 
    Source
    pub fn transactions_sort_by<F>(&self, compare: F) -> Vec<WalletTx<'_>>
    where
     F: FnMut(&WalletTx<'_>, &WalletTx<'_>) -> Ordering,
    Array of relevant and canonical transactions in the wallet sorted with a comparator
 function.
    
@@ -395,7 +395,7 @@ Otherwise, it will return the index of the highest address it has derived.
    
 
    Source
    pub fn apply_update(
     &mut self,
     update: impl Into<Update>,
-) -> Result<(), CannotConnectError>
    Available on crate feature std only.
    Applies an update to the wallet and stages the changes (but does not persist them).
    
+) -> Result<(), CannotConnectError>
    Available on crate feature std only.
    Applies an update to the wallet and stages the changes (but does not persist them).
    
 
    Usually you create an update by interacting with some blockchain data source and inserting
 transactions related to your wallet into it.
    
 
    After applying updates you should persist the staged wallet changes. For an example of how
@@ -404,7 +404,7 @@ to persist staged wallet changes see Into<Update>,
     seen_at: u64,
-) -> Result<(), CannotConnectError>
    Applies an update alongside a seen_at timestamp and stages the changes.
    
+) -> Result<(), CannotConnectError>
    Applies an update alongside a seen_at timestamp and stages the changes.
    
 
    seen_at represents when the update is seen (in unix seconds). It is used to determine the
 last_seens for all transactions in the update which have no corresponding anchor(s). The
 last_seen value is used internally to determine precedence of conflicting unconfirmed
@@ -415,14 +415,14 @@ the current time.
    
 
    Source
    pub fn staged(&self) -> Option<&ChangeSet>
    Get a reference of the staged ChangeSet that is yet to be committed (if any).
    
 
    Source
    pub fn staged_mut(&mut self) -> Option<&mut ChangeSet>
    Get a mutable reference of the staged ChangeSet that is yet to be committed (if any).
    
 
    Source
    pub fn take_staged(&mut self) -> Option<ChangeSet>
    Take the staged ChangeSet to be persisted now (if any).
    
-
    Source
    pub fn tx_graph(&self) -> &TxGraph<ConfirmationBlockTime>
    Get a reference to the inner TxGraph.
    
-
    Source
    pub fn spk_index(&self) -> &KeychainTxOutIndex<KeychainKind>
    Get a reference to the inner KeychainTxOutIndex.
    
-
    Source
    pub fn local_chain(&self) -> &LocalChain
    Get a reference to the inner LocalChain.
    
+
    Source
    pub fn tx_graph(&self) -> &TxGraph<ConfirmationBlockTime>
    Get a reference to the inner [TxGraph].
    
+
    Source
    pub fn spk_index(&self) -> &KeychainTxOutIndex<KeychainKind>
    Get a reference to the inner [KeychainTxOutIndex].
    
+
    Source
    pub fn local_chain(&self) -> &LocalChain
    Get a reference to the inner [LocalChain].
    
 
    Source
    pub fn apply_block(
     &mut self,
     block: &Block,
     height: u32,
-) -> Result<(), CannotConnectError>
    Introduces a block of height to the wallet, and tries to connect it to the
+) -> Result<(), CannotConnectError>

    Introduces a block of height to the wallet, and tries to connect it to the prev_blockhash of the block’s header.

    This is a convenience method that is equivalent to calling apply_block_connected_to with prev_blockhash and height-1 as the connected_to parameter.

    @@ -430,12 +430,12 @@ with prev_blockhash and height-1 as the connecte &mut self, block: &Block, height: u32, - connected_to: BlockId, -) -> Result<(), ApplyHeaderError>

    Applies relevant transactions from block of height to the wallet, and connects the + connected_to: BlockId, +) -> Result<(), ApplyHeaderError>

    Applies relevant transactions from block of height to the wallet, and connects the block to the internal chain.

    The connected_to parameter informs the wallet how this block connects to the internal -LocalChain. Relevant transactions are filtered from the block and inserted into the -internal TxGraph.

    +[LocalChain]. Relevant transactions are filtered from the block and inserted into the +internal [TxGraph].

    WARNING: You must persist the changes resulting from one or more calls to this method if you need the inserted block data to be reloaded after closing the wallet. See Wallet::reveal_next_address.

    @@ -454,17 +454,17 @@ See
    Source§

    impl Wallet

    Methods to construct sync/full-scan requests for spk-based chain sources.

    Source

    pub fn start_sync_with_revealed_spks( &self, -) -> SyncRequestBuilder<(KeychainKind, u32)>

    Create a partial SyncRequest for this wallet for all revealed spks.

    +) -> SyncRequestBuilder<(KeychainKind, u32)>

    Create a partial [SyncRequest] for this wallet for all revealed spks.

    This is the first step when performing a spk-based wallet partial sync, the returned -SyncRequest collects all revealed script pubkeys from the wallet keychain needed to +[SyncRequest] collects all revealed script pubkeys from the wallet keychain needed to start a blockchain sync with a spk based blockchain client.

    -
    Source

    pub fn start_full_scan(&self) -> FullScanRequestBuilder<KeychainKind>

    Create a `FullScanRequest for this wallet.

    +
    Source

    pub fn start_full_scan(&self) -> FullScanRequestBuilder<KeychainKind>

    Create a [`FullScanRequest] for this wallet.

    This is the first step when performing a spk-based wallet full scan, the returned -`FullScanRequest collects iterators for the wallet’s keychain script pub keys needed to +[`FullScanRequest] collects iterators for the wallet’s keychain script pub keys needed to start a blockchain full scan with a spk based blockchain client.

    This operation is generally only used when importing or restoring a previously used wallet in which the list of used scripts is not known.

    -

    Trait Implementations§

    Source§

    impl AsRef<TxGraph> for Wallet

    Source§

    fn as_ref(&self) -> &TxGraph<ConfirmationBlockTime>

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

    impl Debug for Wallet

    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 +

    Trait Implementations§

    Source§

    impl AsRef<TxGraph> for Wallet

    Source§

    fn as_ref(&self) -> &TxGraph<ConfirmationBlockTime>

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

    impl Debug for Wallet

    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/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.WeightedUtxo.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.WeightedUtxo.html index a54361441c..63ed2e2545 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.WeightedUtxo.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.WeightedUtxo.html @@ -1,4 +1,4 @@ -WeightedUtxo in bdk_wallet - Rust
    bdk_wallet

    Struct WeightedUtxo

    Source 
    pub struct WeightedUtxo {
+WeightedUtxo in bdk_wallet - Rust
    bdk_wallet
    Struct WeightedUtxo
    Source 
    pub struct WeightedUtxo {
     pub satisfaction_weight: Weight,
     pub utxo: Utxo,
 }
    Expand description
    A Utxo with its satisfaction_weight.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.AsyncWalletPersister.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.AsyncWalletPersister.html
index 44e2c8ff8b..6b6640acc6 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.AsyncWalletPersister.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.AsyncWalletPersister.html
@@ -1,4 +1,4 @@
-AsyncWalletPersister in bdk_wallet - Rust
    bdk_wallet
    Trait AsyncWalletPersister
    Source 
    pub trait AsyncWalletPersister {
+AsyncWalletPersister in bdk_wallet - Rust
    bdk_wallet
    Trait AsyncWalletPersister
    Source 
    pub trait AsyncWalletPersister {
     type Error;
 
     // Required methods
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.IsDust.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.IsDust.html
index 1a1bb04f6d..e5ca67e7c1 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.IsDust.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.IsDust.html
@@ -1,4 +1,4 @@
-IsDust in bdk_wallet - Rust
    bdk_wallet
    Trait IsDust
    Source 
    pub trait IsDust {
+IsDust in bdk_wallet - Rust
    bdk_wallet
    Trait IsDust
    Source 
    pub trait IsDust {
     // Required method
     fn is_dust(&self, script: &Script) -> bool;
 }
    Expand description
    Trait to check if a value is below the dust limit.
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.WalletPersister.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.WalletPersister.html
index 1173f71f0e..0bf6cad192 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.WalletPersister.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.WalletPersister.html
@@ -1,4 +1,4 @@
-WalletPersister in bdk_wallet - Rust
    bdk_wallet
    Trait WalletPersister
    Source 
    pub trait WalletPersister {
+WalletPersister in bdk_wallet - Rust
    bdk_wallet
    Trait WalletPersister
    Source 
    pub trait WalletPersister {
     type Error;
 
     // Required methods
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.AddForeignUtxoError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.AddForeignUtxoError.html
index ebf1232b10..886ed622c5 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.AddForeignUtxoError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.AddForeignUtxoError.html
@@ -1,4 +1,4 @@
-AddForeignUtxoError in bdk_wallet::tx_builder - Rust
    bdk_wallet::tx_builder
    Enum AddForeignUtxoError
    Source 
    pub enum AddForeignUtxoError {
+AddForeignUtxoError in bdk_wallet::tx_builder - Rust
    bdk_wallet::tx_builder
    Enum AddForeignUtxoError
    Source 
    pub enum AddForeignUtxoError {
     InvalidTxid {
         input_txid: Txid,
         foreign_utxo: OutPoint,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.AddUtxoError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.AddUtxoError.html
index bf21d10d9d..e5f605b2e2 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.AddUtxoError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.AddUtxoError.html
@@ -1,4 +1,4 @@
-AddUtxoError in bdk_wallet::tx_builder - Rust
    bdk_wallet::tx_builder
    Enum AddUtxoError
    Source 
    pub enum AddUtxoError {
+AddUtxoError in bdk_wallet::tx_builder - Rust
    bdk_wallet::tx_builder
    Enum AddUtxoError
    Source 
    pub enum AddUtxoError {
     UnknownUtxo(OutPoint),
 }
    Expand description
    Error returned from TxBuilder::add_utxo and TxBuilder::add_utxos
    
 
    Variants§
    §
    UnknownUtxo(OutPoint)
    Happens when trying to spend an UTXO that is not in the internal database
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.ChangeSpendPolicy.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.ChangeSpendPolicy.html
index 93f44ac512..f55c7346c9 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.ChangeSpendPolicy.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.ChangeSpendPolicy.html
@@ -1,4 +1,4 @@
-ChangeSpendPolicy in bdk_wallet::tx_builder - Rust
    bdk_wallet::tx_builder
    Enum ChangeSpendPolicy
    Source 
    pub enum ChangeSpendPolicy {
+ChangeSpendPolicy in bdk_wallet::tx_builder - Rust
    bdk_wallet::tx_builder
    Enum ChangeSpendPolicy
    Source 
    pub enum ChangeSpendPolicy {
     ChangeAllowed,
     OnlyChange,
     ChangeForbidden,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.TxOrdering.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.TxOrdering.html
index a328e6741b..fa0a91dec0 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.TxOrdering.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.TxOrdering.html
@@ -1,4 +1,4 @@
-TxOrdering in bdk_wallet::tx_builder - Rust
    bdk_wallet::tx_builder
    Enum TxOrdering
    Source 
    pub enum TxOrdering {
+TxOrdering in bdk_wallet::tx_builder - Rust
    bdk_wallet::tx_builder
    Enum TxOrdering
    Source 
    pub enum TxOrdering {
     Shuffle,
     Untouched,
     Custom {
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/index.html
index 5c46fd4895..b27b6bd423 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/index.html
@@ -1,4 +1,4 @@
-bdk_wallet::tx_builder - Rust
    bdk_wallet
    Module tx_builder
    Source 
    Expand description
    Transaction builder
    
+bdk_wallet::tx_builder - Rust
    bdk_wallet
    Module tx_builder
    Source 
    Expand description
    Transaction builder
    
 
    §Example
    
 
    // create a TxBuilder from a wallet
 let mut tx_builder = wallet.build_tx();
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/struct.TxBuilder.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/struct.TxBuilder.html
index 10fafd71b3..dd0dd201a2 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/struct.TxBuilder.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/struct.TxBuilder.html
@@ -1,4 +1,4 @@
-TxBuilder in bdk_wallet::tx_builder - Rust
    bdk_wallet::tx_builder
    Struct TxBuilder
    Source 
    pub struct TxBuilder<'a, Cs> { /* private fields */ }
    Expand description
    A transaction builder
    
+TxBuilder in bdk_wallet::tx_builder - Rust
    bdk_wallet::tx_builder
    Struct TxBuilder
    Source 
    pub struct TxBuilder<'a, Cs> { /* private fields */ }
    Expand description
    A transaction builder
    
 
    A TxBuilder is created by calling build_tx or build_fee_bump on a wallet. After
 assigning it, you set options on it until finally calling finish to consume the builder and
 generate the transaction.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/type.WalletTx.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/type.WalletTx.html
index 9c326244ac..cc3fee3bfc 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/type.WalletTx.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/type.WalletTx.html
@@ -1,7 +1,7 @@
-WalletTx in bdk_wallet - Rust
    bdk_wallet
    Type Alias WalletTx
    Source 
    pub type WalletTx<'a> = CanonicalTx<'a, Arc<Transaction>, ConfirmationBlockTime>;
    Expand description
    A CanonicalTx managed by a Wallet.
    
+WalletTx in bdk_wallet - Rust
    bdk_wallet
    Type Alias WalletTx
    Source 
    pub type WalletTx<'a> = CanonicalTx<'a, Arc<Transaction>, ConfirmationBlockTime>;
    Expand description
    A CanonicalTx managed by a Wallet.
    
 
    Aliased Type§
    struct WalletTx<'a> {
-    pub chain_position: ChainPosition<ConfirmationBlockTime>,
-    pub tx_node: TxNode<'a, Arc<Transaction>, ConfirmationBlockTime>,
-}
    Fields§
    §chain_position: ChainPosition<ConfirmationBlockTime>
    How the transaction is observed in the canonical chain (confirmed or unconfirmed).
    
-
    §tx_node: TxNode<'a, Arc<Transaction>, ConfirmationBlockTime>
    The transaction node (as part of the graph).
    
+    pub chain_position: ChainPosition<ConfirmationBlockTime>,
+    pub tx_node: TxNode<'a, Arc<Transaction>, ConfirmationBlockTime>,
+}
    Fields§
    §chain_position: ChainPosition<ConfirmationBlockTime>
    How the transaction is observed in the canonical chain (confirmed or unconfirmed).
    
+
    §tx_node: TxNode<'a, Arc<Transaction>, ConfirmationBlockTime>
    The transaction node (as part of the graph).
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/all.html
index 031ff0e16b..8e711b9f0a 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/all.html
@@ -1 +1 @@
-List of all items in this crate
    List of all items
    Structs
    Enums
    Functions
    Constants
    
\ No newline at end of file
+List of all items in this crate
    List of all items
    Structs
    Enums
    Functions
    Constants
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.CHANNEL_BOUND.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.CHANNEL_BOUND.html
index 5ca8a85106..00ad6b4b3b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.CHANNEL_BOUND.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.CHANNEL_BOUND.html
@@ -1,2 +1,2 @@
-CHANNEL_BOUND in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Constant CHANNEL_BOUND
    Source 
    pub(crate) const CHANNEL_BOUND: usize = 10;
    Expand description
    The mpsc channel bound for emissions from Emitter.
    
+CHANNEL_BOUND in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Constant CHANNEL_BOUND
    Source 
    pub(crate) const CHANNEL_BOUND: usize = 10;
    Expand description
    The mpsc channel bound for emissions from [Emitter].
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_COMMIT_DELAY.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_COMMIT_DELAY.html
index d06ce98509..4e548a7534 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_COMMIT_DELAY.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_COMMIT_DELAY.html
@@ -1,2 +1,2 @@
-DB_COMMIT_DELAY in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Constant DB_COMMIT_DELAY
    Source 
    pub(crate) const DB_COMMIT_DELAY: Duration;
    Expand description
    Delay for committing to persistence.
    
+DB_COMMIT_DELAY in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Constant DB_COMMIT_DELAY
    Source 
    pub(crate) const DB_COMMIT_DELAY: Duration;
    Expand description
    Delay for committing to persistence.
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_MAGIC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_MAGIC.html
index 81bb773630..d7cedd4718 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_MAGIC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_MAGIC.html
@@ -1 +1 @@
-DB_MAGIC in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Constant DB_MAGIC
    Source 
    pub(crate) const DB_MAGIC: &[u8] = b"bdk_example_rpc";
    
\ No newline at end of file
+DB_MAGIC in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Constant DB_MAGIC
    Source 
    pub(crate) const DB_MAGIC: &[u8] = b"bdk_example_rpc";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_PATH.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_PATH.html
index c879d6f5bb..aa0748ac3a 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_PATH.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_PATH.html
@@ -1 +1 @@
-DB_PATH in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Constant DB_PATH
    Source 
    pub(crate) const DB_PATH: &str = ".bdk_example_rpc.db";
    
\ No newline at end of file
+DB_PATH in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Constant DB_PATH
    Source 
    pub(crate) const DB_PATH: &str = ".bdk_example_rpc.db";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.MEMPOOL_EMIT_DELAY.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.MEMPOOL_EMIT_DELAY.html
index 2a44a090a4..ffceef56b1 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.MEMPOOL_EMIT_DELAY.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.MEMPOOL_EMIT_DELAY.html
@@ -1,2 +1,2 @@
-MEMPOOL_EMIT_DELAY in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Constant MEMPOOL_EMIT_DELAY
    Source 
    pub(crate) const MEMPOOL_EMIT_DELAY: Duration;
    Expand description
    Delay between mempool emissions.
    
+MEMPOOL_EMIT_DELAY in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Constant MEMPOOL_EMIT_DELAY
    Source 
    pub(crate) const MEMPOOL_EMIT_DELAY: Duration;
    Expand description
    Delay between mempool emissions.
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.STDOUT_PRINT_DELAY.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.STDOUT_PRINT_DELAY.html
index 180d693745..98bca5345f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.STDOUT_PRINT_DELAY.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.STDOUT_PRINT_DELAY.html
@@ -1,2 +1,2 @@
-STDOUT_PRINT_DELAY in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Constant STDOUT_PRINT_DELAY
    Source 
    pub(crate) const STDOUT_PRINT_DELAY: Duration;
    Expand description
    Delay for printing status to stdout.
    
+STDOUT_PRINT_DELAY in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Constant STDOUT_PRINT_DELAY
    Source 
    pub(crate) const STDOUT_PRINT_DELAY: Duration;
    Expand description
    Delay for printing status to stdout.
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.Emission.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.Emission.html
index 17750bd46a..1ea1ef3557 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.Emission.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.Emission.html
@@ -1,8 +1,8 @@
-Emission in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Enum Emission
    Source 
    pub(crate) enum Emission {
-    Block(BlockEvent<Block>),
+Emission in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Enum Emission
    Source 
    pub(crate) enum Emission {
+    Block(BlockEvent<Block>),
     Mempool(Vec<(Transaction, u64)>),
     Tip(u32),
-}
    Variants§
    §
    Block(BlockEvent<Block>)
    §
    Mempool(Vec<(Transaction, u64)>)
    §
    Tip(u32)
    Trait Implementations§
    Source§
    impl Debug for Emission
    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
+}
    Variants§
    §
    Block(BlockEvent<Block>)
    §
    Mempool(Vec<(Transaction, u64)>)
    §
    Tip(u32)
    Trait Implementations§
    Source§
    impl Debug for Emission
    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/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.RpcCommands.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.RpcCommands.html
index ec05641b6e..bb77b1810e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.RpcCommands.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.RpcCommands.html
@@ -1,4 +1,4 @@
-RpcCommands in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Enum RpcCommands
    Source 
    pub(crate) enum RpcCommands {
+RpcCommands in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Enum RpcCommands
    Source 
    pub(crate) enum RpcCommands {
     Sync {
         rpc_args: RpcArgs,
     },
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.await_flag.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.await_flag.html
index 99788180f0..f3023c0b4c 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.await_flag.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.await_flag.html
@@ -1 +1 @@
-await_flag in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Function await_flag
    Source 
    pub(crate) fn await_flag(flag: &AtomicBool, duration: Duration) -> bool
    
\ No newline at end of file
+await_flag in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Function await_flag
    Source 
    pub(crate) fn await_flag(flag: &AtomicBool, duration: Duration) -> bool
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.main.html
index ca6b9abcbf..aa66be13ac 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.main.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.main.html
@@ -1 +1 @@
-main in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Function main
    Source 
    pub(crate) fn main() -> Result<()>
    
\ No newline at end of file
+main in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Function main
    Source 
    pub(crate) fn main() -> Result<()>
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.start_ctrlc_handler.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.start_ctrlc_handler.html
index 4580f4de30..fe0297f66b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.start_ctrlc_handler.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.start_ctrlc_handler.html
@@ -1 +1 @@
-start_ctrlc_handler in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Function start_ctrlc_handler
    Source 
    pub(crate) fn start_ctrlc_handler() -> Arc<AtomicBool>
    
\ No newline at end of file
+start_ctrlc_handler in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Function start_ctrlc_handler
    Source 
    pub(crate) fn start_ctrlc_handler() -> Arc<AtomicBool>
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/index.html
index 004ea8fa77..a6da90ed31 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/index.html
@@ -1 +1 @@
-example_bitcoind_rpc_polling - Rust
    Crate example_bitcoind_rpc_polling
    Source 
    Structs§
    Enums§
    Constants§
    Functions§
    
\ No newline at end of file
+example_bitcoind_rpc_polling - Rust
    Crate example_bitcoind_rpc_polling
    Source 
    Structs§
    Enums§
    Constants§
    Functions§
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/struct.RpcArgs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/struct.RpcArgs.html
index 89e696fa0c..fae24a52c2 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/struct.RpcArgs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/struct.RpcArgs.html
@@ -1,4 +1,4 @@
-RpcArgs in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Struct RpcArgs
    Source 
    pub(crate) struct RpcArgs {
+RpcArgs in example_bitcoind_rpc_polling - Rust
    example_bitcoind_rpc_polling
    Struct RpcArgs
    Source 
    pub(crate) struct RpcArgs {
     pub(crate) url: String,
     pub(crate) rpc_cookie: Option<PathBuf>,
     pub(crate) rpc_user: Option<String>,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/all.html
index eb995a0894..dff45cc183 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/all.html
@@ -1 +1 @@
-List of all items in this crate
    List of all items
    Structs
    Enums
    Functions
    Type Aliases
    
\ No newline at end of file
+List of all items in this crate
    List of all items
    Structs
    Enums
    Functions
    Type Aliases
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.AddressCmd.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.AddressCmd.html
index 16214e0fad..f9886769f3 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.AddressCmd.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.AddressCmd.html
@@ -1,4 +1,4 @@
-AddressCmd in example_cli - Rust
    example_cli
    Enum AddressCmd
    Source 
    pub enum AddressCmd {
+AddressCmd in example_cli - Rust
    example_cli
    Enum AddressCmd
    Source 
    pub enum AddressCmd {
     Next,
     New,
     List {
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.CoinSelectionAlgo.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.CoinSelectionAlgo.html
index f8b330eba3..92619e4b96 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.CoinSelectionAlgo.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.CoinSelectionAlgo.html
@@ -1,4 +1,4 @@
-CoinSelectionAlgo in example_cli - Rust
    example_cli
    Enum CoinSelectionAlgo
    Source 
    pub enum CoinSelectionAlgo {
+CoinSelectionAlgo in example_cli - Rust
    example_cli
    Enum CoinSelectionAlgo
    Source 
    pub enum CoinSelectionAlgo {
     LargestFirst,
     SmallestFirst,
     OldestFirst,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Commands.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Commands.html
index 355fa46707..e9cf9b6592 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Commands.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Commands.html
@@ -1,4 +1,4 @@
-Commands in example_cli - Rust
    example_cli
    Enum Commands
    Source 
    pub enum Commands<CS: Subcommand, S: Args> {
+Commands in example_cli - Rust
    example_cli
    Enum Commands
    Source 
    pub enum Commands<CS: Subcommand, S: Args> {
     Init {
         network: Network,
         descriptor: String,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Keychain.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Keychain.html
index 58e31f4752..131f3a9103 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Keychain.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Keychain.html
@@ -1,4 +1,4 @@
-Keychain in example_cli - Rust
    example_cli
    Enum Keychain
    Source 
    pub enum Keychain {
+Keychain in example_cli - Rust
    example_cli
    Enum Keychain
    Source 
    pub enum Keychain {
     External,
     Internal,
 }
    Variants§
    §
    External
    §
    Internal
    Trait Implementations§
    Source§
    impl Clone for Keychain
    Source§
    fn clone(&self) -> Keychain
    Returns a copy of 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 Keychain
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    Source§
    impl<'de> Deserialize<'de> for Keychain
    Source§
    fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
    where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.PsbtCmd.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.PsbtCmd.html
index 0f63ed5247..b59ae985fa 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.PsbtCmd.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.PsbtCmd.html
@@ -1,4 +1,4 @@
-PsbtCmd in example_cli - Rust
    example_cli
    Enum PsbtCmd
    Source 
    pub enum PsbtCmd<S: Args> {
+PsbtCmd in example_cli - Rust
    example_cli
    Enum PsbtCmd
    Source 
    pub enum PsbtCmd<S: Args> {
     New {
         value: u64,
         address: Address<NetworkUnchecked>,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.TxOutCmd.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.TxOutCmd.html
index e26a6a6489..5f4d2af1a0 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.TxOutCmd.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.TxOutCmd.html
@@ -1,4 +1,4 @@
-TxOutCmd in example_cli - Rust
    example_cli
    Enum TxOutCmd
    Source 
    pub enum TxOutCmd {
+TxOutCmd in example_cli - Rust
    example_cli
    Enum TxOutCmd
    Source 
    pub enum TxOutCmd {
     List {
         spent: bool,
         unspent: bool,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.create_tx.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.create_tx.html
index 2ef7c6c134..a88cb66c76 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.create_tx.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.create_tx.html
@@ -1,4 +1,4 @@
-create_tx in example_cli - Rust
    example_cli
    Function create_tx
    Source 
    pub fn create_tx<O: ChainOracle>(
+create_tx in example_cli - Rust
    example_cli
    Function create_tx
    Source 
    pub fn create_tx<O: ChainOracle>(
     graph: &mut KeychainTxGraph,
     chain: &O,
     assets: &Assets,
@@ -6,4 +6,4 @@
     address: Address,
     value: u64,
 ) -> Result<(Psbt, Option<ChangeInfo>)>
    where
-    O::Error: Error + Send + Sync + 'static,
    
\ No newline at end of file
+    O::Error: Error + Send + Sync + 'static,
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.handle_commands.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.handle_commands.html
index 36ca9222ed..fe3a4f8816 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.handle_commands.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.handle_commands.html
@@ -1,6 +1,6 @@
-handle_commands in example_cli - Rust
    example_cli
    Function handle_commands
    Source 
    pub fn handle_commands<CS: Subcommand, S: Args>(
+handle_commands in example_cli - Rust
    example_cli
    Function handle_commands
    Source 
    pub fn handle_commands<CS: Subcommand, S: Args>(
     graph: &Mutex<KeychainTxGraph>,
-    chain: &Mutex<LocalChain>,
+    chain: &Mutex<LocalChain>,
     db: &Mutex<Store<ChangeSet>>,
     network: Network,
     broadcast: impl FnOnce(S, &Transaction) -> Result<()>,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.init_or_load.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.init_or_load.html
index f5436490e6..e05ac9a775 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.init_or_load.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.init_or_load.html
@@ -1,4 +1,4 @@
-init_or_load in example_cli - Rust
    example_cli
    Function init_or_load
    Source 
    pub fn init_or_load<CS: Subcommand, S: Args>(
+init_or_load in example_cli - Rust
    example_cli
    Function init_or_load
    Source 
    pub fn init_or_load<CS: Subcommand, S: Args>(
     db_magic: &[u8],
     db_path: &str,
 ) -> Result<Option<Init<CS, S>>>
    Expand description
    Loads from persistence or creates new
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.planned_utxos.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.planned_utxos.html
index 3b45ed75d5..03a3643ba0 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.planned_utxos.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.planned_utxos.html
@@ -1,5 +1,5 @@
-planned_utxos in example_cli - Rust
    example_cli
    Function planned_utxos
    Source 
    pub fn planned_utxos<O: ChainOracle>(
+planned_utxos in example_cli - Rust
    example_cli
    Function planned_utxos
    Source 
    pub fn planned_utxos<O: ChainOracle>(
     graph: &KeychainTxGraph,
     chain: &O,
     assets: &Assets,
-) -> Result<Vec<PlanUtxo>, O::Error>
    
\ No newline at end of file
+) -> Result<Vec<PlanUtxo>, O::Error>
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/index.html
index 1a0d9a8b42..cb6b554565 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/index.html
@@ -1 +1 @@
-example_cli - Rust
    Crate example_cli
    Source 
    Re-exports§
    Structs§
    Enums§
    Functions§
    Type Aliases§
    
\ No newline at end of file
+example_cli - Rust
    Crate example_cli
    Source 
    Re-exports§
    Structs§
    Enums§
    Functions§
    Type Aliases§
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Args.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Args.html
index e3c0efbca0..4a6f0075b7 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Args.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Args.html
@@ -1,4 +1,4 @@
-Args in example_cli - Rust
    example_cli
    Struct Args
    Source 
    pub struct Args<CS: Subcommand, S: Args> {
+Args in example_cli - Rust
    example_cli
    Struct Args
    Source 
    pub struct Args<CS: Subcommand, S: Args> {
     pub command: Commands<CS, S>,
 }
    Fields§
    §command: Commands<CS, S>
    Trait Implementations§
    Source§
    impl<CS: Subcommand, S: Args> Args for Args<CS, S>
    Source§
    fn group_id() -> Option<Id>
    Report the [ArgGroup::id][crate::ArgGroup::id] for this set of arguments
    Source§
    fn augment_args<'b>(__clap_app: Command) -> Command
    Append to [Command] so it can instantiate Self via
 [FromArgMatches::from_arg_matches_mut] Read more
    Source§
    fn augment_args_for_update<'b>(__clap_app: Command) -> Command
    Append to [Command] so it can instantiate self via
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeInfo.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeInfo.html
index e50a3a0e26..10863621b7 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeInfo.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeInfo.html
@@ -1,8 +1,8 @@
-ChangeInfo in example_cli - Rust
    example_cli
    Struct ChangeInfo
    Source 
    pub struct ChangeInfo {
+ChangeInfo in example_cli - Rust
    example_cli
    Struct ChangeInfo
    Source 
    pub struct ChangeInfo {
     pub change_keychain: Keychain,
-    pub indexer: ChangeSet,
+    pub indexer: ChangeSet,
     pub index: u32,
-}
    Fields§
    §change_keychain: Keychain§indexer: ChangeSet§index: u32
    Trait Implementations§
    Source§
    impl Debug for ChangeInfo
    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
+}
    Fields§
    §change_keychain: Keychain§indexer: ChangeSet§index: u32
    Trait Implementations§
    Source§
    impl Debug for ChangeInfo
    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/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeSet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeSet.html
index 3cec5c69bf..388d4a9e0a 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeSet.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeSet.html
@@ -1,19 +1,19 @@
-ChangeSet in example_cli - Rust
    example_cli
    Struct ChangeSet
    Source 
    pub struct ChangeSet {
+ChangeSet in example_cli - Rust
    example_cli
    Struct ChangeSet
    Source 
    pub struct ChangeSet {
     pub descriptor: Option<Descriptor<DescriptorPublicKey>>,
     pub change_descriptor: Option<Descriptor<DescriptorPublicKey>>,
     pub network: Option<Network>,
-    pub local_chain: ChangeSet,
-    pub tx_graph: ChangeSet<ConfirmationBlockTime>,
-    pub indexer: ChangeSet,
+    pub local_chain: ChangeSet,
+    pub tx_graph: ChangeSet<ConfirmationBlockTime>,
+    pub indexer: ChangeSet,
 }
    Expand description
    ChangeSet
    
 
    Fields§
    §descriptor: Option<Descriptor<DescriptorPublicKey>>
    Descriptor for recipient addresses.
    
 
    §change_descriptor: Option<Descriptor<DescriptorPublicKey>>
    Descriptor for change addresses.
    
 
    §network: Option<Network>
    Stores the network type of the transaction data.
    
-
    §local_chain: ChangeSet
    Changes to the LocalChain.
    
-
    §tx_graph: ChangeSet<ConfirmationBlockTime>
    Changes to TxGraph.
    
-
    §indexer: ChangeSet
    Changes to KeychainTxOutIndex.
    
+
    §local_chain: ChangeSet
    Changes to the [LocalChain].
    
+
    §tx_graph: ChangeSet<ConfirmationBlockTime>
    Changes to TxGraph.
    
+
    §indexer: ChangeSet
    Changes to [KeychainTxOutIndex].
    
 
    Trait Implementations§
    Source§
    impl Clone for ChangeSet
    Source§
    fn clone(&self) -> ChangeSet
    Returns a copy of 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 ChangeSet
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    Source§
    impl Default for ChangeSet
    Source§
    fn default() -> ChangeSet
    Returns the “default value” for a type. Read more
    Source§
    impl<'de> Deserialize<'de> for ChangeSet
    Source§
    fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
    where
-    __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    Source§
    impl Merge for ChangeSet
    Source§
    fn merge(&mut self, other: Self)
    Merge another object of the same type onto self.
    Source§
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    Source§
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    Source§
    impl PartialEq for ChangeSet
    Source§
    fn eq(&self, other: &ChangeSet) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,
+    __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    Source§
    impl Merge for ChangeSet
    Source§
    fn merge(&mut self, other: Self)
    Merge another object of the same type onto self.
    Source§
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    §
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    Source§
    impl PartialEq for ChangeSet
    Source§
    fn eq(&self, other: &ChangeSet) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
    Source§
    impl Serialize for ChangeSet
    Source§
    fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
    where
     __S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    Source§
    impl StructuralPartialEq for ChangeSet
    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/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Init.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Init.html
index 574fe10c34..aaa9b574df 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Init.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Init.html
@@ -1,13 +1,13 @@
-Init in example_cli - Rust
    example_cli
    Struct Init
    Source 
    pub struct Init<CS: Subcommand, S: Args> {
+Init in example_cli - Rust
    example_cli
    Struct Init
    Source 
    pub struct Init<CS: Subcommand, S: Args> {
     pub args: Args<CS, S>,
     pub graph: Mutex<KeychainTxGraph>,
-    pub chain: Mutex<LocalChain>,
+    pub chain: Mutex<LocalChain>,
     pub db: Mutex<Store<ChangeSet>>,
     pub network: Network,
 }
    Expand description
    The initial state returned by init_or_load.
    
 
    Fields§
    §args: Args<CS, S>
    CLI args
    
 
    §graph: Mutex<KeychainTxGraph>
    Indexed graph
    
-
    §chain: Mutex<LocalChain>
    Local chain
    
+
    §chain: Mutex<LocalChain>
    Local chain
    
 
    §db: Mutex<Store<ChangeSet>>
    Database
    
 
    §network: Network
    Network
    
 
    Auto Trait Implementations§
    §
    impl<CS, S> !Freeze for Init<CS, S>
    §
    impl<CS, S> RefUnwindSafe for Init<CS, S>
    where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.KeychainTxGraph.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.KeychainTxGraph.html
index de78a0ef06..77482bdb6f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.KeychainTxGraph.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.KeychainTxGraph.html
@@ -1,6 +1,6 @@
-KeychainTxGraph in example_cli - Rust
    example_cli
    Type Alias KeychainTxGraph
    Source 
    pub type KeychainTxGraph = IndexedTxGraph<ConfirmationBlockTime, KeychainTxOutIndex<Keychain>>;
    Expand description
    Alias for a IndexedTxGraph with specific Anchor and Indexer.
    
+KeychainTxGraph in example_cli - Rust
    example_cli
    Type Alias KeychainTxGraph
    Source 
    pub type KeychainTxGraph = IndexedTxGraph<ConfirmationBlockTime, KeychainTxOutIndex<Keychain>>;
    Expand description
    Alias for a IndexedTxGraph with specific Anchor and Indexer.
    
 
    Aliased Type§
    struct KeychainTxGraph {
-    pub index: KeychainTxOutIndex<Keychain>,
+    pub index: KeychainTxOutIndex<Keychain>,
     /* private fields */
-}
    Fields§
    §index: KeychainTxOutIndex<Keychain>
    Transaction index.
    
+}
    Fields§
    §index: KeychainTxOutIndex<Keychain>
    Transaction index.
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.PlanUtxo.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.PlanUtxo.html
index bb4dc07746..18a4872774 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.PlanUtxo.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.PlanUtxo.html
@@ -1 +1 @@
-PlanUtxo in example_cli - Rust
    example_cli
    Type Alias PlanUtxo
    Source 
    pub type PlanUtxo = (Plan, FullTxOut<ConfirmationBlockTime>);
    
\ No newline at end of file
+PlanUtxo in example_cli - Rust
    example_cli
    Type Alias PlanUtxo
    Source 
    pub type PlanUtxo = (Plan, FullTxOut<ConfirmationBlockTime>);
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/all.html
index b843f8b260..ea29942e05 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/all.html
@@ -1 +1 @@
-List of all items in this crate
    List of all items
    Structs
    Enums
    Functions
    Constants
    
\ No newline at end of file
+List of all items in this crate
    List of all items
    Structs
    Enums
    Functions
    Constants
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/constant.DB_MAGIC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/constant.DB_MAGIC.html
index 1d29c3ddb8..39baa22fed 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/constant.DB_MAGIC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/constant.DB_MAGIC.html
@@ -1 +1 @@
-DB_MAGIC in example_electrum - Rust
    example_electrum
    Constant DB_MAGIC
    Source 
    pub(crate) const DB_MAGIC: &[u8] = b"bdk_example_electrum";
    
\ No newline at end of file
+DB_MAGIC in example_electrum - Rust
    example_electrum
    Constant DB_MAGIC
    Source 
    pub(crate) const DB_MAGIC: &[u8] = b"bdk_example_electrum";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/constant.DB_PATH.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/constant.DB_PATH.html
index 219b04aff0..34335d8738 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/constant.DB_PATH.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/constant.DB_PATH.html
@@ -1 +1 @@
-DB_PATH in example_electrum - Rust
    example_electrum
    Constant DB_PATH
    Source 
    pub(crate) const DB_PATH: &str = ".bdk_example_electrum.db";
    
\ No newline at end of file
+DB_PATH in example_electrum - Rust
    example_electrum
    Constant DB_PATH
    Source 
    pub(crate) const DB_PATH: &str = ".bdk_example_electrum.db";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/enum.ElectrumCommands.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/enum.ElectrumCommands.html
index aa49fd3480..b8a99a4046 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/enum.ElectrumCommands.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/enum.ElectrumCommands.html
@@ -1,4 +1,4 @@
-ElectrumCommands in example_electrum - Rust
    example_electrum
    Enum ElectrumCommands
    Source 
    pub(crate) enum ElectrumCommands {
+ElectrumCommands in example_electrum - Rust
    example_electrum
    Enum ElectrumCommands
    Source 
    pub(crate) enum ElectrumCommands {
     Scan {
         stop_gap: usize,
         scan_options: ScanOptions,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/fn.main.html
index 80899a6123..e84714b90b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/fn.main.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/fn.main.html
@@ -1 +1 @@
-main in example_electrum - Rust
    example_electrum
    Function main
    Source 
    pub(crate) fn main() -> Result<()>
    
\ No newline at end of file
+main in example_electrum - Rust
    example_electrum
    Function main
    Source 
    pub(crate) fn main() -> Result<()>
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/index.html
index 5b87b7566d..59da47c24b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/index.html
@@ -1 +1 @@
-example_electrum - Rust
    Crate example_electrum
    Source 
    Structs§
    Enums§
    Constants§
    Functions§
    
\ No newline at end of file
+example_electrum - Rust
    Crate example_electrum
    Source 
    Structs§
    Enums§
    Constants§
    Functions§
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ElectrumArgs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ElectrumArgs.html
index 5078f73d12..0c8968bb0b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ElectrumArgs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ElectrumArgs.html
@@ -1,4 +1,4 @@
-ElectrumArgs in example_electrum - Rust
    example_electrum
    Struct ElectrumArgs
    Source 
    pub struct ElectrumArgs {
+ElectrumArgs in example_electrum - Rust
    example_electrum
    Struct ElectrumArgs
    Source 
    pub struct ElectrumArgs {
     pub(crate) electrum_url: Option<String>,
 }
    Fields§
    §electrum_url: Option<String>
    The electrum url to use to connect to. If not provided it will use a default electrum server
 for your chosen network.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ScanOptions.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ScanOptions.html
index f55d3d1a8b..a69d619c5a 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ScanOptions.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ScanOptions.html
@@ -1,4 +1,4 @@
-ScanOptions in example_electrum - Rust
    example_electrum
    Struct ScanOptions
    Source 
    pub struct ScanOptions {
+ScanOptions in example_electrum - Rust
    example_electrum
    Struct ScanOptions
    Source 
    pub struct ScanOptions {
     pub batch_size: usize,
 }
    Fields§
    §batch_size: usize
    Set batch size for each script_history call to electrum client.
    
 
    Trait Implementations§
    Source§
    impl Args for ScanOptions
    Source§
    fn group_id() -> Option<Id>
    Report the [ArgGroup::id][crate::ArgGroup::id] for this set of arguments
    Source§
    fn augment_args<'b>(__clap_app: Command) -> Command
    Append to [Command] so it can instantiate Self via
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/all.html
index 9249d0e484..4dd50b8bb8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/all.html
@@ -1 +1 @@
-List of all items in this crate
    List of all items
    Structs
    Enums
    Functions
    Constants
    
\ No newline at end of file
+List of all items in this crate
    List of all items
    Structs
    Enums
    Functions
    Constants
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/constant.DB_MAGIC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/constant.DB_MAGIC.html
index e779926391..db2df4ca7c 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/constant.DB_MAGIC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/constant.DB_MAGIC.html
@@ -1 +1 @@
-DB_MAGIC in example_esplora - Rust
    example_esplora
    Constant DB_MAGIC
    Source 
    pub(crate) const DB_MAGIC: &[u8] = b"bdk_example_esplora";
    
\ No newline at end of file
+DB_MAGIC in example_esplora - Rust
    example_esplora
    Constant DB_MAGIC
    Source 
    pub(crate) const DB_MAGIC: &[u8] = b"bdk_example_esplora";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/constant.DB_PATH.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/constant.DB_PATH.html
index e74f85d4d6..6692695c3e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/constant.DB_PATH.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/constant.DB_PATH.html
@@ -1 +1 @@
-DB_PATH in example_esplora - Rust
    example_esplora
    Constant DB_PATH
    Source 
    pub(crate) const DB_PATH: &str = ".bdk_example_esplora.db";
    
\ No newline at end of file
+DB_PATH in example_esplora - Rust
    example_esplora
    Constant DB_PATH
    Source 
    pub(crate) const DB_PATH: &str = ".bdk_example_esplora.db";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/enum.EsploraCommands.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/enum.EsploraCommands.html
index cc65c65743..114ec9a7f8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/enum.EsploraCommands.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/enum.EsploraCommands.html
@@ -1,4 +1,4 @@
-EsploraCommands in example_esplora - Rust
    example_esplora
    Enum EsploraCommands
    Source 
    pub(crate) enum EsploraCommands {
+EsploraCommands in example_esplora - Rust
    example_esplora
    Enum EsploraCommands
    Source 
    pub(crate) enum EsploraCommands {
     Scan {
         stop_gap: usize,
         scan_options: ScanOptions,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/fn.main.html
index 66d7d9ad2a..e7bccfc43a 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/fn.main.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/fn.main.html
@@ -1 +1 @@
-main in example_esplora - Rust
    example_esplora
    Function main
    Source 
    pub(crate) fn main() -> Result<()>
    
\ No newline at end of file
+main in example_esplora - Rust
    example_esplora
    Function main
    Source 
    pub(crate) fn main() -> Result<()>
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/index.html
index 3eb1c996c8..504af145ac 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/index.html
@@ -1 +1 @@
-example_esplora - Rust
    Crate example_esplora
    Source 
    Structs§
    Enums§
    Constants§
    Functions§
    
\ No newline at end of file
+example_esplora - Rust
    Crate example_esplora
    Source 
    Structs§
    Enums§
    Constants§
    Functions§
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.EsploraArgs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.EsploraArgs.html
index e84819f3c0..560b332f59 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.EsploraArgs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.EsploraArgs.html
@@ -1,4 +1,4 @@
-EsploraArgs in example_esplora - Rust
    example_esplora
    Struct EsploraArgs
    Source 
    pub struct EsploraArgs {
+EsploraArgs in example_esplora - Rust
    example_esplora
    Struct EsploraArgs
    Source 
    pub struct EsploraArgs {
     pub(crate) esplora_url: Option<String>,
 }
    Fields§
    §esplora_url: Option<String>
    The esplora url endpoint to connect to.
    
 
    Implementations§
    Source§
    impl EsploraArgs
    Source
    pub fn client(&self, network: Network) -> Result<BlockingClient>
    Trait Implementations§
    Source§
    impl Args for EsploraArgs
    Source§
    fn group_id() -> Option<Id>
    Report the [ArgGroup::id][crate::ArgGroup::id] for this set of arguments
    Source§
    fn augment_args<'b>(__clap_app: Command) -> Command
    Append to [Command] so it can instantiate Self via
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.ScanOptions.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.ScanOptions.html
index 27970f6f8a..518f1d4722 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.ScanOptions.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.ScanOptions.html
@@ -1,4 +1,4 @@
-ScanOptions in example_esplora - Rust
    example_esplora
    Struct ScanOptions
    Source 
    pub struct ScanOptions {
+ScanOptions in example_esplora - Rust
    example_esplora
    Struct ScanOptions
    Source 
    pub struct ScanOptions {
     pub parallel_requests: usize,
 }
    Fields§
    §parallel_requests: usize
    Max number of concurrent esplora server requests.
    
 
    Trait Implementations§
    Source§
    impl Args for ScanOptions
    Source§
    fn group_id() -> Option<Id>
    Report the [ArgGroup::id][crate::ArgGroup::id] for this set of arguments
    Source§
    fn augment_args<'b>(__clap_app: Command) -> Command
    Append to [Command] so it can instantiate Self via
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/all.html
index 3045de559c..d96a5851cb 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/all.html
@@ -1 +1 @@
-List of all items in this crate
    List of all items
    Functions
    Constants
    
\ No newline at end of file
+List of all items in this crate
    List of all items
    Functions
    Constants
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.BATCH_SIZE.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.BATCH_SIZE.html
index cc121ed705..6ca8937d92 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.BATCH_SIZE.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.BATCH_SIZE.html
@@ -1 +1 @@
-BATCH_SIZE in example_wallet_electrum - Rust
    example_wallet_electrum
    Constant BATCH_SIZE
    Source 
    pub(crate) const BATCH_SIZE: usize = 5;
    
\ No newline at end of file
+BATCH_SIZE in example_wallet_electrum - Rust
    example_wallet_electrum
    Constant BATCH_SIZE
    Source 
    pub(crate) const BATCH_SIZE: usize = 5;
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.DB_MAGIC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.DB_MAGIC.html
index 74f8dcb859..9813da7472 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.DB_MAGIC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.DB_MAGIC.html
@@ -1 +1 @@
-DB_MAGIC in example_wallet_electrum - Rust
    example_wallet_electrum
    Constant DB_MAGIC
    Source 
    pub(crate) const DB_MAGIC: &str = "bdk_wallet_electrum_example";
    
\ No newline at end of file
+DB_MAGIC in example_wallet_electrum - Rust
    example_wallet_electrum
    Constant DB_MAGIC
    Source 
    pub(crate) const DB_MAGIC: &str = "bdk_wallet_electrum_example";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.ELECTRUM_URL.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.ELECTRUM_URL.html
index 87874b6784..aa3fb6fe81 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.ELECTRUM_URL.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.ELECTRUM_URL.html
@@ -1 +1 @@
-ELECTRUM_URL in example_wallet_electrum - Rust
    example_wallet_electrum
    Constant ELECTRUM_URL
    Source 
    pub(crate) const ELECTRUM_URL: &str = "ssl://electrum.blockstream.info:60002";
    
\ No newline at end of file
+ELECTRUM_URL in example_wallet_electrum - Rust
    example_wallet_electrum
    Constant ELECTRUM_URL
    Source 
    pub(crate) const ELECTRUM_URL: &str = "ssl://electrum.blockstream.info:60002";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.EXTERNAL_DESC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.EXTERNAL_DESC.html
index 99c4fd91cd..8812515cc8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.EXTERNAL_DESC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.EXTERNAL_DESC.html
@@ -1 +1 @@
-EXTERNAL_DESC in example_wallet_electrum - Rust
    example_wallet_electrum
    Constant EXTERNAL_DESC
    Source 
    pub(crate) const EXTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/0/*)";
    
\ No newline at end of file
+EXTERNAL_DESC in example_wallet_electrum - Rust
    example_wallet_electrum
    Constant EXTERNAL_DESC
    Source 
    pub(crate) const EXTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/0/*)";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.INTERNAL_DESC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.INTERNAL_DESC.html
index f4facc862c..c8eab04d97 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.INTERNAL_DESC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.INTERNAL_DESC.html
@@ -1 +1 @@
-INTERNAL_DESC in example_wallet_electrum - Rust
    example_wallet_electrum
    Constant INTERNAL_DESC
    Source 
    pub(crate) const INTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/1/*)";
    
\ No newline at end of file
+INTERNAL_DESC in example_wallet_electrum - Rust
    example_wallet_electrum
    Constant INTERNAL_DESC
    Source 
    pub(crate) const INTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/1/*)";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.NETWORK.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.NETWORK.html
index b13c6ae778..1d20286561 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.NETWORK.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.NETWORK.html
@@ -1 +1 @@
-NETWORK in example_wallet_electrum - Rust
    example_wallet_electrum
    Constant NETWORK
    Source 
    pub(crate) const NETWORK: Network;
    
\ No newline at end of file
+NETWORK in example_wallet_electrum - Rust
    example_wallet_electrum
    Constant NETWORK
    Source 
    pub(crate) const NETWORK: Network;
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.SEND_AMOUNT.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.SEND_AMOUNT.html
index c9a185e80c..a6b20433bb 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.SEND_AMOUNT.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.SEND_AMOUNT.html
@@ -1 +1 @@
-SEND_AMOUNT in example_wallet_electrum - Rust
    example_wallet_electrum
    Constant SEND_AMOUNT
    Source 
    pub(crate) const SEND_AMOUNT: Amount;
    
\ No newline at end of file
+SEND_AMOUNT in example_wallet_electrum - Rust
    example_wallet_electrum
    Constant SEND_AMOUNT
    Source 
    pub(crate) const SEND_AMOUNT: Amount;
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.STOP_GAP.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.STOP_GAP.html
index 85e6988291..370b5902b7 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.STOP_GAP.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.STOP_GAP.html
@@ -1 +1 @@
-STOP_GAP in example_wallet_electrum - Rust
    example_wallet_electrum
    Constant STOP_GAP
    Source 
    pub(crate) const STOP_GAP: usize = 50;
    
\ No newline at end of file
+STOP_GAP in example_wallet_electrum - Rust
    example_wallet_electrum
    Constant STOP_GAP
    Source 
    pub(crate) const STOP_GAP: usize = 50;
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/fn.main.html
index 3ee388c855..d9ef0f4a02 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/fn.main.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/fn.main.html
@@ -1 +1 @@
-main in example_wallet_electrum - Rust
    example_wallet_electrum
    Function main
    Source 
    pub(crate) fn main() -> Result<(), Error>
    
\ No newline at end of file
+main in example_wallet_electrum - Rust
    example_wallet_electrum
    Function main
    Source 
    pub(crate) fn main() -> Result<(), Error>
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/index.html
index 91eec72261..2528d3203e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/index.html
@@ -1 +1 @@
-example_wallet_electrum - Rust
    Crate example_wallet_electrum
    Source 
    Constants§
    Functions§
    
\ No newline at end of file
+example_wallet_electrum - Rust
    Crate example_wallet_electrum
    Source 
    Constants§
    Functions§
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/all.html
index 31664efd3d..815a71df0e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/all.html
@@ -1 +1 @@
-List of all items in this crate
    List of all items
    Functions
    Constants
    
\ No newline at end of file
+List of all items in this crate
    List of all items
    Functions
    Constants
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.DB_PATH.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.DB_PATH.html
index cc25146257..83a5f056b9 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.DB_PATH.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.DB_PATH.html
@@ -1 +1 @@
-DB_PATH in example_wallet_esplora_async - Rust
    example_wallet_esplora_async
    Constant DB_PATH
    Source 
    pub(crate) const DB_PATH: &str = "bdk-example-esplora-async.sqlite";
    
\ No newline at end of file
+DB_PATH in example_wallet_esplora_async - Rust
    example_wallet_esplora_async
    Constant DB_PATH
    Source 
    pub(crate) const DB_PATH: &str = "bdk-example-esplora-async.sqlite";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.ESPLORA_URL.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.ESPLORA_URL.html
index 2f061932d0..94a6378fcf 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.ESPLORA_URL.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.ESPLORA_URL.html
@@ -1 +1 @@
-ESPLORA_URL in example_wallet_esplora_async - Rust
    example_wallet_esplora_async
    Constant ESPLORA_URL
    Source 
    pub(crate) const ESPLORA_URL: &str = "http://signet.bitcoindevkit.net";
    
\ No newline at end of file
+ESPLORA_URL in example_wallet_esplora_async - Rust
    example_wallet_esplora_async
    Constant ESPLORA_URL
    Source 
    pub(crate) const ESPLORA_URL: &str = "http://signet.bitcoindevkit.net";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.EXTERNAL_DESC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.EXTERNAL_DESC.html
index 8f10b58a8b..2e55f8b519 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.EXTERNAL_DESC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.EXTERNAL_DESC.html
@@ -1 +1 @@
-EXTERNAL_DESC in example_wallet_esplora_async - Rust
    example_wallet_esplora_async
    Constant EXTERNAL_DESC
    Source 
    pub(crate) const EXTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/0/*)";
    
\ No newline at end of file
+EXTERNAL_DESC in example_wallet_esplora_async - Rust
    example_wallet_esplora_async
    Constant EXTERNAL_DESC
    Source 
    pub(crate) const EXTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/0/*)";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.INTERNAL_DESC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.INTERNAL_DESC.html
index 7e1e267775..4358a60711 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.INTERNAL_DESC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.INTERNAL_DESC.html
@@ -1 +1 @@
-INTERNAL_DESC in example_wallet_esplora_async - Rust
    example_wallet_esplora_async
    Constant INTERNAL_DESC
    Source 
    pub(crate) const INTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/1/*)";
    
\ No newline at end of file
+INTERNAL_DESC in example_wallet_esplora_async - Rust
    example_wallet_esplora_async
    Constant INTERNAL_DESC
    Source 
    pub(crate) const INTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/1/*)";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.NETWORK.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.NETWORK.html
index 791f765435..fb09638c74 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.NETWORK.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.NETWORK.html
@@ -1 +1 @@
-NETWORK in example_wallet_esplora_async - Rust
    example_wallet_esplora_async
    Constant NETWORK
    Source 
    pub(crate) const NETWORK: Network;
    
\ No newline at end of file
+NETWORK in example_wallet_esplora_async - Rust
    example_wallet_esplora_async
    Constant NETWORK
    Source 
    pub(crate) const NETWORK: Network;
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.PARALLEL_REQUESTS.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.PARALLEL_REQUESTS.html
index 2d817670ff..7fc2d3ef84 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.PARALLEL_REQUESTS.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.PARALLEL_REQUESTS.html
@@ -1 +1 @@
-PARALLEL_REQUESTS in example_wallet_esplora_async - Rust
    example_wallet_esplora_async
    Constant PARALLEL_REQUESTS
    Source 
    pub(crate) const PARALLEL_REQUESTS: usize = 5;
    
\ No newline at end of file
+PARALLEL_REQUESTS in example_wallet_esplora_async - Rust
    example_wallet_esplora_async
    Constant PARALLEL_REQUESTS
    Source 
    pub(crate) const PARALLEL_REQUESTS: usize = 5;
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.SEND_AMOUNT.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.SEND_AMOUNT.html
index c804fdd193..0b6a26bc95 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.SEND_AMOUNT.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.SEND_AMOUNT.html
@@ -1 +1 @@
-SEND_AMOUNT in example_wallet_esplora_async - Rust
    example_wallet_esplora_async
    Constant SEND_AMOUNT
    Source 
    pub(crate) const SEND_AMOUNT: Amount;
    
\ No newline at end of file
+SEND_AMOUNT in example_wallet_esplora_async - Rust
    example_wallet_esplora_async
    Constant SEND_AMOUNT
    Source 
    pub(crate) const SEND_AMOUNT: Amount;
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.STOP_GAP.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.STOP_GAP.html
index 7d95fb32f3..fa9c3dcbac 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.STOP_GAP.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.STOP_GAP.html
@@ -1 +1 @@
-STOP_GAP in example_wallet_esplora_async - Rust
    example_wallet_esplora_async
    Constant STOP_GAP
    Source 
    pub(crate) const STOP_GAP: usize = 5;
    
\ No newline at end of file
+STOP_GAP in example_wallet_esplora_async - Rust
    example_wallet_esplora_async
    Constant STOP_GAP
    Source 
    pub(crate) const STOP_GAP: usize = 5;
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/fn.main.html
index 6e90d7891e..0275ac0200 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/fn.main.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/fn.main.html
@@ -1 +1 @@
-main in example_wallet_esplora_async - Rust
    example_wallet_esplora_async
    Function main
    Source 
    pub(crate) fn main() -> Result<(), Error>
    
\ No newline at end of file
+main in example_wallet_esplora_async - Rust
    example_wallet_esplora_async
    Function main
    Source 
    pub(crate) fn main() -> Result<(), Error>
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/index.html
index d52c7a574e..816c99c175 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/index.html
@@ -1 +1 @@
-example_wallet_esplora_async - Rust
    Crate example_wallet_esplora_async
    Source 
    Constants§
    Functions§
    
\ No newline at end of file
+example_wallet_esplora_async - Rust
    Crate example_wallet_esplora_async
    Source 
    Constants§
    Functions§
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/all.html
index 489a9a4f94..72b092a187 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/all.html
@@ -1 +1 @@
-List of all items in this crate
    List of all items
    Functions
    Constants
    
\ No newline at end of file
+List of all items in this crate
    List of all items
    Functions
    Constants
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.DB_MAGIC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.DB_MAGIC.html
index 8a10f19952..8200e186c2 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.DB_MAGIC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.DB_MAGIC.html
@@ -1 +1 @@
-DB_MAGIC in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Constant DB_MAGIC
    Source 
    pub(crate) const DB_MAGIC: &str = "bdk_wallet_esplora_example";
    
\ No newline at end of file
+DB_MAGIC in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Constant DB_MAGIC
    Source 
    pub(crate) const DB_MAGIC: &str = "bdk_wallet_esplora_example";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.DB_PATH.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.DB_PATH.html
index 8205e94b36..3cf102f3b6 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.DB_PATH.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.DB_PATH.html
@@ -1 +1 @@
-DB_PATH in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Constant DB_PATH
    Source 
    pub(crate) const DB_PATH: &str = "bdk-example-esplora-blocking.db";
    
\ No newline at end of file
+DB_PATH in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Constant DB_PATH
    Source 
    pub(crate) const DB_PATH: &str = "bdk-example-esplora-blocking.db";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.ESPLORA_URL.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.ESPLORA_URL.html
index 3c7a6b4e54..b7e4f0ecb5 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.ESPLORA_URL.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.ESPLORA_URL.html
@@ -1 +1 @@
-ESPLORA_URL in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Constant ESPLORA_URL
    Source 
    pub(crate) const ESPLORA_URL: &str = "http://signet.bitcoindevkit.net";
    
\ No newline at end of file
+ESPLORA_URL in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Constant ESPLORA_URL
    Source 
    pub(crate) const ESPLORA_URL: &str = "http://signet.bitcoindevkit.net";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.EXTERNAL_DESC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.EXTERNAL_DESC.html
index b3a070d94b..dfb80f1164 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.EXTERNAL_DESC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.EXTERNAL_DESC.html
@@ -1 +1 @@
-EXTERNAL_DESC in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Constant EXTERNAL_DESC
    Source 
    pub(crate) const EXTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/0/*)";
    
\ No newline at end of file
+EXTERNAL_DESC in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Constant EXTERNAL_DESC
    Source 
    pub(crate) const EXTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/0/*)";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.INTERNAL_DESC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.INTERNAL_DESC.html
index 36c146f8a6..81af585ed4 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.INTERNAL_DESC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.INTERNAL_DESC.html
@@ -1 +1 @@
-INTERNAL_DESC in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Constant INTERNAL_DESC
    Source 
    pub(crate) const INTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/1/*)";
    
\ No newline at end of file
+INTERNAL_DESC in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Constant INTERNAL_DESC
    Source 
    pub(crate) const INTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/1/*)";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.NETWORK.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.NETWORK.html
index afbb011731..db2bacdcda 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.NETWORK.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.NETWORK.html
@@ -1 +1 @@
-NETWORK in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Constant NETWORK
    Source 
    pub(crate) const NETWORK: Network;
    
\ No newline at end of file
+NETWORK in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Constant NETWORK
    Source 
    pub(crate) const NETWORK: Network;
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.PARALLEL_REQUESTS.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.PARALLEL_REQUESTS.html
index ad2a729961..9b9222f5f7 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.PARALLEL_REQUESTS.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.PARALLEL_REQUESTS.html
@@ -1 +1 @@
-PARALLEL_REQUESTS in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Constant PARALLEL_REQUESTS
    Source 
    pub(crate) const PARALLEL_REQUESTS: usize = 5;
    
\ No newline at end of file
+PARALLEL_REQUESTS in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Constant PARALLEL_REQUESTS
    Source 
    pub(crate) const PARALLEL_REQUESTS: usize = 5;
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.SEND_AMOUNT.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.SEND_AMOUNT.html
index a2d22781b4..a31314a4df 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.SEND_AMOUNT.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.SEND_AMOUNT.html
@@ -1 +1 @@
-SEND_AMOUNT in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Constant SEND_AMOUNT
    Source 
    pub(crate) const SEND_AMOUNT: Amount;
    
\ No newline at end of file
+SEND_AMOUNT in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Constant SEND_AMOUNT
    Source 
    pub(crate) const SEND_AMOUNT: Amount;
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.STOP_GAP.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.STOP_GAP.html
index ab2837ea0f..25f73ccb86 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.STOP_GAP.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.STOP_GAP.html
@@ -1 +1 @@
-STOP_GAP in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Constant STOP_GAP
    Source 
    pub(crate) const STOP_GAP: usize = 5;
    
\ No newline at end of file
+STOP_GAP in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Constant STOP_GAP
    Source 
    pub(crate) const STOP_GAP: usize = 5;
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/fn.main.html
index 1cc45c34ed..2977d35859 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/fn.main.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/fn.main.html
@@ -1 +1 @@
-main in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Function main
    Source 
    pub(crate) fn main() -> Result<(), Error>
    
\ No newline at end of file
+main in example_wallet_esplora_blocking - Rust
    example_wallet_esplora_blocking
    Function main
    Source 
    pub(crate) fn main() -> Result<(), Error>
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/index.html
index 71cf554d68..b984cdb64f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/index.html
@@ -1 +1 @@
-example_wallet_esplora_blocking - Rust
    Crate example_wallet_esplora_blocking
    Source 
    Constants§
    Functions§
    
\ No newline at end of file
+example_wallet_esplora_blocking - Rust
    Crate example_wallet_esplora_blocking
    Source 
    Constants§
    Functions§
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/all.html
index db448bdeac..a5e0262886 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/all.html
@@ -1 +1 @@
-List of all items in this crate
    List of all items
    Structs
    Enums
    Functions
    Constants
    
\ No newline at end of file
+List of all items in this crate
    List of all items
    Structs
    Enums
    Functions
    Constants
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/constant.DB_MAGIC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/constant.DB_MAGIC.html
index 7a8171db4a..cc3b748cf1 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/constant.DB_MAGIC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/constant.DB_MAGIC.html
@@ -1 +1 @@
-DB_MAGIC in example_wallet_rpc - Rust
    example_wallet_rpc
    Constant DB_MAGIC
    Source 
    pub(crate) const DB_MAGIC: &str = "bdk-rpc-wallet-example";
    
\ No newline at end of file
+DB_MAGIC in example_wallet_rpc - Rust
    example_wallet_rpc
    Constant DB_MAGIC
    Source 
    pub(crate) const DB_MAGIC: &str = "bdk-rpc-wallet-example";
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/enum.Emission.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/enum.Emission.html
index 0dab86a1b2..8b2c504a6a 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/enum.Emission.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/enum.Emission.html
@@ -1,8 +1,8 @@
-Emission in example_wallet_rpc - Rust
    example_wallet_rpc
    Enum Emission
    Source 
    pub(crate) enum Emission {
+Emission in example_wallet_rpc - Rust
    example_wallet_rpc
    Enum Emission
    Source 
    pub(crate) enum Emission {
     SigTerm,
-    Block(BlockEvent<Block>),
+    Block(BlockEvent<Block>),
     Mempool(Vec<(Transaction, u64)>),
-}
    Variants§
    §
    SigTerm
    §
    Block(BlockEvent<Block>)
    §
    Mempool(Vec<(Transaction, u64)>)
    Trait Implementations§
    Source§
    impl Debug for Emission
    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
+}
    Variants§
    §
    SigTerm
    §
    Block(BlockEvent<Block>)
    §
    Mempool(Vec<(Transaction, u64)>)
    Trait Implementations§
    Source§
    impl Debug for Emission
    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/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/fn.main.html
index 6a2efa2b83..8bd92da444 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/fn.main.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/fn.main.html
@@ -1 +1 @@
-main in example_wallet_rpc - Rust
    example_wallet_rpc
    Function main
    Source 
    pub(crate) fn main() -> Result<()>
    
\ No newline at end of file
+main in example_wallet_rpc - Rust
    example_wallet_rpc
    Function main
    Source 
    pub(crate) fn main() -> Result<()>
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/index.html
index 6dab1e65c8..b11b25d9d4 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/index.html
@@ -1 +1 @@
-example_wallet_rpc - Rust
    Crate example_wallet_rpc
    Source 
    Structs§
    • Args
      Bitcoind RPC example using bdk_wallet::Wallet.
    Enums§
    Constants§
    Functions§
    
\ No newline at end of file
+example_wallet_rpc - Rust
    Crate example_wallet_rpc
    Source 
    Structs§
    • Args
      Bitcoind RPC example using bdk_wallet::Wallet.
    Enums§
    Constants§
    Functions§
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/struct.Args.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/struct.Args.html
index 0442582492..201779faf4 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/struct.Args.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/struct.Args.html
@@ -1,4 +1,4 @@
-Args in example_wallet_rpc - Rust
    example_wallet_rpc
    Struct Args
    Source 
    pub struct Args {
+Args in example_wallet_rpc - Rust
    example_wallet_rpc
    Struct Args
    Source 
    pub struct Args {
     pub descriptor: String,
     pub change_descriptor: String,
     pub start_height: u32,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/help.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/help.html
index b9637593b3..60b36f9c48 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/help.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/help.html
@@ -1 +1 @@
-Help
    Rustdoc help
    Back
    
\ No newline at end of file
+Help
    Rustdoc help
    Back
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/settings.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/settings.html
index d522e4e405..255cdb3666 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/settings.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/settings.html
@@ -1 +1 @@
-Settings
    Rustdoc settings
    Back
    
\ No newline at end of file
+Settings
    Rustdoc settings
    Back
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_bitcoind_rpc/lib.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_bitcoind_rpc/lib.rs.html
index 12e1a883bb..b12c5804ba 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_bitcoind_rpc/lib.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_bitcoind_rpc/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
    bdk_bitcoind_rpc/
    lib.rs
    +lib.rs - source
    bdk_bitcoind_rpc/
    lib.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/balance.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/balance.rs.html
index c8d1d93cd8..33a0d8eca8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/balance.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/balance.rs.html
@@ -1,4 +1,4 @@
-balance.rs - source
    bdk_chain/
    balance.rs
    +balance.rs - source
    bdk_chain/
    balance.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/canonical_iter.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/canonical_iter.rs.html
index 2ed4db88c2..0c890cdf76 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/canonical_iter.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/canonical_iter.rs.html
@@ -1,4 +1,4 @@
-canonical_iter.rs - source
    bdk_chain/
    canonical_iter.rs
    +canonical_iter.rs - source
    bdk_chain/
    canonical_iter.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/chain_data.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/chain_data.rs.html
index a7943c27cb..98f93f2fae 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/chain_data.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/chain_data.rs.html
@@ -1,4 +1,4 @@
-chain_data.rs - source
    bdk_chain/
    chain_data.rs
    +chain_data.rs - source
    bdk_chain/
    chain_data.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/chain_oracle.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/chain_oracle.rs.html
index d225b0d021..7a87aa9c03 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/chain_oracle.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/chain_oracle.rs.html
@@ -1,4 +1,4 @@
-chain_oracle.rs - source
    bdk_chain/
    chain_oracle.rs
    +chain_oracle.rs - source
    bdk_chain/
    chain_oracle.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/descriptor_ext.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/descriptor_ext.rs.html
index 4f3522f1cb..3c27a92018 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/descriptor_ext.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/descriptor_ext.rs.html
@@ -1,4 +1,4 @@
-descriptor_ext.rs - source
    bdk_chain/
    descriptor_ext.rs
    +descriptor_ext.rs - source
    bdk_chain/
    descriptor_ext.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/example_utils.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/example_utils.rs.html
index c0d8dda5fb..b97cb4d1ca 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/example_utils.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/example_utils.rs.html
@@ -1,4 +1,4 @@
-example_utils.rs - source
    bdk_chain/
    example_utils.rs
    +example_utils.rs - source
    bdk_chain/
    example_utils.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexed_tx_graph.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexed_tx_graph.rs.html
index 36a14e4a6a..b8bc3026c7 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexed_tx_graph.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexed_tx_graph.rs.html
@@ -1,4 +1,4 @@
-indexed_tx_graph.rs - source
    bdk_chain/
    indexed_tx_graph.rs
    +indexed_tx_graph.rs - source
    bdk_chain/
    indexed_tx_graph.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer.rs.html
index 05a1301ece..3b2cfcfb58 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer.rs.html
@@ -1,4 +1,4 @@
-indexer.rs - source
    bdk_chain/
    indexer.rs
    +indexer.rs - source
    bdk_chain/
    indexer.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer/keychain_txout.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer/keychain_txout.rs.html
index dfa916a817..a9c53151cb 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer/keychain_txout.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer/keychain_txout.rs.html
@@ -1,4 +1,4 @@
-keychain_txout.rs - source
    bdk_chain/indexer/
    keychain_txout.rs
    +keychain_txout.rs - source
    bdk_chain/indexer/
    keychain_txout.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer/spk_txout.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer/spk_txout.rs.html
index 6fbdd76b47..b3023179de 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer/spk_txout.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer/spk_txout.rs.html
@@ -1,4 +1,4 @@
-spk_txout.rs - source
    bdk_chain/indexer/
    spk_txout.rs
    +spk_txout.rs - source
    bdk_chain/indexer/
    spk_txout.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/lib.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/lib.rs.html
index 074485e2ed..4d4ae68675 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/lib.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
    bdk_chain/
    lib.rs
    +lib.rs - source
    bdk_chain/
    lib.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/local_chain.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/local_chain.rs.html
index c59dd7cdfc..ec242eb2c1 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/local_chain.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/local_chain.rs.html
@@ -1,4 +1,4 @@
-local_chain.rs - source
    bdk_chain/
    local_chain.rs
    +local_chain.rs - source
    bdk_chain/
    local_chain.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/rusqlite_impl.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/rusqlite_impl.rs.html
index 183bda015c..bf4251fe1a 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/rusqlite_impl.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/rusqlite_impl.rs.html
@@ -1,4 +1,4 @@
-rusqlite_impl.rs - source
    bdk_chain/
    rusqlite_impl.rs
    +rusqlite_impl.rs - source
    bdk_chain/
    rusqlite_impl.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/spk_iter.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/spk_iter.rs.html
index 2334336433..015b1eb75d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/spk_iter.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/spk_iter.rs.html
@@ -1,4 +1,4 @@
-spk_iter.rs - source
    bdk_chain/
    spk_iter.rs
    +spk_iter.rs - source
    bdk_chain/
    spk_iter.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_data_traits.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_data_traits.rs.html
index 5cd737c41a..08bc49d773 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_data_traits.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_data_traits.rs.html
@@ -1,4 +1,4 @@
-tx_data_traits.rs - source
    bdk_chain/
    tx_data_traits.rs
    +tx_data_traits.rs - source
    bdk_chain/
    tx_data_traits.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_graph.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_graph.rs.html
index e714b0843f..e8ef0122d8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_graph.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_graph.rs.html
@@ -1,4 +1,4 @@
-tx_graph.rs - source
    bdk_chain/
    tx_graph.rs
    +tx_graph.rs - source
    bdk_chain/
    tx_graph.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/block_id.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/block_id.rs.html
index 6ea949f796..9c63c11ee4 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/block_id.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/block_id.rs.html
@@ -1,4 +1,4 @@
-block_id.rs - source
    bdk_core/
    block_id.rs
    +block_id.rs - source
    bdk_core/
    block_id.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/checkpoint.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/checkpoint.rs.html
index 4c35c76afe..49f4162f3e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/checkpoint.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/checkpoint.rs.html
@@ -1,4 +1,4 @@
-checkpoint.rs - source
    bdk_core/
    checkpoint.rs
    +checkpoint.rs - source
    bdk_core/
    checkpoint.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/lib.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/lib.rs.html
index eb6c90df82..69d302608e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/lib.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
    bdk_core/
    lib.rs
    +lib.rs - source
    bdk_core/
    lib.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/merge.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/merge.rs.html
index 1afdee370a..946fea4274 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/merge.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/merge.rs.html
@@ -1,4 +1,4 @@
-merge.rs - source
    bdk_core/
    merge.rs
    +merge.rs - source
    bdk_core/
    merge.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/spk_client.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/spk_client.rs.html
index aca49c35cf..519b3aa4f2 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/spk_client.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/spk_client.rs.html
@@ -1,4 +1,4 @@
-spk_client.rs - source
    bdk_core/
    spk_client.rs
    +spk_client.rs - source
    bdk_core/
    spk_client.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/tx_update.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/tx_update.rs.html
index 6576572e3e..687f0be2c8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/tx_update.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/tx_update.rs.html
@@ -1,4 +1,4 @@
-tx_update.rs - source
    bdk_core/
    tx_update.rs
    +tx_update.rs - source
    bdk_core/
    tx_update.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_electrum/bdk_electrum_client.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_electrum/bdk_electrum_client.rs.html
index 4728c38c98..69ce364609 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_electrum/bdk_electrum_client.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_electrum/bdk_electrum_client.rs.html
@@ -1,4 +1,4 @@
-bdk_electrum_client.rs - source
    bdk_electrum/
    bdk_electrum_client.rs
    +bdk_electrum_client.rs - source
    bdk_electrum/
    bdk_electrum_client.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_electrum/lib.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_electrum/lib.rs.html
index 46363c6bb1..6b8447b42e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_electrum/lib.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_electrum/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
    bdk_electrum/
    lib.rs
    +lib.rs - source
    bdk_electrum/
    lib.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/async_ext.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/async_ext.rs.html
index 6d55681a95..de240fc38b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/async_ext.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/async_ext.rs.html
@@ -1,4 +1,4 @@
-async_ext.rs - source
    bdk_esplora/
    async_ext.rs
    +async_ext.rs - source
    bdk_esplora/
    async_ext.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/blocking_ext.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/blocking_ext.rs.html
index a20296df61..9056fab426 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/blocking_ext.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/blocking_ext.rs.html
@@ -1,4 +1,4 @@
-blocking_ext.rs - source
    bdk_esplora/
    blocking_ext.rs
    +blocking_ext.rs - source
    bdk_esplora/
    blocking_ext.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/lib.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/lib.rs.html
index db10901c5a..6ab3c95a4f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/lib.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
    bdk_esplora/
    lib.rs
    +lib.rs - source
    bdk_esplora/
    lib.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/entry_iter.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/entry_iter.rs.html
index 7ee170e8fd..b4af1f0703 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/entry_iter.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/entry_iter.rs.html
@@ -1,4 +1,4 @@
-entry_iter.rs - source
    bdk_file_store/
    entry_iter.rs
    +entry_iter.rs - source
    bdk_file_store/
    entry_iter.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/lib.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/lib.rs.html
index 181da98727..e2e09f5f38 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/lib.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
    bdk_file_store/
    lib.rs
    +lib.rs - source
    bdk_file_store/
    lib.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/store.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/store.rs.html
index e07128d1cd..16e26734ed 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/store.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/store.rs.html
@@ -1,4 +1,4 @@
-store.rs - source
    bdk_file_store/
    store.rs
    +store.rs - source
    bdk_file_store/
    store.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_testenv/lib.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_testenv/lib.rs.html
index f9246e71c9..4442e588a3 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_testenv/lib.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_testenv/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
    bdk_testenv/
    lib.rs
    +lib.rs - source
    bdk_testenv/
    lib.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_testenv/utils.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_testenv/utils.rs.html
index 06d4a3a499..1350e3008d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_testenv/utils.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_testenv/utils.rs.html
@@ -1,4 +1,4 @@
-utils.rs - source
    bdk_testenv/
    utils.rs
    +utils.rs - source
    bdk_testenv/
    utils.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/checksum.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/checksum.rs.html
index 8dffaa257b..346d8c3ccc 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/checksum.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/checksum.rs.html
@@ -1,4 +1,4 @@
-checksum.rs - source
    bdk_wallet/descriptor/
    checksum.rs
    +checksum.rs - source
    bdk_wallet/descriptor/
    checksum.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/dsl.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/dsl.rs.html
index be57df5c55..7d6e2cd54e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/dsl.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/dsl.rs.html
@@ -1,4 +1,4 @@
-dsl.rs - source
    bdk_wallet/descriptor/
    dsl.rs
    +dsl.rs - source
    bdk_wallet/descriptor/
    dsl.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/error.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/error.rs.html
index 719212f595..b989dc16b6 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/error.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/error.rs.html
@@ -1,4 +1,4 @@
-error.rs - source
    bdk_wallet/descriptor/
    error.rs
    +error.rs - source
    bdk_wallet/descriptor/
    error.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/mod.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/mod.rs.html
index 86ca24c256..82f92f5664 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/mod.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
    bdk_wallet/descriptor/
    mod.rs
    +mod.rs - source
    bdk_wallet/descriptor/
    mod.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/policy.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/policy.rs.html
index 5d52f9e5dc..ac3e62d1ba 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/policy.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/policy.rs.html
@@ -1,4 +1,4 @@
-policy.rs - source
    bdk_wallet/descriptor/
    policy.rs
    +policy.rs - source
    bdk_wallet/descriptor/
    policy.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/template.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/template.rs.html
index ebd8598938..a0e6d7fba1 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/template.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/template.rs.html
@@ -1,4 +1,4 @@
-template.rs - source
    bdk_wallet/descriptor/
    template.rs
    +template.rs - source
    bdk_wallet/descriptor/
    template.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/keys/mod.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/keys/mod.rs.html
index 17e7fb9430..ee6654a865 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/keys/mod.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/keys/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
    bdk_wallet/keys/
    mod.rs
    +mod.rs - source
    bdk_wallet/keys/
    mod.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/lib.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/lib.rs.html
index fabbc19801..c59f59da9b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/lib.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
    bdk_wallet/
    lib.rs
    +lib.rs - source
    bdk_wallet/
    lib.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/psbt/mod.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/psbt/mod.rs.html
index 10bb4805b4..c3995fbcbc 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/psbt/mod.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/psbt/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
    bdk_wallet/psbt/
    mod.rs
    +mod.rs - source
    bdk_wallet/psbt/
    mod.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/types.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/types.rs.html
index dc35b50521..da9d640509 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/types.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/types.rs.html
@@ -1,4 +1,4 @@
-types.rs - source
    bdk_wallet/
    types.rs
    +types.rs - source
    bdk_wallet/
    types.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/changeset.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/changeset.rs.html
index 96876f6ffb..4f538bee7e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/changeset.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/changeset.rs.html
@@ -1,4 +1,4 @@
-changeset.rs - source
    bdk_wallet/wallet/
    changeset.rs
    +changeset.rs - source
    bdk_wallet/wallet/
    changeset.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/coin_selection.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/coin_selection.rs.html
index 3c6fba3778..58799d2eff 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/coin_selection.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/coin_selection.rs.html
@@ -1,4 +1,4 @@
-coin_selection.rs - source
    bdk_wallet/wallet/
    coin_selection.rs
    +coin_selection.rs - source
    bdk_wallet/wallet/
    coin_selection.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/error.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/error.rs.html
index 14d334e8f0..fe61bf5b94 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/error.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/error.rs.html
@@ -1,4 +1,4 @@
-error.rs - source
    bdk_wallet/wallet/
    error.rs
    +error.rs - source
    bdk_wallet/wallet/
    error.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/export.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/export.rs.html
index e7615f40b2..50b12c2999 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/export.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/export.rs.html
@@ -1,4 +1,4 @@
-export.rs - source
    bdk_wallet/wallet/
    export.rs
    +export.rs - source
    bdk_wallet/wallet/
    export.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/mod.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/mod.rs.html
index 450c3ded8e..e778d1138e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/mod.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
    bdk_wallet/wallet/
    mod.rs
    +mod.rs - source
    bdk_wallet/wallet/
    mod.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/params.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/params.rs.html
index c9a5afe8ef..27fbf89a95 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/params.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/params.rs.html
@@ -1,4 +1,4 @@
-params.rs - source
    bdk_wallet/wallet/
    params.rs
    +params.rs - source
    bdk_wallet/wallet/
    params.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/persisted.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/persisted.rs.html
index 52fa188ef9..0fbb970b0b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/persisted.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/persisted.rs.html
@@ -1,4 +1,4 @@
-persisted.rs - source
    bdk_wallet/wallet/
    persisted.rs
    +persisted.rs - source
    bdk_wallet/wallet/
    persisted.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/signer.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/signer.rs.html
index f67452a97a..2890a8487e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/signer.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/signer.rs.html
@@ -1,4 +1,4 @@
-signer.rs - source
    bdk_wallet/wallet/
    signer.rs
    +signer.rs - source
    bdk_wallet/wallet/
    signer.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/tx_builder.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/tx_builder.rs.html
index 24eb974258..8bbeca24da 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/tx_builder.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/tx_builder.rs.html
@@ -1,4 +1,4 @@
-tx_builder.rs - source
    bdk_wallet/wallet/
    tx_builder.rs
    +tx_builder.rs - source
    bdk_wallet/wallet/
    tx_builder.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/utils.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/utils.rs.html
index c8bc335091..17200763ca 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/utils.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/utils.rs.html
@@ -1,4 +1,4 @@
-utils.rs - source
    bdk_wallet/wallet/
    utils.rs
    +utils.rs - source
    bdk_wallet/wallet/
    utils.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_bitcoind_rpc_polling/main.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_bitcoind_rpc_polling/main.rs.html
index 42d25a5d7e..f7ad65c0e4 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_bitcoind_rpc_polling/main.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_bitcoind_rpc_polling/main.rs.html
@@ -1,4 +1,4 @@
-main.rs - source
    example_bitcoind_rpc_polling/
    main.rs
    +main.rs - source
    example_bitcoind_rpc_polling/
    main.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_cli/lib.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_cli/lib.rs.html
index 1f788b113a..48d05a5f26 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_cli/lib.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_cli/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
    example_cli/
    lib.rs
    +lib.rs - source
    example_cli/
    lib.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_electrum/main.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_electrum/main.rs.html
index 9e64c9ea19..6c84ef647b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_electrum/main.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_electrum/main.rs.html
@@ -1,4 +1,4 @@
-main.rs - source
    example_electrum/
    main.rs
    +main.rs - source
    example_electrum/
    main.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_esplora/main.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_esplora/main.rs.html
index cf230069dd..2171715647 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_esplora/main.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_esplora/main.rs.html
@@ -1,4 +1,4 @@
-main.rs - source
    example_esplora/
    main.rs
    +main.rs - source
    example_esplora/
    main.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_electrum/main.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_electrum/main.rs.html
index ece77e91a3..aab9c71e82 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_electrum/main.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_electrum/main.rs.html
@@ -1,4 +1,4 @@
-main.rs - source
    example_wallet_electrum/
    main.rs
    +main.rs - source
    example_wallet_electrum/
    main.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_esplora_async/main.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_esplora_async/main.rs.html
index b1b7bd55b6..3e69010c54 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_esplora_async/main.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_esplora_async/main.rs.html
@@ -1,4 +1,4 @@
-main.rs - source
    example_wallet_esplora_async/
    main.rs
    +main.rs - source
    example_wallet_esplora_async/
    main.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_esplora_blocking/main.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_esplora_blocking/main.rs.html
index 8e4304ea8c..36aae961f3 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_esplora_blocking/main.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_esplora_blocking/main.rs.html
@@ -1,4 +1,4 @@
-main.rs - source
    example_wallet_esplora_blocking/
    main.rs
    +main.rs - source
    example_wallet_esplora_blocking/
    main.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_rpc/main.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_rpc/main.rs.html
index 8e443bcfcc..4e73d3d1af 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_rpc/main.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_rpc/main.rs.html
@@ -1,4 +1,4 @@
-main.rs - source
    example_wallet_rpc/
    main.rs
    +main.rs - source
    example_wallet_rpc/
    main.rs
     1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/static.files/rustdoc-46132b98.css b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/static.files/rustdoc-c579a84d.css
similarity index 94%
rename from docs/.vuepress/public/docs-rs/bdk/nightly/latest/static.files/rustdoc-46132b98.css
rename to docs/.vuepress/public/docs-rs/bdk/nightly/latest/static.files/rustdoc-c579a84d.css
index 2efac0bd7a..d37a61b417 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/static.files/rustdoc-46132b98.css
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/static.files/rustdoc-c579a84d.css
@@ -8,7 +8,7 @@ xmlns="http://www.w3.org/2000/svg" aria-label="Copy to clipboard">\
 ');--copy-path-height:34px;--copy-path-width:33px;--checkmark-image:url('data:image/svg+xml,\
 \
-');--button-left-margin:4px;--button-border-radius:2px;--toolbar-button-border-radius:6px;--code-block-border-radius:6px;--impl-items-indent:0.3em;--docblock-indent:24px;}@font-face {font-family:'Fira Sans';font-style:normal;font-weight:400;src:local('Fira Sans'),url("FiraSans-Regular-0fe48ade.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Fira Sans';font-style:normal;font-weight:500;src:local('Fira Sans Medium'),url("FiraSans-Medium-e1aa3f0a.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Source Serif 4';font-style:normal;font-weight:400;src:local('Source Serif 4'),url("SourceSerif4-Regular-6b053e98.ttf.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Source Serif 4';font-style:italic;font-weight:400;src:local('Source Serif 4 Italic'),url("SourceSerif4-It-ca3b17ed.ttf.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Source Serif 4';font-style:normal;font-weight:700;src:local('Source Serif 4 Bold'),url("SourceSerif4-Bold-6d4fd4c0.ttf.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Source Code Pro';font-style:normal;font-weight:400;src:url("SourceCodePro-Regular-8badfe75.ttf.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Source Code Pro';font-style:italic;font-weight:400;src:url("SourceCodePro-It-fc8b9304.ttf.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Source Code Pro';font-style:normal;font-weight:600;src:url("SourceCodePro-Semibold-aa29a496.ttf.woff2") format("woff2");font-display:swap;}@font-face {font-family:'NanumBarunGothic';src:url("NanumBarunGothic-13b3dcba.ttf.woff2") format("woff2");font-display:swap;unicode-range:U+AC00-D7AF,U+1100-11FF,U+3130-318F,U+A960-A97F,U+D7B0-D7FF;}*{box-sizing:border-box;}body{font:1rem/1.5 "Source Serif 4",NanumBarunGothic,serif;margin:0;position:relative;overflow-wrap:break-word;overflow-wrap:anywhere;font-feature-settings:"kern","liga";background-color:var(--main-background-color);color:var(--main-color);}h1{font-size:1.5rem;}h2{font-size:1.375rem;}h3{font-size:1.25rem;}h1,h2,h3,h4,h5,h6{font-weight:500;}h1,h2,h3,h4{margin:25px 0 15px 0;padding-bottom:6px;}.docblock h3,.docblock h4,h5,h6{margin:15px 0 5px 0;}.docblock>h2:first-child,.docblock>h3:first-child,.docblock>h4:first-child,.docblock>h5:first-child,.docblock>h6:first-child{margin-top:0;}.main-heading h1{margin:0;padding:0;grid-area:main-heading-h1;overflow-wrap:break-word;overflow-wrap:anywhere;}.main-heading{position:relative;display:grid;grid-template-areas:"main-heading-breadcrumbs main-heading-breadcrumbs" "main-heading-h1 main-heading-toolbar" "main-heading-sub-heading main-heading-toolbar";grid-template-columns:minmax(105px,1fr) minmax(0,max-content);grid-template-rows:minmax(25px,min-content) min-content min-content;padding-bottom:6px;margin-bottom:15px;}.rustdoc-breadcrumbs{grid-area:main-heading-breadcrumbs;line-height:1.25;display:flex;flex-wrap:wrap;align-items:end;padding-top:5px;}.rustdoc-breadcrumbs a{padding:4px 0;margin:-4px 0;z-index:1;}.content h2,.top-doc .docblock>h3,.top-doc .docblock>h4{border-bottom:1px solid var(--headings-border-bottom-color);}h1,h2{line-height:1.25;padding-top:3px;padding-bottom:9px;}h3.code-header{font-size:1.125rem;}h4.code-header{font-size:1rem;}.code-header{font-weight:600;margin:0;padding:0;white-space:pre-wrap;}.structfield,.sub-variant-field{margin:0.6em 0;}#crate-search,h1,h2,h3,h4,h5,h6,.sidebar,.mobile-topbar,.search-input,.search-results .result-name,.item-name>a,.out-of-band,.sub-heading,span.since,a.src,rustdoc-toolbar,summary.hideme,.scraped-example-list,.rustdoc-breadcrumbs,ul.all-items{font-family:"Fira Sans",Arial,NanumBarunGothic,sans-serif;}#toggle-all-docs,a.anchor,.section-header a,#src-sidebar a,.rust a,.sidebar h2 a,.sidebar h3 a,.mobile-topbar h2 a,h1 a,.search-results a,.search-results li,.stab,.result-name i{color:var(--main-color);}span.enum,a.enum,span.struct,a.struct,span.union,a.union,span.primitive,a.primitive,span.type,a.type,span.foreigntype,a.foreigntype{color:var(--type-link-color);}span.trait,a.trait,span.traitalias,a.traitalias{color:var(--trait-link-color);}span.associatedtype,a.associatedtype,span.constant,a.constant,span.static,a.static{color:var(--assoc-item-link-color);}span.fn,a.fn,span.method,a.method,span.tymethod,a.tymethod{color:var(--function-link-color);}span.attr,a.attr,span.derive,a.derive,span.macro,a.macro{color:var(--macro-link-color);}span.mod,a.mod{color:var(--mod-link-color);}span.keyword,a.keyword{color:var(--keyword-link-color);}a{color:var(--link-color);text-decoration:none;}ol,ul{padding-left:24px;}ul ul,ol ul,ul ol,ol ol{margin-bottom:.625em;}p,.docblock>.warning{margin:0 0 .75em 0;}p:last-child,.docblock>.warning:last-child{margin:0;}button{padding:1px 6px;cursor:pointer;}button#toggle-all-docs{padding:0;background:none;border:none;-webkit-appearance:none;opacity:1;}.rustdoc{display:flex;flex-direction:row;flex-wrap:nowrap;}main{position:relative;flex-grow:1;padding:10px 15px 40px 45px;min-width:0;}.src main{padding:15px;}.width-limiter{max-width:960px;margin-right:auto;}details:not(.toggle) summary{margin-bottom:.6em;}code,pre,.code-header,.type-signature{font-family:"Source Code Pro",monospace;}.docblock code,.docblock-short code{border-radius:3px;padding:0 0.125em;}.docblock pre code,.docblock-short pre code{padding:0;}pre{padding:14px;line-height:1.5;}pre.item-decl{overflow-x:auto;}.item-decl .type-contents-toggle{contain:initial;}.src .content pre{padding:20px;}.rustdoc.src .example-wrap .src-line-numbers{padding:20px 0 20px 4px;}img{max-width:100%;}.logo-container{line-height:0;display:block;}.rust-logo{filter:var(--rust-logo-filter);}.sidebar{font-size:0.875rem;flex:0 0 var(--desktop-sidebar-width);width:var(--desktop-sidebar-width);overflow-y:scroll;overscroll-behavior:contain;position:sticky;height:100vh;top:0;left:0;z-index:var(--desktop-sidebar-z-index);}.rustdoc.src .sidebar{flex-basis:50px;width:50px;border-right:1px solid;overflow-x:hidden;overflow-y:hidden;}.hide-sidebar .sidebar,.hide-sidebar .sidebar-resizer{display:none;}.sidebar-resizer{touch-action:none;width:9px;cursor:col-resize;z-index:calc(var(--desktop-sidebar-z-index) + 1);position:fixed;height:100%;left:calc(var(--desktop-sidebar-width) + 1px);}.rustdoc.src .sidebar-resizer{left:49px;}.src-sidebar-expanded .src .sidebar-resizer{left:var(--src-sidebar-width);}.sidebar-resizing{-moz-user-select:none;-webkit-user-select:none;-ms-user-select:none;user-select:none;}.sidebar-resizing*{cursor:col-resize !important;}.sidebar-resizing .sidebar{position:fixed;}.sidebar-resizing>body{padding-left:var(--resizing-sidebar-width);}.sidebar-resizer:hover,.sidebar-resizer:active,.sidebar-resizer:focus,.sidebar-resizer.active{width:10px;margin:0;left:var(--desktop-sidebar-width);border-left:solid 1px var(--sidebar-resizer-hover);}.src-sidebar-expanded .rustdoc.src .sidebar-resizer:hover,.src-sidebar-expanded .rustdoc.src .sidebar-resizer:active,.src-sidebar-expanded .rustdoc.src .sidebar-resizer:focus,.src-sidebar-expanded .rustdoc.src .sidebar-resizer.active{left:calc(var(--src-sidebar-width) - 1px);}@media (pointer:coarse){.sidebar-resizer{display:none !important;}}.sidebar-resizer.active{padding:0 140px;width:2px;margin-left:-140px;border-left:none;}.sidebar-resizer.active:before{border-left:solid 2px var(--sidebar-resizer-active);display:block;height:100%;content:"";}.sidebar,.mobile-topbar,.sidebar-menu-toggle,#src-sidebar{background-color:var(--sidebar-background-color);}.src .sidebar>*{visibility:hidden;}.src-sidebar-expanded .src .sidebar{overflow-y:auto;flex-basis:var(--src-sidebar-width);width:var(--src-sidebar-width);}.src-sidebar-expanded .src .sidebar>*{visibility:visible;}#all-types{margin-top:1em;}*{scrollbar-width:initial;scrollbar-color:var(--scrollbar-color);}.sidebar{scrollbar-width:thin;scrollbar-color:var(--scrollbar-color);}::-webkit-scrollbar{width:12px;}.sidebar::-webkit-scrollbar{width:8px;}::-webkit-scrollbar-track{-webkit-box-shadow:inset 0;background-color:var(--scrollbar-track-background-color);}.sidebar::-webkit-scrollbar-track{background-color:var(--scrollbar-track-background-color);}::-webkit-scrollbar-thumb,.sidebar::-webkit-scrollbar-thumb{background-color:var(--scrollbar-thumb-background-color);}.hidden{display:none !important;}.logo-container>img{height:48px;width:48px;}ul.block,.block li,.block ul{padding:0;margin:0;list-style:none;}.block ul a{padding-left:1rem;}.sidebar-elems a,.sidebar>h2 a{display:block;padding:0.25rem;margin-right:0.25rem;border-left:solid var(--sidebar-elems-left-padding) transparent;margin-left:calc(-0.25rem - var(--sidebar-elems-left-padding));background-clip:border-box;}.hide-toc #rustdoc-toc,.hide-toc .in-crate{display:none;}.hide-modnav #rustdoc-modnav{display:none;}.sidebar h2{text-wrap:balance;overflow-wrap:anywhere;padding:0;margin:0.7rem 0;}.sidebar h3{text-wrap:balance;overflow-wrap:anywhere;font-size:1.125rem;padding:0;margin:0;}.sidebar-elems,.sidebar>.version,.sidebar>h2{padding-left:var(--sidebar-elems-left-padding);}.sidebar a{color:var(--sidebar-link-color);}.sidebar .current,.sidebar .current a,.sidebar-crate a.logo-container:hover+h2 a,.sidebar a:hover:not(.logo-container){background-color:var(--sidebar-current-link-background-color);}.sidebar-elems .block{margin-bottom:2em;}.sidebar-elems .block li a{white-space:nowrap;text-overflow:ellipsis;overflow:hidden;}.sidebar-crate{display:flex;align-items:center;justify-content:center;margin:14px 32px 1rem;row-gap:10px;column-gap:32px;flex-wrap:wrap;}.sidebar-crate h2{flex-grow:1;margin:0 -8px;align-self:start;}.sidebar-crate .logo-container{margin:0 calc(-16px - var(--sidebar-elems-left-padding));padding:0 var(--sidebar-elems-left-padding);text-align:center;}.sidebar-crate .logo-container img{margin-top:-16px;border-top:solid 16px transparent;box-sizing:content-box;position:relative;background-clip:border-box;z-index:1;}.sidebar-crate h2 a{display:block;border-left:solid var(--sidebar-elems-left-padding) transparent;background-clip:border-box;margin:0 calc(-24px + 0.25rem) 0 calc(-0.2rem - var(--sidebar-elems-left-padding));padding:calc((16px - 0.57rem ) / 2 ) 0.25rem;padding-left:0.2rem;}.sidebar-crate h2 .version{display:block;font-weight:normal;font-size:1rem;overflow-wrap:break-word;}.sidebar-crate+.version{margin-top:-1rem;margin-bottom:1rem;}.mobile-topbar{display:none;}.rustdoc .example-wrap{display:flex;position:relative;margin-bottom:10px;}.rustdoc .example-wrap>pre,.rustdoc .scraped-example .src-line-numbers,.rustdoc .scraped-example .src-line-numbers>pre{border-radius:6px;}.rustdoc .example-wrap>.example-line-numbers,.rustdoc .scraped-example .src-line-numbers,.rustdoc .scraped-example .src-line-numbers>pre{border-top-right-radius:0;border-bottom-right-radius:0;}.rustdoc .example-wrap>.example-line-numbers+pre,.rustdoc .scraped-example .rust{border-top-left-radius:0;border-bottom-left-radius:0;}.rustdoc .scraped-example{position:relative;}.rustdoc .example-wrap:last-child{margin-bottom:0px;}.rustdoc .example-wrap pre{margin:0;flex-grow:1;}.scraped-example:not(.expanded) .example-wrap{max-height:calc(1.5em * 5 + 10px);}.more-scraped-examples .scraped-example:not(.expanded) .example-wrap{max-height:calc(1.5em * 10 + 10px);}.rustdoc:not(.src) .scraped-example:not(.expanded) .src-line-numbers,.rustdoc:not(.src) .scraped-example:not(.expanded) .src-line-numbers>pre,.rustdoc:not(.src) .scraped-example:not(.expanded) pre.rust{padding-bottom:0;overflow:auto hidden;}.rustdoc:not(.src) .scraped-example .src-line-numbers{padding-top:0;}.rustdoc:not(.src) .scraped-example.expanded .src-line-numbers{padding-bottom:0;}.rustdoc:not(.src) .example-wrap pre{overflow:auto;}.rustdoc .example-wrap pre.example-line-numbers,.rustdoc .example-wrap .src-line-numbers{min-width:fit-content;flex-grow:0;text-align:right;-webkit-user-select:none;user-select:none;padding:14px 8px;padding-right:2px;color:var(--src-line-numbers-span-color);}.rustdoc .scraped-example .example-wrap .src-line-numbers{padding:0;}.rustdoc .src-line-numbers pre{padding:14px 0;}.src-line-numbers a,.src-line-numbers span{color:var(--src-line-numbers-span-color);padding:0 8px;}.src-line-numbers :target{background-color:transparent;border-right:none;padding:0 8px;}.src-line-numbers .line-highlighted{background-color:var(--src-line-number-highlighted-background-color);}.search-loading{text-align:center;}.docblock-short{overflow-wrap:break-word;overflow-wrap:anywhere;}.docblock :not(pre)>code,.docblock-short code{white-space:pre-wrap;}.top-doc .docblock h2{font-size:1.375rem;}.top-doc .docblock h3{font-size:1.25rem;}.top-doc .docblock h4,.top-doc .docblock h5{font-size:1.125rem;}.top-doc .docblock h6{font-size:1rem;}.docblock h5{font-size:1rem;}.docblock h6{font-size:0.875rem;}.docblock{margin-left:var(--docblock-indent);position:relative;}.docblock>:not(.more-examples-toggle):not(.example-wrap){max-width:100%;overflow-x:auto;}.sub-heading{font-size:1rem;flex-grow:0;grid-area:main-heading-sub-heading;line-height:1.25;padding-bottom:4px;}.main-heading rustdoc-toolbar,.main-heading .out-of-band{grid-area:main-heading-toolbar;}rustdoc-toolbar{display:flex;flex-direction:row;flex-wrap:nowrap;min-height:60px;}.docblock code,.docblock-short code,pre,.rustdoc.src .example-wrap,.example-wrap .src-line-numbers{background-color:var(--code-block-background-color);border-radius:var(--code-block-border-radius);}#main-content{position:relative;}.docblock table{margin:.5em 0;border-collapse:collapse;}.docblock table td,.docblock table th{padding:.5em;border:1px solid var(--border-color);}.docblock table tbody tr:nth-child(2n){background:var(--table-alt-row-background-color);}.docblock .stab,.docblock-short .stab,.docblock p code{display:inline-block;}.docblock li{margin-bottom:.4em;}.docblock li p:not(:last-child){margin-bottom:.3em;}div.where{white-space:pre-wrap;font-size:0.875rem;}.item-info{display:block;margin-left:var(--docblock-indent);}.impl-items>.item-info{margin-left:calc(var(--docblock-indent) + var(--impl-items-indent));}.item-info code{font-size:0.875rem;}#main-content>.item-info{margin-left:0;}nav.sub{flex-grow:1;flex-flow:row nowrap;margin:4px 0 0 0;display:flex;align-items:center;}.search-form{position:relative;display:flex;height:34px;flex-grow:1;margin-bottom:4px;}.src nav.sub{margin:0 0 -10px 0;}.section-header{display:block;position:relative;}.section-header:hover>.anchor,.impl:hover>.anchor,.trait-impl:hover>.anchor,.variant:hover>.anchor{display:initial;}.anchor{display:none;position:absolute;left:-0.5em;background:none !important;}.anchor.field{left:-5px;}.section-header>.anchor{left:-15px;padding-right:8px;}h2.section-header>.anchor{padding-right:6px;}a.doc-anchor{color:var(--main-color);display:none;position:absolute;left:-17px;padding-right:10px;padding-left:3px;}*:hover>.doc-anchor{display:block;}.top-doc>.docblock>*:first-child>.doc-anchor{display:none !important;}.main-heading a:hover,.example-wrap .rust a:hover,.all-items a:hover,.docblock a:not(.scrape-help):not(.tooltip):hover:not(.doc-anchor),.docblock-short a:not(.scrape-help):not(.tooltip):hover,.item-info a{text-decoration:underline;}.crate.block li.current a{font-weight:500;}table,.item-table{overflow-wrap:break-word;}.item-table{display:table;padding:0;margin:0;width:100%;}.item-table>li{display:table-row;}.item-table>li>div{display:table-cell;}.item-table>li>.item-name{padding-right:1.25rem;}.search-results-title{margin-top:0;white-space:nowrap;display:flex;align-items:baseline;}.search-results-title+.sub-heading{color:var(--main-color);display:flex;align-items:baseline;white-space:nowrap;}#crate-search-div{position:relative;min-width:0;}#crate-search{padding:0 23px 0 4px;max-width:100%;text-overflow:ellipsis;border:1px solid var(--border-color);border-radius:4px;outline:none;cursor:pointer;-moz-appearance:none;-webkit-appearance:none;text-indent:0.01px;background-color:var(--main-background-color);color:inherit;line-height:1.5;font-weight:500;}#crate-search:hover,#crate-search:focus{border-color:var(--crate-search-hover-border);}#crate-search-div::after{pointer-events:none;width:100%;height:100%;position:absolute;top:0;left:0;content:"";background-repeat:no-repeat;background-size:20px;background-position:calc(100% - 2px) 56%;background-image:url('data:image/svg+xml,');--button-left-margin:4px;--button-border-radius:2px;--toolbar-button-border-radius:6px;--code-block-border-radius:6px;--impl-items-indent:0.3em;--docblock-indent:24px;}@font-face {font-family:'Fira Sans';font-style:normal;font-weight:400;src:local('Fira Sans'),url("FiraSans-Regular-0fe48ade.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Fira Sans';font-style:normal;font-weight:500;src:local('Fira Sans Medium'),url("FiraSans-Medium-e1aa3f0a.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Source Serif 4';font-style:normal;font-weight:400;src:local('Source Serif 4'),url("SourceSerif4-Regular-6b053e98.ttf.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Source Serif 4';font-style:italic;font-weight:400;src:local('Source Serif 4 Italic'),url("SourceSerif4-It-ca3b17ed.ttf.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Source Serif 4';font-style:normal;font-weight:700;src:local('Source Serif 4 Bold'),url("SourceSerif4-Bold-6d4fd4c0.ttf.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Source Code Pro';font-style:normal;font-weight:400;src:url("SourceCodePro-Regular-8badfe75.ttf.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Source Code Pro';font-style:italic;font-weight:400;src:url("SourceCodePro-It-fc8b9304.ttf.woff2") format("woff2");font-display:swap;}@font-face {font-family:'Source Code Pro';font-style:normal;font-weight:600;src:url("SourceCodePro-Semibold-aa29a496.ttf.woff2") format("woff2");font-display:swap;}@font-face {font-family:'NanumBarunGothic';src:url("NanumBarunGothic-13b3dcba.ttf.woff2") format("woff2");font-display:swap;unicode-range:U+AC00-D7AF,U+1100-11FF,U+3130-318F,U+A960-A97F,U+D7B0-D7FF;}*{box-sizing:border-box;}body{font:1rem/1.5 "Source Serif 4",NanumBarunGothic,serif;margin:0;position:relative;overflow-wrap:break-word;overflow-wrap:anywhere;font-feature-settings:"kern","liga";background-color:var(--main-background-color);color:var(--main-color);}h1{font-size:1.5rem;}h2{font-size:1.375rem;}h3{font-size:1.25rem;}h1,h2,h3,h4,h5,h6{font-weight:500;}h1,h2,h3,h4{margin:25px 0 15px 0;padding-bottom:6px;}.docblock h3,.docblock h4,h5,h6{margin:15px 0 5px 0;}.docblock>h2:first-child,.docblock>h3:first-child,.docblock>h4:first-child,.docblock>h5:first-child,.docblock>h6:first-child{margin-top:0;}.main-heading h1{margin:0;padding:0;grid-area:main-heading-h1;overflow-wrap:break-word;overflow-wrap:anywhere;}.main-heading{position:relative;display:grid;grid-template-areas:"main-heading-breadcrumbs main-heading-breadcrumbs" "main-heading-h1 main-heading-toolbar" "main-heading-sub-heading main-heading-toolbar";grid-template-columns:minmax(105px,1fr) minmax(0,max-content);grid-template-rows:minmax(25px,min-content) min-content min-content;padding-bottom:6px;margin-bottom:15px;}.rustdoc-breadcrumbs{grid-area:main-heading-breadcrumbs;line-height:1.25;display:flex;flex-wrap:wrap;align-items:end;padding-top:5px;}.rustdoc-breadcrumbs a{padding:4px 0;margin:-4px 0;z-index:1;}.content h2,.top-doc .docblock>h3,.top-doc .docblock>h4{border-bottom:1px solid var(--headings-border-bottom-color);}h1,h2{line-height:1.25;padding-top:3px;padding-bottom:9px;}h3.code-header{font-size:1.125rem;}h4.code-header{font-size:1rem;}.code-header{font-weight:600;margin:0;padding:0;white-space:pre-wrap;}.structfield,.sub-variant-field{margin:0.6em 0;}#crate-search,h1,h2,h3,h4,h5,h6,.sidebar,.mobile-topbar,.search-input,.search-results .result-name,.item-name>a,.out-of-band,.sub-heading,span.since,a.src,rustdoc-toolbar,summary.hideme,.scraped-example-list,.rustdoc-breadcrumbs,ul.all-items{font-family:"Fira Sans",Arial,NanumBarunGothic,sans-serif;}#toggle-all-docs,a.anchor,.section-header a,#src-sidebar a,.rust a,.sidebar h2 a,.sidebar h3 a,.mobile-topbar h2 a,h1 a,.search-results a,.search-results li,.stab,.result-name i{color:var(--main-color);}span.enum,a.enum,span.struct,a.struct,span.union,a.union,span.primitive,a.primitive,span.type,a.type,span.foreigntype,a.foreigntype{color:var(--type-link-color);}span.trait,a.trait,span.traitalias,a.traitalias{color:var(--trait-link-color);}span.associatedtype,a.associatedtype,span.constant,a.constant,span.static,a.static{color:var(--assoc-item-link-color);}span.fn,a.fn,span.method,a.method,span.tymethod,a.tymethod{color:var(--function-link-color);}span.attr,a.attr,span.derive,a.derive,span.macro,a.macro{color:var(--macro-link-color);}span.mod,a.mod{color:var(--mod-link-color);}span.keyword,a.keyword{color:var(--keyword-link-color);}a{color:var(--link-color);text-decoration:none;}ol,ul{padding-left:24px;}ul ul,ol ul,ul ol,ol ol{margin-bottom:.625em;}p,.docblock>.warning{margin:0 0 .75em 0;}p:last-child,.docblock>.warning:last-child{margin:0;}button{padding:1px 6px;cursor:pointer;}button#toggle-all-docs{padding:0;background:none;border:none;-webkit-appearance:none;opacity:1;}.rustdoc{display:flex;flex-direction:row;flex-wrap:nowrap;}main{position:relative;flex-grow:1;padding:10px 15px 40px 45px;min-width:0;}.src main{padding:15px;}.width-limiter{max-width:960px;margin-right:auto;}details:not(.toggle) summary{margin-bottom:.6em;}code,pre,.code-header,.type-signature{font-family:"Source Code Pro",monospace;}.docblock code,.docblock-short code{border-radius:3px;padding:0 0.125em;}.docblock pre code,.docblock-short pre code{padding:0;}pre{padding:14px;line-height:1.5;}pre.item-decl{overflow-x:auto;}.item-decl .type-contents-toggle{contain:initial;}.src .content pre{padding:20px;}.rustdoc.src .example-wrap .src-line-numbers{padding:20px 0 20px 4px;}img{max-width:100%;}.logo-container{line-height:0;display:block;}.rust-logo{filter:var(--rust-logo-filter);}.sidebar{font-size:0.875rem;flex:0 0 var(--desktop-sidebar-width);width:var(--desktop-sidebar-width);overflow-y:scroll;overscroll-behavior:contain;position:sticky;height:100vh;top:0;left:0;z-index:var(--desktop-sidebar-z-index);}.rustdoc.src .sidebar{flex-basis:50px;width:50px;border-right:1px solid;overflow-x:hidden;overflow-y:hidden;}.hide-sidebar .sidebar,.hide-sidebar .sidebar-resizer{display:none;}.sidebar-resizer{touch-action:none;width:9px;cursor:col-resize;z-index:calc(var(--desktop-sidebar-z-index) + 1);position:fixed;height:100%;left:calc(var(--desktop-sidebar-width) + 1px);}.rustdoc.src .sidebar-resizer{left:49px;}.src-sidebar-expanded .src .sidebar-resizer{left:var(--src-sidebar-width);}.sidebar-resizing{-moz-user-select:none;-webkit-user-select:none;-ms-user-select:none;user-select:none;}.sidebar-resizing*{cursor:col-resize !important;}.sidebar-resizing .sidebar{position:fixed;}.sidebar-resizing>body{padding-left:var(--resizing-sidebar-width);}.sidebar-resizer:hover,.sidebar-resizer:active,.sidebar-resizer:focus,.sidebar-resizer.active{width:10px;margin:0;left:var(--desktop-sidebar-width);border-left:solid 1px var(--sidebar-resizer-hover);}.src-sidebar-expanded .rustdoc.src .sidebar-resizer:hover,.src-sidebar-expanded .rustdoc.src .sidebar-resizer:active,.src-sidebar-expanded .rustdoc.src .sidebar-resizer:focus,.src-sidebar-expanded .rustdoc.src .sidebar-resizer.active{left:calc(var(--src-sidebar-width) - 1px);}@media (pointer:coarse){.sidebar-resizer{display:none !important;}}.sidebar-resizer.active{padding:0 140px;width:2px;margin-left:-140px;border-left:none;}.sidebar-resizer.active:before{border-left:solid 2px var(--sidebar-resizer-active);display:block;height:100%;content:"";}.sidebar,.mobile-topbar,.sidebar-menu-toggle,#src-sidebar{background-color:var(--sidebar-background-color);}.src .sidebar>*{visibility:hidden;}.src-sidebar-expanded .src .sidebar{overflow-y:auto;flex-basis:var(--src-sidebar-width);width:var(--src-sidebar-width);}.src-sidebar-expanded .src .sidebar>*{visibility:visible;}#all-types{margin-top:1em;}*{scrollbar-width:initial;scrollbar-color:var(--scrollbar-color);}.sidebar{scrollbar-width:thin;scrollbar-color:var(--scrollbar-color);}::-webkit-scrollbar{width:12px;}.sidebar::-webkit-scrollbar{width:8px;}::-webkit-scrollbar-track{-webkit-box-shadow:inset 0;background-color:var(--scrollbar-track-background-color);}.sidebar::-webkit-scrollbar-track{background-color:var(--scrollbar-track-background-color);}::-webkit-scrollbar-thumb,.sidebar::-webkit-scrollbar-thumb{background-color:var(--scrollbar-thumb-background-color);}.hidden{display:none !important;}.logo-container>img{height:48px;width:48px;}ul.block,.block li,.block ul{padding:0;margin:0;list-style:none;}.block ul a{padding-left:1rem;}.sidebar-elems a,.sidebar>h2 a{display:block;padding:0.25rem;margin-right:0.25rem;border-left:solid var(--sidebar-elems-left-padding) transparent;margin-left:calc(-0.25rem - var(--sidebar-elems-left-padding));background-clip:border-box;}.hide-toc #rustdoc-toc,.hide-toc .in-crate{display:none;}.hide-modnav #rustdoc-modnav{display:none;}.sidebar h2{text-wrap:balance;overflow-wrap:anywhere;padding:0;margin:0.7rem 0;}.sidebar h3{text-wrap:balance;overflow-wrap:anywhere;font-size:1.125rem;padding:0;margin:0;}.sidebar-elems,.sidebar>.version,.sidebar>h2{padding-left:var(--sidebar-elems-left-padding);}.sidebar a{color:var(--sidebar-link-color);}.sidebar .current,.sidebar .current a,.sidebar-crate a.logo-container:hover+h2 a,.sidebar a:hover:not(.logo-container){background-color:var(--sidebar-current-link-background-color);}.sidebar-elems .block{margin-bottom:2em;}.sidebar-elems .block li a{white-space:nowrap;text-overflow:ellipsis;overflow:hidden;}.sidebar-crate{display:flex;align-items:center;justify-content:center;margin:14px 32px 1rem;row-gap:10px;column-gap:32px;flex-wrap:wrap;}.sidebar-crate h2{flex-grow:1;margin:0 -8px;align-self:start;}.sidebar-crate .logo-container{margin:0 calc(-16px - var(--sidebar-elems-left-padding));padding:0 var(--sidebar-elems-left-padding);text-align:center;}.sidebar-crate .logo-container img{margin-top:-16px;border-top:solid 16px transparent;box-sizing:content-box;position:relative;background-clip:border-box;z-index:1;}.sidebar-crate h2 a{display:block;border-left:solid var(--sidebar-elems-left-padding) transparent;background-clip:border-box;margin:0 calc(-24px + 0.25rem) 0 calc(-0.2rem - var(--sidebar-elems-left-padding));padding:calc((16px - 0.57rem ) / 2 ) 0.25rem;padding-left:0.2rem;}.sidebar-crate h2 .version{display:block;font-weight:normal;font-size:1rem;overflow-wrap:break-word;}.sidebar-crate+.version{margin-top:-1rem;margin-bottom:1rem;}.mobile-topbar{display:none;}.rustdoc .example-wrap{display:flex;position:relative;margin-bottom:10px;}.rustdoc .example-wrap>pre,.rustdoc .scraped-example .src-line-numbers,.rustdoc .scraped-example .src-line-numbers>pre{border-radius:6px;}.rustdoc .example-wrap>.example-line-numbers,.rustdoc .scraped-example .src-line-numbers,.rustdoc .scraped-example .src-line-numbers>pre{border-top-right-radius:0;border-bottom-right-radius:0;}.rustdoc .example-wrap>.example-line-numbers+pre,.rustdoc .scraped-example .rust{border-top-left-radius:0;border-bottom-left-radius:0;}.rustdoc .scraped-example{position:relative;}.rustdoc .example-wrap:last-child{margin-bottom:0px;}.rustdoc .example-wrap pre{margin:0;flex-grow:1;}.scraped-example:not(.expanded) .example-wrap{max-height:calc(1.5em * 5 + 10px);}.more-scraped-examples .scraped-example:not(.expanded) .example-wrap{max-height:calc(1.5em * 10 + 10px);}.rustdoc:not(.src) .scraped-example:not(.expanded) .src-line-numbers,.rustdoc:not(.src) .scraped-example:not(.expanded) .src-line-numbers>pre,.rustdoc:not(.src) .scraped-example:not(.expanded) pre.rust{padding-bottom:0;overflow:auto hidden;}.rustdoc:not(.src) .scraped-example .src-line-numbers{padding-top:0;}.rustdoc:not(.src) .scraped-example.expanded .src-line-numbers{padding-bottom:0;}.rustdoc:not(.src) .example-wrap pre{overflow:auto;}.rustdoc .example-wrap pre.example-line-numbers,.rustdoc .example-wrap .src-line-numbers{min-width:fit-content;flex-grow:0;text-align:right;-webkit-user-select:none;user-select:none;padding:14px 8px;padding-right:2px;color:var(--src-line-numbers-span-color);}.rustdoc .scraped-example .example-wrap .src-line-numbers{padding:0;}.rustdoc .src-line-numbers pre{padding:14px 0;}.src-line-numbers a,.src-line-numbers span{color:var(--src-line-numbers-span-color);padding:0 8px;}.src-line-numbers :target{background-color:transparent;border-right:none;padding:0 8px;}.src-line-numbers .line-highlighted{background-color:var(--src-line-number-highlighted-background-color);}.search-loading{text-align:center;}.docblock-short{overflow-wrap:break-word;overflow-wrap:anywhere;}.docblock :not(pre)>code,.docblock-short code{white-space:pre-wrap;}.top-doc .docblock h2{font-size:1.375rem;}.top-doc .docblock h3{font-size:1.25rem;}.top-doc .docblock h4,.top-doc .docblock h5{font-size:1.125rem;}.top-doc .docblock h6{font-size:1rem;}.docblock h5{font-size:1rem;}.docblock h6{font-size:0.875rem;}.docblock{margin-left:var(--docblock-indent);position:relative;}.docblock>:not(.more-examples-toggle):not(.example-wrap){max-width:100%;overflow-x:auto;}.sub-heading{font-size:1rem;flex-grow:0;grid-area:main-heading-sub-heading;line-height:1.25;padding-bottom:4px;}.main-heading rustdoc-toolbar,.main-heading .out-of-band{grid-area:main-heading-toolbar;}rustdoc-toolbar{display:flex;flex-direction:row;flex-wrap:nowrap;min-height:60px;}.docblock code,.docblock-short code,pre,.rustdoc.src .example-wrap,.example-wrap .src-line-numbers{background-color:var(--code-block-background-color);border-radius:var(--code-block-border-radius);text-decoration:inherit;}#main-content{position:relative;}.docblock table{margin:.5em 0;border-collapse:collapse;}.docblock table td,.docblock table th{padding:.5em;border:1px solid var(--border-color);}.docblock table tbody tr:nth-child(2n){background:var(--table-alt-row-background-color);}.docblock .stab,.docblock-short .stab,.docblock p code{display:inline-block;}.docblock li{margin-bottom:.4em;}.docblock li p:not(:last-child){margin-bottom:.3em;}div.where{white-space:pre-wrap;font-size:0.875rem;}.item-info{display:block;margin-left:var(--docblock-indent);}.impl-items>.item-info{margin-left:calc(var(--docblock-indent) + var(--impl-items-indent));}.item-info code{font-size:0.875rem;}#main-content>.item-info{margin-left:0;}nav.sub{flex-grow:1;flex-flow:row nowrap;margin:4px 0 0 0;display:flex;align-items:center;}.search-form{position:relative;display:flex;height:34px;flex-grow:1;margin-bottom:4px;}.src nav.sub{margin:0 0 -10px 0;}.section-header{display:block;position:relative;}.section-header:hover>.anchor,.impl:hover>.anchor,.trait-impl:hover>.anchor,.variant:hover>.anchor{display:initial;}.anchor{display:none;position:absolute;left:-0.5em;background:none !important;}.anchor.field{left:-5px;}.section-header>.anchor{left:-15px;padding-right:8px;}h2.section-header>.anchor{padding-right:6px;}a.doc-anchor{color:var(--main-color);display:none;position:absolute;left:-17px;padding-right:10px;padding-left:3px;}*:hover>.doc-anchor{display:block;}.top-doc>.docblock>*:first-child>.doc-anchor{display:none !important;}.main-heading a:hover,.example-wrap .rust a:hover,.all-items a:hover,.docblock a:not(.scrape-help):not(.tooltip):hover:not(.doc-anchor),.docblock-short a:not(.scrape-help):not(.tooltip):hover,.item-info a{text-decoration:underline;}.crate.block li.current a{font-weight:500;}table,.item-table{overflow-wrap:break-word;}.item-table{display:table;padding:0;margin:0;width:100%;}.item-table>li{display:table-row;}.item-table>li>div{display:table-cell;}.item-table>li>.item-name{padding-right:1.25rem;}.search-results-title{margin-top:0;white-space:nowrap;display:flex;align-items:baseline;}.search-results-title+.sub-heading{color:var(--main-color);display:flex;align-items:baseline;white-space:nowrap;}#crate-search-div{position:relative;min-width:0;}#crate-search{padding:0 23px 0 4px;max-width:100%;text-overflow:ellipsis;border:1px solid var(--border-color);border-radius:4px;outline:none;cursor:pointer;-moz-appearance:none;-webkit-appearance:none;text-indent:0.01px;background-color:var(--main-background-color);color:inherit;line-height:1.5;font-weight:500;}#crate-search:hover,#crate-search:focus{border-color:var(--crate-search-hover-border);}#crate-search-div::after{pointer-events:none;width:100%;height:100%;position:absolute;top:0;left:0;content:"";background-repeat:no-repeat;background-size:20px;background-position:calc(100% - 2px) 56%;background-image:url('data:image/svg+xml, \
 	');filter:var(--crate-search-div-filter);}#crate-search-div:hover::after,#crate-search-div:focus-within::after{filter:var(--crate-search-div-hover-filter);}#crate-search>option{font-size:1rem;}.search-input{-webkit-appearance:none;outline:none;border:1px solid var(--border-color);border-radius:2px;padding:8px;font-size:1rem;flex-grow:1;background-color:var(--button-background-color);color:var(--search-color);}.search-input:focus{border-color:var(--search-input-focused-border-color);}.search-results{display:none;}.search-results.active{display:block;margin:0;padding:0;}.search-results>a{display:grid;grid-template-areas:"search-result-name search-result-desc" "search-result-type-signature search-result-type-signature";grid-template-columns:.6fr .4fr;margin-left:2px;margin-right:2px;border-bottom:1px solid var(--search-result-border-color);column-gap:1em;}.search-results>a>div.desc{white-space:nowrap;text-overflow:ellipsis;overflow:hidden;grid-area:search-result-desc;}.search-results a:hover,.search-results a:focus{background-color:var(--search-result-link-focus-background-color);}.search-results .result-name{display:flex;align-items:center;justify-content:start;grid-area:search-result-name;}.search-results .result-name .alias{color:var(--search-results-alias-color);}.search-results .result-name .grey{color:var(--search-results-grey-color);}.search-results .result-name .typename{color:var(--search-results-grey-color);font-size:0.875rem;width:var(--search-typename-width);}.search-results .result-name .path{word-break:break-all;max-width:calc(100% - var(--search-typename-width));display:inline-block;}.search-results .result-name .path>*{display:inline;}.search-results .type-signature{grid-area:search-result-type-signature;white-space:pre-wrap;}.popover{position:absolute;top:100%;right:0;z-index:calc(var(--desktop-sidebar-z-index) + 1);margin-top:7px;border-radius:3px;border:1px solid var(--border-color);background-color:var(--main-background-color);color:var(--main-color);--popover-arrow-offset:11px;}.popover::before{content:'';position:absolute;right:var(--popover-arrow-offset);border:solid var(--border-color);border-width:1px 1px 0 0;background-color:var(--main-background-color);padding:4px;transform:rotate(-45deg);top:-5px;}.setting-line{margin:1.2em 0.6em;}.setting-radio input,.setting-check input{margin-right:0.3em;height:1.2rem;width:1.2rem;border:2px solid var(--settings-input-border-color);outline:none;-webkit-appearance:none;cursor:pointer;}.setting-radio input{border-radius:50%;}.setting-radio span,.setting-check span{padding-bottom:1px;}.setting-radio{margin-top:0.1em;margin-bottom:0.1em;min-width:3.8em;padding:0.3em;display:inline-flex;align-items:center;cursor:pointer;}.setting-radio+.setting-radio{margin-left:0.5em;}.setting-check{margin-right:20px;display:flex;align-items:center;cursor:pointer;}.setting-radio input:checked{box-shadow:inset 0 0 0 3px var(--main-background-color);background-color:var(--settings-input-color);}.setting-check input:checked{background-color:var(--settings-input-color);border-width:1px;content:url('data:image/svg+xml,\
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/static.files/search-75f5ac3e.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/static.files/search-1429c0ba.js
similarity index 71%
rename from docs/.vuepress/public/docs-rs/bdk/nightly/latest/static.files/search-75f5ac3e.js
rename to docs/.vuepress/public/docs-rs/bdk/nightly/latest/static.files/search-1429c0ba.js
index cf59d77973..df69c818f3 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/static.files/search-75f5ac3e.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/static.files/search-1429c0ba.js
@@ -1,4 +1,4 @@
-"use strict";if(!Array.prototype.toSpliced){Array.prototype.toSpliced=function(){const me=this.slice();Array.prototype.splice.apply(me,arguments);return me}}function onEachBtwn(arr,func,funcBtwn){let skipped=true;for(const value of arr){if(!skipped){funcBtwn(value)}skipped=func(value)}}const itemTypes=["keyword","primitive","mod","externcrate","import","struct","enum","fn","type","static","trait","impl","tymethod","method","structfield","variant","macro","associatedtype","constant","associatedconstant","union","foreigntype","existential","attr","derive","traitalias","generic",];const TY_PRIMITIVE=itemTypes.indexOf("primitive");const TY_GENERIC=itemTypes.indexOf("generic");const TY_IMPORT=itemTypes.indexOf("import");const TY_TRAIT=itemTypes.indexOf("trait");const ROOT_PATH=typeof window!=="undefined"?window.rootPath:"../";const UNBOXING_LIMIT=5;const REGEX_IDENT=/\p{ID_Start}\p{ID_Continue}*|_\p{ID_Continue}+/uy;const REGEX_INVALID_TYPE_FILTER=/[^a-z]/ui;const MAX_RESULTS=200;const NO_TYPE_FILTER=-1;const editDistanceState={current:[],prev:[],prevPrev:[],calculate:function calculate(a,b,limit){if(a.lengthlimit){return limit+1}while(b.length>0&&b[0]===a[0]){a=a.substring(1);b=b.substring(1)}while(b.length>0&&b[b.length-1]===a[a.length-1]){a=a.substring(0,a.length-1);b=b.substring(0,b.length-1)}if(b.length===0){return minDist}const aLength=a.length;const bLength=b.length;for(let i=0;i<=bLength;++i){this.current[i]=0;this.prev[i]=i;this.prevPrev[i]=Number.MAX_VALUE}for(let i=1;i<=aLength;++i){this.current[0]=i;const aIdx=i-1;for(let j=1;j<=bLength;++j){const bIdx=j-1;const substitutionCost=a[aIdx]===b[bIdx]?0:1;this.current[j]=Math.min(this.prev[j]+1,this.current[j-1]+1,this.prev[j-1]+substitutionCost,);if((i>1)&&(j>1)&&(a[aIdx]===b[bIdx-1])&&(a[aIdx-1]===b[bIdx])){this.current[j]=Math.min(this.current[j],this.prevPrev[j-2]+1,)}}const prevPrevTmp=this.prevPrev;this.prevPrev=this.prev;this.prev=this.current;this.current=prevPrevTmp}const distance=this.prev[bLength];return distance<=limit?distance:(limit+1)},};function editDistance(a,b,limit){return editDistanceState.calculate(a,b,limit)}function isEndCharacter(c){return"=,>-])".indexOf(c)!==-1}function isSeparatorCharacter(c){return c===","||c==="="}function isReturnArrow(parserState){return parserState.userQuery.slice(parserState.pos,parserState.pos+2)==="->"}function skipWhitespace(parserState){while(parserState.pos0){const c=parserState.userQuery[pos-1];if(c===lookingFor){return true}else if(c!==" "){break}pos-=1}return false}function isLastElemGeneric(elems,parserState){return(elems.length>0&&elems[elems.length-1].generics.length>0)||prevIs(parserState,">")}function getFilteredNextElem(query,parserState,elems,isInGenerics){const start=parserState.pos;if(parserState.userQuery[parserState.pos]===":"&&!isPathStart(parserState)){throw["Expected type filter before ",":"]}getNextElem(query,parserState,elems,isInGenerics);if(parserState.userQuery[parserState.pos]===":"&&!isPathStart(parserState)){if(parserState.typeFilter!==null){throw["Unexpected ",":"," (expected path after type filter ",parserState.typeFilter+":",")",]}if(elems.length===0){throw["Expected type filter before ",":"]}else if(query.literalSearch){throw["Cannot use quotes on type filter"]}const typeFilterElem=elems.pop();checkExtraTypeFilterCharacters(start,parserState);parserState.typeFilter=typeFilterElem.normalizedPathLast;parserState.pos+=1;parserState.totalElems-=1;query.literalSearch=false;getNextElem(query,parserState,elems,isInGenerics)}}function getItemsBefore(query,parserState,elems,endChar){let foundStopChar=true;let foundSeparator=false;const oldTypeFilter=parserState.typeFilter;parserState.typeFilter=null;const oldIsInBinding=parserState.isInBinding;parserState.isInBinding=null;let hofParameters=null;let extra="";if(endChar===">"){extra="<"}else if(endChar==="]"){extra="["}else if(endChar===")"){extra="("}else if(endChar===""){extra="->"}else{extra=endChar}while(parserState.pos"," after ","="]}hofParameters=[...elems];elems.length=0;parserState.pos+=2;foundStopChar=true;foundSeparator=false;continue}else if(c===" "){parserState.pos+=1;continue}else if(isSeparatorCharacter(c)){parserState.pos+=1;foundStopChar=true;foundSeparator=true;continue}else if(c===":"&&isPathStart(parserState)){throw["Unexpected ","::",": paths cannot start with ","::"]}else if(isEndCharacter(c)){throw["Unexpected ",c," after ",extra]}if(!foundStopChar){let extra=[];if(isLastElemGeneric(query.elems,parserState)){extra=[" after ",">"]}else if(prevIs(parserState,"\"")){throw["Cannot have more than one element if you use quotes"]}if(endChar!==""){throw["Expected ",",",", ","=",", or ",endChar,...extra,", found ",c,]}throw["Expected ",","," or ","=",...extra,", found ",c,]}const posBefore=parserState.pos;getFilteredNextElem(query,parserState,elems,endChar!=="");if(endChar!==""&&parserState.pos>=parserState.length){throw["Unclosed ",extra]}if(posBefore===parserState.pos){parserState.pos+=1}foundStopChar=false}if(parserState.pos>=parserState.length&&endChar!==""){throw["Unclosed ",extra]}parserState.pos+=1;if(hofParameters){foundSeparator=false;if([...elems,...hofParameters].some(x=>x.bindingName)||parserState.isInBinding){throw["Unexpected ","="," within ","->"]}const hofElem=makePrimitiveElement("->",{generics:hofParameters,bindings:new Map([["output",[...elems]]]),typeFilter:null,});elems.length=0;elems[0]=hofElem}parserState.typeFilter=oldTypeFilter;parserState.isInBinding=oldIsInBinding;return{foundSeparator}}function getNextElem(query,parserState,elems,isInGenerics){const generics=[];skipWhitespace(parserState);let start=parserState.pos;let end;if("[(".indexOf(parserState.userQuery[parserState.pos])!==-1){let endChar=")";let name="()";let friendlyName="tuple";if(parserState.userQuery[parserState.pos]==="["){endChar="]";name="[]";friendlyName="slice"}parserState.pos+=1;const{foundSeparator}=getItemsBefore(query,parserState,generics,endChar);const typeFilter=parserState.typeFilter;const bindingName=parserState.isInBinding;parserState.typeFilter=null;parserState.isInBinding=null;for(const gen of generics){if(gen.bindingName!==null){throw["Type parameter ","=",` cannot be within ${friendlyName} `,name]}}if(name==="()"&&!foundSeparator&&generics.length===1&&typeFilter===null){elems.push(generics[0])}else if(name==="()"&&generics.length===1&&generics[0].name==="->"){generics[0].typeFilter=typeFilter;elems.push(generics[0])}else{if(typeFilter!==null&&typeFilter!=="primitive"){throw["Invalid search type: primitive ",name," and ",typeFilter," both specified",]}parserState.totalElems+=1;if(isInGenerics){parserState.genericsElems+=1}elems.push(makePrimitiveElement(name,{bindingName,generics}))}}else if(parserState.userQuery[parserState.pos]==="&"){if(parserState.typeFilter!==null&&parserState.typeFilter!=="primitive"){throw["Invalid search type: primitive ","&"," and ",parserState.typeFilter," both specified",]}parserState.typeFilter=null;parserState.pos+=1;let c=parserState.userQuery[parserState.pos];while(c===" "&&parserState.pos=end){throw["Found generics without a path"]}parserState.pos+=1;getItemsBefore(query,parserState,generics,">")}else if(parserState.pos=end){throw["Found generics without a path"]}if(parserState.isInBinding){throw["Unexpected ","("," after ","="]}parserState.pos+=1;const typeFilter=parserState.typeFilter;parserState.typeFilter=null;getItemsBefore(query,parserState,generics,")");skipWhitespace(parserState);if(isReturnArrow(parserState)){parserState.pos+=2;skipWhitespace(parserState);getFilteredNextElem(query,parserState,generics,isInGenerics);generics[generics.length-1].bindingName=makePrimitiveElement("output")}else{generics.push(makePrimitiveElement(null,{bindingName:makePrimitiveElement("output"),typeFilter:null,}))}parserState.typeFilter=typeFilter}if(isStringElem){skipWhitespace(parserState)}if(start>=end&&generics.length===0){return}if(parserState.userQuery[parserState.pos]==="="){if(parserState.isInBinding){throw["Cannot write ","="," twice in a binding"]}if(!isInGenerics){throw["Type parameter ","="," must be within generics list"]}const name=parserState.userQuery.slice(start,end).trim();if(name==="!"){throw["Type parameter ","="," key cannot be ","!"," never type"]}if(name.includes("!")){throw["Type parameter ","="," key cannot be ","!"," macro"]}if(name.includes("::")){throw["Type parameter ","="," key cannot contain ","::"," path"]}if(name.includes(":")){throw["Type parameter ","="," key cannot contain ",":"," type"]}parserState.isInBinding={name,generics}}else{elems.push(createQueryElement(query,parserState,parserState.userQuery.slice(start,end),generics,isInGenerics,),)}}}function checkExtraTypeFilterCharacters(start,parserState){const query=parserState.userQuery.slice(start,parserState.pos).trim();const match=query.match(REGEX_INVALID_TYPE_FILTER);if(match){throw["Unexpected ",match[0]," in type filter (before ",":",")",]}}function createQueryElement(query,parserState,name,generics,isInGenerics){const path=name.trim();if(path.length===0&&generics.length===0){throw["Unexpected ",parserState.userQuery[parserState.pos]]}if(query.literalSearch&&parserState.totalElems-parserState.genericsElems>0){throw["Cannot have more than one element if you use quotes"]}const typeFilter=parserState.typeFilter;parserState.typeFilter=null;if(name.trim()==="!"){if(typeFilter!==null&&typeFilter!=="primitive"){throw["Invalid search type: primitive never type ","!"," and ",typeFilter," both specified",]}if(generics.length!==0){throw["Never type ","!"," does not accept generic parameters",]}const bindingName=parserState.isInBinding;parserState.isInBinding=null;return makePrimitiveElement("never",{bindingName})}const quadcolon=/::\s*::/.exec(path);if(path.startsWith("::")){throw["Paths cannot start with ","::"]}else if(quadcolon!==null){throw["Unexpected ",quadcolon[0]]}const pathSegments=path.split(/(?:::\s*)|(?:\s+(?:::\s*)?)/).map(x=>x.toLowerCase());if(pathSegments.length===0||(pathSegments.length===1&&pathSegments[0]==="")){if(generics.length>0||prevIs(parserState,">")){throw["Found generics without a path"]}else{throw["Unexpected ",parserState.userQuery[parserState.pos]]}}for(const[i,pathSegment]of pathSegments.entries()){if(pathSegment==="!"){if(i!==0){throw["Never type ","!"," is not associated item"]}pathSegments[i]="never"}}parserState.totalElems+=1;if(isInGenerics){parserState.genericsElems+=1}const bindingName=parserState.isInBinding;parserState.isInBinding=null;const bindings=new Map();const pathLast=pathSegments[pathSegments.length-1];return{name:name.trim(),id:null,fullPath:pathSegments,pathWithoutLast:pathSegments.slice(0,pathSegments.length-1),pathLast,normalizedPathLast:pathLast.replace(/_/g,""),generics:generics.filter(gen=>{if(gen.bindingName!==null){if(gen.name!==null){gen.bindingName.generics.unshift(gen)}bindings.set(gen.bindingName.name.toLowerCase().replace(/_/g,""),gen.bindingName.generics,);return false}return true}),bindings,typeFilter,bindingName,}}function makePrimitiveElement(name,extra){return Object.assign({name,id:null,fullPath:[name],pathWithoutLast:[],pathLast:name,normalizedPathLast:name,generics:[],bindings:new Map(),typeFilter:"primitive",bindingName:null,},extra)}function getStringElem(query,parserState,isInGenerics){if(isInGenerics){throw["Unexpected ","\""," in generics"]}else if(query.literalSearch){throw["Cannot have more than one literal search element"]}else if(parserState.totalElems-parserState.genericsElems>0){throw["Cannot use literal search when there is more than one element"]}parserState.pos+=1;const start=parserState.pos;const end=getIdentEndPosition(parserState);if(parserState.pos>=parserState.length){throw["Unclosed ","\""]}else if(parserState.userQuery[end]!=="\""){throw["Unexpected ",parserState.userQuery[end]," in a string element"]}else if(start===end){throw["Cannot have empty string element"]}parserState.pos+=1;query.literalSearch=true}function getIdentEndPosition(parserState){let afterIdent=consumeIdent(parserState);let end=parserState.pos;let macroExclamation=-1;while(parserState.pos0){throw["Unexpected ",c," after ",parserState.userQuery[parserState.pos-1]," (not a valid identifier)"]}else{throw["Unexpected ",c," (not a valid identifier)"]}parserState.pos+=1;afterIdent=consumeIdent(parserState);end=parserState.pos}if(macroExclamation!==-1){if(parserState.typeFilter===null){parserState.typeFilter="macro"}else if(parserState.typeFilter!=="macro"){throw["Invalid search type: macro ","!"," and ",parserState.typeFilter," both specified",]}end=macroExclamation}return end}function isSpecialStartCharacter(c){return"<\"".indexOf(c)!==-1}function isPathStart(parserState){return parserState.userQuery.slice(parserState.pos,parserState.pos+2)==="::"}function consumeIdent(parserState){REGEX_IDENT.lastIndex=parserState.pos;const match=parserState.userQuery.match(REGEX_IDENT);if(match){parserState.pos+=match[0].length;return true}return false}function isPathSeparator(c){return c===":"||c===" "}class VlqHexDecoder{constructor(string,cons){this.string=string;this.cons=cons;this.offset=0;this.backrefQueue=[]}decodeList(){let c=this.string.charCodeAt(this.offset);const ret=[];while(c!==125){ret.push(this.decode());c=this.string.charCodeAt(this.offset)}this.offset+=1;return ret}decode(){let n=0;let c=this.string.charCodeAt(this.offset);if(c===123){this.offset+=1;return this.decodeList()}while(c<96){n=(n<<4)|(c&0xF);this.offset+=1;c=this.string.charCodeAt(this.offset)}n=(n<<4)|(c&0xF);const[sign,value]=[n&1,n>>1];this.offset+=1;return sign?-value:value}next(){const c=this.string.charCodeAt(this.offset);if(c>=48&&c<64){this.offset+=1;return this.backrefQueue[c-48]}if(c===96){this.offset+=1;return this.cons(0)}const result=this.cons(this.decode());this.backrefQueue.unshift(result);if(this.backrefQueue.length>16){this.backrefQueue.pop()}return result}}class RoaringBitmap{constructor(str){const strdecoded=atob(str);const u8array=new Uint8Array(strdecoded.length);for(let j=0;j=4){offsets=[];for(let j=0;j>3]&(1<<(j&0x7))){const runcount=(u8array[i]|(u8array[i+1]<<8));i+=2;this.containers.push(new RoaringBitmapRun(runcount,u8array.slice(i,i+(runcount*4)),));i+=runcount*4}else if(this.cardinalities[j]>=4096){this.containers.push(new RoaringBitmapBits(u8array.slice(i,i+8192)));i+=8192}else{const end=this.cardinalities[j]*2;this.containers.push(new RoaringBitmapArray(this.cardinalities[j],u8array.slice(i,i+end),));i+=end}}}contains(keyvalue){const key=keyvalue>>16;const value=keyvalue&0xFFFF;let left=0;let right=this.keys.length-1;while(left<=right){const mid=Math.floor((left+right)/2);const x=this.keys[mid];if(xkey){right=mid-1}else{return this.containers[mid].contains(value)}}return false}}class RoaringBitmapRun{constructor(runcount,array){this.runcount=runcount;this.array=array}contains(value){let left=0;let right=this.runcount-1;while(left<=right){const mid=Math.floor((left+right)/2);const i=mid*4;const start=this.array[i]|(this.array[i+1]<<8);const lenm1=this.array[i+2]|(this.array[i+3]<<8);if((start+lenm1)value){right=mid-1}else{return true}}return false}}class RoaringBitmapArray{constructor(cardinality,array){this.cardinality=cardinality;this.array=array}contains(value){let left=0;let right=this.cardinality-1;while(left<=right){const mid=Math.floor((left+right)/2);const i=mid*2;const x=this.array[i]|(this.array[i+1]<<8);if(xvalue){right=mid-1}else{return true}}return false}}class RoaringBitmapBits{constructor(array){this.array=array}contains(value){return!!(this.array[value>>3]&(1<<(value&7)))}}class NameTrie{constructor(){this.children=[];this.matches=[]}insert(name,id,tailTable){this.insertSubstring(name,0,id,tailTable)}insertSubstring(name,substart,id,tailTable){const l=name.length;if(substart===l){this.matches.push(id)}else{const sb=name.charCodeAt(substart);let child;if(this.children[sb]!==undefined){child=this.children[sb]}else{child=new NameTrie();this.children[sb]=child;let sste;if(substart>=2){const tail=name.substring(substart-2,substart+1);if(tailTable.has(tail)){sste=tailTable.get(tail)}else{sste=[];tailTable.set(tail,sste)}sste.push(child)}}child.insertSubstring(name,substart+1,id,tailTable)}}search(name,tailTable){const results=new Set();this.searchSubstringPrefix(name,0,results);if(results.size=3){const levParams=name.length>=6?new Lev2TParametricDescription(name.length):new Lev1TParametricDescription(name.length);this.searchLev(name,0,levParams,results);const tail=name.substring(0,3);if(tailTable.has(tail)){for(const entry of tailTable.get(tail)){entry.searchSubstringPrefix(name,3,results)}}}return[...results]}searchSubstringPrefix(name,substart,results){const l=name.length;if(substart===l){for(const match of this.matches){results.add(match)}let unprocessedChildren=[];for(const child of this.children){if(child){unprocessedChildren.push(child)}}let nextSet=[];while(unprocessedChildren.length!==0){const next=unprocessedChildren.pop();for(const child of next.children){if(child){nextSet.push(child)}}for(const match of next.matches){results.add(match)}if(unprocessedChildren.length===0){const tmp=unprocessedChildren;unprocessedChildren=nextSet;nextSet=tmp}}}else{const sb=name.charCodeAt(substart);if(this.children[sb]!==undefined){this.children[sb].searchSubstringPrefix(name,substart+1,results)}}}searchLev(name,substart,levParams,results){const stack=[[this,0]];const n=levParams.n;while(stack.length!==0){const[trie,levState]=stack.pop();for(const[charCode,child]of trie.children.entries()){if(!child){continue}const levPos=levParams.getPosition(levState);const vector=levParams.getVector(name,charCode,levPos,Math.min(name.length,levPos+(2*n)+1),);const newLevState=levParams.transition(levState,levPos,vector,);if(newLevState>=0){stack.push([child,newLevState]);if(levParams.isAccept(newLevState)){for(const match of child.matches){results.add(match)}}}}}}}class DocSearch{constructor(rawSearchIndex,rootPath,searchState){this.searchIndexDeprecated=new Map();this.searchIndexEmptyDesc=new Map();this.functionTypeFingerprint=null;this.typeNameIdMap=new Map();this.assocTypeIdNameMap=new Map();this.ALIASES=new Map();this.rootPath=rootPath;this.searchState=searchState;this.typeNameIdOfArray=this.buildTypeMapIndex("array");this.typeNameIdOfSlice=this.buildTypeMapIndex("slice");this.typeNameIdOfArrayOrSlice=this.buildTypeMapIndex("[]");this.typeNameIdOfTuple=this.buildTypeMapIndex("tuple");this.typeNameIdOfUnit=this.buildTypeMapIndex("unit");this.typeNameIdOfTupleOrUnit=this.buildTypeMapIndex("()");this.typeNameIdOfFn=this.buildTypeMapIndex("fn");this.typeNameIdOfFnMut=this.buildTypeMapIndex("fnmut");this.typeNameIdOfFnOnce=this.buildTypeMapIndex("fnonce");this.typeNameIdOfHof=this.buildTypeMapIndex("->");this.typeNameIdOfOutput=this.buildTypeMapIndex("output",true);this.typeNameIdOfReference=this.buildTypeMapIndex("reference");this.EMPTY_BINDINGS_MAP=new Map();this.EMPTY_GENERICS_ARRAY=[];this.TYPES_POOL=new Map();this.nameTrie=new NameTrie();this.tailTable=new Map();this.searchIndex=this.buildIndex(rawSearchIndex)}buildTypeMapIndex(name,isAssocType){if(name===""||name===null){return null}if(this.typeNameIdMap.has(name)){const obj=this.typeNameIdMap.get(name);obj.assocOnly=isAssocType&&obj.assocOnly;return obj.id}else{const id=this.typeNameIdMap.size;this.typeNameIdMap.set(name,{id,assocOnly:isAssocType});return id}}buildItemSearchTypeAll(types,paths,lowercasePaths){return types.length>0?types.map(type=>this.buildItemSearchType(type,paths,lowercasePaths)):this.EMPTY_GENERICS_ARRAY}buildItemSearchType(type,paths,lowercasePaths,isAssocType){const PATH_INDEX_DATA=0;const GENERICS_DATA=1;const BINDINGS_DATA=2;let pathIndex,generics,bindings;if(typeof type==="number"){pathIndex=type;generics=this.EMPTY_GENERICS_ARRAY;bindings=this.EMPTY_BINDINGS_MAP}else{pathIndex=type[PATH_INDEX_DATA];generics=this.buildItemSearchTypeAll(type[GENERICS_DATA],paths,lowercasePaths,);if(type.length>BINDINGS_DATA&&type[BINDINGS_DATA].length>0){bindings=new Map(type[BINDINGS_DATA].map(binding=>{const[assocType,constraints]=binding;return[this.buildItemSearchType(assocType,paths,lowercasePaths,true).id,this.buildItemSearchTypeAll(constraints,paths,lowercasePaths),]}))}else{bindings=this.EMPTY_BINDINGS_MAP}}let result;if(pathIndex<0){result={id:pathIndex,name:"",ty:TY_GENERIC,path:null,exactPath:null,generics,bindings,unboxFlag:true,}}else if(pathIndex===0){result={id:null,name:"",ty:null,path:null,exactPath:null,generics,bindings,unboxFlag:true,}}else{const item=lowercasePaths[pathIndex-1];const id=this.buildTypeMapIndex(item.name,isAssocType);if(isAssocType){this.assocTypeIdNameMap.set(id,paths[pathIndex-1].name)}result={id,name:paths[pathIndex-1].name,ty:item.ty,path:item.path,exactPath:item.exactPath,generics,bindings,unboxFlag:item.unboxFlag,}}const cr=this.TYPES_POOL.get(result.id);if(cr){if(cr.generics.length===result.generics.length&&cr.generics!==result.generics&&cr.generics.every((x,i)=>result.generics[i]===x)){result.generics=cr.generics}if(cr.bindings.size===result.bindings.size&&cr.bindings!==result.bindings){let ok=true;for(const[k,v]of cr.bindings.entries()){const v2=result.bindings.get(v);if(!v2){ok=false;break}if(v!==v2&&v.length===v2.length&&v.every((x,i)=>v2[i]===x)){result.bindings.set(k,v)}else if(v!==v2){ok=false;break}}if(ok){result.bindings=cr.bindings}}if(cr.ty===result.ty&&cr.path===result.path&&cr.bindings===result.bindings&&cr.generics===result.generics&&cr.ty===result.ty&&cr.name===result.name&&cr.unboxFlag===result.unboxFlag){return cr}}this.TYPES_POOL.set(result.id,result);return result}buildFunctionTypeFingerprint(type,output){let input=type.id;if(input===this.typeNameIdOfArray||input===this.typeNameIdOfSlice){input=this.typeNameIdOfArrayOrSlice}if(input===this.typeNameIdOfTuple||input===this.typeNameIdOfUnit){input=this.typeNameIdOfTupleOrUnit}if(input===this.typeNameIdOfFn||input===this.typeNameIdOfFnMut||input===this.typeNameIdOfFnOnce){input=this.typeNameIdOfHof}const hashint1=k=>{k=(~~k+0x7ed55d16)+(k<<12);k=(k ^ 0xc761c23c)^(k>>>19);k=(~~k+0x165667b1)+(k<<5);k=(~~k+0xd3a2646c)^(k<<9);k=(~~k+0xfd7046c5)+(k<<3);return(k ^ 0xb55a4f09)^(k>>>16)};const hashint2=k=>{k=~k+(k<<15);k ^=k>>>12;k+=k<<2;k ^=k>>>4;k=Math.imul(k,2057);return k ^(k>>16)};if(input!==null){const h0a=hashint1(input);const h0b=hashint2(input);const h1a=~~(h0a+Math.imul(h0b,2));const h1b=~~(h0a+Math.imul(h0b,3));const h2a=~~(h0a+Math.imul(h0b,4));const h2b=~~(h0a+Math.imul(h0b,5));output[0]|=(1<<(h0a%32))|(1<<(h1b%32));output[1]|=(1<<(h1a%32))|(1<<(h2b%32));output[2]|=(1<<(h2a%32))|(1<<(h0b%32));output[3]+=1}for(const g of type.generics){this.buildFunctionTypeFingerprint(g,output)}const fb={id:null,ty:0,generics:this.EMPTY_GENERICS_ARRAY,bindings:this.EMPTY_BINDINGS_MAP,};for(const[k,v]of type.bindings.entries()){fb.id=k;fb.generics=v;this.buildFunctionTypeFingerprint(fb,output)}}buildIndex(rawSearchIndex){const buildFunctionSearchTypeCallback=(paths,lowercasePaths)=>{return functionSearchType=>{if(functionSearchType===0){return null}const INPUTS_DATA=0;const OUTPUT_DATA=1;let inputs,output;if(typeof functionSearchType[INPUTS_DATA]==="number"){inputs=[this.buildItemSearchType(functionSearchType[INPUTS_DATA],paths,lowercasePaths,),]}else{inputs=this.buildItemSearchTypeAll(functionSearchType[INPUTS_DATA],paths,lowercasePaths,)}if(functionSearchType.length>1){if(typeof functionSearchType[OUTPUT_DATA]==="number"){output=[this.buildItemSearchType(functionSearchType[OUTPUT_DATA],paths,lowercasePaths,),]}else{output=this.buildItemSearchTypeAll(functionSearchType[OUTPUT_DATA],paths,lowercasePaths,)}}else{output=[]}const where_clause=[];const l=functionSearchType.length;for(let i=2;inoop);let descShard={crate,shard:0,start:0,len:itemDescShardDecoder.next(),promise:null,resolve:null,};const descShardList=[descShard];this.searchIndexDeprecated.set(crate,new RoaringBitmap(crateCorpus.c));this.searchIndexEmptyDesc.set(crate,new RoaringBitmap(crateCorpus.e));let descIndex=0;let lastParamNames=[];let normalizedName=crate.indexOf("_")===-1?crate:crate.replace(/_/g,"");const crateRow={crate,ty:3,name:crate,path:"",descShard,descIndex,exactPath:"",desc:crateCorpus.doc,parent:undefined,type:null,paramNames:lastParamNames,id,word:crate,normalizedName,bitIndex:0,implDisambiguator:null,};this.nameTrie.insert(normalizedName,id,this.tailTable);id+=1;searchIndex.push(crateRow);currentIndex+=1;if(!this.searchIndexEmptyDesc.get(crate).contains(0)){descIndex+=1}const itemTypes=crateCorpus.t;const itemNames=crateCorpus.n;const itemPaths=new Map(crateCorpus.q);const itemReexports=new Map(crateCorpus.r);const itemParentIdxDecoder=new VlqHexDecoder(crateCorpus.i,noop=>noop);const implDisambiguator=new Map(crateCorpus.b);const paths=crateCorpus.p;const aliases=crateCorpus.a;const itemParamNames=new Map(crateCorpus.P);const lowercasePaths=[];const itemFunctionDecoder=new VlqHexDecoder(crateCorpus.f,buildFunctionSearchTypeCallback(paths,lowercasePaths),);let len=paths.length;let lastPath=itemPaths.get(0);for(let i=0;i2&&elem[2]!==null){path=itemPaths.has(elem[2])?itemPaths.get(elem[2]):lastPath;lastPath=path}const exactPath=elem.length>3&&elem[3]!==null?itemPaths.get(elem[3]):path;const unboxFlag=elem.length>4&&!!elem[4];lowercasePaths.push({ty,name:name.toLowerCase(),path,exactPath,unboxFlag});paths[i]={ty,name,path,exactPath,unboxFlag}}lastPath="";len=itemTypes.length;let lastName="";let lastWord="";for(let i=0;i=descShard.len&&!this.searchIndexEmptyDesc.get(crate).contains(bitIndex)){descShard={crate,shard:descShard.shard+1,start:descShard.start+descShard.len,len:itemDescShardDecoder.next(),promise:null,resolve:null,};descIndex=0;descShardList.push(descShard)}const name=itemNames[i]===""?lastName:itemNames[i];const word=itemNames[i]===""?lastWord:itemNames[i].toLowerCase();const path=itemPaths.has(i)?itemPaths.get(i):lastPath;const paramNames=itemParamNames.has(i)?itemParamNames.get(i).split(","):lastParamNames;const type=itemFunctionDecoder.next();if(type!==null){if(type){const fp=this.functionTypeFingerprint.subarray(id*4,(id+1)*4);for(const t of type.inputs){this.buildFunctionTypeFingerprint(t,fp)}for(const t of type.output){this.buildFunctionTypeFingerprint(t,fp)}for(const w of type.where_clause){for(const t of w){this.buildFunctionTypeFingerprint(t,fp)}}}}const itemParentIdx=itemParentIdxDecoder.next();normalizedName=word.indexOf("_")===-1?word:word.replace(/_/g,"");const row={crate,ty:itemTypes.charCodeAt(i)-65,name,path,descShard,descIndex,exactPath:itemReexports.has(i)?itemPaths.get(itemReexports.get(i)):path,parent:itemParentIdx>0?paths[itemParentIdx-1]:undefined,type,paramNames,id,word,normalizedName,bitIndex,implDisambiguator:implDisambiguator.has(i)?implDisambiguator.get(i):null,};this.nameTrie.insert(normalizedName,id,this.tailTable);id+=1;searchIndex.push(row);lastPath=row.path;lastParamNames=row.paramNames;if(!this.searchIndexEmptyDesc.get(crate).contains(bitIndex)){descIndex+=1}lastName=name;lastWord=word}if(aliases){const currentCrateAliases=new Map();this.ALIASES.set(crate,currentCrateAliases);for(const alias_name in aliases){if(!Object.prototype.hasOwnProperty.call(aliases,alias_name)){continue}let currentNameAliases;if(currentCrateAliases.has(alias_name)){currentNameAliases=currentCrateAliases.get(alias_name)}else{currentNameAliases=[];currentCrateAliases.set(alias_name,currentNameAliases)}for(const local_alias of aliases[alias_name]){currentNameAliases.push(local_alias+currentIndex)}}}currentIndex+=itemTypes.length;this.searchState.descShards.set(crate,descShardList)}this.TYPES_POOL=new Map();return searchIndex}static parseQuery(userQuery){function itemTypeFromName(typename){const index=itemTypes.findIndex(i=>i===typename);if(index<0){throw["Unknown type filter ",typename]}return index}function convertTypeFilterOnElem(elem){if(elem.typeFilter!==null){let typeFilter=elem.typeFilter;if(typeFilter==="const"){typeFilter="constant"}elem.typeFilter=itemTypeFromName(typeFilter)}else{elem.typeFilter=NO_TYPE_FILTER}for(const elem2 of elem.generics){convertTypeFilterOnElem(elem2)}for(const constraints of elem.bindings.values()){for(const constraint of constraints){convertTypeFilterOnElem(constraint)}}}function newParsedQuery(userQuery){return{userQuery,elems:[],returned:[],foundElems:0,totalElems:0,literalSearch:false,hasReturnArrow:false,error:null,correction:null,proposeCorrectionFrom:null,proposeCorrectionTo:null,typeFingerprint:new Uint32Array(4),}}function parseInput(query,parserState){let foundStopChar=true;while(parserState.pos"){if(isReturnArrow(parserState)){query.hasReturnArrow=true;break}throw["Unexpected ",c," (did you mean ","->","?)"]}else if(parserState.pos>0){throw["Unexpected ",c," after ",parserState.userQuery[parserState.pos-1]]}throw["Unexpected ",c]}else if(c===" "){skipWhitespace(parserState);continue}if(!foundStopChar){let extra="";if(isLastElemGeneric(query.elems,parserState)){extra=[" after ",">"]}else if(prevIs(parserState,"\"")){throw["Cannot have more than one element if you use quotes"]}if(parserState.typeFilter!==null){throw["Expected ",","," or ","->",...extra,", found ",c,]}throw["Expected ",",",", ",":"," or ","->",...extra,", found ",c,]}const before=query.elems.length;getFilteredNextElem(query,parserState,query.elems,false);if(query.elems.length===before){parserState.pos+=1}foundStopChar=false}if(parserState.typeFilter!==null){throw["Unexpected ",":"," (expected path after type filter ",parserState.typeFilter+":",")",]}while(parserState.pos1}query.foundElems=query.elems.length+query.returned.length;query.totalElems=parserState.totalElems;return query}async execQuery(parsedQuery,filterCrates,currentCrate){const results_others=new Map(),results_in_args=new Map(),results_returned=new Map();function createQueryResults(results_in_args,results_returned,results_others,parsedQuery){return{"in_args":results_in_args,"returned":results_returned,"others":results_others,"query":parsedQuery,}}const buildHrefAndPath=item=>{let displayPath;let href;const type=itemTypes[item.ty];const name=item.name;let path=item.path;let exactPath=item.exactPath;if(type==="mod"){displayPath=path+"::";href=this.rootPath+path.replace(/::/g,"/")+"/"+name+"/index.html"}else if(type==="import"){displayPath=item.path+"::";href=this.rootPath+item.path.replace(/::/g,"/")+"/index.html#reexport."+name}else if(type==="primitive"||type==="keyword"){displayPath="";exactPath="";href=this.rootPath+path.replace(/::/g,"/")+"/"+type+"."+name+".html"}else if(type==="externcrate"){displayPath="";href=this.rootPath+name+"/index.html"}else if(item.parent!==undefined){const myparent=item.parent;let anchor=type+"."+name;const parentType=itemTypes[myparent.ty];let pageType=parentType;let pageName=myparent.name;exactPath=`${myparent.exactPath}::${myparent.name}`;if(parentType==="primitive"){displayPath=myparent.name+"::";exactPath=myparent.name}else if(type==="structfield"&&parentType==="variant"){const enumNameIdx=item.path.lastIndexOf("::");const enumName=item.path.substr(enumNameIdx+2);path=item.path.substr(0,enumNameIdx);displayPath=path+"::"+enumName+"::"+myparent.name+"::";anchor="variant."+myparent.name+".field."+name;pageType="enum";pageName=enumName}else{displayPath=path+"::"+myparent.name+"::"}if(item.implDisambiguator!==null){anchor=item.implDisambiguator+"/"+anchor}href=this.rootPath+path.replace(/::/g,"/")+"/"+pageType+"."+pageName+".html#"+anchor}else{displayPath=item.path+"::";href=this.rootPath+item.path.replace(/::/g,"/")+"/"+type+"."+name+".html"}return[displayPath,href,`${exactPath}::${name}`]};function pathSplitter(path){const tmp=""+path.replace(/::/g,"::");if(tmp.endsWith("")){return tmp.slice(0,tmp.length-6)}return tmp}const transformResults=(results,typeInfo)=>{const duplicates=new Set();const out=[];for(const result of results){if(result.id!==-1){const res=buildHrefAndPath(this.searchIndex[result.id]);const obj=Object.assign({dist:result.dist,displayPath:pathSplitter(res[0]),},this.searchIndex[result.id]);obj.fullPath=res[2]+"|"+obj.ty;if(duplicates.has(obj.fullPath)){continue}if(obj.ty===TY_IMPORT&&duplicates.has(res[2])){continue}if(duplicates.has(res[2]+"|"+TY_IMPORT)){continue}duplicates.add(obj.fullPath);duplicates.add(res[2]);if(typeInfo!==null){obj.displayTypeSignature=this.formatDisplayTypeSignature(obj,typeInfo)}obj.href=res[1];out.push(obj);if(out.length>=MAX_RESULTS){break}}}return out};this.formatDisplayTypeSignature=async(obj,typeInfo)=>{let fnInputs=null;let fnOutput=null;let mgens=null;if(typeInfo!=="elems"&&typeInfo!=="returned"){fnInputs=unifyFunctionTypes(obj.type.inputs,parsedQuery.elems,obj.type.where_clause,null,mgensScratch=>{fnOutput=unifyFunctionTypes(obj.type.output,parsedQuery.returned,obj.type.where_clause,mgensScratch,mgensOut=>{mgens=mgensOut;return true},0,);return!!fnOutput},0,)}else{const arr=typeInfo==="elems"?obj.type.inputs:obj.type.output;const highlighted=unifyFunctionTypes(arr,parsedQuery.elems,obj.type.where_clause,null,mgensOut=>{mgens=mgensOut;return true},0,);if(typeInfo==="elems"){fnInputs=highlighted}else{fnOutput=highlighted}}if(!fnInputs){fnInputs=obj.type.inputs}if(!fnOutput){fnOutput=obj.type.output}const mappedNames=new Map();const whereClause=new Map();const fnParamNames=obj.paramNames;const queryParamNames=[];const remapQuery=queryElem=>{if(queryElem.id<0){queryParamNames[-1-queryElem.id]=queryElem.name}if(queryElem.generics.length>0){queryElem.generics.forEach(remapQuery)}if(queryElem.bindings.size>0){[...queryElem.bindings.values()].flat().forEach(remapQuery)}};parsedQuery.elems.forEach(remapQuery);parsedQuery.returned.forEach(remapQuery);const pushText=(fnType,result)=>{if(!!(result.length%2)===!!fnType.highlighted){result.push("")}else if(result.length===0&&!!fnType.highlighted){result.push("");result.push("")}result[result.length-1]+=fnType.name};const writeHof=(fnType,result)=>{const hofOutput=fnType.bindings.get(this.typeNameIdOfOutput)||[];const hofInputs=fnType.generics;pushText(fnType,result);pushText({name:" (",highlighted:false},result);let needsComma=false;for(const fnType of hofInputs){if(needsComma){pushText({name:", ",highlighted:false},result)}needsComma=true;writeFn(fnType,result)}pushText({name:hofOutput.length===0?")":") -> ",highlighted:false,},result);if(hofOutput.length>1){pushText({name:"(",highlighted:false},result)}needsComma=false;for(const fnType of hofOutput){if(needsComma){pushText({name:", ",highlighted:false},result)}needsComma=true;writeFn(fnType,result)}if(hofOutput.length>1){pushText({name:")",highlighted:false},result)}};const writeSpecialPrimitive=(fnType,result)=>{if(fnType.id===this.typeNameIdOfArray||fnType.id===this.typeNameIdOfSlice||fnType.id===this.typeNameIdOfTuple||fnType.id===this.typeNameIdOfUnit){const[ob,sb]=fnType.id===this.typeNameIdOfArray||fnType.id===this.typeNameIdOfSlice?["[","]"]:["(",")"];pushText({name:ob,highlighted:fnType.highlighted},result);onEachBtwn(fnType.generics,nested=>writeFn(nested,result),()=>pushText({name:", ",highlighted:false},result),);pushText({name:sb,highlighted:fnType.highlighted},result);return true}else if(fnType.id===this.typeNameIdOfReference){pushText({name:"&",highlighted:fnType.highlighted},result);let prevHighlighted=false;onEachBtwn(fnType.generics,value=>{prevHighlighted=value.highlighted;writeFn(value,result)},value=>pushText({name:" ",highlighted:prevHighlighted&&value.highlighted,},result),);return true}else if(fnType.id===this.typeNameIdOfFn){writeHof(fnType,result);return true}return false};const writeFn=(fnType,result)=>{if(fnType.id<0){if(fnParamNames[-1-fnType.id]===""){const generics=fnType.generics.length>0?fnType.generics:obj.type.where_clause[-1-fnType.id];for(const nested of generics){writeFn(nested,result)}return}else if(mgens){for(const[queryId,fnId]of mgens){if(fnId===fnType.id){mappedNames.set(queryParamNames[-1-queryId],fnParamNames[-1-fnType.id],)}}}pushText({name:fnParamNames[-1-fnType.id],highlighted:!!fnType.highlighted,},result);const where=[];onEachBtwn(fnType.generics,nested=>writeFn(nested,where),()=>pushText({name:" + ",highlighted:false},where),);if(where.length>0){whereClause.set(fnParamNames[-1-fnType.id],where)}}else{if(fnType.ty===TY_PRIMITIVE){if(writeSpecialPrimitive(fnType,result)){return}}else if(fnType.ty===TY_TRAIT&&(fnType.id===this.typeNameIdOfFn||fnType.id===this.typeNameIdOfFnMut||fnType.id===this.typeNameIdOfFnOnce)){writeHof(fnType,result);return}pushText(fnType,result);let hasBindings=false;if(fnType.bindings.size>0){onEachBtwn(fnType.bindings,([key,values])=>{const name=this.assocTypeIdNameMap.get(key);if(values.length===1&&values[0].id<0&&`${fnType.name}::${name}`===fnParamNames[-1-values[0].id]){for(const value of values){writeFn(value,[])}return true}if(!hasBindings){hasBindings=true;pushText({name:"<",highlighted:false},result)}pushText({name,highlighted:false},result);pushText({name:values.length!==1?"=(":"=",highlighted:false,},result);onEachBtwn(values||[],value=>writeFn(value,result),()=>pushText({name:" + ",highlighted:false},result),);if(values.length!==1){pushText({name:")",highlighted:false},result)}},()=>pushText({name:", ",highlighted:false},result),)}if(fnType.generics.length>0){pushText({name:hasBindings?", ":"<",highlighted:false},result)}onEachBtwn(fnType.generics,value=>writeFn(value,result),()=>pushText({name:", ",highlighted:false},result),);if(hasBindings||fnType.generics.length>0){pushText({name:">",highlighted:false},result)}}};const type=[];onEachBtwn(fnInputs,fnType=>writeFn(fnType,type),()=>pushText({name:", ",highlighted:false},type),);pushText({name:" -> ",highlighted:false},type);onEachBtwn(fnOutput,fnType=>writeFn(fnType,type),()=>pushText({name:", ",highlighted:false},type),);return{type,mappedNames,whereClause}};const sortResults=async(results,typeInfo,preferredCrate)=>{const userQuery=parsedQuery.userQuery;const normalizedUserQuery=parsedQuery.userQuery.toLowerCase();const isMixedCase=normalizedUserQuery!==userQuery;const result_list=[];for(const result of results.values()){result.item=this.searchIndex[result.id];result.word=this.searchIndex[result.id].word;result_list.push(result)}result_list.sort((aaa,bbb)=>{let a,b;if(isMixedCase){a=(aaa.item.name!==userQuery);b=(bbb.item.name!==userQuery);if(a!==b){return a-b}}a=(aaa.word!==normalizedUserQuery);b=(bbb.word!==normalizedUserQuery);if(a!==b){return a-b}a=(aaa.index<0);b=(bbb.index<0);if(a!==b){return a-b}a=aaa.path_dist;b=bbb.path_dist;if(a!==b){return a-b}a=aaa.index;b=bbb.index;if(a!==b){return a-b}a=(aaa.dist);b=(bbb.dist);if(a!==b){return a-b}a=this.searchIndexDeprecated.get(aaa.item.crate).contains(aaa.item.bitIndex);b=this.searchIndexDeprecated.get(bbb.item.crate).contains(bbb.item.bitIndex);if(a!==b){return a-b}a=(aaa.item.crate!==preferredCrate);b=(bbb.item.crate!==preferredCrate);if(a!==b){return a-b}a=aaa.word.length;b=bbb.word.length;if(a!==b){return a-b}a=aaa.word;b=bbb.word;if(a!==b){return(a>b?+1:-1)}a=this.searchIndexEmptyDesc.get(aaa.item.crate).contains(aaa.item.bitIndex);b=this.searchIndexEmptyDesc.get(bbb.item.crate).contains(bbb.item.bitIndex);if(a!==b){return a-b}a=aaa.item.ty;b=bbb.item.ty;if(a!==b){return a-b}a=aaa.item.path;b=bbb.item.path;if(a!==b){return(a>b?+1:-1)}return 0});return transformResults(result_list,typeInfo)};function unifyFunctionTypes(fnTypesIn,queryElems,whereClause,mgensIn,solutionCb,unboxingDepth,){if(unboxingDepth>=UNBOXING_LIMIT){return null}const mgens=mgensIn===null?null:new Map(mgensIn);if(queryElems.length===0){return solutionCb(mgens)?fnTypesIn:null}if(!fnTypesIn||fnTypesIn.length===0){return null}const ql=queryElems.length;const fl=fnTypesIn.length;if(ql===1&&queryElems[0].generics.length===0&&queryElems[0].bindings.size===0){const queryElem=queryElems[0];for(const[i,fnType]of fnTypesIn.entries()){if(!unifyFunctionTypeIsMatchCandidate(fnType,queryElem,mgens)){continue}if(fnType.id<0&&queryElem.id<0){if(mgens&&mgens.has(queryElem.id)&&mgens.get(queryElem.id)!==fnType.id){continue}const mgensScratch=new Map(mgens);mgensScratch.set(queryElem.id,fnType.id);if(!solutionCb||solutionCb(mgensScratch)){const highlighted=[...fnTypesIn];highlighted[i]=Object.assign({highlighted:true,},fnType,{generics:whereClause[-1-fnType.id],});return highlighted}}else if(solutionCb(mgens?new Map(mgens):null)){const highlighted=[...fnTypesIn];highlighted[i]=Object.assign({highlighted:true,},fnType,{generics:unifyGenericTypes(fnType.generics,queryElem.generics,whereClause,mgens?new Map(mgens):null,solutionCb,unboxingDepth,)||fnType.generics,});return highlighted}}for(const[i,fnType]of fnTypesIn.entries()){if(!unifyFunctionTypeIsUnboxCandidate(fnType,queryElem,whereClause,mgens,unboxingDepth+1,)){continue}if(fnType.id<0){const highlightedGenerics=unifyFunctionTypes(whereClause[(-fnType.id)-1],queryElems,whereClause,mgens,solutionCb,unboxingDepth+1,);if(highlightedGenerics){const highlighted=[...fnTypesIn];highlighted[i]=Object.assign({highlighted:true,},fnType,{generics:highlightedGenerics,});return highlighted}}else{const highlightedGenerics=unifyFunctionTypes([...Array.from(fnType.bindings.values()).flat(),...fnType.generics],queryElems,whereClause,mgens?new Map(mgens):null,solutionCb,unboxingDepth+1,);if(highlightedGenerics){const highlighted=[...fnTypesIn];highlighted[i]=Object.assign({},fnType,{generics:highlightedGenerics,bindings:new Map([...fnType.bindings.entries()].map(([k,v])=>{return[k,highlightedGenerics.splice(0,v.length)]})),});return highlighted}}}return false}const fnTypes=fnTypesIn.slice();const flast=fl-1;const qlast=ql-1;const queryElem=queryElems[qlast];let queryElemsTmp=null;for(let i=flast;i>=0;i-=1){const fnType=fnTypes[i];if(!unifyFunctionTypeIsMatchCandidate(fnType,queryElem,mgens)){continue}let mgensScratch;if(fnType.id<0){mgensScratch=new Map(mgens);if(mgensScratch.has(queryElem.id)&&mgensScratch.get(queryElem.id)!==fnType.id){continue}mgensScratch.set(queryElem.id,fnType.id)}else{mgensScratch=mgens}fnTypes[i]=fnTypes[flast];fnTypes.length=flast;if(!queryElemsTmp){queryElemsTmp=queryElems.slice(0,qlast)}let unifiedGenerics=[];let unifiedGenericsMgens=null;const passesUnification=unifyFunctionTypes(fnTypes,queryElemsTmp,whereClause,mgensScratch,mgensScratch=>{if(fnType.generics.length===0&&queryElem.generics.length===0&&fnType.bindings.size===0&&queryElem.bindings.size===0){return solutionCb(mgensScratch)}const solution=unifyFunctionTypeCheckBindings(fnType,queryElem,whereClause,mgensScratch,unboxingDepth,);if(!solution){return false}const simplifiedGenerics=solution.simplifiedGenerics;for(const simplifiedMgens of solution.mgens){unifiedGenerics=unifyGenericTypes(simplifiedGenerics,queryElem.generics,whereClause,simplifiedMgens,solutionCb,unboxingDepth,);if(unifiedGenerics!==null){unifiedGenericsMgens=simplifiedMgens;return true}}return false},unboxingDepth,);if(passesUnification){passesUnification.length=fl;passesUnification[flast]=passesUnification[i];passesUnification[i]=Object.assign({},fnType,{highlighted:true,generics:unifiedGenerics,bindings:new Map([...fnType.bindings.entries()].map(([k,v])=>{return[k,queryElem.bindings.has(k)?unifyFunctionTypes(v,queryElem.bindings.get(k),whereClause,unifiedGenericsMgens,solutionCb,unboxingDepth,):unifiedGenerics.splice(0,v.length)]})),});return passesUnification}fnTypes[flast]=fnTypes[i];fnTypes[i]=fnType;fnTypes.length=fl}for(let i=flast;i>=0;i-=1){const fnType=fnTypes[i];if(!unifyFunctionTypeIsUnboxCandidate(fnType,queryElem,whereClause,mgens,unboxingDepth+1,)){continue}const generics=fnType.id<0?whereClause[(-fnType.id)-1]:fnType.generics;const bindings=fnType.bindings?Array.from(fnType.bindings.values()).flat():[];const passesUnification=unifyFunctionTypes(fnTypes.toSpliced(i,1,...bindings,...generics),queryElems,whereClause,mgens,solutionCb,unboxingDepth+1,);if(passesUnification){const highlightedGenerics=passesUnification.slice(i,i+generics.length+bindings.length,);const highlightedFnType=Object.assign({},fnType,{generics:highlightedGenerics,bindings:new Map([...fnType.bindings.entries()].map(([k,v])=>{return[k,highlightedGenerics.splice(0,v.length)]})),});return passesUnification.toSpliced(i,generics.length+bindings.length,highlightedFnType,)}}return null}function unifyGenericTypes(fnTypesIn,queryElems,whereClause,mgensIn,solutionCb,unboxingDepth,){if(unboxingDepth>=UNBOXING_LIMIT){return null}const mgens=mgensIn===null?null:new Map(mgensIn);if(queryElems.length===0){return solutionCb(mgens)?fnTypesIn:null}if(!fnTypesIn||fnTypesIn.length===0){return null}const fnType=fnTypesIn[0];const queryElem=queryElems[0];if(unifyFunctionTypeIsMatchCandidate(fnType,queryElem,mgens)){if(fnType.id<0&&queryElem.id<0){if(!mgens||!mgens.has(queryElem.id)||mgens.get(queryElem.id)===fnType.id){const mgensScratch=new Map(mgens);mgensScratch.set(queryElem.id,fnType.id);const fnTypesRemaining=unifyGenericTypes(fnTypesIn.slice(1),queryElems.slice(1),whereClause,mgensScratch,solutionCb,unboxingDepth,);if(fnTypesRemaining){const highlighted=[fnType,...fnTypesRemaining];highlighted[0]=Object.assign({highlighted:true,},fnType,{generics:whereClause[-1-fnType.id],});return highlighted}}}else{let unifiedGenerics;const fnTypesRemaining=unifyGenericTypes(fnTypesIn.slice(1),queryElems.slice(1),whereClause,mgens,mgensScratch=>{const solution=unifyFunctionTypeCheckBindings(fnType,queryElem,whereClause,mgensScratch,unboxingDepth,);if(!solution){return false}const simplifiedGenerics=solution.simplifiedGenerics;for(const simplifiedMgens of solution.mgens){unifiedGenerics=unifyGenericTypes(simplifiedGenerics,queryElem.generics,whereClause,simplifiedMgens,solutionCb,unboxingDepth,);if(unifiedGenerics!==null){return true}}},unboxingDepth,);if(fnTypesRemaining){const highlighted=[fnType,...fnTypesRemaining];highlighted[0]=Object.assign({highlighted:true,},fnType,{generics:unifiedGenerics||fnType.generics,});return highlighted}}}if(unifyFunctionTypeIsUnboxCandidate(fnType,queryElem,whereClause,mgens,unboxingDepth+1,)){let highlightedRemaining;if(fnType.id<0){const highlightedGenerics=unifyFunctionTypes(whereClause[(-fnType.id)-1],[queryElem],whereClause,mgens,mgensScratch=>{const hl=unifyGenericTypes(fnTypesIn.slice(1),queryElems.slice(1),whereClause,mgensScratch,solutionCb,unboxingDepth,);if(hl){highlightedRemaining=hl}return hl},unboxingDepth+1,);if(highlightedGenerics){return[Object.assign({highlighted:true,},fnType,{generics:highlightedGenerics,}),...highlightedRemaining]}}else{const highlightedGenerics=unifyGenericTypes([...Array.from(fnType.bindings.values()).flat(),...fnType.generics,],[queryElem],whereClause,mgens,mgensScratch=>{const hl=unifyGenericTypes(fnTypesIn.slice(1),queryElems.slice(1),whereClause,mgensScratch,solutionCb,unboxingDepth,);if(hl){highlightedRemaining=hl}return hl},unboxingDepth+1,);if(highlightedGenerics){return[Object.assign({},fnType,{generics:highlightedGenerics,bindings:new Map([...fnType.bindings.entries()].map(([k,v])=>{return[k,highlightedGenerics.splice(0,v.length)]})),}),...highlightedRemaining]}}}return null}const unifyFunctionTypeIsMatchCandidate=(fnType,queryElem,mgensIn)=>{if(!typePassesFilter(queryElem.typeFilter,fnType.ty)){return false}if(fnType.id<0&&queryElem.id<0){if(mgensIn&&mgensIn.has(queryElem.id)&&mgensIn.get(queryElem.id)!==fnType.id){return false}return true}else{if(queryElem.id===this.typeNameIdOfArrayOrSlice&&(fnType.id===this.typeNameIdOfSlice||fnType.id===this.typeNameIdOfArray)){}else if(queryElem.id===this.typeNameIdOfTupleOrUnit&&(fnType.id===this.typeNameIdOfTuple||fnType.id===this.typeNameIdOfUnit)){}else if(queryElem.id===this.typeNameIdOfHof&&(fnType.id===this.typeNameIdOfFn||fnType.id===this.typeNameIdOfFnMut||fnType.id===this.typeNameIdOfFnOnce)){}else if(fnType.id!==queryElem.id||queryElem.id===null){return false}if((fnType.generics.length+fnType.bindings.size)===0&&queryElem.generics.length!==0){return false}if(fnType.bindings.size0){const fnTypePath=fnType.path!==undefined&&fnType.path!==null?fnType.path.split("::"):[];if(queryElemPathLength>fnTypePath.length){return false}let i=0;for(const path of fnTypePath){if(path===queryElem.pathWithoutLast[i]){i+=1;if(i>=queryElemPathLength){break}}}if(i0){let mgensSolutionSet=[mgensIn];for(const[name,constraints]of queryElem.bindings.entries()){if(mgensSolutionSet.length===0){return false}if(!fnType.bindings.has(name)){return false}const fnTypeBindings=fnType.bindings.get(name);mgensSolutionSet=mgensSolutionSet.flatMap(mgens=>{const newSolutions=[];unifyFunctionTypes(fnTypeBindings,constraints,whereClause,mgens,newMgens=>{newSolutions.push(newMgens);return false},unboxingDepth,);return newSolutions})}if(mgensSolutionSet.length===0){return false}const binds=Array.from(fnType.bindings.entries()).flatMap(entry=>{const[name,constraints]=entry;if(queryElem.bindings.has(name)){return[]}else{return constraints}});if(simplifiedGenerics.length>0){simplifiedGenerics=[...binds,...simplifiedGenerics]}else{simplifiedGenerics=binds}return{simplifiedGenerics,mgens:mgensSolutionSet}}return{simplifiedGenerics,mgens:[mgensIn]}}function unifyFunctionTypeIsUnboxCandidate(fnType,queryElem,whereClause,mgens,unboxingDepth,){if(unboxingDepth>=UNBOXING_LIMIT){return false}if(fnType.id<0){if(!whereClause){return false}return checkIfInList(whereClause[(-fnType.id)-1],queryElem,whereClause,mgens,unboxingDepth,)}else if(fnType.unboxFlag&&(fnType.generics.length>0||fnType.bindings.size>0)){const simplifiedGenerics=[...fnType.generics,...Array.from(fnType.bindings.values()).flat(),];return checkIfInList(simplifiedGenerics,queryElem,whereClause,mgens,unboxingDepth,)}return false}function checkIfInList(list,elem,whereClause,mgens,unboxingDepth){for(const entry of list){if(checkType(entry,elem,whereClause,mgens,unboxingDepth)){return true}}return false}const checkType=(row,elem,whereClause,mgens,unboxingDepth)=>{if(unboxingDepth>=UNBOXING_LIMIT){return false}if(row.id>0&&elem.id>0&&elem.pathWithoutLast.length===0&&row.generics.length===0&&elem.generics.length===0&&row.bindings.size===0&&elem.bindings.size===0&&elem.id!==this.typeNameIdOfArrayOrSlice&&elem.id!==this.typeNameIdOfHof&&elem.id!==this.typeNameIdOfTupleOrUnit){return row.id===elem.id&&typePassesFilter(elem.typeFilter,row.ty)}else{return unifyFunctionTypes([row],[elem],whereClause,mgens,()=>true,unboxingDepth,)}};const checkTypeMgensForConflict=mgens=>{if(!mgens){return true}const fnTypes=new Set();for(const[_qid,fid]of mgens){if(fnTypes.has(fid)){return false}fnTypes.add(fid)}return true};function checkPath(contains,ty){if(contains.length===0){return 0}const maxPathEditDistance=Math.floor(contains.reduce((acc,next)=>acc+next.length,0)/3,);let ret_dist=maxPathEditDistance+1;const path=ty.path.split("::");if(ty.parent&&ty.parent.name){path.push(ty.parent.name.toLowerCase())}const length=path.length;const clength=contains.length;pathiter:for(let i=length-clength;i>=0;i-=1){let dist_total=0;for(let x=0;xmaxPathEditDistance){continue pathiter}dist_total+=dist}}ret_dist=Math.min(ret_dist,Math.round(dist_total/clength))}return ret_dist>maxPathEditDistance?null:ret_dist}function typePassesFilter(filter,type){if(filter<=NO_TYPE_FILTER||filter===type)return true;const name=itemTypes[type];switch(itemTypes[filter]){case"constant":return name==="associatedconstant";case"fn":return name==="method"||name==="tymethod";case"type":return name==="primitive"||name==="associatedtype";case"trait":return name==="traitalias"}return false}function createAliasFromItem(item){return{crate:item.crate,name:item.name,path:item.path,descShard:item.descShard,descIndex:item.descIndex,exactPath:item.exactPath,ty:item.ty,parent:item.parent,type:item.type,is_alias:true,bitIndex:item.bitIndex,implDisambiguator:item.implDisambiguator,}}const handleAliases=async(ret,query,filterCrates,currentCrate)=>{const lowerQuery=query.toLowerCase();const aliases=[];const crateAliases=[];if(filterCrates!==null){if(this.ALIASES.has(filterCrates)&&this.ALIASES.get(filterCrates).has(lowerQuery)){const query_aliases=this.ALIASES.get(filterCrates).get(lowerQuery);for(const alias of query_aliases){aliases.push(createAliasFromItem(this.searchIndex[alias]))}}}else{for(const[crate,crateAliasesIndex]of this.ALIASES){if(crateAliasesIndex.has(lowerQuery)){const pushTo=crate===currentCrate?crateAliases:aliases;const query_aliases=crateAliasesIndex.get(lowerQuery);for(const alias of query_aliases){pushTo.push(createAliasFromItem(this.searchIndex[alias]))}}}}const sortFunc=(aaa,bbb)=>{if(aaa.path{return this.searchIndexEmptyDesc.get(alias.crate).contains(alias.bitIndex)?"":this.searchState.loadDesc(alias)};const[crateDescs,descs]=await Promise.all([Promise.all(crateAliases.map(fetchDesc)),Promise.all(aliases.map(fetchDesc)),]);const pushFunc=alias=>{alias.alias=query;const res=buildHrefAndPath(alias);alias.displayPath=pathSplitter(res[0]);alias.fullPath=alias.displayPath+alias.name;alias.href=res[1];ret.others.unshift(alias);if(ret.others.length>MAX_RESULTS){ret.others.pop()}};aliases.forEach((alias,i)=>{alias.desc=descs[i]});aliases.forEach(pushFunc);crateAliases.forEach((alias,i)=>{alias.desc=crateDescs[i]});crateAliases.forEach(pushFunc)};function addIntoResults(results,fullId,id,index,dist,path_dist,maxEditDistance){if(dist<=maxEditDistance||index!==-1){if(results.has(fullId)){const result=results.get(fullId);if(result.dontValidate||result.dist<=dist){return}}results.set(fullId,{id:id,index:index,dontValidate:parsedQuery.literalSearch,dist:dist,path_dist:path_dist,})}}function handleArgs(row,pos,results){if(!row||(filterCrates!==null&&row.crate!==filterCrates)||!row.type){return}const tfpDist=compareTypeFingerprints(row.id,parsedQuery.typeFingerprint,);if(tfpDist===null){return}if(results.size>=MAX_RESULTS&&tfpDist>results.max_dist){return}if(!unifyFunctionTypes(row.type.inputs,parsedQuery.elems,row.type.where_clause,null,mgens=>{return unifyFunctionTypes(row.type.output,parsedQuery.returned,row.type.where_clause,mgens,checkTypeMgensForConflict,0,)},0,)){return}results.max_dist=Math.max(results.max_dist||0,tfpDist);addIntoResults(results,row.id,pos,0,tfpDist,0,Number.MAX_VALUE)}const compareTypeFingerprints=(fullId,queryFingerprint)=>{const fh0=this.functionTypeFingerprint[fullId*4];const fh1=this.functionTypeFingerprint[(fullId*4)+1];const fh2=this.functionTypeFingerprint[(fullId*4)+2];const[qh0,qh1,qh2]=queryFingerprint;const[in0,in1,in2]=[fh0&qh0,fh1&qh1,fh2&qh2];if((in0 ^ qh0)||(in1 ^ qh1)||(in2 ^ qh2)){return null}return this.functionTypeFingerprint[(fullId*4)+3]};const innerRunQuery=()=>{const queryLen=parsedQuery.elems.reduce((acc,next)=>acc+next.pathLast.length,0)+parsedQuery.returned.reduce((acc,next)=>acc+next.pathLast.length,0);const maxEditDistance=Math.floor(queryLen/3);const genericSymbols=new Map();const convertNameToId=(elem,isAssocType)=>{const loweredName=elem.pathLast.toLowerCase();if(this.typeNameIdMap.has(loweredName)&&(isAssocType||!this.typeNameIdMap.get(loweredName).assocOnly)){elem.id=this.typeNameIdMap.get(loweredName).id}else if(!parsedQuery.literalSearch){let match=null;let matchDist=maxEditDistance+1;let matchName="";for(const[name,{id,assocOnly}]of this.typeNameIdMap){const dist=Math.min(editDistance(name,loweredName,maxEditDistance),editDistance(name,elem.normalizedPathLast,maxEditDistance),);if(dist<=matchDist&&dist<=maxEditDistance&&(isAssocType||!assocOnly)){if(dist===matchDist&&matchName>name){continue}match=id;matchDist=dist;matchName=name}}if(match!==null){parsedQuery.correction=matchName}elem.id=match}if((elem.id===null&&parsedQuery.totalElems>1&&elem.typeFilter===-1&&elem.generics.length===0&&elem.bindings.size===0)||elem.typeFilter===TY_GENERIC){if(genericSymbols.has(elem.normalizedPathLast)){elem.id=genericSymbols.get(elem.normalizedPathLast)}else{elem.id=-(genericSymbols.size+1);genericSymbols.set(elem.normalizedPathLast,elem.id)}if(elem.typeFilter===-1&&elem.normalizedPathLast.length>=3){const maxPartDistance=Math.floor(elem.normalizedPathLast.length/3);let matchDist=maxPartDistance+1;let matchName="";for(const name of this.typeNameIdMap.keys()){const dist=editDistance(name,elem.normalizedPathLast,maxPartDistance,);if(dist<=matchDist&&dist<=maxPartDistance){if(dist===matchDist&&matchName>name){continue}matchDist=dist;matchName=name}}if(matchName!==""){parsedQuery.proposeCorrectionFrom=elem.name;parsedQuery.proposeCorrectionTo=matchName}}elem.typeFilter=TY_GENERIC}if(elem.generics.length>0&&elem.typeFilter===TY_GENERIC){parsedQuery.error=["Generic type parameter ",elem.name," does not accept generic parameters",]}for(const elem2 of elem.generics){convertNameToId(elem2)}elem.bindings=new Map(Array.from(elem.bindings.entries()).map(entry=>{const[name,constraints]=entry;if(!this.typeNameIdMap.has(name)){parsedQuery.error=["Type parameter ",name," does not exist",];return[null,[]]}for(const elem2 of constraints){convertNameToId(elem2)}return[this.typeNameIdMap.get(name).id,constraints]}),)};for(const elem of parsedQuery.elems){convertNameToId(elem);this.buildFunctionTypeFingerprint(elem,parsedQuery.typeFingerprint)}for(const elem of parsedQuery.returned){convertNameToId(elem);this.buildFunctionTypeFingerprint(elem,parsedQuery.typeFingerprint)}if(parsedQuery.foundElems===1&&!parsedQuery.hasReturnArrow){const elem=parsedQuery.elems[0];const handleNameSearch=id=>{const row=this.searchIndex[id];if(!typePassesFilter(elem.typeFilter,row.ty)||(filterCrates!==null&&row.crate!==filterCrates)){return}let pathDist=0;if(elem.fullPath.length>1){pathDist=checkPath(elem.pathWithoutLast,row);if(pathDist===null){return}}if(parsedQuery.literalSearch){if(row.word===elem.pathLast){addIntoResults(results_others,row.id,id,0,0,pathDist)}}else{addIntoResults(results_others,row.id,id,row.normalizedName.indexOf(elem.normalizedPathLast),editDistance(row.normalizedName,elem.normalizedPathLast,maxEditDistance,),pathDist,maxEditDistance,)}};if(elem.normalizedPathLast!==""){const last=elem.normalizedPathLast;for(const id of this.nameTrie.search(last,this.tailTable)){handleNameSearch(id)}}const length=this.searchIndex.length;for(let i=0,nSearchIndex=length;i0){const sortQ=(a,b)=>{const ag=a.generics.length===0&&a.bindings.size===0;const bg=b.generics.length===0&&b.bindings.size===0;if(ag!==bg){return ag-bg}const ai=a.id>0;const bi=b.id>0;return ai-bi};parsedQuery.elems.sort(sortQ);parsedQuery.returned.sort(sortQ);for(let i=0,nSearchIndex=this.searchIndex.length;i{const descs=await Promise.all(list.map(result=>{return this.searchIndexEmptyDesc.get(result.crate).contains(result.bitIndex)?"":this.searchState.loadDesc(result)}));for(const[i,result]of list.entries()){result.desc=descs[i]}}));if(parsedQuery.error!==null&&ret.others.length!==0){ret.query.error=null}return ret}}let rawSearchIndex;let docSearch;const longItemTypes=["keyword","primitive type","module","extern crate","re-export","struct","enum","function","type alias","static","trait","","trait method","method","struct field","enum variant","macro","assoc type","constant","assoc const","union","foreign type","existential type","attribute macro","derive macro","trait alias",];let currentResults;function printTab(nb){let iter=0;let foundCurrentTab=false;let foundCurrentResultSet=false;onEachLazy(document.getElementById("search-tabs").childNodes,elem=>{if(nb===iter){addClass(elem,"selected");foundCurrentTab=true}else{removeClass(elem,"selected")}iter+=1});const isTypeSearch=(nb>0||iter===1);iter=0;onEachLazy(document.getElementById("results").childNodes,elem=>{if(nb===iter){addClass(elem,"active");foundCurrentResultSet=true}else{removeClass(elem,"active")}iter+=1});if(foundCurrentTab&&foundCurrentResultSet){searchState.currentTab=nb;const correctionsElem=document.getElementsByClassName("search-corrections");if(isTypeSearch){removeClass(correctionsElem[0],"hidden")}else{addClass(correctionsElem[0],"hidden")}}else if(nb!==0){printTab(0)}}function buildUrl(search,filterCrates){let extra="?search="+encodeURIComponent(search);if(filterCrates!==null){extra+="&filter-crate="+encodeURIComponent(filterCrates)}return getNakedUrl()+extra+window.location.hash}function getFilterCrates(){const elem=document.getElementById("crate-search");if(elem&&elem.value!=="all crates"&&window.searchIndex.has(elem.value)){return elem.value}return null}function nextTab(direction){const next=(searchState.currentTab+direction+3)%searchState.focusedByTab.length;searchState.focusedByTab[searchState.currentTab]=document.activeElement;printTab(next);focusSearchResult()}function focusSearchResult(){const target=searchState.focusedByTab[searchState.currentTab]||document.querySelectorAll(".search-results.active a").item(0)||document.querySelectorAll("#search-tabs button").item(searchState.currentTab);searchState.focusedByTab[searchState.currentTab]=null;if(target){target.focus()}}async function addTab(array,query,display){const extraClass=display?" active":"";const output=document.createElement(array.length===0&&query.error===null?"div":"ul",);if(array.length>0){output.className="search-results "+extraClass;const lis=Promise.all(array.map(async item=>{const name=item.name;const type=itemTypes[item.ty];const longType=longItemTypes[item.ty];const typeName=longType.length!==0?`${longType}`:"?";const link=document.createElement("a");link.className="result-"+type;link.href=item.href;const resultName=document.createElement("span");resultName.className="result-name";resultName.insertAdjacentHTML("beforeend",`${typeName}`);link.appendChild(resultName);let alias=" ";if(item.is_alias){alias=` 
    \
+"use strict";if(!Array.prototype.toSpliced){Array.prototype.toSpliced=function(){const me=this.slice();Array.prototype.splice.apply(me,arguments);return me}}function onEachBtwn(arr,func,funcBtwn){let skipped=true;for(const value of arr){if(!skipped){funcBtwn(value)}skipped=func(value)}}const itemTypes=["keyword","primitive","mod","externcrate","import","struct","enum","fn","type","static","trait","impl","tymethod","method","structfield","variant","macro","associatedtype","constant","associatedconstant","union","foreigntype","existential","attr","derive","traitalias","generic",];const TY_PRIMITIVE=itemTypes.indexOf("primitive");const TY_GENERIC=itemTypes.indexOf("generic");const TY_IMPORT=itemTypes.indexOf("import");const TY_TRAIT=itemTypes.indexOf("trait");const ROOT_PATH=typeof window!=="undefined"?window.rootPath:"../";const UNBOXING_LIMIT=5;const REGEX_IDENT=/\p{ID_Start}\p{ID_Continue}*|_\p{ID_Continue}+/uy;const REGEX_INVALID_TYPE_FILTER=/[^a-z]/ui;const MAX_RESULTS=200;const NO_TYPE_FILTER=-1;const editDistanceState={current:[],prev:[],prevPrev:[],calculate:function calculate(a,b,limit){if(a.lengthlimit){return limit+1}while(b.length>0&&b[0]===a[0]){a=a.substring(1);b=b.substring(1)}while(b.length>0&&b[b.length-1]===a[a.length-1]){a=a.substring(0,a.length-1);b=b.substring(0,b.length-1)}if(b.length===0){return minDist}const aLength=a.length;const bLength=b.length;for(let i=0;i<=bLength;++i){this.current[i]=0;this.prev[i]=i;this.prevPrev[i]=Number.MAX_VALUE}for(let i=1;i<=aLength;++i){this.current[0]=i;const aIdx=i-1;for(let j=1;j<=bLength;++j){const bIdx=j-1;const substitutionCost=a[aIdx]===b[bIdx]?0:1;this.current[j]=Math.min(this.prev[j]+1,this.current[j-1]+1,this.prev[j-1]+substitutionCost,);if((i>1)&&(j>1)&&(a[aIdx]===b[bIdx-1])&&(a[aIdx-1]===b[bIdx])){this.current[j]=Math.min(this.current[j],this.prevPrev[j-2]+1,)}}const prevPrevTmp=this.prevPrev;this.prevPrev=this.prev;this.prev=this.current;this.current=prevPrevTmp}const distance=this.prev[bLength];return distance<=limit?distance:(limit+1)},};function editDistance(a,b,limit){return editDistanceState.calculate(a,b,limit)}function isEndCharacter(c){return"=,>-])".indexOf(c)!==-1}function isSeparatorCharacter(c){return c===","||c==="="}function isReturnArrow(parserState){return parserState.userQuery.slice(parserState.pos,parserState.pos+2)==="->"}function skipWhitespace(parserState){while(parserState.pos0){const c=parserState.userQuery[pos-1];if(c===lookingFor){return true}else if(c!==" "){break}pos-=1}return false}function isLastElemGeneric(elems,parserState){return(elems.length>0&&elems[elems.length-1].generics.length>0)||prevIs(parserState,">")}function getFilteredNextElem(query,parserState,elems,isInGenerics){const start=parserState.pos;if(parserState.userQuery[parserState.pos]===":"&&!isPathStart(parserState)){throw["Expected type filter before ",":"]}getNextElem(query,parserState,elems,isInGenerics);if(parserState.userQuery[parserState.pos]===":"&&!isPathStart(parserState)){if(parserState.typeFilter!==null){throw["Unexpected ",":"," (expected path after type filter ",parserState.typeFilter+":",")",]}if(elems.length===0){throw["Expected type filter before ",":"]}else if(query.literalSearch){throw["Cannot use quotes on type filter"]}const typeFilterElem=elems.pop();checkExtraTypeFilterCharacters(start,parserState);parserState.typeFilter=typeFilterElem.normalizedPathLast;parserState.pos+=1;parserState.totalElems-=1;query.literalSearch=false;getNextElem(query,parserState,elems,isInGenerics)}}function getItemsBefore(query,parserState,elems,endChar){let foundStopChar=true;let foundSeparator=false;const oldTypeFilter=parserState.typeFilter;parserState.typeFilter=null;const oldIsInBinding=parserState.isInBinding;parserState.isInBinding=null;let hofParameters=null;let extra="";if(endChar===">"){extra="<"}else if(endChar==="]"){extra="["}else if(endChar===")"){extra="("}else if(endChar===""){extra="->"}else{extra=endChar}while(parserState.pos"," after ","="]}hofParameters=[...elems];elems.length=0;parserState.pos+=2;foundStopChar=true;foundSeparator=false;continue}else if(c===" "){parserState.pos+=1;continue}else if(isSeparatorCharacter(c)){parserState.pos+=1;foundStopChar=true;foundSeparator=true;continue}else if(c===":"&&isPathStart(parserState)){throw["Unexpected ","::",": paths cannot start with ","::"]}else if(isEndCharacter(c)){throw["Unexpected ",c," after ",extra]}if(!foundStopChar){let extra=[];if(isLastElemGeneric(query.elems,parserState)){extra=[" after ",">"]}else if(prevIs(parserState,"\"")){throw["Cannot have more than one element if you use quotes"]}if(endChar!==""){throw["Expected ",",",", ","=",", or ",endChar,...extra,", found ",c,]}throw["Expected ",","," or ","=",...extra,", found ",c,]}const posBefore=parserState.pos;getFilteredNextElem(query,parserState,elems,endChar!=="");if(endChar!==""&&parserState.pos>=parserState.length){throw["Unclosed ",extra]}if(posBefore===parserState.pos){parserState.pos+=1}foundStopChar=false}if(parserState.pos>=parserState.length&&endChar!==""){throw["Unclosed ",extra]}parserState.pos+=1;if(hofParameters){foundSeparator=false;if([...elems,...hofParameters].some(x=>x.bindingName)||parserState.isInBinding){throw["Unexpected ","="," within ","->"]}const hofElem=makePrimitiveElement("->",{generics:hofParameters,bindings:new Map([["output",[...elems]]]),typeFilter:null,});elems.length=0;elems[0]=hofElem}parserState.typeFilter=oldTypeFilter;parserState.isInBinding=oldIsInBinding;return{foundSeparator}}function getNextElem(query,parserState,elems,isInGenerics){const generics=[];skipWhitespace(parserState);let start=parserState.pos;let end;if("[(".indexOf(parserState.userQuery[parserState.pos])!==-1){let endChar=")";let name="()";let friendlyName="tuple";if(parserState.userQuery[parserState.pos]==="["){endChar="]";name="[]";friendlyName="slice"}parserState.pos+=1;const{foundSeparator}=getItemsBefore(query,parserState,generics,endChar);const typeFilter=parserState.typeFilter;const bindingName=parserState.isInBinding;parserState.typeFilter=null;parserState.isInBinding=null;for(const gen of generics){if(gen.bindingName!==null){throw["Type parameter ","=",` cannot be within ${friendlyName} `,name]}}if(name==="()"&&!foundSeparator&&generics.length===1&&typeFilter===null){elems.push(generics[0])}else if(name==="()"&&generics.length===1&&generics[0].name==="->"){generics[0].typeFilter=typeFilter;elems.push(generics[0])}else{if(typeFilter!==null&&typeFilter!=="primitive"){throw["Invalid search type: primitive ",name," and ",typeFilter," both specified",]}parserState.totalElems+=1;if(isInGenerics){parserState.genericsElems+=1}elems.push(makePrimitiveElement(name,{bindingName,generics}))}}else if(parserState.userQuery[parserState.pos]==="&"){if(parserState.typeFilter!==null&&parserState.typeFilter!=="primitive"){throw["Invalid search type: primitive ","&"," and ",parserState.typeFilter," both specified",]}parserState.typeFilter=null;parserState.pos+=1;let c=parserState.userQuery[parserState.pos];while(c===" "&&parserState.pos=end){throw["Found generics without a path"]}parserState.pos+=1;getItemsBefore(query,parserState,generics,">")}else if(parserState.pos=end){throw["Found generics without a path"]}if(parserState.isInBinding){throw["Unexpected ","("," after ","="]}parserState.pos+=1;const typeFilter=parserState.typeFilter;parserState.typeFilter=null;getItemsBefore(query,parserState,generics,")");skipWhitespace(parserState);if(isReturnArrow(parserState)){parserState.pos+=2;skipWhitespace(parserState);getFilteredNextElem(query,parserState,generics,isInGenerics);generics[generics.length-1].bindingName=makePrimitiveElement("output")}else{generics.push(makePrimitiveElement(null,{bindingName:makePrimitiveElement("output"),typeFilter:null,}))}parserState.typeFilter=typeFilter}if(isStringElem){skipWhitespace(parserState)}if(start>=end&&generics.length===0){return}if(parserState.userQuery[parserState.pos]==="="){if(parserState.isInBinding){throw["Cannot write ","="," twice in a binding"]}if(!isInGenerics){throw["Type parameter ","="," must be within generics list"]}const name=parserState.userQuery.slice(start,end).trim();if(name==="!"){throw["Type parameter ","="," key cannot be ","!"," never type"]}if(name.includes("!")){throw["Type parameter ","="," key cannot be ","!"," macro"]}if(name.includes("::")){throw["Type parameter ","="," key cannot contain ","::"," path"]}if(name.includes(":")){throw["Type parameter ","="," key cannot contain ",":"," type"]}parserState.isInBinding={name,generics}}else{elems.push(createQueryElement(query,parserState,parserState.userQuery.slice(start,end),generics,isInGenerics,),)}}}function checkExtraTypeFilterCharacters(start,parserState){const query=parserState.userQuery.slice(start,parserState.pos).trim();const match=query.match(REGEX_INVALID_TYPE_FILTER);if(match){throw["Unexpected ",match[0]," in type filter (before ",":",")",]}}function createQueryElement(query,parserState,name,generics,isInGenerics){const path=name.trim();if(path.length===0&&generics.length===0){throw["Unexpected ",parserState.userQuery[parserState.pos]]}if(query.literalSearch&&parserState.totalElems-parserState.genericsElems>0){throw["Cannot have more than one element if you use quotes"]}const typeFilter=parserState.typeFilter;parserState.typeFilter=null;if(name.trim()==="!"){if(typeFilter!==null&&typeFilter!=="primitive"){throw["Invalid search type: primitive never type ","!"," and ",typeFilter," both specified",]}if(generics.length!==0){throw["Never type ","!"," does not accept generic parameters",]}const bindingName=parserState.isInBinding;parserState.isInBinding=null;return makePrimitiveElement("never",{bindingName})}const quadcolon=/::\s*::/.exec(path);if(path.startsWith("::")){throw["Paths cannot start with ","::"]}else if(quadcolon!==null){throw["Unexpected ",quadcolon[0]]}const pathSegments=path.split(/(?:::\s*)|(?:\s+(?:::\s*)?)/).map(x=>x.toLowerCase());if(pathSegments.length===0||(pathSegments.length===1&&pathSegments[0]==="")){if(generics.length>0||prevIs(parserState,">")){throw["Found generics without a path"]}else{throw["Unexpected ",parserState.userQuery[parserState.pos]]}}for(const[i,pathSegment]of pathSegments.entries()){if(pathSegment==="!"){if(i!==0){throw["Never type ","!"," is not associated item"]}pathSegments[i]="never"}}parserState.totalElems+=1;if(isInGenerics){parserState.genericsElems+=1}const bindingName=parserState.isInBinding;parserState.isInBinding=null;const bindings=new Map();const pathLast=pathSegments[pathSegments.length-1];return{name:name.trim(),id:null,fullPath:pathSegments,pathWithoutLast:pathSegments.slice(0,pathSegments.length-1),pathLast,normalizedPathLast:pathLast.replace(/_/g,""),generics:generics.filter(gen=>{if(gen.bindingName!==null){if(gen.name!==null){gen.bindingName.generics.unshift(gen)}bindings.set(gen.bindingName.name.toLowerCase().replace(/_/g,""),gen.bindingName.generics,);return false}return true}),bindings,typeFilter,bindingName,}}function makePrimitiveElement(name,extra){return Object.assign({name,id:null,fullPath:[name],pathWithoutLast:[],pathLast:name,normalizedPathLast:name,generics:[],bindings:new Map(),typeFilter:"primitive",bindingName:null,},extra)}function getStringElem(query,parserState,isInGenerics){if(isInGenerics){throw["Unexpected ","\""," in generics"]}else if(query.literalSearch){throw["Cannot have more than one literal search element"]}else if(parserState.totalElems-parserState.genericsElems>0){throw["Cannot use literal search when there is more than one element"]}parserState.pos+=1;const start=parserState.pos;const end=getIdentEndPosition(parserState);if(parserState.pos>=parserState.length){throw["Unclosed ","\""]}else if(parserState.userQuery[end]!=="\""){throw["Unexpected ",parserState.userQuery[end]," in a string element"]}else if(start===end){throw["Cannot have empty string element"]}parserState.pos+=1;query.literalSearch=true}function getIdentEndPosition(parserState){let afterIdent=consumeIdent(parserState);let end=parserState.pos;let macroExclamation=-1;while(parserState.pos0){throw["Unexpected ",c," after ",parserState.userQuery[parserState.pos-1]," (not a valid identifier)"]}else{throw["Unexpected ",c," (not a valid identifier)"]}parserState.pos+=1;afterIdent=consumeIdent(parserState);end=parserState.pos}if(macroExclamation!==-1){if(parserState.typeFilter===null){parserState.typeFilter="macro"}else if(parserState.typeFilter!=="macro"){throw["Invalid search type: macro ","!"," and ",parserState.typeFilter," both specified",]}end=macroExclamation}return end}function isSpecialStartCharacter(c){return"<\"".indexOf(c)!==-1}function isPathStart(parserState){return parserState.userQuery.slice(parserState.pos,parserState.pos+2)==="::"}function consumeIdent(parserState){REGEX_IDENT.lastIndex=parserState.pos;const match=parserState.userQuery.match(REGEX_IDENT);if(match){parserState.pos+=match[0].length;return true}return false}function isPathSeparator(c){return c===":"||c===" "}class VlqHexDecoder{constructor(string,cons){this.string=string;this.cons=cons;this.offset=0;this.backrefQueue=[]}decodeList(){let c=this.string.charCodeAt(this.offset);const ret=[];while(c!==125){ret.push(this.decode());c=this.string.charCodeAt(this.offset)}this.offset+=1;return ret}decode(){let n=0;let c=this.string.charCodeAt(this.offset);if(c===123){this.offset+=1;return this.decodeList()}while(c<96){n=(n<<4)|(c&0xF);this.offset+=1;c=this.string.charCodeAt(this.offset)}n=(n<<4)|(c&0xF);const[sign,value]=[n&1,n>>1];this.offset+=1;return sign?-value:value}next(){const c=this.string.charCodeAt(this.offset);if(c>=48&&c<64){this.offset+=1;return this.backrefQueue[c-48]}if(c===96){this.offset+=1;return this.cons(0)}const result=this.cons(this.decode());this.backrefQueue.unshift(result);if(this.backrefQueue.length>16){this.backrefQueue.pop()}return result}}class RoaringBitmap{constructor(str){const strdecoded=atob(str);const u8array=new Uint8Array(strdecoded.length);for(let j=0;j=4){offsets=[];for(let j=0;j>3]&(1<<(j&0x7))){const runcount=(u8array[i]|(u8array[i+1]<<8));i+=2;this.containers.push(new RoaringBitmapRun(runcount,u8array.slice(i,i+(runcount*4)),));i+=runcount*4}else if(this.cardinalities[j]>=4096){this.containers.push(new RoaringBitmapBits(u8array.slice(i,i+8192)));i+=8192}else{const end=this.cardinalities[j]*2;this.containers.push(new RoaringBitmapArray(this.cardinalities[j],u8array.slice(i,i+end),));i+=end}}}contains(keyvalue){const key=keyvalue>>16;const value=keyvalue&0xFFFF;let left=0;let right=this.keys.length-1;while(left<=right){const mid=Math.floor((left+right)/2);const x=this.keys[mid];if(xkey){right=mid-1}else{return this.containers[mid].contains(value)}}return false}}class RoaringBitmapRun{constructor(runcount,array){this.runcount=runcount;this.array=array}contains(value){let left=0;let right=this.runcount-1;while(left<=right){const mid=Math.floor((left+right)/2);const i=mid*4;const start=this.array[i]|(this.array[i+1]<<8);const lenm1=this.array[i+2]|(this.array[i+3]<<8);if((start+lenm1)value){right=mid-1}else{return true}}return false}}class RoaringBitmapArray{constructor(cardinality,array){this.cardinality=cardinality;this.array=array}contains(value){let left=0;let right=this.cardinality-1;while(left<=right){const mid=Math.floor((left+right)/2);const i=mid*2;const x=this.array[i]|(this.array[i+1]<<8);if(xvalue){right=mid-1}else{return true}}return false}}class RoaringBitmapBits{constructor(array){this.array=array}contains(value){return!!(this.array[value>>3]&(1<<(value&7)))}}class NameTrie{constructor(){this.children=[];this.matches=[]}insert(name,id,tailTable){this.insertSubstring(name,0,id,tailTable)}insertSubstring(name,substart,id,tailTable){const l=name.length;if(substart===l){this.matches.push(id)}else{const sb=name.charCodeAt(substart);let child;if(this.children[sb]!==undefined){child=this.children[sb]}else{child=new NameTrie();this.children[sb]=child;let sste;if(substart>=2){const tail=name.substring(substart-2,substart+1);if(tailTable.has(tail)){sste=tailTable.get(tail)}else{sste=[];tailTable.set(tail,sste)}sste.push(child)}}child.insertSubstring(name,substart+1,id,tailTable)}}search(name,tailTable){const results=new Set();this.searchSubstringPrefix(name,0,results);if(results.size=3){const levParams=name.length>=6?new Lev2TParametricDescription(name.length):new Lev1TParametricDescription(name.length);this.searchLev(name,0,levParams,results);const tail=name.substring(0,3);if(tailTable.has(tail)){for(const entry of tailTable.get(tail)){entry.searchSubstringPrefix(name,3,results)}}}return[...results]}searchSubstringPrefix(name,substart,results){const l=name.length;if(substart===l){for(const match of this.matches){results.add(match)}let unprocessedChildren=[];for(const child of this.children){if(child){unprocessedChildren.push(child)}}let nextSet=[];while(unprocessedChildren.length!==0){const next=unprocessedChildren.pop();for(const child of next.children){if(child){nextSet.push(child)}}for(const match of next.matches){results.add(match)}if(unprocessedChildren.length===0){const tmp=unprocessedChildren;unprocessedChildren=nextSet;nextSet=tmp}}}else{const sb=name.charCodeAt(substart);if(this.children[sb]!==undefined){this.children[sb].searchSubstringPrefix(name,substart+1,results)}}}searchLev(name,substart,levParams,results){const stack=[[this,0]];const n=levParams.n;while(stack.length!==0){const[trie,levState]=stack.pop();for(const[charCode,child]of trie.children.entries()){if(!child){continue}const levPos=levParams.getPosition(levState);const vector=levParams.getVector(name,charCode,levPos,Math.min(name.length,levPos+(2*n)+1),);const newLevState=levParams.transition(levState,levPos,vector,);if(newLevState>=0){stack.push([child,newLevState]);if(levParams.isAccept(newLevState)){for(const match of child.matches){results.add(match)}}}}}}}class DocSearch{constructor(rawSearchIndex,rootPath,searchState){this.searchIndexDeprecated=new Map();this.searchIndexEmptyDesc=new Map();this.functionTypeFingerprint=null;this.typeNameIdMap=new Map();this.assocTypeIdNameMap=new Map();this.ALIASES=new Map();this.rootPath=rootPath;this.searchState=searchState;this.typeNameIdOfArray=this.buildTypeMapIndex("array");this.typeNameIdOfSlice=this.buildTypeMapIndex("slice");this.typeNameIdOfArrayOrSlice=this.buildTypeMapIndex("[]");this.typeNameIdOfTuple=this.buildTypeMapIndex("tuple");this.typeNameIdOfUnit=this.buildTypeMapIndex("unit");this.typeNameIdOfTupleOrUnit=this.buildTypeMapIndex("()");this.typeNameIdOfFn=this.buildTypeMapIndex("fn");this.typeNameIdOfFnMut=this.buildTypeMapIndex("fnmut");this.typeNameIdOfFnOnce=this.buildTypeMapIndex("fnonce");this.typeNameIdOfHof=this.buildTypeMapIndex("->");this.typeNameIdOfOutput=this.buildTypeMapIndex("output",true);this.typeNameIdOfReference=this.buildTypeMapIndex("reference");this.EMPTY_BINDINGS_MAP=new Map();this.EMPTY_GENERICS_ARRAY=[];this.TYPES_POOL=new Map();this.nameTrie=new NameTrie();this.tailTable=new Map();this.searchIndex=this.buildIndex(rawSearchIndex)}buildTypeMapIndex(name,isAssocType){if(name===""||name===null){return null}if(this.typeNameIdMap.has(name)){const obj=this.typeNameIdMap.get(name);obj.assocOnly=isAssocType&&obj.assocOnly;return obj.id}else{const id=this.typeNameIdMap.size;this.typeNameIdMap.set(name,{id,assocOnly:isAssocType});return id}}buildItemSearchTypeAll(types,paths,lowercasePaths){return types.length>0?types.map(type=>this.buildItemSearchType(type,paths,lowercasePaths)):this.EMPTY_GENERICS_ARRAY}buildItemSearchType(type,paths,lowercasePaths,isAssocType){const PATH_INDEX_DATA=0;const GENERICS_DATA=1;const BINDINGS_DATA=2;let pathIndex,generics,bindings;if(typeof type==="number"){pathIndex=type;generics=this.EMPTY_GENERICS_ARRAY;bindings=this.EMPTY_BINDINGS_MAP}else{pathIndex=type[PATH_INDEX_DATA];generics=this.buildItemSearchTypeAll(type[GENERICS_DATA],paths,lowercasePaths,);if(type.length>BINDINGS_DATA&&type[BINDINGS_DATA].length>0){bindings=new Map(type[BINDINGS_DATA].map(binding=>{const[assocType,constraints]=binding;return[this.buildItemSearchType(assocType,paths,lowercasePaths,true).id,this.buildItemSearchTypeAll(constraints,paths,lowercasePaths),]}))}else{bindings=this.EMPTY_BINDINGS_MAP}}let result;if(pathIndex<0){result={id:pathIndex,name:"",ty:TY_GENERIC,path:null,exactPath:null,generics,bindings,unboxFlag:true,}}else if(pathIndex===0){result={id:null,name:"",ty:null,path:null,exactPath:null,generics,bindings,unboxFlag:true,}}else{const item=lowercasePaths[pathIndex-1];const id=this.buildTypeMapIndex(item.name,isAssocType);if(isAssocType){this.assocTypeIdNameMap.set(id,paths[pathIndex-1].name)}result={id,name:paths[pathIndex-1].name,ty:item.ty,path:item.path,exactPath:item.exactPath,generics,bindings,unboxFlag:item.unboxFlag,}}const cr=this.TYPES_POOL.get(result.id);if(cr){if(cr.generics.length===result.generics.length&&cr.generics!==result.generics&&cr.generics.every((x,i)=>result.generics[i]===x)){result.generics=cr.generics}if(cr.bindings.size===result.bindings.size&&cr.bindings!==result.bindings){let ok=true;for(const[k,v]of cr.bindings.entries()){const v2=result.bindings.get(v);if(!v2){ok=false;break}if(v!==v2&&v.length===v2.length&&v.every((x,i)=>v2[i]===x)){result.bindings.set(k,v)}else if(v!==v2){ok=false;break}}if(ok){result.bindings=cr.bindings}}if(cr.ty===result.ty&&cr.path===result.path&&cr.bindings===result.bindings&&cr.generics===result.generics&&cr.ty===result.ty&&cr.name===result.name&&cr.unboxFlag===result.unboxFlag){return cr}}this.TYPES_POOL.set(result.id,result);return result}buildFunctionTypeFingerprint(type,output){let input=type.id;if(input===this.typeNameIdOfArray||input===this.typeNameIdOfSlice){input=this.typeNameIdOfArrayOrSlice}if(input===this.typeNameIdOfTuple||input===this.typeNameIdOfUnit){input=this.typeNameIdOfTupleOrUnit}if(input===this.typeNameIdOfFn||input===this.typeNameIdOfFnMut||input===this.typeNameIdOfFnOnce){input=this.typeNameIdOfHof}const hashint1=k=>{k=(~~k+0x7ed55d16)+(k<<12);k=(k ^ 0xc761c23c)^(k>>>19);k=(~~k+0x165667b1)+(k<<5);k=(~~k+0xd3a2646c)^(k<<9);k=(~~k+0xfd7046c5)+(k<<3);return(k ^ 0xb55a4f09)^(k>>>16)};const hashint2=k=>{k=~k+(k<<15);k ^=k>>>12;k+=k<<2;k ^=k>>>4;k=Math.imul(k,2057);return k ^(k>>16)};if(input!==null){const h0a=hashint1(input);const h0b=hashint2(input);const h1a=~~(h0a+Math.imul(h0b,2));const h1b=~~(h0a+Math.imul(h0b,3));const h2a=~~(h0a+Math.imul(h0b,4));const h2b=~~(h0a+Math.imul(h0b,5));output[0]|=(1<<(h0a%32))|(1<<(h1b%32));output[1]|=(1<<(h1a%32))|(1<<(h2b%32));output[2]|=(1<<(h2a%32))|(1<<(h0b%32));output[3]+=1}for(const g of type.generics){this.buildFunctionTypeFingerprint(g,output)}const fb={id:null,ty:0,generics:this.EMPTY_GENERICS_ARRAY,bindings:this.EMPTY_BINDINGS_MAP,};for(const[k,v]of type.bindings.entries()){fb.id=k;fb.generics=v;this.buildFunctionTypeFingerprint(fb,output)}}buildIndex(rawSearchIndex){const buildFunctionSearchTypeCallback=(paths,lowercasePaths)=>{return functionSearchType=>{if(functionSearchType===0){return null}const INPUTS_DATA=0;const OUTPUT_DATA=1;let inputs,output;if(typeof functionSearchType[INPUTS_DATA]==="number"){inputs=[this.buildItemSearchType(functionSearchType[INPUTS_DATA],paths,lowercasePaths,),]}else{inputs=this.buildItemSearchTypeAll(functionSearchType[INPUTS_DATA],paths,lowercasePaths,)}if(functionSearchType.length>1){if(typeof functionSearchType[OUTPUT_DATA]==="number"){output=[this.buildItemSearchType(functionSearchType[OUTPUT_DATA],paths,lowercasePaths,),]}else{output=this.buildItemSearchTypeAll(functionSearchType[OUTPUT_DATA],paths,lowercasePaths,)}}else{output=[]}const where_clause=[];const l=functionSearchType.length;for(let i=2;inoop);let descShard={crate,shard:0,start:0,len:itemDescShardDecoder.next(),promise:null,resolve:null,};const descShardList=[descShard];this.searchIndexDeprecated.set(crate,new RoaringBitmap(crateCorpus.c));this.searchIndexEmptyDesc.set(crate,new RoaringBitmap(crateCorpus.e));let descIndex=0;let lastParamNames=[];let normalizedName=crate.indexOf("_")===-1?crate:crate.replace(/_/g,"");const crateRow={crate,ty:3,name:crate,path:"",descShard,descIndex,exactPath:"",desc:crateCorpus.doc,parent:undefined,type:null,paramNames:lastParamNames,id,word:crate,normalizedName,bitIndex:0,implDisambiguator:null,};this.nameTrie.insert(normalizedName,id,this.tailTable);id+=1;searchIndex.push(crateRow);currentIndex+=1;if(!this.searchIndexEmptyDesc.get(crate).contains(0)){descIndex+=1}const itemTypes=crateCorpus.t;const itemNames=crateCorpus.n;const itemPaths=new Map(crateCorpus.q);const itemReexports=new Map(crateCorpus.r);const itemParentIdxDecoder=new VlqHexDecoder(crateCorpus.i,noop=>noop);const implDisambiguator=new Map(crateCorpus.b);const paths=crateCorpus.p;const aliases=crateCorpus.a;const itemParamNames=new Map(crateCorpus.P);const lowercasePaths=[];const itemFunctionDecoder=new VlqHexDecoder(crateCorpus.f,buildFunctionSearchTypeCallback(paths,lowercasePaths),);let len=paths.length;let lastPath=itemPaths.get(0);for(let i=0;i2&&elem[2]!==null){path=itemPaths.has(elem[2])?itemPaths.get(elem[2]):lastPath;lastPath=path}const exactPath=elem.length>3&&elem[3]!==null?itemPaths.get(elem[3]):path;const unboxFlag=elem.length>4&&!!elem[4];lowercasePaths.push({ty,name:name.toLowerCase(),path,exactPath,unboxFlag});paths[i]={ty,name,path,exactPath,unboxFlag}}lastPath="";len=itemTypes.length;let lastName="";let lastWord="";for(let i=0;i=descShard.len&&!this.searchIndexEmptyDesc.get(crate).contains(bitIndex)){descShard={crate,shard:descShard.shard+1,start:descShard.start+descShard.len,len:itemDescShardDecoder.next(),promise:null,resolve:null,};descIndex=0;descShardList.push(descShard)}const name=itemNames[i]===""?lastName:itemNames[i];const word=itemNames[i]===""?lastWord:itemNames[i].toLowerCase();const path=itemPaths.has(i)?itemPaths.get(i):lastPath;const paramNames=itemParamNames.has(i)?itemParamNames.get(i).split(","):lastParamNames;const type=itemFunctionDecoder.next();if(type!==null){if(type){const fp=this.functionTypeFingerprint.subarray(id*4,(id+1)*4);for(const t of type.inputs){this.buildFunctionTypeFingerprint(t,fp)}for(const t of type.output){this.buildFunctionTypeFingerprint(t,fp)}for(const w of type.where_clause){for(const t of w){this.buildFunctionTypeFingerprint(t,fp)}}}}const itemParentIdx=itemParentIdxDecoder.next();normalizedName=word.indexOf("_")===-1?word:word.replace(/_/g,"");const row={crate,ty:itemTypes.charCodeAt(i)-65,name,path,descShard,descIndex,exactPath:itemReexports.has(i)?itemPaths.get(itemReexports.get(i)):path,parent:itemParentIdx>0?paths[itemParentIdx-1]:undefined,type,paramNames,id,word,normalizedName,bitIndex,implDisambiguator:implDisambiguator.has(i)?implDisambiguator.get(i):null,};this.nameTrie.insert(normalizedName,id,this.tailTable);id+=1;searchIndex.push(row);lastPath=row.path;lastParamNames=row.paramNames;if(!this.searchIndexEmptyDesc.get(crate).contains(bitIndex)){descIndex+=1}lastName=name;lastWord=word}if(aliases){const currentCrateAliases=new Map();this.ALIASES.set(crate,currentCrateAliases);for(const alias_name in aliases){if(!Object.prototype.hasOwnProperty.call(aliases,alias_name)){continue}let currentNameAliases;if(currentCrateAliases.has(alias_name)){currentNameAliases=currentCrateAliases.get(alias_name)}else{currentNameAliases=[];currentCrateAliases.set(alias_name,currentNameAliases)}for(const local_alias of aliases[alias_name]){currentNameAliases.push(local_alias+currentIndex)}}}currentIndex+=itemTypes.length;this.searchState.descShards.set(crate,descShardList)}this.TYPES_POOL=new Map();return searchIndex}static parseQuery(userQuery){function itemTypeFromName(typename){const index=itemTypes.findIndex(i=>i===typename);if(index<0){throw["Unknown type filter ",typename]}return index}function convertTypeFilterOnElem(elem){if(elem.typeFilter!==null){let typeFilter=elem.typeFilter;if(typeFilter==="const"){typeFilter="constant"}elem.typeFilter=itemTypeFromName(typeFilter)}else{elem.typeFilter=NO_TYPE_FILTER}for(const elem2 of elem.generics){convertTypeFilterOnElem(elem2)}for(const constraints of elem.bindings.values()){for(const constraint of constraints){convertTypeFilterOnElem(constraint)}}}function newParsedQuery(userQuery){return{userQuery,elems:[],returned:[],foundElems:0,totalElems:0,literalSearch:false,hasReturnArrow:false,error:null,correction:null,proposeCorrectionFrom:null,proposeCorrectionTo:null,typeFingerprint:new Uint32Array(4),}}function parseInput(query,parserState){let foundStopChar=true;while(parserState.pos"){if(isReturnArrow(parserState)){query.hasReturnArrow=true;break}throw["Unexpected ",c," (did you mean ","->","?)"]}else if(parserState.pos>0){throw["Unexpected ",c," after ",parserState.userQuery[parserState.pos-1]]}throw["Unexpected ",c]}else if(c===" "){skipWhitespace(parserState);continue}if(!foundStopChar){let extra="";if(isLastElemGeneric(query.elems,parserState)){extra=[" after ",">"]}else if(prevIs(parserState,"\"")){throw["Cannot have more than one element if you use quotes"]}if(parserState.typeFilter!==null){throw["Expected ",","," or ","->",...extra,", found ",c,]}throw["Expected ",",",", ",":"," or ","->",...extra,", found ",c,]}const before=query.elems.length;getFilteredNextElem(query,parserState,query.elems,false);if(query.elems.length===before){parserState.pos+=1}foundStopChar=false}if(parserState.typeFilter!==null){throw["Unexpected ",":"," (expected path after type filter ",parserState.typeFilter+":",")",]}while(parserState.pos1}query.foundElems=query.elems.length+query.returned.length;query.totalElems=parserState.totalElems;return query}async execQuery(parsedQuery,filterCrates,currentCrate){const results_others=new Map(),results_in_args=new Map(),results_returned=new Map();function createQueryResults(results_in_args,results_returned,results_others,parsedQuery){return{"in_args":results_in_args,"returned":results_returned,"others":results_others,"query":parsedQuery,}}const buildHrefAndPath=item=>{let displayPath;let href;const type=itemTypes[item.ty];const name=item.name;let path=item.path;let exactPath=item.exactPath;if(type==="mod"){displayPath=path+"::";href=this.rootPath+path.replace(/::/g,"/")+"/"+name+"/index.html"}else if(type==="import"){displayPath=item.path+"::";href=this.rootPath+item.path.replace(/::/g,"/")+"/index.html#reexport."+name}else if(type==="primitive"||type==="keyword"){displayPath="";exactPath="";href=this.rootPath+path.replace(/::/g,"/")+"/"+type+"."+name+".html"}else if(type==="externcrate"){displayPath="";href=this.rootPath+name+"/index.html"}else if(item.parent!==undefined){const myparent=item.parent;let anchor=type+"."+name;const parentType=itemTypes[myparent.ty];let pageType=parentType;let pageName=myparent.name;exactPath=`${myparent.exactPath}::${myparent.name}`;if(parentType==="primitive"){displayPath=myparent.name+"::";exactPath=myparent.name}else if(type==="structfield"&&parentType==="variant"){const enumNameIdx=item.path.lastIndexOf("::");const enumName=item.path.substr(enumNameIdx+2);path=item.path.substr(0,enumNameIdx);displayPath=path+"::"+enumName+"::"+myparent.name+"::";anchor="variant."+myparent.name+".field."+name;pageType="enum";pageName=enumName}else{displayPath=path+"::"+myparent.name+"::"}if(item.implDisambiguator!==null){anchor=item.implDisambiguator+"/"+anchor}href=this.rootPath+path.replace(/::/g,"/")+"/"+pageType+"."+pageName+".html#"+anchor}else{displayPath=item.path+"::";href=this.rootPath+item.path.replace(/::/g,"/")+"/"+type+"."+name+".html"}return[displayPath,href,`${exactPath}::${name}`]};function pathSplitter(path){const tmp=""+path.replace(/::/g,"::");if(tmp.endsWith("")){return tmp.slice(0,tmp.length-6)}return tmp}const transformResults=(results,typeInfo)=>{const duplicates=new Set();const out=[];for(const result of results){if(result.id!==-1){const res=buildHrefAndPath(this.searchIndex[result.id]);const obj=Object.assign({dist:result.dist,displayPath:pathSplitter(res[0]),},this.searchIndex[result.id]);obj.fullPath=res[2]+"|"+obj.ty;if(duplicates.has(obj.fullPath)){continue}if(obj.ty===TY_IMPORT&&duplicates.has(res[2])){continue}if(duplicates.has(res[2]+"|"+TY_IMPORT)){continue}duplicates.add(obj.fullPath);duplicates.add(res[2]);if(typeInfo!==null){obj.displayTypeSignature=this.formatDisplayTypeSignature(obj,typeInfo)}obj.href=res[1];out.push(obj);if(out.length>=MAX_RESULTS){break}}}return out};this.formatDisplayTypeSignature=async(obj,typeInfo)=>{let fnInputs=null;let fnOutput=null;let mgens=null;if(typeInfo!=="elems"&&typeInfo!=="returned"){fnInputs=unifyFunctionTypes(obj.type.inputs,parsedQuery.elems,obj.type.where_clause,null,mgensScratch=>{fnOutput=unifyFunctionTypes(obj.type.output,parsedQuery.returned,obj.type.where_clause,mgensScratch,mgensOut=>{mgens=mgensOut;return true},0,);return!!fnOutput},0,)}else{const arr=typeInfo==="elems"?obj.type.inputs:obj.type.output;const highlighted=unifyFunctionTypes(arr,parsedQuery.elems,obj.type.where_clause,null,mgensOut=>{mgens=mgensOut;return true},0,);if(typeInfo==="elems"){fnInputs=highlighted}else{fnOutput=highlighted}}if(!fnInputs){fnInputs=obj.type.inputs}if(!fnOutput){fnOutput=obj.type.output}const mappedNames=new Map();const whereClause=new Map();const fnParamNames=obj.paramNames;const queryParamNames=[];const remapQuery=queryElem=>{if(queryElem.id<0){queryParamNames[-1-queryElem.id]=queryElem.name}if(queryElem.generics.length>0){queryElem.generics.forEach(remapQuery)}if(queryElem.bindings.size>0){[...queryElem.bindings.values()].flat().forEach(remapQuery)}};parsedQuery.elems.forEach(remapQuery);parsedQuery.returned.forEach(remapQuery);const pushText=(fnType,result)=>{if(!!(result.length%2)===!!fnType.highlighted){result.push("")}else if(result.length===0&&!!fnType.highlighted){result.push("");result.push("")}result[result.length-1]+=fnType.name};const writeHof=(fnType,result)=>{const hofOutput=fnType.bindings.get(this.typeNameIdOfOutput)||[];const hofInputs=fnType.generics;pushText(fnType,result);pushText({name:" (",highlighted:false},result);let needsComma=false;for(const fnType of hofInputs){if(needsComma){pushText({name:", ",highlighted:false},result)}needsComma=true;writeFn(fnType,result)}pushText({name:hofOutput.length===0?")":") -> ",highlighted:false,},result);if(hofOutput.length>1){pushText({name:"(",highlighted:false},result)}needsComma=false;for(const fnType of hofOutput){if(needsComma){pushText({name:", ",highlighted:false},result)}needsComma=true;writeFn(fnType,result)}if(hofOutput.length>1){pushText({name:")",highlighted:false},result)}};const writeSpecialPrimitive=(fnType,result)=>{if(fnType.id===this.typeNameIdOfArray||fnType.id===this.typeNameIdOfSlice||fnType.id===this.typeNameIdOfTuple||fnType.id===this.typeNameIdOfUnit){const[ob,sb]=fnType.id===this.typeNameIdOfArray||fnType.id===this.typeNameIdOfSlice?["[","]"]:["(",")"];pushText({name:ob,highlighted:fnType.highlighted},result);onEachBtwn(fnType.generics,nested=>writeFn(nested,result),()=>pushText({name:", ",highlighted:false},result),);pushText({name:sb,highlighted:fnType.highlighted},result);return true}else if(fnType.id===this.typeNameIdOfReference){pushText({name:"&",highlighted:fnType.highlighted},result);let prevHighlighted=false;onEachBtwn(fnType.generics,value=>{prevHighlighted=value.highlighted;writeFn(value,result)},value=>pushText({name:" ",highlighted:prevHighlighted&&value.highlighted,},result),);return true}else if(fnType.id===this.typeNameIdOfFn){writeHof(fnType,result);return true}return false};const writeFn=(fnType,result)=>{if(fnType.id<0){if(fnParamNames[-1-fnType.id]===""){const generics=fnType.generics.length>0?fnType.generics:obj.type.where_clause[-1-fnType.id];for(const nested of generics){writeFn(nested,result)}return}else if(mgens){for(const[queryId,fnId]of mgens){if(fnId===fnType.id){mappedNames.set(queryParamNames[-1-queryId],fnParamNames[-1-fnType.id],)}}}pushText({name:fnParamNames[-1-fnType.id],highlighted:!!fnType.highlighted,},result);const where=[];onEachBtwn(fnType.generics,nested=>writeFn(nested,where),()=>pushText({name:" + ",highlighted:false},where),);if(where.length>0){whereClause.set(fnParamNames[-1-fnType.id],where)}}else{if(fnType.ty===TY_PRIMITIVE){if(writeSpecialPrimitive(fnType,result)){return}}else if(fnType.ty===TY_TRAIT&&(fnType.id===this.typeNameIdOfFn||fnType.id===this.typeNameIdOfFnMut||fnType.id===this.typeNameIdOfFnOnce)){writeHof(fnType,result);return}pushText(fnType,result);let hasBindings=false;if(fnType.bindings.size>0){onEachBtwn(fnType.bindings,([key,values])=>{const name=this.assocTypeIdNameMap.get(key);if(values.length===1&&values[0].id<0&&`${fnType.name}::${name}`===fnParamNames[-1-values[0].id]){for(const value of values){writeFn(value,[])}return true}if(!hasBindings){hasBindings=true;pushText({name:"<",highlighted:false},result)}pushText({name,highlighted:false},result);pushText({name:values.length!==1?"=(":"=",highlighted:false,},result);onEachBtwn(values||[],value=>writeFn(value,result),()=>pushText({name:" + ",highlighted:false},result),);if(values.length!==1){pushText({name:")",highlighted:false},result)}},()=>pushText({name:", ",highlighted:false},result),)}if(fnType.generics.length>0){pushText({name:hasBindings?", ":"<",highlighted:false},result)}onEachBtwn(fnType.generics,value=>writeFn(value,result),()=>pushText({name:", ",highlighted:false},result),);if(hasBindings||fnType.generics.length>0){pushText({name:">",highlighted:false},result)}}};const type=[];onEachBtwn(fnInputs,fnType=>writeFn(fnType,type),()=>pushText({name:", ",highlighted:false},type),);pushText({name:" -> ",highlighted:false},type);onEachBtwn(fnOutput,fnType=>writeFn(fnType,type),()=>pushText({name:", ",highlighted:false},type),);return{type,mappedNames,whereClause}};const sortResults=async(results,typeInfo,preferredCrate)=>{const userQuery=parsedQuery.userQuery;const normalizedUserQuery=parsedQuery.userQuery.toLowerCase();const isMixedCase=normalizedUserQuery!==userQuery;const result_list=[];const isReturnTypeQuery=parsedQuery.elems.length===0||typeInfo==="returned";for(const result of results.values()){result.item=this.searchIndex[result.id];result.word=this.searchIndex[result.id].word;if(isReturnTypeQuery){const hasType=result.item&&result.item.type;if(!hasType){continue}const inputs=result.item.type.inputs;const where_clause=result.item.type.where_clause;if(containsTypeFromQuery(inputs,where_clause)){result.path_dist*=100;result.dist*=100}}result_list.push(result)}result_list.sort((aaa,bbb)=>{let a,b;if(isMixedCase){a=(aaa.item.name!==userQuery);b=(bbb.item.name!==userQuery);if(a!==b){return a-b}}a=(aaa.word!==normalizedUserQuery);b=(bbb.word!==normalizedUserQuery);if(a!==b){return a-b}a=(aaa.index<0);b=(bbb.index<0);if(a!==b){return a-b}a=aaa.path_dist;b=bbb.path_dist;if(a!==b){return a-b}a=aaa.index;b=bbb.index;if(a!==b){return a-b}a=(aaa.dist);b=(bbb.dist);if(a!==b){return a-b}a=this.searchIndexDeprecated.get(aaa.item.crate).contains(aaa.item.bitIndex);b=this.searchIndexDeprecated.get(bbb.item.crate).contains(bbb.item.bitIndex);if(a!==b){return a-b}a=(aaa.item.crate!==preferredCrate);b=(bbb.item.crate!==preferredCrate);if(a!==b){return a-b}a=aaa.word.length;b=bbb.word.length;if(a!==b){return a-b}a=aaa.word;b=bbb.word;if(a!==b){return(a>b?+1:-1)}a=this.searchIndexEmptyDesc.get(aaa.item.crate).contains(aaa.item.bitIndex);b=this.searchIndexEmptyDesc.get(bbb.item.crate).contains(bbb.item.bitIndex);if(a!==b){return a-b}a=aaa.item.ty;b=bbb.item.ty;if(a!==b){return a-b}a=aaa.item.path;b=bbb.item.path;if(a!==b){return(a>b?+1:-1)}return 0});return transformResults(result_list,typeInfo)};function unifyFunctionTypes(fnTypesIn,queryElems,whereClause,mgensIn,solutionCb,unboxingDepth,){if(unboxingDepth>=UNBOXING_LIMIT){return null}const mgens=mgensIn===null?null:new Map(mgensIn);if(queryElems.length===0){return solutionCb(mgens)?fnTypesIn:null}if(!fnTypesIn||fnTypesIn.length===0){return null}const ql=queryElems.length;const fl=fnTypesIn.length;if(ql===1&&queryElems[0].generics.length===0&&queryElems[0].bindings.size===0){const queryElem=queryElems[0];for(const[i,fnType]of fnTypesIn.entries()){if(!unifyFunctionTypeIsMatchCandidate(fnType,queryElem,mgens)){continue}if(fnType.id<0&&queryElem.id<0){if(mgens&&mgens.has(queryElem.id)&&mgens.get(queryElem.id)!==fnType.id){continue}const mgensScratch=new Map(mgens);mgensScratch.set(queryElem.id,fnType.id);if(!solutionCb||solutionCb(mgensScratch)){const highlighted=[...fnTypesIn];highlighted[i]=Object.assign({highlighted:true,},fnType,{generics:whereClause[-1-fnType.id],});return highlighted}}else if(solutionCb(mgens?new Map(mgens):null)){const highlighted=[...fnTypesIn];highlighted[i]=Object.assign({highlighted:true,},fnType,{generics:unifyGenericTypes(fnType.generics,queryElem.generics,whereClause,mgens?new Map(mgens):null,solutionCb,unboxingDepth,)||fnType.generics,});return highlighted}}for(const[i,fnType]of fnTypesIn.entries()){if(!unifyFunctionTypeIsUnboxCandidate(fnType,queryElem,whereClause,mgens,unboxingDepth+1,)){continue}if(fnType.id<0){const highlightedGenerics=unifyFunctionTypes(whereClause[(-fnType.id)-1],queryElems,whereClause,mgens,solutionCb,unboxingDepth+1,);if(highlightedGenerics){const highlighted=[...fnTypesIn];highlighted[i]=Object.assign({highlighted:true,},fnType,{generics:highlightedGenerics,});return highlighted}}else{const highlightedGenerics=unifyFunctionTypes([...Array.from(fnType.bindings.values()).flat(),...fnType.generics],queryElems,whereClause,mgens?new Map(mgens):null,solutionCb,unboxingDepth+1,);if(highlightedGenerics){const highlighted=[...fnTypesIn];highlighted[i]=Object.assign({},fnType,{generics:highlightedGenerics,bindings:new Map([...fnType.bindings.entries()].map(([k,v])=>{return[k,highlightedGenerics.splice(0,v.length)]})),});return highlighted}}}return false}const fnTypes=fnTypesIn.slice();const flast=fl-1;const qlast=ql-1;const queryElem=queryElems[qlast];let queryElemsTmp=null;for(let i=flast;i>=0;i-=1){const fnType=fnTypes[i];if(!unifyFunctionTypeIsMatchCandidate(fnType,queryElem,mgens)){continue}let mgensScratch;if(fnType.id<0){mgensScratch=new Map(mgens);if(mgensScratch.has(queryElem.id)&&mgensScratch.get(queryElem.id)!==fnType.id){continue}mgensScratch.set(queryElem.id,fnType.id)}else{mgensScratch=mgens}fnTypes[i]=fnTypes[flast];fnTypes.length=flast;if(!queryElemsTmp){queryElemsTmp=queryElems.slice(0,qlast)}let unifiedGenerics=[];let unifiedGenericsMgens=null;const passesUnification=unifyFunctionTypes(fnTypes,queryElemsTmp,whereClause,mgensScratch,mgensScratch=>{if(fnType.generics.length===0&&queryElem.generics.length===0&&fnType.bindings.size===0&&queryElem.bindings.size===0){return solutionCb(mgensScratch)}const solution=unifyFunctionTypeCheckBindings(fnType,queryElem,whereClause,mgensScratch,unboxingDepth,);if(!solution){return false}const simplifiedGenerics=solution.simplifiedGenerics;for(const simplifiedMgens of solution.mgens){unifiedGenerics=unifyGenericTypes(simplifiedGenerics,queryElem.generics,whereClause,simplifiedMgens,solutionCb,unboxingDepth,);if(unifiedGenerics!==null){unifiedGenericsMgens=simplifiedMgens;return true}}return false},unboxingDepth,);if(passesUnification){passesUnification.length=fl;passesUnification[flast]=passesUnification[i];passesUnification[i]=Object.assign({},fnType,{highlighted:true,generics:unifiedGenerics,bindings:new Map([...fnType.bindings.entries()].map(([k,v])=>{return[k,queryElem.bindings.has(k)?unifyFunctionTypes(v,queryElem.bindings.get(k),whereClause,unifiedGenericsMgens,solutionCb,unboxingDepth,):unifiedGenerics.splice(0,v.length)]})),});return passesUnification}fnTypes[flast]=fnTypes[i];fnTypes[i]=fnType;fnTypes.length=fl}for(let i=flast;i>=0;i-=1){const fnType=fnTypes[i];if(!unifyFunctionTypeIsUnboxCandidate(fnType,queryElem,whereClause,mgens,unboxingDepth+1,)){continue}const generics=fnType.id<0?whereClause[(-fnType.id)-1]:fnType.generics;const bindings=fnType.bindings?Array.from(fnType.bindings.values()).flat():[];const passesUnification=unifyFunctionTypes(fnTypes.toSpliced(i,1,...bindings,...generics),queryElems,whereClause,mgens,solutionCb,unboxingDepth+1,);if(passesUnification){const highlightedGenerics=passesUnification.slice(i,i+generics.length+bindings.length,);const highlightedFnType=Object.assign({},fnType,{generics:highlightedGenerics,bindings:new Map([...fnType.bindings.entries()].map(([k,v])=>{return[k,highlightedGenerics.splice(0,v.length)]})),});return passesUnification.toSpliced(i,generics.length+bindings.length,highlightedFnType,)}}return null}function unifyGenericTypes(fnTypesIn,queryElems,whereClause,mgensIn,solutionCb,unboxingDepth,){if(unboxingDepth>=UNBOXING_LIMIT){return null}const mgens=mgensIn===null?null:new Map(mgensIn);if(queryElems.length===0){return solutionCb(mgens)?fnTypesIn:null}if(!fnTypesIn||fnTypesIn.length===0){return null}const fnType=fnTypesIn[0];const queryElem=queryElems[0];if(unifyFunctionTypeIsMatchCandidate(fnType,queryElem,mgens)){if(fnType.id<0&&queryElem.id<0){if(!mgens||!mgens.has(queryElem.id)||mgens.get(queryElem.id)===fnType.id){const mgensScratch=new Map(mgens);mgensScratch.set(queryElem.id,fnType.id);const fnTypesRemaining=unifyGenericTypes(fnTypesIn.slice(1),queryElems.slice(1),whereClause,mgensScratch,solutionCb,unboxingDepth,);if(fnTypesRemaining){const highlighted=[fnType,...fnTypesRemaining];highlighted[0]=Object.assign({highlighted:true,},fnType,{generics:whereClause[-1-fnType.id],});return highlighted}}}else{let unifiedGenerics;const fnTypesRemaining=unifyGenericTypes(fnTypesIn.slice(1),queryElems.slice(1),whereClause,mgens,mgensScratch=>{const solution=unifyFunctionTypeCheckBindings(fnType,queryElem,whereClause,mgensScratch,unboxingDepth,);if(!solution){return false}const simplifiedGenerics=solution.simplifiedGenerics;for(const simplifiedMgens of solution.mgens){unifiedGenerics=unifyGenericTypes(simplifiedGenerics,queryElem.generics,whereClause,simplifiedMgens,solutionCb,unboxingDepth,);if(unifiedGenerics!==null){return true}}},unboxingDepth,);if(fnTypesRemaining){const highlighted=[fnType,...fnTypesRemaining];highlighted[0]=Object.assign({highlighted:true,},fnType,{generics:unifiedGenerics||fnType.generics,});return highlighted}}}if(unifyFunctionTypeIsUnboxCandidate(fnType,queryElem,whereClause,mgens,unboxingDepth+1,)){let highlightedRemaining;if(fnType.id<0){const highlightedGenerics=unifyFunctionTypes(whereClause[(-fnType.id)-1],[queryElem],whereClause,mgens,mgensScratch=>{const hl=unifyGenericTypes(fnTypesIn.slice(1),queryElems.slice(1),whereClause,mgensScratch,solutionCb,unboxingDepth,);if(hl){highlightedRemaining=hl}return hl},unboxingDepth+1,);if(highlightedGenerics){return[Object.assign({highlighted:true,},fnType,{generics:highlightedGenerics,}),...highlightedRemaining]}}else{const highlightedGenerics=unifyGenericTypes([...Array.from(fnType.bindings.values()).flat(),...fnType.generics,],[queryElem],whereClause,mgens,mgensScratch=>{const hl=unifyGenericTypes(fnTypesIn.slice(1),queryElems.slice(1),whereClause,mgensScratch,solutionCb,unboxingDepth,);if(hl){highlightedRemaining=hl}return hl},unboxingDepth+1,);if(highlightedGenerics){return[Object.assign({},fnType,{generics:highlightedGenerics,bindings:new Map([...fnType.bindings.entries()].map(([k,v])=>{return[k,highlightedGenerics.splice(0,v.length)]})),}),...highlightedRemaining]}}}return null}const unifyFunctionTypeIsMatchCandidate=(fnType,queryElem,mgensIn)=>{if(!typePassesFilter(queryElem.typeFilter,fnType.ty)){return false}if(fnType.id<0&&queryElem.id<0){if(mgensIn&&mgensIn.has(queryElem.id)&&mgensIn.get(queryElem.id)!==fnType.id){return false}return true}else{if(queryElem.id===this.typeNameIdOfArrayOrSlice&&(fnType.id===this.typeNameIdOfSlice||fnType.id===this.typeNameIdOfArray)){}else if(queryElem.id===this.typeNameIdOfTupleOrUnit&&(fnType.id===this.typeNameIdOfTuple||fnType.id===this.typeNameIdOfUnit)){}else if(queryElem.id===this.typeNameIdOfHof&&(fnType.id===this.typeNameIdOfFn||fnType.id===this.typeNameIdOfFnMut||fnType.id===this.typeNameIdOfFnOnce)){}else if(fnType.id!==queryElem.id||queryElem.id===null){return false}if((fnType.generics.length+fnType.bindings.size)===0&&queryElem.generics.length!==0){return false}if(fnType.bindings.size0){const fnTypePath=fnType.path!==undefined&&fnType.path!==null?fnType.path.split("::"):[];if(queryElemPathLength>fnTypePath.length){return false}let i=0;for(const path of fnTypePath){if(path===queryElem.pathWithoutLast[i]){i+=1;if(i>=queryElemPathLength){break}}}if(i0){let mgensSolutionSet=[mgensIn];for(const[name,constraints]of queryElem.bindings.entries()){if(mgensSolutionSet.length===0){return false}if(!fnType.bindings.has(name)){return false}const fnTypeBindings=fnType.bindings.get(name);mgensSolutionSet=mgensSolutionSet.flatMap(mgens=>{const newSolutions=[];unifyFunctionTypes(fnTypeBindings,constraints,whereClause,mgens,newMgens=>{newSolutions.push(newMgens);return false},unboxingDepth,);return newSolutions})}if(mgensSolutionSet.length===0){return false}const binds=Array.from(fnType.bindings.entries()).flatMap(entry=>{const[name,constraints]=entry;if(queryElem.bindings.has(name)){return[]}else{return constraints}});if(simplifiedGenerics.length>0){simplifiedGenerics=[...binds,...simplifiedGenerics]}else{simplifiedGenerics=binds}return{simplifiedGenerics,mgens:mgensSolutionSet}}return{simplifiedGenerics,mgens:[mgensIn]}}function unifyFunctionTypeIsUnboxCandidate(fnType,queryElem,whereClause,mgens,unboxingDepth,){if(unboxingDepth>=UNBOXING_LIMIT){return false}if(fnType.id<0){if(!whereClause){return false}return checkIfInList(whereClause[(-fnType.id)-1],queryElem,whereClause,mgens,unboxingDepth,)}else if(fnType.unboxFlag&&(fnType.generics.length>0||fnType.bindings.size>0)){const simplifiedGenerics=[...fnType.generics,...Array.from(fnType.bindings.values()).flat(),];return checkIfInList(simplifiedGenerics,queryElem,whereClause,mgens,unboxingDepth,)}return false}function containsTypeFromQuery(list,where_clause){if(!list)return false;for(const ty of parsedQuery.returned){if(ty.id<0){continue}if(checkIfInList(list,ty,where_clause,null,0)){return true}}for(const ty of parsedQuery.elems){if(ty.id<0){continue}if(checkIfInList(list,ty,where_clause,null,0)){return true}}return false}function checkIfInList(list,elem,whereClause,mgens,unboxingDepth){for(const entry of list){if(checkType(entry,elem,whereClause,mgens,unboxingDepth)){return true}}return false}const checkType=(row,elem,whereClause,mgens,unboxingDepth)=>{if(unboxingDepth>=UNBOXING_LIMIT){return false}if(row.id>0&&elem.id>0&&elem.pathWithoutLast.length===0&&row.generics.length===0&&elem.generics.length===0&&row.bindings.size===0&&elem.bindings.size===0&&elem.id!==this.typeNameIdOfArrayOrSlice&&elem.id!==this.typeNameIdOfHof&&elem.id!==this.typeNameIdOfTupleOrUnit){return row.id===elem.id&&typePassesFilter(elem.typeFilter,row.ty)}else{return unifyFunctionTypes([row],[elem],whereClause,mgens,()=>true,unboxingDepth,)}};const checkTypeMgensForConflict=mgens=>{if(!mgens){return true}const fnTypes=new Set();for(const[_qid,fid]of mgens){if(fnTypes.has(fid)){return false}fnTypes.add(fid)}return true};function checkPath(contains,ty){if(contains.length===0){return 0}const maxPathEditDistance=Math.floor(contains.reduce((acc,next)=>acc+next.length,0)/3,);let ret_dist=maxPathEditDistance+1;const path=ty.path.split("::");if(ty.parent&&ty.parent.name){path.push(ty.parent.name.toLowerCase())}const length=path.length;const clength=contains.length;pathiter:for(let i=length-clength;i>=0;i-=1){let dist_total=0;for(let x=0;xmaxPathEditDistance){continue pathiter}dist_total+=dist}}ret_dist=Math.min(ret_dist,Math.round(dist_total/clength))}return ret_dist>maxPathEditDistance?null:ret_dist}function typePassesFilter(filter,type){if(filter<=NO_TYPE_FILTER||filter===type)return true;const name=itemTypes[type];switch(itemTypes[filter]){case"constant":return name==="associatedconstant";case"fn":return name==="method"||name==="tymethod";case"type":return name==="primitive"||name==="associatedtype";case"trait":return name==="traitalias"}return false}function createAliasFromItem(item){return{crate:item.crate,name:item.name,path:item.path,descShard:item.descShard,descIndex:item.descIndex,exactPath:item.exactPath,ty:item.ty,parent:item.parent,type:item.type,is_alias:true,bitIndex:item.bitIndex,implDisambiguator:item.implDisambiguator,}}const handleAliases=async(ret,query,filterCrates,currentCrate)=>{const lowerQuery=query.toLowerCase();const aliases=[];const crateAliases=[];if(filterCrates!==null){if(this.ALIASES.has(filterCrates)&&this.ALIASES.get(filterCrates).has(lowerQuery)){const query_aliases=this.ALIASES.get(filterCrates).get(lowerQuery);for(const alias of query_aliases){aliases.push(createAliasFromItem(this.searchIndex[alias]))}}}else{for(const[crate,crateAliasesIndex]of this.ALIASES){if(crateAliasesIndex.has(lowerQuery)){const pushTo=crate===currentCrate?crateAliases:aliases;const query_aliases=crateAliasesIndex.get(lowerQuery);for(const alias of query_aliases){pushTo.push(createAliasFromItem(this.searchIndex[alias]))}}}}const sortFunc=(aaa,bbb)=>{if(aaa.path{return this.searchIndexEmptyDesc.get(alias.crate).contains(alias.bitIndex)?"":this.searchState.loadDesc(alias)};const[crateDescs,descs]=await Promise.all([Promise.all(crateAliases.map(fetchDesc)),Promise.all(aliases.map(fetchDesc)),]);const pushFunc=alias=>{alias.alias=query;const res=buildHrefAndPath(alias);alias.displayPath=pathSplitter(res[0]);alias.fullPath=alias.displayPath+alias.name;alias.href=res[1];ret.others.unshift(alias);if(ret.others.length>MAX_RESULTS){ret.others.pop()}};aliases.forEach((alias,i)=>{alias.desc=descs[i]});aliases.forEach(pushFunc);crateAliases.forEach((alias,i)=>{alias.desc=crateDescs[i]});crateAliases.forEach(pushFunc)};function addIntoResults(results,fullId,id,index,dist,path_dist,maxEditDistance){if(dist<=maxEditDistance||index!==-1){if(results.has(fullId)){const result=results.get(fullId);if(result.dontValidate||result.dist<=dist){return}}results.set(fullId,{id:id,index:index,dontValidate:parsedQuery.literalSearch,dist:dist,path_dist:path_dist,})}}function handleArgs(row,pos,results){if(!row||(filterCrates!==null&&row.crate!==filterCrates)||!row.type){return}const tfpDist=compareTypeFingerprints(row.id,parsedQuery.typeFingerprint,);if(tfpDist===null){return}if(results.size>=MAX_RESULTS&&tfpDist>results.max_dist){return}if(!unifyFunctionTypes(row.type.inputs,parsedQuery.elems,row.type.where_clause,null,mgens=>{return unifyFunctionTypes(row.type.output,parsedQuery.returned,row.type.where_clause,mgens,checkTypeMgensForConflict,0,)},0,)){return}results.max_dist=Math.max(results.max_dist||0,tfpDist);addIntoResults(results,row.id,pos,0,tfpDist,0,Number.MAX_VALUE)}const compareTypeFingerprints=(fullId,queryFingerprint)=>{const fh0=this.functionTypeFingerprint[fullId*4];const fh1=this.functionTypeFingerprint[(fullId*4)+1];const fh2=this.functionTypeFingerprint[(fullId*4)+2];const[qh0,qh1,qh2]=queryFingerprint;const[in0,in1,in2]=[fh0&qh0,fh1&qh1,fh2&qh2];if((in0 ^ qh0)||(in1 ^ qh1)||(in2 ^ qh2)){return null}return this.functionTypeFingerprint[(fullId*4)+3]};const innerRunQuery=()=>{const queryLen=parsedQuery.elems.reduce((acc,next)=>acc+next.pathLast.length,0)+parsedQuery.returned.reduce((acc,next)=>acc+next.pathLast.length,0);const maxEditDistance=Math.floor(queryLen/3);const genericSymbols=new Map();const convertNameToId=(elem,isAssocType)=>{const loweredName=elem.pathLast.toLowerCase();if(this.typeNameIdMap.has(loweredName)&&(isAssocType||!this.typeNameIdMap.get(loweredName).assocOnly)){elem.id=this.typeNameIdMap.get(loweredName).id}else if(!parsedQuery.literalSearch){let match=null;let matchDist=maxEditDistance+1;let matchName="";for(const[name,{id,assocOnly}]of this.typeNameIdMap){const dist=Math.min(editDistance(name,loweredName,maxEditDistance),editDistance(name,elem.normalizedPathLast,maxEditDistance),);if(dist<=matchDist&&dist<=maxEditDistance&&(isAssocType||!assocOnly)){if(dist===matchDist&&matchName>name){continue}match=id;matchDist=dist;matchName=name}}if(match!==null){parsedQuery.correction=matchName}elem.id=match}if((elem.id===null&&parsedQuery.totalElems>1&&elem.typeFilter===-1&&elem.generics.length===0&&elem.bindings.size===0)||elem.typeFilter===TY_GENERIC){if(genericSymbols.has(elem.normalizedPathLast)){elem.id=genericSymbols.get(elem.normalizedPathLast)}else{elem.id=-(genericSymbols.size+1);genericSymbols.set(elem.normalizedPathLast,elem.id)}if(elem.typeFilter===-1&&elem.normalizedPathLast.length>=3){const maxPartDistance=Math.floor(elem.normalizedPathLast.length/3);let matchDist=maxPartDistance+1;let matchName="";for(const name of this.typeNameIdMap.keys()){const dist=editDistance(name,elem.normalizedPathLast,maxPartDistance,);if(dist<=matchDist&&dist<=maxPartDistance){if(dist===matchDist&&matchName>name){continue}matchDist=dist;matchName=name}}if(matchName!==""){parsedQuery.proposeCorrectionFrom=elem.name;parsedQuery.proposeCorrectionTo=matchName}}elem.typeFilter=TY_GENERIC}if(elem.generics.length>0&&elem.typeFilter===TY_GENERIC){parsedQuery.error=["Generic type parameter ",elem.name," does not accept generic parameters",]}for(const elem2 of elem.generics){convertNameToId(elem2)}elem.bindings=new Map(Array.from(elem.bindings.entries()).map(entry=>{const[name,constraints]=entry;if(!this.typeNameIdMap.has(name)){parsedQuery.error=["Type parameter ",name," does not exist",];return[null,[]]}for(const elem2 of constraints){convertNameToId(elem2)}return[this.typeNameIdMap.get(name).id,constraints]}),)};for(const elem of parsedQuery.elems){convertNameToId(elem);this.buildFunctionTypeFingerprint(elem,parsedQuery.typeFingerprint)}for(const elem of parsedQuery.returned){convertNameToId(elem);this.buildFunctionTypeFingerprint(elem,parsedQuery.typeFingerprint)}if(parsedQuery.foundElems===1&&!parsedQuery.hasReturnArrow){const elem=parsedQuery.elems[0];const handleNameSearch=id=>{const row=this.searchIndex[id];if(!typePassesFilter(elem.typeFilter,row.ty)||(filterCrates!==null&&row.crate!==filterCrates)){return}let pathDist=0;if(elem.fullPath.length>1){pathDist=checkPath(elem.pathWithoutLast,row);if(pathDist===null){return}}if(parsedQuery.literalSearch){if(row.word===elem.pathLast){addIntoResults(results_others,row.id,id,0,0,pathDist)}}else{addIntoResults(results_others,row.id,id,row.normalizedName.indexOf(elem.normalizedPathLast),editDistance(row.normalizedName,elem.normalizedPathLast,maxEditDistance,),pathDist,maxEditDistance,)}};if(elem.normalizedPathLast!==""){const last=elem.normalizedPathLast;for(const id of this.nameTrie.search(last,this.tailTable)){handleNameSearch(id)}}const length=this.searchIndex.length;for(let i=0,nSearchIndex=length;i0){const sortQ=(a,b)=>{const ag=a.generics.length===0&&a.bindings.size===0;const bg=b.generics.length===0&&b.bindings.size===0;if(ag!==bg){return ag-bg}const ai=a.id>0;const bi=b.id>0;return ai-bi};parsedQuery.elems.sort(sortQ);parsedQuery.returned.sort(sortQ);for(let i=0,nSearchIndex=this.searchIndex.length;i{const descs=await Promise.all(list.map(result=>{return this.searchIndexEmptyDesc.get(result.crate).contains(result.bitIndex)?"":this.searchState.loadDesc(result)}));for(const[i,result]of list.entries()){result.desc=descs[i]}}));if(parsedQuery.error!==null&&ret.others.length!==0){ret.query.error=null}return ret}}let rawSearchIndex;let docSearch;const longItemTypes=["keyword","primitive type","module","extern crate","re-export","struct","enum","function","type alias","static","trait","","trait method","method","struct field","enum variant","macro","assoc type","constant","assoc const","union","foreign type","existential type","attribute macro","derive macro","trait alias",];let currentResults;function printTab(nb){let iter=0;let foundCurrentTab=false;let foundCurrentResultSet=false;onEachLazy(document.getElementById("search-tabs").childNodes,elem=>{if(nb===iter){addClass(elem,"selected");foundCurrentTab=true}else{removeClass(elem,"selected")}iter+=1});const isTypeSearch=(nb>0||iter===1);iter=0;onEachLazy(document.getElementById("results").childNodes,elem=>{if(nb===iter){addClass(elem,"active");foundCurrentResultSet=true}else{removeClass(elem,"active")}iter+=1});if(foundCurrentTab&&foundCurrentResultSet){searchState.currentTab=nb;const correctionsElem=document.getElementsByClassName("search-corrections");if(isTypeSearch){removeClass(correctionsElem[0],"hidden")}else{addClass(correctionsElem[0],"hidden")}}else if(nb!==0){printTab(0)}}function buildUrl(search,filterCrates){let extra="?search="+encodeURIComponent(search);if(filterCrates!==null){extra+="&filter-crate="+encodeURIComponent(filterCrates)}return getNakedUrl()+extra+window.location.hash}function getFilterCrates(){const elem=document.getElementById("crate-search");if(elem&&elem.value!=="all crates"&&window.searchIndex.has(elem.value)){return elem.value}return null}function nextTab(direction){const next=(searchState.currentTab+direction+3)%searchState.focusedByTab.length;searchState.focusedByTab[searchState.currentTab]=document.activeElement;printTab(next);focusSearchResult()}function focusSearchResult(){const target=searchState.focusedByTab[searchState.currentTab]||document.querySelectorAll(".search-results.active a").item(0)||document.querySelectorAll("#search-tabs button").item(searchState.currentTab);searchState.focusedByTab[searchState.currentTab]=null;if(target){target.focus()}}async function addTab(array,query,display){const extraClass=display?" active":"";const output=document.createElement(array.length===0&&query.error===null?"div":"ul",);if(array.length>0){output.className="search-results "+extraClass;const lis=Promise.all(array.map(async item=>{const name=item.name;const type=itemTypes[item.ty];const longType=longItemTypes[item.ty];const typeName=longType.length!==0?`${longType}`:"?";const link=document.createElement("a");link.className="result-"+type;link.href=item.href;const resultName=document.createElement("span");resultName.className="result-name";resultName.insertAdjacentHTML("beforeend",`${typeName}`);link.appendChild(resultName);let alias=" ";if(item.is_alias){alias=` 
    \
 ${item.alias} - see \
 
    `}resultName.insertAdjacentHTML("beforeend",`
    ${alias}\
 ${item.displayPath}${name}\
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/bdk_core/merge/trait.Merge.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/bdk_core/merge/trait.Merge.js
index 26880133bb..eb829b46d5 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/bdk_core/merge/trait.Merge.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/bdk_core/merge/trait.Merge.js
@@ -1,9 +1,9 @@
 (function() {
-    var implementors = Object.fromEntries([["bdk_chain",[["impl Merge for ChangeSet"],["impl Merge for ChangeSet"],["impl<A: Anchor, IA: Merge> Merge for ChangeSet<A, IA>"],["impl<A: Ord> Merge for ChangeSet<A>"]]],["bdk_core",[]],["bdk_wallet",[["impl Merge for ChangeSet"]]],["example_cli",[["impl Merge for ChangeSet"]]]]);
+    var implementors = Object.fromEntries([["bdk_chain",[["impl Merge for ChangeSet"],["impl Merge for ChangeSet"],["impl<A: Anchor, IA: Merge> Merge for ChangeSet<A, IA>"],["impl<A: Ord> Merge for ChangeSet<A>"]]],["bdk_core",[]],["bdk_wallet",[["impl Merge for ChangeSet"]]],["example_cli",[["impl Merge for ChangeSet"]]]]);
     if (window.register_implementors) {
         window.register_implementors(implementors);
     } else {
         window.pending_implementors = implementors;
     }
 })()
-//{"start":57,"fragment_lengths":[1409,16,254,257]}
\ No newline at end of file
+//{"start":57,"fragment_lengths":[1409,16,151,154]}
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.AsRef.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.AsRef.js
index 74f6817cd5..5c048cd7cb 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.AsRef.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.AsRef.js
@@ -1,9 +1,9 @@
 (function() {
-    var implementors = Object.fromEntries([["bdk_chain",[["impl AsRef<[u8; 32]> for DescriptorId"],["impl AsRef<[u8]> for DescriptorId"],["impl<A> AsRef<TxGraph<A>> for TxGraph<A>"],["impl<A, I> AsRef<TxGraph<A>> for IndexedTxGraph<A, I>"]]],["bdk_wallet",[["impl AsRef<TxGraph> for Wallet"],["impl AsRef<[u8]> for KeychainKind"]]]]);
+    var implementors = Object.fromEntries([["bdk_chain",[["impl AsRef<[u8; 32]> for DescriptorId"],["impl AsRef<[u8]> for DescriptorId"],["impl<A> AsRef<TxGraph<A>> for TxGraph<A>"],["impl<A, I> AsRef<TxGraph<A>> for IndexedTxGraph<A, I>"]]],["bdk_wallet",[["impl AsRef<TxGraph> for Wallet"],["impl AsRef<[u8]> for KeychainKind"]]]]);
     if (window.register_implementors) {
         window.register_implementors(implementors);
     } else {
         window.pending_implementors = implementors;
     }
 })()
-//{"start":57,"fragment_lengths":[1789,782]}
\ No newline at end of file
+//{"start":57,"fragment_lengths":[1789,664]}
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.From.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.From.js
index 34290217a1..d1a0f25774 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.From.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.From.js
@@ -1,9 +1,9 @@
 (function() {
-    var implementors = Object.fromEntries([["bdk_chain",[["impl From<Hash> for DescriptorId"],["impl From<DescriptorId> for Hash"],["impl From<TxPosInBlock<'_>> for BlockId"],["impl From<TxPosInBlock<'_>> for ConfirmationBlockTime"],["impl<A> From<ChangeSet> for ChangeSet<A, ChangeSet>"],["impl<A, IA: Default> From<ChangeSet<A>> for ChangeSet<A, IA>"],["impl<A: Anchor> From<TxUpdate<A>> for TxGraph<A>"],["impl<A: Ord> From<TxGraph<A>> for TxUpdate<A>"],["impl<B: IntoIterator<Item = (u32, Option<BlockHash>)>> From<B> for ChangeSet"],["impl<T> From<T> for Impl<T>"]]],["bdk_core",[["impl From<(&u32, &BlockHash)> for BlockId"],["impl From<(u32, BlockHash)> for BlockId"],["impl From<BlockId> for (u32, BlockHash)"],["impl<I> From<SyncRequestBuilder<I>> for SyncRequest<I>"],["impl<K> From<FullScanRequestBuilder<K>> for FullScanRequest<K>"]]],["bdk_file_store",[["impl From<Error> for FileError"],["impl From<Error> for IterError"]]],["bdk_wallet",[["impl From<Error> for CreateTxError"],["impl From<PolicyError> for Error"],["impl From<PolicyError> for CreateTxError"],["impl From<SatisfiableItem> for Policy"],["impl From<LoadMismatch> for LoadError"],["impl From<MiniscriptPsbtError> for CreateTxError"],["impl From<KeyError> for Error"],["impl From<bool> for Satisfaction"],["impl From<ChangeSet<ConfirmationBlockTime, ChangeSet>> for ChangeSet"],["impl From<ChangeSet> for ChangeSet"],["impl From<ChangeSet> for ChangeSet"],["impl From<ChangeSet<ConfirmationBlockTime>> for ChangeSet"],["impl From<FullScanResponse<KeychainKind>> for Update"],["impl From<SyncResponse> for Update"],["impl From<InsufficientFunds> for CreateTxError"],["impl From<Error> for Error"],["impl From<Error> for Error"],["impl From<Error> for Error"],["impl From<Error> for CreateTxError"],["impl From<Error> for KeyError"],["impl From<Error> for KeyError"],["impl From<Fingerprint> for SignerId"],["impl From<Hash> for SignerId"],["impl From<HexToBytesError> for Error"],["impl From<ParsePublicKeyError> for Error"],["impl<Ctx: ScriptContext> From<Xpriv> for ExtendedKey<Ctx>"],["impl<Ctx: ScriptContext> From<Xpub> for ExtendedKey<Ctx>"],["impl<E> From<LoadMismatch> for LoadWithPersistError<E>"]]],["example_bitcoind_rpc_polling",[["impl From<RpcArgs> for Auth"]]]]);
+    var implementors = Object.fromEntries([["bdk_chain",[["impl From<Hash> for DescriptorId"],["impl From<DescriptorId> for Hash"],["impl From<TxPosInBlock<'_>> for BlockId"],["impl From<TxPosInBlock<'_>> for ConfirmationBlockTime"],["impl<A> From<ChangeSet> for ChangeSet<A, ChangeSet>"],["impl<A, IA: Default> From<ChangeSet<A>> for ChangeSet<A, IA>"],["impl<A: Anchor> From<TxUpdate<A>> for TxGraph<A>"],["impl<A: Ord> From<TxGraph<A>> for TxUpdate<A>"],["impl<B: IntoIterator<Item = (u32, Option<BlockHash>)>> From<B> for ChangeSet"],["impl<T> From<T> for Impl<T>"]]],["bdk_core",[["impl From<(&u32, &BlockHash)> for BlockId"],["impl From<(u32, BlockHash)> for BlockId"],["impl From<BlockId> for (u32, BlockHash)"],["impl<I> From<SyncRequestBuilder<I>> for SyncRequest<I>"],["impl<K> From<FullScanRequestBuilder<K>> for FullScanRequest<K>"]]],["bdk_file_store",[["impl From<Error> for FileError"],["impl From<Error> for IterError"]]],["bdk_wallet",[["impl From<Error> for CreateTxError"],["impl From<PolicyError> for Error"],["impl From<PolicyError> for CreateTxError"],["impl From<SatisfiableItem> for Policy"],["impl From<LoadMismatch> for LoadError"],["impl From<MiniscriptPsbtError> for CreateTxError"],["impl From<KeyError> for Error"],["impl From<bool> for Satisfaction"],["impl From<InsufficientFunds> for CreateTxError"],["impl From<ChangeSet> for ChangeSet"],["impl From<ChangeSet> for ChangeSet"],["impl From<ChangeSet<ConfirmationBlockTime>> for ChangeSet"],["impl From<ChangeSet<ConfirmationBlockTime, ChangeSet>> for ChangeSet"],["impl From<Error> for Error"],["impl From<Error> for Error"],["impl From<Error> for Error"],["impl From<Error> for CreateTxError"],["impl From<Error> for KeyError"],["impl From<Error> for KeyError"],["impl From<Fingerprint> for SignerId"],["impl From<FullScanResponse<KeychainKind>> for Update"],["impl From<Hash> for SignerId"],["impl From<HexToBytesError> for Error"],["impl From<ParsePublicKeyError> for Error"],["impl From<SyncResponse> for Update"],["impl<Ctx: ScriptContext> From<Xpriv> for ExtendedKey<Ctx>"],["impl<Ctx: ScriptContext> From<Xpub> for ExtendedKey<Ctx>"],["impl<E> From<LoadMismatch> for LoadWithPersistError<E>"]]],["example_bitcoind_rpc_polling",[["impl From<RpcArgs> for Auth"]]]]);
     if (window.register_implementors) {
         window.register_implementors(implementors);
     } else {
         window.pending_implementors = implementors;
     }
 })()
-//{"start":57,"fragment_lengths":[5175,2130,853,11283,341]}
\ No newline at end of file
+//{"start":57,"fragment_lengths":[5175,2130,853,10037,341]}
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/alloc/boxed/struct.Box.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/alloc/boxed/struct.Box.js
index d02aa7191c..3b34fbc291 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/alloc/boxed/struct.Box.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/alloc/boxed/struct.Box.js
@@ -1,5 +1,5 @@
 (function() {
-    var type_impls = Object.fromEntries([["bdk_esplora",[["
    §
    impl<T> AnyProvider for Box<T>
    where\n    T: AnyProvider + ?Sized,
    §
    fn load_any(\n    &self,\n    key: DataKey,\n    req: DataRequest<'_>,\n) -> Result<AnyResponse, DataError>
    Loads an [AnyPayload] according to the key and request.
    ","AnyProvider","bdk_esplora::blocking_ext::Error"],["
    1.64.0 · Source§
    impl<T> AsFd for Box<T>
    where\n    T: AsFd + ?Sized,
    Source§
    fn as_fd(&self) -> BorrowedFd<'_>
    Borrows the file descriptor. Read more
    ","AsFd","bdk_esplora::blocking_ext::Error"],["
    1.5.0 · Source§
    impl<T, A> AsMut<T> for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    Source§
    fn as_mut(&mut self) -> &mut T
    Converts this type into a mutable reference of the (usually inferred) input type.
    ","AsMut","bdk_esplora::blocking_ext::Error"],["
    1.63.0 · Source§
    impl<T> AsRawFd for Box<T>
    where\n    T: AsRawFd,
    Source§
    fn as_raw_fd(&self) -> i32
    Extracts the raw file descriptor. Read more
    ","AsRawFd","bdk_esplora::blocking_ext::Error"],["
    1.5.0 · Source§
    impl<T, A> AsRef<T> for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    Source§
    fn as_ref(&self) -> &T
    Converts this type into a shared reference of the (usually inferred) input type.
    ","AsRef","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncBufRead for Box<T>
    where\n    T: AsyncBufRead + Unpin + ?Sized,
    §
    fn poll_fill_buf(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<&[u8], Error>>
    Attempt to return the contents of the internal buffer, filling it with more data\nfrom the inner reader if it is empty. Read more
    §
    fn consume(self: Pin<&mut Box<T>>, amt: usize)
    Tells this buffer that amt bytes have been consumed from the buffer,\nso they should no longer be returned in calls to poll_read. Read more
    ","AsyncBufRead","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncBufRead for Box<T>
    where\n    T: AsyncBufRead + Unpin + ?Sized,
    §
    fn poll_fill_buf(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<&[u8], Error>>
    Attempts to return the contents of the internal buffer, filling it with more data\nfrom the inner reader if it is empty. Read more
    §
    fn consume(self: Pin<&mut Box<T>>, amt: usize)
    Tells this buffer that amt bytes have been consumed from the buffer,\nso they should no longer be returned in calls to poll_read. Read more
    ","AsyncBufRead","bdk_esplora::blocking_ext::Error"],["
    1.85.0 · Source§
    impl<Args, F, A> AsyncFn<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: AsyncFn<Args> + ?Sized,\n    A: Allocator,
    Source§
    extern "rust-call" fn async_call(\n    &self,\n    args: Args,\n) -> <Box<F, A> as AsyncFnMut<Args>>::CallRefFuture<'_>
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Call the AsyncFn, returning a future which may borrow from the called closure.
    ","AsyncFn","bdk_esplora::blocking_ext::Error"],["
    1.85.0 · Source§
    impl<Args, F, A> AsyncFnMut<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: AsyncFnMut<Args> + ?Sized,\n    A: Allocator,
    Source§
    type CallRefFuture<'a> = <F as AsyncFnMut<Args>>::CallRefFuture<'a>\nwhere\n    Box<F, A>: 'a
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Future returned by AsyncFnMut::async_call_mut and AsyncFn::async_call.
    Source§
    extern "rust-call" fn async_call_mut(\n    &mut self,\n    args: Args,\n) -> <Box<F, A> as AsyncFnMut<Args>>::CallRefFuture<'_>
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Call the AsyncFnMut, returning a future which may borrow from the called closure.
    ","AsyncFnMut","bdk_esplora::blocking_ext::Error"],["
    1.85.0 · Source§
    impl<Args, F, A> AsyncFnOnce<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: AsyncFnOnce<Args> + ?Sized,\n    A: Allocator,
    Source§
    type Output = <F as AsyncFnOnce<Args>>::Output
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Output type of the called closure’s future.
    Source§
    type CallOnceFuture = <F as AsyncFnOnce<Args>>::CallOnceFuture
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Future returned by AsyncFnOnce::async_call_once.
    Source§
    extern "rust-call" fn async_call_once(\n    self,\n    args: Args,\n) -> <Box<F, A> as AsyncFnOnce<Args>>::CallOnceFuture
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Call the AsyncFnOnce, returning a future which may move out of the called closure.
    ","AsyncFnOnce","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<S> AsyncIterator for Box<S>
    where\n    S: AsyncIterator + Unpin + ?Sized,
    Source§
    type Item = <S as AsyncIterator>::Item
    🔬This is a nightly-only experimental API. (async_iterator)
    The type of items yielded by the async iterator.
    Source§
    fn poll_next(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>,\n) -> Poll<Option<<Box<S> as AsyncIterator>::Item>>
    🔬This is a nightly-only experimental API. (async_iterator)
    Attempts to pull out the next value of this async iterator, registering the\ncurrent task for wakeup if the value is not yet available, and returning\nNone if the async iterator is exhausted. Read more
    Source§
    fn size_hint(&self) -> (usize, Option<usize>)
    🔬This is a nightly-only experimental API. (async_iterator)
    Returns the bounds on the remaining length of the async iterator. Read more
    ","AsyncIterator","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncRead for Box<T>
    where\n    T: AsyncRead + Unpin + ?Sized,
    §
    fn poll_read(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    buf: &mut ReadBuf<'_>,\n) -> Poll<Result<(), Error>>
    Attempts to read from the AsyncRead into buf. Read more
    ","AsyncRead","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncRead for Box<T>
    where\n    T: AsyncRead + Unpin + ?Sized,
    §
    fn poll_read(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    buf: &mut [u8],\n) -> Poll<Result<usize, Error>>
    Attempt to read from the AsyncRead into buf. Read more
    §
    fn poll_read_vectored(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    bufs: &mut [IoSliceMut<'_>],\n) -> Poll<Result<usize, Error>>
    Attempt to read from the AsyncRead into bufs using vectored\nIO operations. Read more
    ","AsyncRead","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncSeek for Box<T>
    where\n    T: AsyncSeek + Unpin + ?Sized,
    §
    fn poll_seek(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    pos: SeekFrom,\n) -> Poll<Result<u64, Error>>
    Attempt to seek to an offset, in bytes, in a stream. Read more
    ","AsyncSeek","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncSeek for Box<T>
    where\n    T: AsyncSeek + Unpin + ?Sized,
    §
    fn start_seek(self: Pin<&mut Box<T>>, pos: SeekFrom) -> Result<(), Error>
    Attempts to seek to an offset, in bytes, in a stream. Read more
    §
    fn poll_complete(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<u64, Error>>
    Waits for a seek operation to complete. Read more
    ","AsyncSeek","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncWrite for Box<T>
    where\n    T: AsyncWrite + Unpin + ?Sized,
    §
    fn poll_write(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    buf: &[u8],\n) -> Poll<Result<usize, Error>>
    Attempt to write bytes from buf into the object. Read more
    §
    fn poll_write_vectored(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    bufs: &[IoSlice<'_>],\n) -> Poll<Result<usize, Error>>
    Attempt to write bytes from bufs into the object using vectored\nIO operations. Read more
    §
    fn poll_flush(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<(), Error>>
    Attempt to flush the object, ensuring that any buffered data reach\ntheir destination. Read more
    §
    fn poll_close(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<(), Error>>
    Attempt to close the object. Read more
    ","AsyncWrite","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncWrite for Box<T>
    where\n    T: AsyncWrite + Unpin + ?Sized,
    §
    fn poll_write(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    buf: &[u8],\n) -> Poll<Result<usize, Error>>
    Attempt to write bytes from buf into the object. Read more
    §
    fn poll_write_vectored(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    bufs: &[IoSlice<'_>],\n) -> Poll<Result<usize, Error>>
    Like poll_write, except that it writes from a slice of buffers. Read more
    §
    fn is_write_vectored(&self) -> bool
    Determines if this writer has an efficient poll_write_vectored\nimplementation. Read more
    §
    fn poll_flush(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<(), Error>>
    Attempts to flush the object, ensuring that any buffered data reach\ntheir destination. Read more
    §
    fn poll_shutdown(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<(), Error>>
    Initiates or attempts to shut down this writer, returning success when\nthe I/O connection has completely shut down. Read more
    ","AsyncWrite","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T> Body for Box<T>
    where\n    T: Body + Unpin + ?Sized,
    Source§
    type Data = <T as Body>::Data
    Values yielded by the Body.
    Source§
    type Error = <T as Body>::Error
    The error type this Body might generate.
    Source§
    fn poll_data(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n) -> Poll<Option<Result<<Box<T> as Body>::Data, <Box<T> as Body>::Error>>>
    Attempt to pull out the next data buffer of this stream.
    Source§
    fn poll_trailers(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<Option<HeaderMap>, <Box<T> as Body>::Error>>
    Poll for an optional single HeaderMap of trailers. Read more
    Source§
    fn is_end_stream(&self) -> bool
    Returns true when the end of stream has been reached. Read more
    Source§
    fn size_hint(&self) -> SizeHint
    Returns the bounds on the remaining length of the stream. Read more
    Source§
    fn data(&mut self) -> Data<'_, Self>
    where\n    Self: Sized + Unpin,
    Returns future that resolves to next data chunk, if any.
    Source§
    fn trailers(&mut self) -> Trailers<'_, Self>
    where\n    Self: Sized + Unpin,
    Returns future that resolves to trailers, if any.
    Source§
    fn map_data<F, B>(self, f: F) -> MapData<Self, F>
    where\n    Self: Sized,\n    F: FnMut(Self::Data) -> B,\n    B: Buf,
    Maps this body’s data value to a different value.
    Source§
    fn map_err<F, E>(self, f: F) -> MapErr<Self, F>
    where\n    Self: Sized,\n    F: FnMut(Self::Error) -> E,
    Maps this body’s error value to a different value.
    Source§
    fn collect(self) -> Collect<Self>
    where\n    Self: Sized,
    Turn this body into Collected body which will collect all the DATA frames\nand trailers.
    Source§
    fn boxed(self) -> BoxBody<Self::Data, Self::Error>
    where\n    Self: Sized + Send + Sync + 'static,
    Turn this body into a boxed trait object.
    Source§
    fn boxed_unsync(self) -> UnsyncBoxBody<Self::Data, Self::Error>
    where\n    Self: Sized + Send + 'static,
    Turn this body into a boxed trait object that is !Sync.
    ","Body","bdk_esplora::blocking_ext::Error"],["
    1.1.0 · Source§
    impl<T, A> Borrow<T> for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    Source§
    fn borrow(&self) -> &T
    Immutably borrows from an owned value. Read more
    ","Borrow","bdk_esplora::blocking_ext::Error"],["
    1.1.0 · Source§
    impl<T, A> BorrowMut<T> for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    Source§
    fn borrow_mut(&mut self) -> &mut T
    Mutably borrows from an owned value. Read more
    ","BorrowMut","bdk_esplora::blocking_ext::Error"],["
    §
    impl<M, P> BoundDataProvider<M> for Box<P>
    where\n    M: DataMarker,\n    P: BoundDataProvider<M> + ?Sized,
    §
    fn load_bound(&self, req: DataRequest<'_>) -> Result<DataResponse<M>, DataError>
    Query the provider for data, returning the result. Read more
    §
    fn bound_key(&self) -> DataKey
    Returns the [DataKey] that this provider uses for loading data.
    ","BoundDataProvider","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T> Box<T>
    where\n    T: ?Sized,
    1.4.0 · Source
    pub unsafe fn from_raw(raw: *mut T) -> Box<T>
    Constructs a box from a raw pointer.
    \n
    After calling this function, the raw pointer is owned by the\nresulting Box. Specifically, the Box destructor will call\nthe destructor of T and free the allocated memory. For this\nto be safe, the memory must have been allocated in accordance\nwith the memory layout used by Box .
    \n
    §Safety
    \n
    This function is unsafe because improper use may lead to\nmemory problems. For example, a double-free may occur if the\nfunction is called twice on the same raw pointer.
    \n
    The raw pointer must point to a block of memory allocated by the global allocator.
    \n
    The safety conditions are described in the memory layout section.
    \n
    §Examples
    \n
    Recreate a Box which was previously converted to a raw pointer\nusing Box::into_raw:
    \n\n
    let x = Box::new(5);\nlet ptr = Box::into_raw(x);\nlet x = unsafe { Box::from_raw(ptr) };
    \n
    Manually create a Box from scratch by using the global allocator:
    \n\n
    use std::alloc::{alloc, Layout};\n\nunsafe {\n    let ptr = alloc(Layout::new::<i32>()) as *mut i32;\n    // In general .write is required to avoid attempting to destruct\n    // the (uninitialized) previous contents of `ptr`, though for this\n    // simple example `*ptr = 5` would have worked as well.\n    ptr.write(5);\n    let x = Box::from_raw(ptr);\n}
    \n
    Source
    pub unsafe fn from_non_null(ptr: NonNull<T>) -> Box<T>
    🔬This is a nightly-only experimental API. (box_vec_non_null)
    Constructs a box from a NonNull pointer.
    \n
    After calling this function, the NonNull pointer is owned by\nthe resulting Box. Specifically, the Box destructor will call\nthe destructor of T and free the allocated memory. For this\nto be safe, the memory must have been allocated in accordance\nwith the memory layout used by Box .
    \n
    §Safety
    \n
    This function is unsafe because improper use may lead to\nmemory problems. For example, a double-free may occur if the\nfunction is called twice on the same NonNull pointer.
    \n
    The safety conditions are described in the memory layout section.
    \n
    §Examples
    \n
    Recreate a Box which was previously converted to a NonNull\npointer using Box::into_non_null:
    \n\n
    #![feature(box_vec_non_null)]\n\nlet x = Box::new(5);\nlet non_null = Box::into_non_null(x);\nlet x = unsafe { Box::from_non_null(non_null) };
    \n
    Manually create a Box from scratch by using the global allocator:
    \n\n
    #![feature(box_vec_non_null)]\n\nuse std::alloc::{alloc, Layout};\nuse std::ptr::NonNull;\n\nunsafe {\n    let non_null = NonNull::new(alloc(Layout::new::<i32>()).cast::<i32>())\n        .expect(\"allocation failed\");\n    // In general .write is required to avoid attempting to destruct\n    // the (uninitialized) previous contents of `non_null`.\n    non_null.write(5);\n    let x = Box::from_non_null(non_null);\n}
    \n
    ",0,"bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T> Box<T>
    1.0.0 · Source
    pub fn new(x: T) -> Box<T>
    Allocates memory on the heap and then places x into it.
    \n
    This doesn’t actually allocate if T is zero-sized.
    \n
    §Examples
    \n
    let five = Box::new(5);
    \n
    1.82.0 · Source
    pub fn new_uninit() -> Box<MaybeUninit<T>>
    Constructs a new box with uninitialized contents.
    \n
    §Examples
    \n
    let mut five = Box::<u32>::new_uninit();\n\nlet five = unsafe {\n    // Deferred initialization:\n    five.as_mut_ptr().write(5);\n\n    five.assume_init()\n};\n\nassert_eq!(*five, 5)
    \n
    Source
    pub fn new_zeroed() -> Box<MaybeUninit<T>>
    🔬This is a nightly-only experimental API. (new_zeroed_alloc)
    Constructs a new Box with uninitialized contents, with the memory\nbeing filled with 0 bytes.
    \n
    See MaybeUninit::zeroed for examples of correct and incorrect usage\nof this method.
    \n
    §Examples
    \n
    #![feature(new_zeroed_alloc)]\n\nlet zero = Box::<u32>::new_zeroed();\nlet zero = unsafe { zero.assume_init() };\n\nassert_eq!(*zero, 0)
    \n
    1.33.0 · Source
    pub fn pin(x: T) -> Pin<Box<T>>
    Constructs a new Pin<Box<T>>. If T does not implement Unpin, then\nx will be pinned in memory and unable to be moved.
    \n
    Constructing and pinning of the Box can also be done in two steps: Box::pin(x)\ndoes the same as Box::into_pin(Box::new(x)). Consider using\ninto_pin if you already have a Box<T>, or if you want to\nconstruct a (pinned) Box in a different way than with Box::new.
    \n
    Source
    pub fn try_new(x: T) -> Result<Box<T>, AllocError>
    🔬This is a nightly-only experimental API. (allocator_api)
    Allocates memory on the heap then places x into it,\nreturning an error if the allocation fails
    \n
    This doesn’t actually allocate if T is zero-sized.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nlet five = Box::try_new(5)?;
    \n
    Source
    pub fn try_new_uninit() -> Result<Box<MaybeUninit<T>>, AllocError>
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new box with uninitialized contents on the heap,\nreturning an error if the allocation fails
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nlet mut five = Box::<u32>::try_new_uninit()?;\n\nlet five = unsafe {\n    // Deferred initialization:\n    five.as_mut_ptr().write(5);\n\n    five.assume_init()\n};\n\nassert_eq!(*five, 5);
    \n
    Source
    pub fn try_new_zeroed() -> Result<Box<MaybeUninit<T>>, AllocError>
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new Box with uninitialized contents, with the memory\nbeing filled with 0 bytes on the heap
    \n
    See MaybeUninit::zeroed for examples of correct and incorrect usage\nof this method.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nlet zero = Box::<u32>::try_new_zeroed()?;\nlet zero = unsafe { zero.assume_init() };\n\nassert_eq!(*zero, 0);
    \n
    ",0,"bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T, A> Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    Source
    pub const unsafe fn from_raw_in(raw: *mut T, alloc: A) -> Box<T, A>
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a box from a raw pointer in the given allocator.
    \n
    After calling this function, the raw pointer is owned by the\nresulting Box. Specifically, the Box destructor will call\nthe destructor of T and free the allocated memory. For this\nto be safe, the memory must have been allocated in accordance\nwith the memory layout used by Box .
    \n
    §Safety
    \n
    This function is unsafe because improper use may lead to\nmemory problems. For example, a double-free may occur if the\nfunction is called twice on the same raw pointer.
    \n
    The raw pointer must point to a block of memory allocated by alloc
    \n
    §Examples
    \n
    Recreate a Box which was previously converted to a raw pointer\nusing Box::into_raw_with_allocator:
    \n\n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet x = Box::new_in(5, System);\nlet (ptr, alloc) = Box::into_raw_with_allocator(x);\nlet x = unsafe { Box::from_raw_in(ptr, alloc) };
    \n
    Manually create a Box from scratch by using the system allocator:
    \n\n
    #![feature(allocator_api, slice_ptr_get)]\n\nuse std::alloc::{Allocator, Layout, System};\n\nunsafe {\n    let ptr = System.allocate(Layout::new::<i32>())?.as_mut_ptr() as *mut i32;\n    // In general .write is required to avoid attempting to destruct\n    // the (uninitialized) previous contents of `ptr`, though for this\n    // simple example `*ptr = 5` would have worked as well.\n    ptr.write(5);\n    let x = Box::from_raw_in(ptr, System);\n}
    \n
    Source
    pub const unsafe fn from_non_null_in(raw: NonNull<T>, alloc: A) -> Box<T, A>
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a box from a NonNull pointer in the given allocator.
    \n
    After calling this function, the NonNull pointer is owned by\nthe resulting Box. Specifically, the Box destructor will call\nthe destructor of T and free the allocated memory. For this\nto be safe, the memory must have been allocated in accordance\nwith the memory layout used by Box .
    \n
    §Safety
    \n
    This function is unsafe because improper use may lead to\nmemory problems. For example, a double-free may occur if the\nfunction is called twice on the same raw pointer.
    \n
    §Examples
    \n
    Recreate a Box which was previously converted to a NonNull pointer\nusing Box::into_non_null_with_allocator:
    \n\n
    #![feature(allocator_api, box_vec_non_null)]\n\nuse std::alloc::System;\n\nlet x = Box::new_in(5, System);\nlet (non_null, alloc) = Box::into_non_null_with_allocator(x);\nlet x = unsafe { Box::from_non_null_in(non_null, alloc) };
    \n
    Manually create a Box from scratch by using the system allocator:
    \n\n
    #![feature(allocator_api, box_vec_non_null, slice_ptr_get)]\n\nuse std::alloc::{Allocator, Layout, System};\n\nunsafe {\n    let non_null = System.allocate(Layout::new::<i32>())?.cast::<i32>();\n    // In general .write is required to avoid attempting to destruct\n    // the (uninitialized) previous contents of `non_null`.\n    non_null.write(5);\n    let x = Box::from_non_null_in(non_null, System);\n}
    \n
    1.4.0 · Source
    pub fn into_raw(b: Box<T, A>) -> *mut T
    Consumes the Box, returning a wrapped raw pointer.
    \n
    The pointer will be properly aligned and non-null.
    \n
    After calling this function, the caller is responsible for the\nmemory previously managed by the Box. In particular, the\ncaller should properly destroy T and release the memory, taking\ninto account the memory layout used by Box. The easiest way to\ndo this is to convert the raw pointer back into a Box with the\nBox::from_raw function, allowing the Box destructor to perform\nthe cleanup.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::into_raw(b) instead of b.into_raw(). This\nis so that there is no conflict with a method on the inner type.
    \n
    §Examples
    \n
    Converting the raw pointer back into a Box with Box::from_raw\nfor automatic cleanup:
    \n\n
    let x = Box::new(String::from(\"Hello\"));\nlet ptr = Box::into_raw(x);\nlet x = unsafe { Box::from_raw(ptr) };
    \n
    Manual cleanup by explicitly running the destructor and deallocating\nthe memory:
    \n\n
    use std::alloc::{dealloc, Layout};\nuse std::ptr;\n\nlet x = Box::new(String::from(\"Hello\"));\nlet ptr = Box::into_raw(x);\nunsafe {\n    ptr::drop_in_place(ptr);\n    dealloc(ptr as *mut u8, Layout::new::<String>());\n}
    \n
    Note: This is equivalent to the following:
    \n\n
    let x = Box::new(String::from(\"Hello\"));\nlet ptr = Box::into_raw(x);\nunsafe {\n    drop(Box::from_raw(ptr));\n}
    \n
    Source
    pub fn into_non_null(b: Box<T, A>) -> NonNull<T>
    🔬This is a nightly-only experimental API. (box_vec_non_null)
    Consumes the Box, returning a wrapped NonNull pointer.
    \n
    The pointer will be properly aligned.
    \n
    After calling this function, the caller is responsible for the\nmemory previously managed by the Box. In particular, the\ncaller should properly destroy T and release the memory, taking\ninto account the memory layout used by Box. The easiest way to\ndo this is to convert the NonNull pointer back into a Box with the\nBox::from_non_null function, allowing the Box destructor to\nperform the cleanup.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::into_non_null(b) instead of b.into_non_null().\nThis is so that there is no conflict with a method on the inner type.
    \n
    §Examples
    \n
    Converting the NonNull pointer back into a Box with Box::from_non_null\nfor automatic cleanup:
    \n\n
    #![feature(box_vec_non_null)]\n\nlet x = Box::new(String::from(\"Hello\"));\nlet non_null = Box::into_non_null(x);\nlet x = unsafe { Box::from_non_null(non_null) };
    \n
    Manual cleanup by explicitly running the destructor and deallocating\nthe memory:
    \n\n
    #![feature(box_vec_non_null)]\n\nuse std::alloc::{dealloc, Layout};\n\nlet x = Box::new(String::from(\"Hello\"));\nlet non_null = Box::into_non_null(x);\nunsafe {\n    non_null.drop_in_place();\n    dealloc(non_null.as_ptr().cast::<u8>(), Layout::new::<String>());\n}
    \n
    Note: This is equivalent to the following:
    \n\n
    #![feature(box_vec_non_null)]\n\nlet x = Box::new(String::from(\"Hello\"));\nlet non_null = Box::into_non_null(x);\nunsafe {\n    drop(Box::from_non_null(non_null));\n}
    \n
    Source
    pub fn into_raw_with_allocator(b: Box<T, A>) -> (*mut T, A)
    🔬This is a nightly-only experimental API. (allocator_api)
    Consumes the Box, returning a wrapped raw pointer and the allocator.
    \n
    The pointer will be properly aligned and non-null.
    \n
    After calling this function, the caller is responsible for the\nmemory previously managed by the Box. In particular, the\ncaller should properly destroy T and release the memory, taking\ninto account the memory layout used by Box. The easiest way to\ndo this is to convert the raw pointer back into a Box with the\nBox::from_raw_in function, allowing the Box destructor to perform\nthe cleanup.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::into_raw_with_allocator(b) instead of b.into_raw_with_allocator(). This\nis so that there is no conflict with a method on the inner type.
    \n
    §Examples
    \n
    Converting the raw pointer back into a Box with Box::from_raw_in\nfor automatic cleanup:
    \n\n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet x = Box::new_in(String::from(\"Hello\"), System);\nlet (ptr, alloc) = Box::into_raw_with_allocator(x);\nlet x = unsafe { Box::from_raw_in(ptr, alloc) };
    \n
    Manual cleanup by explicitly running the destructor and deallocating\nthe memory:
    \n\n
    #![feature(allocator_api)]\n\nuse std::alloc::{Allocator, Layout, System};\nuse std::ptr::{self, NonNull};\n\nlet x = Box::new_in(String::from(\"Hello\"), System);\nlet (ptr, alloc) = Box::into_raw_with_allocator(x);\nunsafe {\n    ptr::drop_in_place(ptr);\n    let non_null = NonNull::new_unchecked(ptr);\n    alloc.deallocate(non_null.cast(), Layout::new::<String>());\n}
    \n
    Source
    pub fn into_non_null_with_allocator(b: Box<T, A>) -> (NonNull<T>, A)
    🔬This is a nightly-only experimental API. (allocator_api)
    Consumes the Box, returning a wrapped NonNull pointer and the allocator.
    \n
    The pointer will be properly aligned.
    \n
    After calling this function, the caller is responsible for the\nmemory previously managed by the Box. In particular, the\ncaller should properly destroy T and release the memory, taking\ninto account the memory layout used by Box. The easiest way to\ndo this is to convert the NonNull pointer back into a Box with the\nBox::from_non_null_in function, allowing the Box destructor to\nperform the cleanup.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::into_non_null_with_allocator(b) instead of\nb.into_non_null_with_allocator(). This is so that there is no\nconflict with a method on the inner type.
    \n
    §Examples
    \n
    Converting the NonNull pointer back into a Box with\nBox::from_non_null_in for automatic cleanup:
    \n\n
    #![feature(allocator_api, box_vec_non_null)]\n\nuse std::alloc::System;\n\nlet x = Box::new_in(String::from(\"Hello\"), System);\nlet (non_null, alloc) = Box::into_non_null_with_allocator(x);\nlet x = unsafe { Box::from_non_null_in(non_null, alloc) };
    \n
    Manual cleanup by explicitly running the destructor and deallocating\nthe memory:
    \n\n
    #![feature(allocator_api, box_vec_non_null)]\n\nuse std::alloc::{Allocator, Layout, System};\n\nlet x = Box::new_in(String::from(\"Hello\"), System);\nlet (non_null, alloc) = Box::into_non_null_with_allocator(x);\nunsafe {\n    non_null.drop_in_place();\n    alloc.deallocate(non_null.cast::<u8>(), Layout::new::<String>());\n}
    \n
    Source
    pub fn as_mut_ptr(b: &mut Box<T, A>) -> *mut T
    🔬This is a nightly-only experimental API. (box_as_ptr)
    Returns a raw mutable pointer to the Box’s contents.
    \n
    The caller must ensure that the Box outlives the pointer this\nfunction returns, or else it will end up dangling.
    \n
    This method guarantees that for the purpose of the aliasing model, this method\ndoes not materialize a reference to the underlying memory, and thus the returned pointer\nwill remain valid when mixed with other calls to as_ptr and as_mut_ptr.\nNote that calling other methods that materialize references to the memory\nmay still invalidate this pointer.\nSee the example below for how this guarantee can be used.
    \n
    §Examples
    \n
    Due to the aliasing guarantee, the following code is legal:
    \n\n
    #![feature(box_as_ptr)]\n\nunsafe {\n    let mut b = Box::new(0);\n    let ptr1 = Box::as_mut_ptr(&mut b);\n    ptr1.write(1);\n    let ptr2 = Box::as_mut_ptr(&mut b);\n    ptr2.write(2);\n    // Notably, the write to `ptr2` did *not* invalidate `ptr1`:\n    ptr1.write(3);\n}
    \n
    Source
    pub fn as_ptr(b: &Box<T, A>) -> *const T
    🔬This is a nightly-only experimental API. (box_as_ptr)
    Returns a raw pointer to the Box’s contents.
    \n
    The caller must ensure that the Box outlives the pointer this\nfunction returns, or else it will end up dangling.
    \n
    The caller must also ensure that the memory the pointer (non-transitively) points to\nis never written to (except inside an UnsafeCell) using this pointer or any pointer\nderived from it. If you need to mutate the contents of the Box, use as_mut_ptr.
    \n
    This method guarantees that for the purpose of the aliasing model, this method\ndoes not materialize a reference to the underlying memory, and thus the returned pointer\nwill remain valid when mixed with other calls to as_ptr and as_mut_ptr.\nNote that calling other methods that materialize mutable references to the memory,\nas well as writing to this memory, may still invalidate this pointer.\nSee the example below for how this guarantee can be used.
    \n
    §Examples
    \n
    Due to the aliasing guarantee, the following code is legal:
    \n\n
    #![feature(box_as_ptr)]\n\nunsafe {\n    let mut v = Box::new(0);\n    let ptr1 = Box::as_ptr(&v);\n    let ptr2 = Box::as_mut_ptr(&mut v);\n    let _val = ptr2.read();\n    // No write to this memory has happened yet, so `ptr1` is still valid.\n    let _val = ptr1.read();\n    // However, once we do a write...\n    ptr2.write(1);\n    // ... `ptr1` is no longer valid.\n    // This would be UB: let _val = ptr1.read();\n}
    \n
    Source
    pub const fn allocator(b: &Box<T, A>) -> &A
    🔬This is a nightly-only experimental API. (allocator_api)
    Returns a reference to the underlying allocator.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::allocator(&b) instead of b.allocator(). This\nis so that there is no conflict with a method on the inner type.
    \n
    1.26.0 · Source
    pub fn leak<'a>(b: Box<T, A>) -> &'a mut T
    where\n    A: 'a,
    Consumes and leaks the Box, returning a mutable reference,\n&'a mut T.
    \n
    Note that the type T must outlive the chosen lifetime 'a. If the type\nhas only static references, or none at all, then this may be chosen to be\n'static.
    \n
    This function is mainly useful for data that lives for the remainder of\nthe program’s life. Dropping the returned reference will cause a memory\nleak. If this is not acceptable, the reference should first be wrapped\nwith the Box::from_raw function producing a Box. This Box can\nthen be dropped which will properly destroy T and release the\nallocated memory.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::leak(b) instead of b.leak(). This\nis so that there is no conflict with a method on the inner type.
    \n
    §Examples
    \n
    Simple usage:
    \n\n
    let x = Box::new(41);\nlet static_ref: &'static mut usize = Box::leak(x);\n*static_ref += 1;\nassert_eq!(*static_ref, 42);
    \n
    Unsized data:
    \n\n
    let x = vec![1, 2, 3].into_boxed_slice();\nlet static_ref = Box::leak(x);\nstatic_ref[0] = 4;\nassert_eq!(*static_ref, [4, 2, 3]);
    \n
    1.63.0 (const: unstable) · Source
    pub fn into_pin(boxed: Box<T, A>) -> Pin<Box<T, A>>
    where\n    A: 'static,
    Converts a Box<T> into a Pin<Box<T>>. If T does not implement Unpin, then\n*boxed will be pinned in memory and unable to be moved.
    \n
    This conversion does not allocate on the heap and happens in place.
    \n
    This is also available via From.
    \n
    Constructing and pinning a Box with Box::into_pin(Box::new(x))\ncan also be written more concisely using Box::pin(x).\nThis into_pin method is useful if you already have a Box<T>, or you are\nconstructing a (pinned) Box in a different way than with Box::new.
    \n
    §Notes
    \n
    It’s not recommended that crates add an impl like From<Box<T>> for Pin<T>,\nas it’ll introduce an ambiguity when calling Pin::from.\nA demonstration of such a poor impl is shown below.
    \n\n
    ⓘ
    struct Foo; // A type defined in this crate.\nimpl From<Box<()>> for Pin<Foo> {\n    fn from(_: Box<()>) -> Pin<Foo> {\n        Pin::new(Foo)\n    }\n}\n\nlet foo = Box::new(());\nlet bar = Pin::from(foo);
    \n
    ",0,"bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T, A> Box<T, A>
    where\n    A: Allocator,
    Source
    pub fn new_in(x: T, alloc: A) -> Box<T, A>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Allocates memory in the given allocator then places x into it.
    \n
    This doesn’t actually allocate if T is zero-sized.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet five = Box::new_in(5, System);
    \n
    Source
    pub fn try_new_in(x: T, alloc: A) -> Result<Box<T, A>, AllocError>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Allocates memory in the given allocator then places x into it,\nreturning an error if the allocation fails
    \n
    This doesn’t actually allocate if T is zero-sized.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet five = Box::try_new_in(5, System)?;
    \n
    Source
    pub fn new_uninit_in(alloc: A) -> Box<MaybeUninit<T>, A>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new box with uninitialized contents in the provided allocator.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet mut five = Box::<u32, _>::new_uninit_in(System);\n\nlet five = unsafe {\n    // Deferred initialization:\n    five.as_mut_ptr().write(5);\n\n    five.assume_init()\n};\n\nassert_eq!(*five, 5)
    \n
    Source
    pub fn try_new_uninit_in(alloc: A) -> Result<Box<MaybeUninit<T>, A>, AllocError>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new box with uninitialized contents in the provided allocator,\nreturning an error if the allocation fails
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet mut five = Box::<u32, _>::try_new_uninit_in(System)?;\n\nlet five = unsafe {\n    // Deferred initialization:\n    five.as_mut_ptr().write(5);\n\n    five.assume_init()\n};\n\nassert_eq!(*five, 5);
    \n
    Source
    pub fn new_zeroed_in(alloc: A) -> Box<MaybeUninit<T>, A>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new Box with uninitialized contents, with the memory\nbeing filled with 0 bytes in the provided allocator.
    \n
    See MaybeUninit::zeroed for examples of correct and incorrect usage\nof this method.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet zero = Box::<u32, _>::new_zeroed_in(System);\nlet zero = unsafe { zero.assume_init() };\n\nassert_eq!(*zero, 0)
    \n
    Source
    pub fn try_new_zeroed_in(alloc: A) -> Result<Box<MaybeUninit<T>, A>, AllocError>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new Box with uninitialized contents, with the memory\nbeing filled with 0 bytes in the provided allocator,\nreturning an error if the allocation fails,
    \n
    See MaybeUninit::zeroed for examples of correct and incorrect usage\nof this method.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet zero = Box::<u32, _>::try_new_zeroed_in(System)?;\nlet zero = unsafe { zero.assume_init() };\n\nassert_eq!(*zero, 0);
    \n
    Source
    pub fn pin_in(x: T, alloc: A) -> Pin<Box<T, A>>
    where\n    A: 'static + Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new Pin<Box<T, A>>. If T does not implement Unpin, then\nx will be pinned in memory and unable to be moved.
    \n
    Constructing and pinning of the Box can also be done in two steps: Box::pin_in(x, alloc)\ndoes the same as Box::into_pin(Box::new_in(x, alloc)). Consider using\ninto_pin if you already have a Box<T, A>, or if you want to\nconstruct a (pinned) Box in a different way than with Box::new_in.
    \n
    Source
    pub fn into_boxed_slice(boxed: Box<T, A>) -> Box<[T], A>
    🔬This is a nightly-only experimental API. (box_into_boxed_slice)
    Converts a Box<T> into a Box<[T]>
    \n
    This conversion does not allocate on the heap and happens in place.
    \n
    Source
    pub fn into_inner(boxed: Box<T, A>) -> T
    🔬This is a nightly-only experimental API. (box_into_inner)
    Consumes the Box, returning the wrapped value.
    \n
    §Examples
    \n
    #![feature(box_into_inner)]\n\nlet c = Box::new(5);\n\nassert_eq!(Box::into_inner(c), 5);
    \n
    ",0,"bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> Buf for Box<T>
    where\n    T: Buf + ?Sized,
    §
    fn remaining(&self) -> usize
    Returns the number of bytes between the current position and the end of\nthe buffer. Read more
    §
    fn chunk(&self) -> &[u8] ⓘ
    Returns a slice starting at the current position and of length between 0\nand Buf::remaining(). Note that this can return a shorter slice (this\nallows non-continuous internal representation). Read more
    §
    fn chunks_vectored<'b>(&'b self, dst: &mut [IoSlice<'b>]) -> usize
    Fills dst with potentially multiple slices starting at self’s\ncurrent position. Read more
    §
    fn advance(&mut self, cnt: usize)
    Advance the internal cursor of the Buf Read more
    §
    fn has_remaining(&self) -> bool
    Returns true if there are any more bytes to consume Read more
    §
    fn copy_to_slice(&mut self, dst: &mut [u8])
    Copies bytes from self into dst. Read more
    §
    fn get_u8(&mut self) -> u8
    Gets an unsigned 8 bit integer from self. Read more
    §
    fn get_i8(&mut self) -> i8
    Gets a signed 8 bit integer from self. Read more
    §
    fn get_u16(&mut self) -> u16
    Gets an unsigned 16 bit integer from self in big-endian byte order. Read more
    §
    fn get_u16_le(&mut self) -> u16
    Gets an unsigned 16 bit integer from self in little-endian byte order. Read more
    §
    fn get_u16_ne(&mut self) -> u16
    Gets an unsigned 16 bit integer from self in native-endian byte order. Read more
    §
    fn get_i16(&mut self) -> i16
    Gets a signed 16 bit integer from self in big-endian byte order. Read more
    §
    fn get_i16_le(&mut self) -> i16
    Gets a signed 16 bit integer from self in little-endian byte order. Read more
    §
    fn get_i16_ne(&mut self) -> i16
    Gets a signed 16 bit integer from self in native-endian byte order. Read more
    §
    fn get_u32(&mut self) -> u32
    Gets an unsigned 32 bit integer from self in the big-endian byte order. Read more
    §
    fn get_u32_le(&mut self) -> u32
    Gets an unsigned 32 bit integer from self in the little-endian byte order. Read more
    §
    fn get_u32_ne(&mut self) -> u32
    Gets an unsigned 32 bit integer from self in native-endian byte order. Read more
    §
    fn get_i32(&mut self) -> i32
    Gets a signed 32 bit integer from self in big-endian byte order. Read more
    §
    fn get_i32_le(&mut self) -> i32
    Gets a signed 32 bit integer from self in little-endian byte order. Read more
    §
    fn get_i32_ne(&mut self) -> i32
    Gets a signed 32 bit integer from self in native-endian byte order. Read more
    §
    fn get_u64(&mut self) -> u64
    Gets an unsigned 64 bit integer from self in big-endian byte order. Read more
    §
    fn get_u64_le(&mut self) -> u64
    Gets an unsigned 64 bit integer from self in little-endian byte order. Read more
    §
    fn get_u64_ne(&mut self) -> u64
    Gets an unsigned 64 bit integer from self in native-endian byte order. Read more
    §
    fn get_i64(&mut self) -> i64
    Gets a signed 64 bit integer from self in big-endian byte order. Read more
    §
    fn get_i64_le(&mut self) -> i64
    Gets a signed 64 bit integer from self in little-endian byte order. Read more
    §
    fn get_i64_ne(&mut self) -> i64
    Gets a signed 64 bit integer from self in native-endian byte order. Read more
    §
    fn get_uint(&mut self, nbytes: usize) -> u64
    Gets an unsigned n-byte integer from self in big-endian byte order. Read more
    §
    fn get_uint_le(&mut self, nbytes: usize) -> u64
    Gets an unsigned n-byte integer from self in little-endian byte order. Read more
    §
    fn get_uint_ne(&mut self, nbytes: usize) -> u64
    Gets an unsigned n-byte integer from self in native-endian byte order. Read more
    §
    fn get_int(&mut self, nbytes: usize) -> i64
    Gets a signed n-byte integer from self in big-endian byte order. Read more
    §
    fn get_int_le(&mut self, nbytes: usize) -> i64
    Gets a signed n-byte integer from self in little-endian byte order. Read more
    §
    fn get_int_ne(&mut self, nbytes: usize) -> i64
    Gets a signed n-byte integer from self in native-endian byte order. Read more
    §
    fn copy_to_bytes(&mut self, len: usize) -> Bytes
    Consumes len bytes inside self and returns new instance of Bytes\nwith this data. Read more
    §
    fn get_u128(&mut self) -> u128
    Gets an unsigned 128 bit integer from self in big-endian byte order. Read more
    §
    fn get_u128_le(&mut self) -> u128
    Gets an unsigned 128 bit integer from self in little-endian byte order. Read more
    §
    fn get_u128_ne(&mut self) -> u128
    Gets an unsigned 128 bit integer from self in native-endian byte order. Read more
    §
    fn get_i128(&mut self) -> i128
    Gets a signed 128 bit integer from self in big-endian byte order. Read more
    §
    fn get_i128_le(&mut self) -> i128
    Gets a signed 128 bit integer from self in little-endian byte order. Read more
    §
    fn get_i128_ne(&mut self) -> i128
    Gets a signed 128 bit integer from self in native-endian byte order. Read more
    §
    fn get_f32(&mut self) -> f32
    Gets an IEEE754 single-precision (4 bytes) floating point number from\nself in big-endian byte order. Read more
    §
    fn get_f32_le(&mut self) -> f32
    Gets an IEEE754 single-precision (4 bytes) floating point number from\nself in little-endian byte order. Read more
    §
    fn get_f32_ne(&mut self) -> f32
    Gets an IEEE754 single-precision (4 bytes) floating point number from\nself in native-endian byte order. Read more
    §
    fn get_f64(&mut self) -> f64
    Gets an IEEE754 double-precision (8 bytes) floating point number from\nself in big-endian byte order. Read more
    §
    fn get_f64_le(&mut self) -> f64
    Gets an IEEE754 double-precision (8 bytes) floating point number from\nself in little-endian byte order. Read more
    §
    fn get_f64_ne(&mut self) -> f64
    Gets an IEEE754 double-precision (8 bytes) floating point number from\nself in native-endian byte order. Read more
    §
    fn take(self, limit: usize) -> Take<Self>
    where\n    Self: Sized,
    Creates an adaptor which will read at most limit bytes from self. Read more
    §
    fn chain<U>(self, next: U) -> Chain<Self, U>
    where\n    U: Buf,\n    Self: Sized,
    Creates an adaptor which will chain this buffer with another. Read more
    §
    fn reader(self) -> Reader<Self>
    where\n    Self: Sized,
    Creates an adaptor which implements the Read trait for self. Read more
    ","Buf","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> BufMut for Box<T>
    where\n    T: BufMut + ?Sized,
    §
    fn remaining_mut(&self) -> usize
    Returns the number of bytes that can be written from the current\nposition until the end of the buffer is reached. Read more
    §
    fn chunk_mut(&mut self) -> &mut UninitSlice
    Returns a mutable slice starting at the current BufMut position and of\nlength between 0 and BufMut::remaining_mut(). Note that this can be shorter than the\nwhole remainder of the buffer (this allows non-continuous implementation). Read more
    §
    unsafe fn advance_mut(&mut self, cnt: usize)
    Advance the internal cursor of the BufMut Read more
    §
    fn put_slice(&mut self, src: &[u8])
    Transfer bytes into self from src and advance the cursor by the\nnumber of bytes written. Read more
    §
    fn put_u8(&mut self, n: u8)
    Writes an unsigned 8 bit integer to self. Read more
    §
    fn put_i8(&mut self, n: i8)
    Writes a signed 8 bit integer to self. Read more
    §
    fn put_u16(&mut self, n: u16)
    Writes an unsigned 16 bit integer to self in big-endian byte order. Read more
    §
    fn put_u16_le(&mut self, n: u16)
    Writes an unsigned 16 bit integer to self in little-endian byte order. Read more
    §
    fn put_u16_ne(&mut self, n: u16)
    Writes an unsigned 16 bit integer to self in native-endian byte order. Read more
    §
    fn put_i16(&mut self, n: i16)
    Writes a signed 16 bit integer to self in big-endian byte order. Read more
    §
    fn put_i16_le(&mut self, n: i16)
    Writes a signed 16 bit integer to self in little-endian byte order. Read more
    §
    fn put_i16_ne(&mut self, n: i16)
    Writes a signed 16 bit integer to self in native-endian byte order. Read more
    §
    fn put_u32(&mut self, n: u32)
    Writes an unsigned 32 bit integer to self in big-endian byte order. Read more
    §
    fn put_u32_le(&mut self, n: u32)
    Writes an unsigned 32 bit integer to self in little-endian byte order. Read more
    §
    fn put_u32_ne(&mut self, n: u32)
    Writes an unsigned 32 bit integer to self in native-endian byte order. Read more
    §
    fn put_i32(&mut self, n: i32)
    Writes a signed 32 bit integer to self in big-endian byte order. Read more
    §
    fn put_i32_le(&mut self, n: i32)
    Writes a signed 32 bit integer to self in little-endian byte order. Read more
    §
    fn put_i32_ne(&mut self, n: i32)
    Writes a signed 32 bit integer to self in native-endian byte order. Read more
    §
    fn put_u64(&mut self, n: u64)
    Writes an unsigned 64 bit integer to self in the big-endian byte order. Read more
    §
    fn put_u64_le(&mut self, n: u64)
    Writes an unsigned 64 bit integer to self in little-endian byte order. Read more
    §
    fn put_u64_ne(&mut self, n: u64)
    Writes an unsigned 64 bit integer to self in native-endian byte order. Read more
    §
    fn put_i64(&mut self, n: i64)
    Writes a signed 64 bit integer to self in the big-endian byte order. Read more
    §
    fn put_i64_le(&mut self, n: i64)
    Writes a signed 64 bit integer to self in little-endian byte order. Read more
    §
    fn put_i64_ne(&mut self, n: i64)
    Writes a signed 64 bit integer to self in native-endian byte order. Read more
    §
    fn has_remaining_mut(&self) -> bool
    Returns true if there is space in self for more bytes. Read more
    §
    fn put<T>(&mut self, src: T)
    where\n    T: Buf,\n    Self: Sized,
    Transfer bytes into self from src and advance the cursor by the\nnumber of bytes written. Read more
    §
    fn put_bytes(&mut self, val: u8, cnt: usize)
    Put cnt bytes val into self. Read more
    §
    fn put_u128(&mut self, n: u128)
    Writes an unsigned 128 bit integer to self in the big-endian byte order. Read more
    §
    fn put_u128_le(&mut self, n: u128)
    Writes an unsigned 128 bit integer to self in little-endian byte order. Read more
    §
    fn put_u128_ne(&mut self, n: u128)
    Writes an unsigned 128 bit integer to self in native-endian byte order. Read more
    §
    fn put_i128(&mut self, n: i128)
    Writes a signed 128 bit integer to self in the big-endian byte order. Read more
    §
    fn put_i128_le(&mut self, n: i128)
    Writes a signed 128 bit integer to self in little-endian byte order. Read more
    §
    fn put_i128_ne(&mut self, n: i128)
    Writes a signed 128 bit integer to self in native-endian byte order. Read more
    §
    fn put_uint(&mut self, n: u64, nbytes: usize)
    Writes an unsigned n-byte integer to self in big-endian byte order. Read more
    §
    fn put_uint_le(&mut self, n: u64, nbytes: usize)
    Writes an unsigned n-byte integer to self in the little-endian byte order. Read more
    §
    fn put_uint_ne(&mut self, n: u64, nbytes: usize)
    Writes an unsigned n-byte integer to self in the native-endian byte order. Read more
    §
    fn put_int(&mut self, n: i64, nbytes: usize)
    Writes low nbytes of a signed integer to self in big-endian byte order. Read more
    §
    fn put_int_le(&mut self, n: i64, nbytes: usize)
    Writes low nbytes of a signed integer to self in little-endian byte order. Read more
    §
    fn put_int_ne(&mut self, n: i64, nbytes: usize)
    Writes low nbytes of a signed integer to self in native-endian byte order. Read more
    §
    fn put_f32(&mut self, n: f32)
    Writes an IEEE754 single-precision (4 bytes) floating point number to\nself in big-endian byte order. Read more
    §
    fn put_f32_le(&mut self, n: f32)
    Writes an IEEE754 single-precision (4 bytes) floating point number to\nself in little-endian byte order. Read more
    §
    fn put_f32_ne(&mut self, n: f32)
    Writes an IEEE754 single-precision (4 bytes) floating point number to\nself in native-endian byte order. Read more
    §
    fn put_f64(&mut self, n: f64)
    Writes an IEEE754 double-precision (8 bytes) floating point number to\nself in big-endian byte order. Read more
    §
    fn put_f64_le(&mut self, n: f64)
    Writes an IEEE754 double-precision (8 bytes) floating point number to\nself in little-endian byte order. Read more
    §
    fn put_f64_ne(&mut self, n: f64)
    Writes an IEEE754 double-precision (8 bytes) floating point number to\nself in native-endian byte order. Read more
    §
    fn limit(self, limit: usize) -> Limit<Self>
    where\n    Self: Sized,
    Creates an adaptor which can write at most limit bytes to self. Read more
    §
    fn writer(self) -> Writer<Self>
    where\n    Self: Sized,
    Creates an adaptor which implements the Write trait for self. Read more
    §
    fn chain_mut<U>(self, next: U) -> Chain<Self, U>
    where\n    U: BufMut,\n    Self: Sized,
    Creates an adapter which will chain this buffer with another. Read more
    ","BufMut","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<B> BufRead for Box<B>
    where\n    B: BufRead + ?Sized,
    Source§
    fn fill_buf(&mut self) -> Result<&[u8], Error>
    Returns the contents of the internal buffer, filling it with more data\nfrom the inner reader if it is empty. Read more
    Source§
    fn consume(&mut self, amt: usize)
    Tells this buffer that amt bytes have been consumed from the buffer,\nso they should no longer be returned in calls to read. Read more
    Source§
    fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize, Error>
    Reads all bytes into buf until the delimiter byte or EOF is reached. Read more
    Source§
    fn read_line(&mut self, buf: &mut String) -> Result<usize, Error>
    Reads all bytes until a newline (the 0xA byte) is reached, and append\nthem to the provided String buffer. Read more
    Source§
    fn has_data_left(&mut self) -> Result<bool, Error>
    🔬This is a nightly-only experimental API. (buf_read_has_data_left)
    Checks if the underlying Read has any data left to be read. Read more
    1.83.0 · Source§
    fn skip_until(&mut self, byte: u8) -> Result<usize, Error>
    Skips all bytes until the delimiter byte or EOF is reached. Read more
    1.0.0 · Source§
    fn split(self, byte: u8) -> Split<Self>
    where\n    Self: Sized,
    Returns an iterator over the contents of this reader split on the byte\nbyte. Read more
    1.0.0 · Source§
    fn lines(self) -> Lines<Self>
    where\n    Self: Sized,
    Returns an iterator over the lines of this reader. Read more
    ","BufRead","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> BufferProvider for Box<T>
    where\n    T: BufferProvider + ?Sized,
    §
    fn load_buffer(\n    &self,\n    key: DataKey,\n    req: DataRequest<'_>,\n) -> Result<DataResponse<BufferMarker>, DataError>
    Loads a [DataPayload]<[BufferMarker]> according to the key and request.
    ","BufferProvider","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> Clone for Box<T, A>
    where\n    T: Clone,\n    A: Allocator + Clone,
    Source§
    fn clone(&self) -> Box<T, A>
    Returns a new box with a clone() of this box’s contents.
    \n
    §Examples
    \n
    let x = Box::new(5);\nlet y = x.clone();\n\n// The value is the same\nassert_eq!(x, y);\n\n// But they are unique objects\nassert_ne!(&*x as *const i32, &*y as *const i32);
    \n
    Source§
    fn clone_from(&mut self, source: &Box<T, A>)
    Copies source’s contents into self without creating a new allocation.
    \n
    §Examples
    \n
    let x = Box::new(5);\nlet mut y = Box::new(10);\nlet yp: *const i32 = &*y;\n\ny.clone_from(&x);\n\n// The value is the same\nassert_eq!(x, y);\n\n// And no allocation occurred\nassert_eq!(yp, &*y);
    \n
    ","Clone","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<G, R, A> Coroutine<R> for Box<G, A>
    where\n    G: Coroutine<R> + Unpin + ?Sized,\n    A: Allocator,
    Source§
    type Yield = <G as Coroutine<R>>::Yield
    🔬This is a nightly-only experimental API. (coroutine_trait)
    The type of value this coroutine yields. Read more
    Source§
    type Return = <G as Coroutine<R>>::Return
    🔬This is a nightly-only experimental API. (coroutine_trait)
    The type of value this coroutine returns. Read more
    Source§
    fn resume(\n    self: Pin<&mut Box<G, A>>,\n    arg: R,\n) -> CoroutineState<<Box<G, A> as Coroutine<R>>::Yield, <Box<G, A> as Coroutine<R>>::Return>
    🔬This is a nightly-only experimental API. (coroutine_trait)
    Resumes the execution of this coroutine. Read more
    ","Coroutine","bdk_esplora::blocking_ext::Error"],["
    §
    impl<M, P> DataProvider<M> for Box<P>
    where\n    M: KeyedDataMarker,\n    P: DataProvider<M> + ?Sized,
    §
    fn load(&self, req: DataRequest<'_>) -> Result<DataResponse<M>, DataError>
    Query the provider for data, returning the result. Read more
    ","DataProvider","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> Debug for Box<T, A>
    where\n    T: Debug + ?Sized,\n    A: Allocator,
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T> Default for Box<T>
    where\n    T: Default,
    Source§
    fn default() -> Box<T>
    Creates a Box<T>, with the Default value for T.
    \n
    ","Default","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> Deref for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    Source§
    type Target = T
    The resulting type after dereferencing.
    Source§
    fn deref(&self) -> &T
    Dereferences the value.
    ","Deref","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> DerefMut for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    Source§
    fn deref_mut(&mut self) -> &mut T
    Mutably dereferences the value.
    ","DerefMut","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<'de, T> Deserialize<'de> for Box<T>
    where\n    T: Deserialize<'de>,
    Source§
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<Box<T>, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> Display for Box<T, A>
    where\n    T: Display + ?Sized,\n    A: Allocator,
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Display","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<I, A> DoubleEndedIterator for Box<I, A>
    where\n    I: DoubleEndedIterator + ?Sized,\n    A: Allocator,
    Source§
    fn next_back(&mut self) -> Option<<I as Iterator>::Item>
    Removes and returns an element from the end of the iterator. Read more
    Source§
    fn nth_back(&mut self, n: usize) -> Option<<I as Iterator>::Item>
    Returns the nth element from the end of the iterator. Read more
    Source§
    fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>
    🔬This is a nightly-only experimental API. (iter_advance_by)
    Advances the iterator from the back by n elements. Read more
    1.27.0 · Source§
    fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R
    where\n    Self: Sized,\n    F: FnMut(B, Self::Item) -> R,\n    R: Try<Output = B>,
    This is the reverse version of Iterator::try_fold(): it takes\nelements starting from the back of the iterator. Read more
    1.27.0 · Source§
    fn rfold<B, F>(self, init: B, f: F) -> B
    where\n    Self: Sized,\n    F: FnMut(B, Self::Item) -> B,
    An iterator method that reduces the iterator’s elements to a single,\nfinal value, starting from the back. Read more
    1.27.0 · Source§
    fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item>
    where\n    Self: Sized,\n    P: FnMut(&Self::Item) -> bool,
    Searches for an element of an iterator from the back that satisfies a predicate. Read more
    ","DoubleEndedIterator","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> Drop for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    Source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    ","Drop","bdk_esplora::blocking_ext::Error"],["
    §
    impl<M, P> DynamicDataProvider<M> for Box<P>
    where\n    M: DataMarker,\n    P: DynamicDataProvider<M> + ?Sized,
    §
    fn load_data(\n    &self,\n    key: DataKey,\n    req: DataRequest<'_>,\n) -> Result<DataResponse<M>, DataError>
    Query the provider for data, returning the result. Read more
    ","DynamicDataProvider","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> EncodeAsVarULE<T> for Box<T>
    where\n    T: VarULE + ?Sized,
    §
    fn encode_var_ule_as_slices<R>(&self, cb: impl FnOnce(&[&[u8]]) -> R) -> R
    Calls cb with a piecewise list of byte slices that when concatenated\nproduce the memory pattern of the corresponding instance of T. Read more
    §
    fn encode_var_ule_len(&self) -> usize
    Return the length, in bytes, of the corresponding [VarULE] type
    §
    fn encode_var_ule_write(&self, dst: &mut [u8])
    Write the corresponding [VarULE] type to the dst buffer. dst should\nbe the size of [Self::encode_var_ule_len()]
    ","EncodeAsVarULE","bdk_esplora::blocking_ext::Error"],["
    1.8.0 · Source§
    impl<E> Error for Box<E>
    where\n    E: Error,
    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
    Source§
    fn source(&self) -> Option<&(dyn Error + 'static)>
    Returns the lower-level source of this error, if any. Read more
    Source§
    fn provide<'b>(&'b self, request: &mut Request<'b>)
    🔬This is a nightly-only experimental API. (error_generic_member_access)
    Provides type-based access to context intended for error reports. Read more
    ","Error","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<I, A> ExactSizeIterator for Box<I, A>
    where\n    I: ExactSizeIterator + ?Sized,\n    A: Allocator,
    Source§
    fn len(&self) -> usize
    Returns the exact remaining length of the iterator. Read more
    Source§
    fn is_empty(&self) -> bool
    🔬This is a nightly-only experimental API. (exact_size_is_empty)
    Returns true if the iterator is empty. Read more
    ","ExactSizeIterator","bdk_esplora::blocking_ext::Error"],["
    1.35.0 · Source§
    impl<Args, F, A> Fn<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: Fn<Args> + ?Sized,\n    A: Allocator,
    Source§
    extern "rust-call" fn call(\n    &self,\n    args: Args,\n) -> <Box<F, A> as FnOnce<Args>>::Output
    🔬This is a nightly-only experimental API. (fn_traits)
    Performs the call operation.
    ","Fn","bdk_esplora::blocking_ext::Error"],["
    1.35.0 · Source§
    impl<Args, F, A> FnMut<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: FnMut<Args> + ?Sized,\n    A: Allocator,
    Source§
    extern "rust-call" fn call_mut(\n    &mut self,\n    args: Args,\n) -> <Box<F, A> as FnOnce<Args>>::Output
    🔬This is a nightly-only experimental API. (fn_traits)
    Performs the call operation.
    ","FnMut","bdk_esplora::blocking_ext::Error"],["
    1.35.0 · Source§
    impl<Args, F, A> FnOnce<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: FnOnce<Args> + ?Sized,\n    A: Allocator,
    Source§
    type Output = <F as FnOnce<Args>>::Output
    The returned type after the call operator is used.
    Source§
    extern "rust-call" fn call_once(\n    self,\n    args: Args,\n) -> <Box<F, A> as FnOnce<Args>>::Output
    🔬This is a nightly-only experimental API. (fn_traits)
    Performs the call operation.
    ","FnOnce","bdk_esplora::blocking_ext::Error"],["
    1.6.0 · Source§
    impl<T> From<T> for Box<T>
    Source§
    fn from(t: T) -> Box<T>
    Converts a T into a Box<T>
    \n
    The conversion allocates on the heap and moves t\nfrom the stack into it.
    \n
    §Examples
    \n
    let x = 5;\nlet boxed = Box::new(5);\n\nassert_eq!(Box::from(x), boxed);
    \n
    ","From","bdk_esplora::blocking_ext::Error"],["
    §
    impl<F> FusedFuture for Box<F>
    where\n    F: FusedFuture + Unpin + ?Sized,
    §
    fn is_terminated(&self) -> bool
    Returns true if the underlying future should no longer be polled.
    ","FusedFuture","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S> FusedStream for Box<S>
    where\n    S: FusedStream + Unpin + ?Sized,
    §
    fn is_terminated(&self) -> bool
    Returns true if the stream should no longer be polled.
    ","FusedStream","bdk_esplora::blocking_ext::Error"],["
    1.36.0 · Source§
    impl<F, A> Future for Box<F, A>
    where\n    F: Future + Unpin + ?Sized,\n    A: Allocator,
    Source§
    type Output = <F as Future>::Output
    The type of value produced on completion.
    Source§
    fn poll(\n    self: Pin<&mut Box<F, A>>,\n    cx: &mut Context<'_>,\n) -> Poll<<Box<F, A> as Future>::Output>
    Attempts to resolve the future to a final value, registering\nthe current task for wakeup if the value is not yet available. Read more
    ","Future","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> Hash for Box<T, A>
    where\n    T: Hash + ?Sized,\n    A: Allocator,
    Source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · Source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where\n    H: Hasher,\n    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_esplora::blocking_ext::Error"],["
    1.22.0 · Source§
    impl<T, A> Hasher for Box<T, A>
    where\n    T: Hasher + ?Sized,\n    A: Allocator,
    Source§
    fn finish(&self) -> u64
    Returns the hash value for the values written so far. Read more
    Source§
    fn write(&mut self, bytes: &[u8])
    Writes some data into this Hasher. Read more
    Source§
    fn write_u8(&mut self, i: u8)
    Writes a single u8 into this hasher.
    Source§
    fn write_u16(&mut self, i: u16)
    Writes a single u16 into this hasher.
    Source§
    fn write_u32(&mut self, i: u32)
    Writes a single u32 into this hasher.
    Source§
    fn write_u64(&mut self, i: u64)
    Writes a single u64 into this hasher.
    Source§
    fn write_u128(&mut self, i: u128)
    Writes a single u128 into this hasher.
    Source§
    fn write_usize(&mut self, i: usize)
    Writes a single usize into this hasher.
    Source§
    fn write_i8(&mut self, i: i8)
    Writes a single i8 into this hasher.
    Source§
    fn write_i16(&mut self, i: i16)
    Writes a single i16 into this hasher.
    Source§
    fn write_i32(&mut self, i: i32)
    Writes a single i32 into this hasher.
    Source§
    fn write_i64(&mut self, i: i64)
    Writes a single i64 into this hasher.
    Source§
    fn write_i128(&mut self, i: i128)
    Writes a single i128 into this hasher.
    Source§
    fn write_isize(&mut self, i: isize)
    Writes a single isize into this hasher.
    Source§
    fn write_length_prefix(&mut self, len: usize)
    🔬This is a nightly-only experimental API. (hasher_prefixfree_extras)
    Writes a length prefix into this hasher, as part of being prefix-free. Read more
    Source§
    fn write_str(&mut self, s: &str)
    🔬This is a nightly-only experimental API. (hasher_prefixfree_extras)
    Writes a single str into this hasher. Read more
    ","Hasher","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<I, A> Iterator for Box<I, A>
    where\n    I: Iterator + ?Sized,\n    A: Allocator,
    Source§
    type Item = <I as Iterator>::Item
    The type of the elements being iterated over.
    Source§
    fn next(&mut self) -> Option<<I as Iterator>::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 nth(&mut self, n: usize) -> Option<<I as Iterator>::Item>
    Returns the nth element of the iterator. Read more
    Source§
    fn last(self) -> Option<<I as Iterator>::Item>
    Consumes the iterator, returning the last element. Read more
    Source§
    fn next_chunk<const N: usize>(\n    &mut self,\n) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>
    where\n    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\n    Self: Sized,
    Consumes the iterator, counting the number of iterations and returning it. 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\n    Self: Sized,
    Creates an iterator starting at the same point, but stepping by\nthe given amount at each iteration. Read more
    1.0.0 · Source§
    fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>
    where\n    Self: Sized,\n    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\n    Self: Sized,\n    U: IntoIterator,
    ‘Zips up’ two iterators into a single iterator of pairs. Read more
    Source§
    fn intersperse(self, separator: Self::Item) -> Intersperse<Self>
    where\n    Self: Sized,\n    Self::Item: Clone,
    🔬This is a nightly-only experimental API. (iter_intersperse)
    Creates a new iterator which places a copy of separator between adjacent\nitems of the original iterator. Read more
    Source§
    fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>
    where\n    Self: Sized,\n    G: FnMut() -> Self::Item,
    🔬This is a nightly-only experimental API. (iter_intersperse)
    Creates a new iterator which places an item generated by separator\nbetween adjacent items of the original iterator. Read more
    1.0.0 · Source§
    fn map<B, F>(self, f: F) -> Map<Self, F>
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> B,
    Takes a closure and creates an iterator which calls that closure on each\nelement. Read more
    1.21.0 · Source§
    fn for_each<F>(self, f: F)
    where\n    Self: Sized,\n    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\n    Self: Sized,\n    P: FnMut(&Self::Item) -> bool,
    Creates an iterator which uses a closure to determine if an element\nshould be yielded. Read more
    1.0.0 · Source§
    fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>
    where\n    Self: Sized,\n    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\n    Self: Sized,
    Creates an iterator which gives the current iteration count as well as\nthe next value. Read more
    1.0.0 · Source§
    fn peekable(self) -> Peekable<Self>
    where\n    Self: Sized,
    Creates an iterator which can use the peek and peek_mut methods\nto look at the next element of the iterator without consuming it. See\ntheir documentation for more information. Read more
    1.0.0 · Source§
    fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>
    where\n    Self: Sized,\n    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\n    Self: Sized,\n    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\n    Self: Sized,\n    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\n    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\n    Self: Sized,
    Creates an iterator that yields the first n elements, or fewer\nif 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\n    Self: Sized,\n    F: FnMut(&mut St, Self::Item) -> Option<B>,
    An iterator adapter which, like fold, holds internal state, but\nunlike fold, produces a new iterator. Read more
    1.0.0 · Source§
    fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>
    where\n    Self: Sized,\n    U: IntoIterator,\n    F: FnMut(Self::Item) -> U,
    Creates an iterator that works like map, but flattens nested structure. Read more
    1.29.0 · Source§
    fn flatten(self) -> Flatten<Self>
    where\n    Self: Sized,\n    Self::Item: IntoIterator,
    Creates an iterator that flattens nested structure. Read more
    Source§
    fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>
    where\n    Self: Sized,\n    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\nself and returns an iterator over the outputs of f. Like slice::windows(),\nthe windows during mapping overlap as well. Read more
    1.0.0 · Source§
    fn fuse(self) -> Fuse<Self>
    where\n    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\n    Self: Sized,\n    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\n    Self: Sized,
    Borrows an iterator, rather than consuming it. Read more
    1.0.0 · Source§
    fn collect<B>(self) -> B
    where\n    B: FromIterator<Self::Item>,\n    Self: Sized,
    Transforms an iterator into a collection. Read more
    Source§
    fn try_collect<B>(\n    &mut self,\n) -> <<Self::Item as Try>::Residual as Residual<B>>::TryType
    where\n    Self: Sized,\n    Self::Item: Try,\n    <Self::Item as Try>::Residual: Residual<B>,\n    B: FromIterator<<Self::Item as Try>::Output>,
    🔬This is a nightly-only experimental API. (iterator_try_collect)
    Fallibly transforms an iterator into a collection, short circuiting if\na failure is encountered. Read more
    Source§
    fn collect_into<E>(self, collection: &mut E) -> &mut E
    where\n    E: Extend<Self::Item>,\n    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\n    Self: Sized,\n    B: Default + Extend<Self::Item>,\n    F: FnMut(&Self::Item) -> bool,
    Consumes an iterator, creating two collections from it. Read more
    Source§
    fn partition_in_place<'a, T, P>(self, predicate: P) -> usize
    where\n    T: 'a,\n    Self: Sized + DoubleEndedIterator<Item = &'a mut T>,\n    P: FnMut(&T) -> bool,
    🔬This is a nightly-only experimental API. (iter_partition_in_place)
    Reorders the elements of this iterator in-place according to the given predicate,\nsuch that all those that return true precede all those that return false.\nReturns the number of true elements found. Read more
    Source§
    fn is_partitioned<P>(self, predicate: P) -> bool
    where\n    Self: Sized,\n    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,\nsuch 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\n    Self: Sized,\n    F: FnMut(B, Self::Item) -> R,\n    R: Try<Output = B>,
    An iterator method that applies a function as long as it returns\nsuccessfully, producing a single, final value. Read more
    1.27.0 · Source§
    fn try_for_each<F, R>(&mut self, f: F) -> R
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> R,\n    R: Try<Output = ()>,
    An iterator method that applies a fallible function to each item in the\niterator, 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\n    Self: Sized,\n    F: FnMut(B, Self::Item) -> B,
    Folds every element into an accumulator by applying an operation,\nreturning the final result. Read more
    1.51.0 · Source§
    fn reduce<F>(self, f: F) -> Option<Self::Item>
    where\n    Self: Sized,\n    F: FnMut(Self::Item, Self::Item) -> Self::Item,
    Reduces the elements to a single one, by repeatedly applying a reducing\noperation. Read more
    Source§
    fn try_reduce<R>(\n    &mut self,\n    f: impl FnMut(Self::Item, Self::Item) -> R,\n) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType
    where\n    Self: Sized,\n    R: Try<Output = Self::Item>,\n    <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\nclosure 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\n    Self: Sized,\n    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\n    Self: Sized,\n    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\n    Self: Sized,\n    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\n    Self: Sized,\n    F: FnMut(Self::Item) -> Option<B>,
    Applies function to the elements of iterator and returns\nthe first non-none result. Read more
    Source§
    fn try_find<R>(\n    &mut self,\n    f: impl FnMut(&Self::Item) -> R,\n) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType
    where\n    Self: Sized,\n    R: Try<Output = bool>,\n    <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\nthe first true result or the first error. Read more
    1.0.0 · Source§
    fn position<P>(&mut self, predicate: P) -> Option<usize>
    where\n    Self: Sized,\n    P: FnMut(Self::Item) -> bool,
    Searches for an element in an iterator, returning its index. Read more
    1.0.0 · Source§
    fn rposition<P>(&mut self, predicate: P) -> Option<usize>
    where\n    P: FnMut(Self::Item) -> bool,\n    Self: Sized + ExactSizeIterator + DoubleEndedIterator,
    Searches for an element in an iterator from the right, returning its\nindex. Read more
    1.0.0 · Source§
    fn max(self) -> Option<Self::Item>
    where\n    Self: Sized,\n    Self::Item: Ord,
    Returns the maximum element of an iterator. Read more
    1.0.0 · Source§
    fn min(self) -> Option<Self::Item>
    where\n    Self: Sized,\n    Self::Item: Ord,
    Returns the minimum element of an iterator. Read more
    1.6.0 · Source§
    fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>
    where\n    B: Ord,\n    Self: Sized,\n    F: FnMut(&Self::Item) -> B,
    Returns the element that gives the maximum value from the\nspecified function. Read more
    1.15.0 · Source§
    fn max_by<F>(self, compare: F) -> Option<Self::Item>
    where\n    Self: Sized,\n    F: FnMut(&Self::Item, &Self::Item) -> Ordering,
    Returns the element that gives the maximum value with respect to the\nspecified comparison function. Read more
    1.6.0 · Source§
    fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>
    where\n    B: Ord,\n    Self: Sized,\n    F: FnMut(&Self::Item) -> B,
    Returns the element that gives the minimum value from the\nspecified function. Read more
    1.15.0 · Source§
    fn min_by<F>(self, compare: F) -> Option<Self::Item>
    where\n    Self: Sized,\n    F: FnMut(&Self::Item, &Self::Item) -> Ordering,
    Returns the element that gives the minimum value with respect to the\nspecified comparison function. Read more
    1.0.0 · Source§
    fn rev(self) -> Rev<Self>
    where\n    Self: Sized + DoubleEndedIterator,
    Reverses an iterator’s direction. Read more
    1.0.0 · Source§
    fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)
    where\n    FromA: Default + Extend<A>,\n    FromB: Default + Extend<B>,\n    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\n    T: 'a + Copy,\n    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\n    T: 'a + Clone,\n    Self: Sized + Iterator<Item = &'a T>,
    Creates an iterator which clones all of its elements. Read more
    1.0.0 · Source§
    fn cycle(self) -> Cycle<Self>
    where\n    Self: Sized + Clone,
    Repeats an iterator endlessly. Read more
    Source§
    fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>
    where\n    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\n    Self: Sized,\n    S: Sum<Self::Item>,
    Sums the elements of an iterator. Read more
    1.11.0 · Source§
    fn product<P>(self) -> P
    where\n    Self: Sized,\n    P: Product<Self::Item>,
    Iterates over the entire iterator, multiplying all the elements Read more
    1.5.0 · Source§
    fn cmp<I>(self, other: I) -> Ordering
    where\n    I: IntoIterator<Item = Self::Item>,\n    Self::Item: Ord,\n    Self: Sized,
    Lexicographically compares the elements of this Iterator with those\nof another. Read more
    Source§
    fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering
    where\n    Self: Sized,\n    I: IntoIterator,\n    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\nof another with respect to the specified comparison function. Read more
    1.5.0 · Source§
    fn partial_cmp<I>(self, other: I) -> Option<Ordering>
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Lexicographically compares the PartialOrd elements of\nthis Iterator with those of another. The comparison works like short-circuit\nevaluation, returning a result without comparing the remaining elements.\nAs 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\n    Self: Sized,\n    I: IntoIterator,\n    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\nof another with respect to the specified comparison function. Read more
    1.5.0 · Source§
    fn eq<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialEq<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are equal to those of\nanother. Read more
    Source§
    fn eq_by<I, F>(self, other: I, eq: F) -> bool
    where\n    Self: Sized,\n    I: IntoIterator,\n    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\nanother with respect to the specified equality function. Read more
    1.5.0 · Source§
    fn ne<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialEq<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are not equal to those of\nanother. Read more
    1.5.0 · Source§
    fn lt<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are lexicographically\nless than those of another. Read more
    1.5.0 · Source§
    fn le<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are lexicographically\nless or equal to those of another. Read more
    1.5.0 · Source§
    fn gt<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are lexicographically\ngreater than those of another. Read more
    1.5.0 · Source§
    fn ge<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are lexicographically\ngreater than or equal to those of another. Read more
    1.82.0 · Source§
    fn is_sorted(self) -> bool
    where\n    Self: Sized,\n    Self::Item: PartialOrd,
    Checks if the elements of this iterator are sorted. Read more
    1.82.0 · Source§
    fn is_sorted_by<F>(self, compare: F) -> bool
    where\n    Self: Sized,\n    F: FnMut(&Self::Item, &Self::Item) -> bool,
    Checks if the elements of this iterator are sorted using the given comparator function. Read more
    1.82.0 · Source§
    fn is_sorted_by_key<F, K>(self, f: F) -> bool
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> K,\n    K: PartialOrd,
    Checks if the elements of this iterator are sorted using the given key extraction\nfunction. Read more
    ","Iterator","bdk_esplora::blocking_ext::Error"],["
    §
    impl<Sp> LocalSpawn for Box<Sp>
    where\n    Sp: LocalSpawn + ?Sized,
    §
    fn spawn_local_obj(\n    &self,\n    future: LocalFutureObj<'static, ()>,\n) -> Result<(), SpawnError>
    Spawns a future that will be run to completion. Read more
    §
    fn status_local(&self) -> Result<(), SpawnError>
    Determines whether the executor is able to spawn new tasks. Read more
    ","LocalSpawn","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> Ord for Box<T, A>
    where\n    T: Ord + ?Sized,\n    A: Allocator,
    Source§
    fn cmp(&self, other: &Box<T, A>) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> PartialEq for Box<T, A>
    where\n    T: PartialEq + ?Sized,\n    A: Allocator,
    Source§
    fn eq(&self, other: &Box<T, A>) -> bool
    Tests for self and other values to be equal, and is used by ==.
    Source§
    fn ne(&self, other: &Box<T, A>) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> PartialOrd for Box<T, A>
    where\n    T: PartialOrd + ?Sized,\n    A: Allocator,
    Source§
    fn partial_cmp(&self, other: &Box<T, A>) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    Source§
    fn lt(&self, other: &Box<T, A>) -> bool
    Tests less than (for self and other) and is used by the < operator. Read more
    Source§
    fn le(&self, other: &Box<T, A>) -> bool
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    Source§
    fn ge(&self, other: &Box<T, A>) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    Source§
    fn gt(&self, other: &Box<T, A>) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    ","PartialOrd","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> Pointer for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Pointer","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<R> Read for Box<R>
    where\n    R: Read + ?Sized,
    Source§
    fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>
    Pull some bytes from this source into the specified buffer, returning\nhow many bytes were read. Read more
    Source§
    fn read_buf(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>
    🔬This is a nightly-only experimental API. (read_buf)
    Pull some bytes from this source into the specified buffer. Read more
    Source§
    fn read_vectored(&mut self, bufs: &mut [IoSliceMut<'_>]) -> Result<usize, Error>
    Like read, except that it reads into a slice of buffers. Read more
    Source§
    fn is_read_vectored(&self) -> bool
    🔬This is a nightly-only experimental API. (can_vector)
    Determines if this Reader has an efficient read_vectored\nimplementation. Read more
    Source§
    fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>
    Reads all bytes until EOF in this source, placing them into buf. Read more
    Source§
    fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>
    Reads all bytes until EOF in this source, appending them to buf. Read more
    Source§
    fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>
    Reads the exact number of bytes required to fill buf. Read more
    Source§
    fn read_buf_exact(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>
    🔬This is a nightly-only experimental API. (read_buf)
    Reads the exact number of bytes required to fill cursor. Read more
    1.0.0 · Source§
    fn by_ref(&mut self) -> &mut Self
    where\n    Self: Sized,
    Creates a “by reference” adaptor for this instance of Read. Read more
    1.0.0 · Source§
    fn bytes(self) -> Bytes<Self>
    where\n    Self: Sized,
    Transforms this Read instance to an Iterator over its bytes. Read more
    1.0.0 · Source§
    fn chain<R>(self, next: R) -> Chain<Self, R>
    where\n    R: Read,\n    Self: Sized,
    Creates an adapter which will chain this stream with another. Read more
    1.0.0 · Source§
    fn take(self, limit: u64) -> Take<Self>
    where\n    Self: Sized,
    Creates an adapter which will read at most limit bytes from it. Read more
    ","Read","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<R> RngCore for Box<R>
    where\n    R: RngCore + ?Sized,
    Source§
    fn next_u32(&mut self) -> u32
    Return the next random u32. Read more
    Source§
    fn next_u64(&mut self) -> u64
    Return the next random u64. Read more
    Source§
    fn fill_bytes(&mut self, dest: &mut [u8])
    Fill dest with random data. Read more
    Source§
    fn try_fill_bytes(&mut self, dest: &mut [u8]) -> Result<(), Error>
    Fill dest entirely with random data. Read more
    ","RngCore","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<S> Seek for Box<S>
    where\n    S: Seek + ?Sized,
    Source§
    fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>
    Seek to an offset, in bytes, in a stream. Read more
    Source§
    fn stream_position(&mut self) -> Result<u64, Error>
    Returns the current seek position from the start of the stream. Read more
    1.55.0 · Source§
    fn rewind(&mut self) -> Result<(), Error>
    Rewind to the beginning of a stream. Read more
    Source§
    fn stream_len(&mut self) -> Result<u64, Error>
    🔬This is a nightly-only experimental API. (seek_stream_len)
    Returns the length of this stream (in bytes). Read more
    1.80.0 · Source§
    fn seek_relative(&mut self, offset: i64) -> Result<(), Error>
    Seeks relative to the current position. Read more
    ","Seek","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T> Serialize for Box<T>
    where\n    T: Serialize + ?Sized,
    Source§
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S, Request> Service<Request> for Box<S>
    where\n    S: Service<Request> + ?Sized,
    §
    type Response = <S as Service<Request>>::Response
    Responses given by the service.
    §
    type Error = <S as Service<Request>>::Error
    Errors produced by the service.
    §
    type Future = <S as Service<Request>>::Future
    The future response value.
    §
    fn poll_ready(\n    &mut self,\n    cx: &mut Context<'_>,\n) -> Poll<Result<(), <S as Service<Request>>::Error>>
    Returns Poll::Ready(Ok(())) when the service is able to process requests. Read more
    §
    fn call(&mut self, request: Request) -> <S as Service<Request>>::Future
    Process the request and return the response asynchronously. Read more
    ","Service","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S, Item> Sink<Item> for Box<S>
    where\n    S: Sink<Item> + Unpin + ?Sized,
    §
    type Error = <S as Sink<Item>>::Error
    The type of value produced by the sink when an error occurs.
    §
    fn poll_ready(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<(), <Box<S> as Sink<Item>>::Error>>
    Attempts to prepare the Sink to receive a value. Read more
    §
    fn start_send(\n    self: Pin<&mut Box<S>>,\n    item: Item,\n) -> Result<(), <Box<S> as Sink<Item>>::Error>
    Begin the process of sending a value to the sink.\nEach call to this function must be preceded by a successful call to\npoll_ready which returned Poll::Ready(Ok(())). Read more
    §
    fn poll_flush(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<(), <Box<S> as Sink<Item>>::Error>>
    Flush any remaining output from this sink. Read more
    §
    fn poll_close(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<(), <Box<S> as Sink<Item>>::Error>>
    Flush any remaining output and close this sink, if necessary. Read more
    ","Sink","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> Source for Box<T>
    where\n    T: Source + ?Sized,
    §
    fn register(\n    &mut self,\n    registry: &Registry,\n    token: Token,\n    interests: Interest,\n) -> Result<(), Error>
    Register self with the given Registry instance. Read more
    §
    fn reregister(\n    &mut self,\n    registry: &Registry,\n    token: Token,\n    interests: Interest,\n) -> Result<(), Error>
    Re-register self with the given Registry instance. Read more
    §
    fn deregister(&mut self, registry: &Registry) -> Result<(), Error>
    Deregister self from the given Registry instance. Read more
    ","Source","bdk_esplora::blocking_ext::Error"],["
    §
    impl<Sp> Spawn for Box<Sp>
    where\n    Sp: Spawn + ?Sized,
    §
    fn spawn_obj(&self, future: FutureObj<'static, ()>) -> Result<(), SpawnError>
    Spawns a future that will be run to completion. Read more
    §
    fn status(&self) -> Result<(), SpawnError>
    Determines whether the executor is able to spawn new tasks. Read more
    ","Spawn","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S> Stream for Box<S>
    where\n    S: Stream + Unpin + ?Sized,
    §
    type Item = <S as Stream>::Item
    Values yielded by the stream.
    §
    fn poll_next(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>,\n) -> Poll<Option<<Box<S> as Stream>::Item>>
    Attempt to pull out the next value of this stream, registering the\ncurrent task for wakeup if the value is not yet available, and returning\nNone if the stream is exhausted. Read more
    §
    fn size_hint(&self) -> (usize, Option<usize>)
    Returns the bounds on the remaining length of the stream. Read more
    ","Stream","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S> Subscriber for Box<S>
    where\n    S: Subscriber + ?Sized,
    §
    fn register_callsite(&self, metadata: &'static Metadata<'static>) -> Interest
    Registers a new callsite with this subscriber, returning whether or not\nthe subscriber is interested in being notified about the callsite. Read more
    §
    fn enabled(&self, metadata: &Metadata<'_>) -> bool
    Returns true if a span or event with the specified metadata would be\nrecorded. Read more
    §
    fn max_level_hint(&self) -> Option<LevelFilter>
    Returns the highest verbosity level that this Subscriber will\nenable, or None, if the subscriber does not implement level-based\nfiltering or chooses not to implement this method. Read more
    §
    fn new_span(&self, span: &Attributes<'_>) -> Id
    Visit the construction of a new span, returning a new span ID for the\nspan being constructed. Read more
    §
    fn record(&self, span: &Id, values: &Record<'_>)
    Record a set of values on a span. Read more
    §
    fn record_follows_from(&self, span: &Id, follows: &Id)
    Adds an indication that span follows from the span with the id\nfollows. Read more
    §
    fn event_enabled(&self, event: &Event<'_>) -> bool
    Determine if an [Event] should be recorded. Read more
    §
    fn event(&self, event: &Event<'_>)
    Records that an Event has occurred. Read more
    §
    fn enter(&self, span: &Id)
    Records that a span has been entered. Read more
    §
    fn exit(&self, span: &Id)
    Records that a span has been exited. Read more
    §
    fn clone_span(&self, id: &Id) -> Id
    Notifies the subscriber that a span ID has been cloned. Read more
    §
    fn try_close(&self, id: Id) -> bool
    Notifies the subscriber that a span ID has been dropped, and returns\ntrue if there are now 0 IDs that refer to that span. Read more
    §
    fn drop_span(&self, id: Id)
    👎Deprecated since 0.1.2: use Subscriber::try_close instead
    This method is deprecated. Read more
    §
    fn current_span(&self) -> Current
    Returns a type representing this subscriber’s view of the current span. Read more
    §
    unsafe fn downcast_raw(&self, id: TypeId) -> Option<*const ()>
    If self is the same type as the provided TypeId, returns an untyped\n*const pointer to that type. Otherwise, returns None. Read more
    §
    fn on_register_dispatch(&self, subscriber: &Dispatch)
    Invoked when this subscriber becomes a [Dispatch]. Read more
    ","Subscriber","bdk_esplora::blocking_ext::Error"],["
    §
    impl<'a, T, F> UnsafeFutureObj<'a, T> for Box<F>
    where\n    F: Future<Output = T> + 'a,
    §
    fn into_raw(self) -> *mut dyn Future<Output = T> + 'a
    Convert an owned instance into a (conceptually owned) fat pointer. Read more
    §
    unsafe fn drop(ptr: *mut dyn Future<Output = T> + 'a)
    Drops the future represented by the given fat pointer. Read more
    ","UnsafeFutureObj<'a, T>","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> Value for Box<T>
    where\n    T: Value + ?Sized,
    §
    fn record(&self, key: &Field, visitor: &mut dyn Visit)
    Visits this value with the given Visitor.
    ","Value","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<W> Write for Box<W>
    where\n    W: Write + ?Sized,
    Source§
    fn write(&mut self, buf: &[u8]) -> Result<usize, Error>
    Writes a buffer into this writer, returning how many bytes were written. Read more
    Source§
    fn write_vectored(&mut self, bufs: &[IoSlice<'_>]) -> Result<usize, Error>
    Like write, except that it writes from a slice of buffers. Read more
    Source§
    fn is_write_vectored(&self) -> bool
    🔬This is a nightly-only experimental API. (can_vector)
    Determines if this Writer has an efficient write_vectored\nimplementation. Read more
    Source§
    fn flush(&mut self) -> Result<(), Error>
    Flushes this output stream, ensuring that all intermediately buffered\ncontents reach their destination. Read more
    Source§
    fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>
    Attempts to write an entire buffer into this writer. Read more
    Source§
    fn write_fmt(&mut self, fmt: Arguments<'_>) -> Result<(), Error>
    Writes a formatted string into this writer, returning any error\nencountered. Read more
    Source§
    fn write_all_vectored(&mut self, bufs: &mut [IoSlice<'_>]) -> Result<(), Error>
    🔬This is a nightly-only experimental API. (write_all_vectored)
    Attempts to write multiple buffers into this writer. Read more
    1.0.0 · Source§
    fn by_ref(&mut self) -> &mut Self
    where\n    Self: Sized,
    Creates a “by reference” adapter for this instance of Write. Read more
    ","Write","bdk_esplora::blocking_ext::Error"],["
    §
    impl<'a, T> Writeable for Box<T>
    where\n    T: Writeable + ?Sized,
    §
    fn write_to<W>(&self, sink: &mut W) -> Result<(), Error>
    where\n    W: Write + ?Sized,
    Writes a string to the given sink. Errors from the sink are bubbled up.\nThe default implementation delegates to write_to_parts, and discards any\nPart annotations.
    §
    fn write_to_parts<W>(&self, sink: &mut W) -> Result<(), Error>
    where\n    W: PartsWrite + ?Sized,
    Write bytes and Part annotations to the given sink. Errors from the\nsink are bubbled up. The default implementation delegates to write_to,\nand doesn’t produce any Part annotations.
    §
    fn writeable_length_hint(&self) -> LengthHint
    Returns a hint for the number of UTF-8 bytes that will be written to the sink. Read more
    §
    fn write_to_string(&self) -> Cow<'_, str>
    Creates a new String with the data from this Writeable. Like ToString,\nbut smaller and faster. Read more
    §
    fn writeable_cmp_bytes(&self, other: &[u8]) -> Ordering
    Compares the contents of this Writeable to the given bytes\nwithout allocating a String to hold the Writeable contents. Read more
    ","Writeable","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> CartablePointerLike for Box<T>
    ","CartablePointerLike","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T, U, A> CoerceUnsized<Box<U, A>> for Box<T, A>
    where\n    T: Unsize<U> + ?Sized,\n    A: Allocator,\n    U: ?Sized,
    ","CoerceUnsized>","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<R> CryptoRng for Box<R>
    where\n    R: CryptoRng + ?Sized,
    ","CryptoRng","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T, A> DerefPure for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    ","DerefPure","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T, U> DispatchFromDyn<Box<U>> for Box<T>
    where\n    T: Unsize<U> + ?Sized,\n    U: ?Sized,
    ","DispatchFromDyn>","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> Eq for Box<T, A>
    where\n    T: Eq + ?Sized,\n    A: Allocator,
    ","Eq","bdk_esplora::blocking_ext::Error"],["
    1.26.0 · Source§
    impl<I, A> FusedIterator for Box<I, A>
    where\n    I: FusedIterator + ?Sized,\n    A: Allocator,
    ","FusedIterator","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T, A> PinCoerceUnsized for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    ","PinCoerceUnsized","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T> PointerLike for Box<T>
    ","PointerLike","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> StableDeref for Box<T>
    where\n    T: ?Sized,
    ","StableDeref","bdk_esplora::blocking_ext::Error"],["
    1.33.0 · Source§
    impl<T, A> Unpin for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    ","Unpin","bdk_esplora::blocking_ext::Error"]]]]);
+    var type_impls = Object.fromEntries([["bdk_esplora",[["
    §
    impl<T> AnyProvider for Box<T>
    where\n    T: AnyProvider + ?Sized,
    §
    fn load_any(\n    &self,\n    key: DataKey,\n    req: DataRequest<'_>,\n) -> Result<AnyResponse, DataError>
    Loads an [AnyPayload] according to the key and request.
    ","AnyProvider","bdk_esplora::blocking_ext::Error"],["
    1.64.0 · Source§
    impl<T> AsFd for Box<T>
    where\n    T: AsFd + ?Sized,
    Source§
    fn as_fd(&self) -> BorrowedFd<'_>
    Borrows the file descriptor. Read more
    ","AsFd","bdk_esplora::blocking_ext::Error"],["
    1.5.0 · Source§
    impl<T, A> AsMut<T> for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    Source§
    fn as_mut(&mut self) -> &mut T
    Converts this type into a mutable reference of the (usually inferred) input type.
    ","AsMut","bdk_esplora::blocking_ext::Error"],["
    1.63.0 · Source§
    impl<T> AsRawFd for Box<T>
    where\n    T: AsRawFd,
    Source§
    fn as_raw_fd(&self) -> i32
    Extracts the raw file descriptor. Read more
    ","AsRawFd","bdk_esplora::blocking_ext::Error"],["
    1.5.0 · Source§
    impl<T, A> AsRef<T> for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    Source§
    fn as_ref(&self) -> &T
    Converts this type into a shared reference of the (usually inferred) input type.
    ","AsRef","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncBufRead for Box<T>
    where\n    T: AsyncBufRead + Unpin + ?Sized,
    §
    fn poll_fill_buf(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<&[u8], Error>>
    Attempt to return the contents of the internal buffer, filling it with more data\nfrom the inner reader if it is empty. Read more
    §
    fn consume(self: Pin<&mut Box<T>>, amt: usize)
    Tells this buffer that amt bytes have been consumed from the buffer,\nso they should no longer be returned in calls to poll_read. Read more
    ","AsyncBufRead","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncBufRead for Box<T>
    where\n    T: AsyncBufRead + Unpin + ?Sized,
    §
    fn poll_fill_buf(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<&[u8], Error>>
    Attempts to return the contents of the internal buffer, filling it with more data\nfrom the inner reader if it is empty. Read more
    §
    fn consume(self: Pin<&mut Box<T>>, amt: usize)
    Tells this buffer that amt bytes have been consumed from the buffer,\nso they should no longer be returned in calls to poll_read. Read more
    ","AsyncBufRead","bdk_esplora::blocking_ext::Error"],["
    1.85.0 · Source§
    impl<Args, F, A> AsyncFn<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: AsyncFn<Args> + ?Sized,\n    A: Allocator,
    Source§
    extern "rust-call" fn async_call(\n    &self,\n    args: Args,\n) -> <Box<F, A> as AsyncFnMut<Args>>::CallRefFuture<'_>
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Call the AsyncFn, returning a future which may borrow from the called closure.
    ","AsyncFn","bdk_esplora::blocking_ext::Error"],["
    1.85.0 · Source§
    impl<Args, F, A> AsyncFnMut<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: AsyncFnMut<Args> + ?Sized,\n    A: Allocator,
    Source§
    type CallRefFuture<'a> = <F as AsyncFnMut<Args>>::CallRefFuture<'a>\nwhere\n    Box<F, A>: 'a
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Future returned by AsyncFnMut::async_call_mut and AsyncFn::async_call.
    Source§
    extern "rust-call" fn async_call_mut(\n    &mut self,\n    args: Args,\n) -> <Box<F, A> as AsyncFnMut<Args>>::CallRefFuture<'_>
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Call the AsyncFnMut, returning a future which may borrow from the called closure.
    ","AsyncFnMut","bdk_esplora::blocking_ext::Error"],["
    1.85.0 · Source§
    impl<Args, F, A> AsyncFnOnce<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: AsyncFnOnce<Args> + ?Sized,\n    A: Allocator,
    Source§
    type Output = <F as AsyncFnOnce<Args>>::Output
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Output type of the called closure’s future.
    Source§
    type CallOnceFuture = <F as AsyncFnOnce<Args>>::CallOnceFuture
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Future returned by AsyncFnOnce::async_call_once.
    Source§
    extern "rust-call" fn async_call_once(\n    self,\n    args: Args,\n) -> <Box<F, A> as AsyncFnOnce<Args>>::CallOnceFuture
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Call the AsyncFnOnce, returning a future which may move out of the called closure.
    ","AsyncFnOnce","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<S> AsyncIterator for Box<S>
    where\n    S: AsyncIterator + Unpin + ?Sized,
    Source§
    type Item = <S as AsyncIterator>::Item
    🔬This is a nightly-only experimental API. (async_iterator)
    The type of items yielded by the async iterator.
    Source§
    fn poll_next(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>,\n) -> Poll<Option<<Box<S> as AsyncIterator>::Item>>
    🔬This is a nightly-only experimental API. (async_iterator)
    Attempts to pull out the next value of this async iterator, registering the\ncurrent task for wakeup if the value is not yet available, and returning\nNone if the async iterator is exhausted. Read more
    Source§
    fn size_hint(&self) -> (usize, Option<usize>)
    🔬This is a nightly-only experimental API. (async_iterator)
    Returns the bounds on the remaining length of the async iterator. Read more
    ","AsyncIterator","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncRead for Box<T>
    where\n    T: AsyncRead + Unpin + ?Sized,
    §
    fn poll_read(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    buf: &mut ReadBuf<'_>,\n) -> Poll<Result<(), Error>>
    Attempts to read from the AsyncRead into buf. Read more
    ","AsyncRead","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncRead for Box<T>
    where\n    T: AsyncRead + Unpin + ?Sized,
    §
    fn poll_read(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    buf: &mut [u8],\n) -> Poll<Result<usize, Error>>
    Attempt to read from the AsyncRead into buf. Read more
    §
    fn poll_read_vectored(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    bufs: &mut [IoSliceMut<'_>],\n) -> Poll<Result<usize, Error>>
    Attempt to read from the AsyncRead into bufs using vectored\nIO operations. Read more
    ","AsyncRead","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncSeek for Box<T>
    where\n    T: AsyncSeek + Unpin + ?Sized,
    §
    fn poll_seek(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    pos: SeekFrom,\n) -> Poll<Result<u64, Error>>
    Attempt to seek to an offset, in bytes, in a stream. Read more
    ","AsyncSeek","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncSeek for Box<T>
    where\n    T: AsyncSeek + Unpin + ?Sized,
    §
    fn start_seek(self: Pin<&mut Box<T>>, pos: SeekFrom) -> Result<(), Error>
    Attempts to seek to an offset, in bytes, in a stream. Read more
    §
    fn poll_complete(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<u64, Error>>
    Waits for a seek operation to complete. Read more
    ","AsyncSeek","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncWrite for Box<T>
    where\n    T: AsyncWrite + Unpin + ?Sized,
    §
    fn poll_write(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    buf: &[u8],\n) -> Poll<Result<usize, Error>>
    Attempt to write bytes from buf into the object. Read more
    §
    fn poll_write_vectored(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    bufs: &[IoSlice<'_>],\n) -> Poll<Result<usize, Error>>
    Attempt to write bytes from bufs into the object using vectored\nIO operations. Read more
    §
    fn poll_flush(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<(), Error>>
    Attempt to flush the object, ensuring that any buffered data reach\ntheir destination. Read more
    §
    fn poll_close(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<(), Error>>
    Attempt to close the object. Read more
    ","AsyncWrite","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncWrite for Box<T>
    where\n    T: AsyncWrite + Unpin + ?Sized,
    §
    fn poll_write(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    buf: &[u8],\n) -> Poll<Result<usize, Error>>
    Attempt to write bytes from buf into the object. Read more
    §
    fn poll_write_vectored(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    bufs: &[IoSlice<'_>],\n) -> Poll<Result<usize, Error>>
    Like poll_write, except that it writes from a slice of buffers. Read more
    §
    fn is_write_vectored(&self) -> bool
    Determines if this writer has an efficient poll_write_vectored\nimplementation. Read more
    §
    fn poll_flush(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<(), Error>>
    Attempts to flush the object, ensuring that any buffered data reach\ntheir destination. Read more
    §
    fn poll_shutdown(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<(), Error>>
    Initiates or attempts to shut down this writer, returning success when\nthe I/O connection has completely shut down. Read more
    ","AsyncWrite","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T> Body for Box<T>
    where\n    T: Body + Unpin + ?Sized,
    Source§
    type Data = <T as Body>::Data
    Values yielded by the Body.
    Source§
    type Error = <T as Body>::Error
    The error type this Body might generate.
    Source§
    fn poll_data(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n) -> Poll<Option<Result<<Box<T> as Body>::Data, <Box<T> as Body>::Error>>>
    Attempt to pull out the next data buffer of this stream.
    Source§
    fn poll_trailers(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<Option<HeaderMap>, <Box<T> as Body>::Error>>
    Poll for an optional single HeaderMap of trailers. Read more
    Source§
    fn is_end_stream(&self) -> bool
    Returns true when the end of stream has been reached. Read more
    Source§
    fn size_hint(&self) -> SizeHint
    Returns the bounds on the remaining length of the stream. Read more
    Source§
    fn data(&mut self) -> Data<'_, Self>
    where\n    Self: Sized + Unpin,
    Returns future that resolves to next data chunk, if any.
    Source§
    fn trailers(&mut self) -> Trailers<'_, Self>
    where\n    Self: Sized + Unpin,
    Returns future that resolves to trailers, if any.
    Source§
    fn map_data<F, B>(self, f: F) -> MapData<Self, F>
    where\n    Self: Sized,\n    F: FnMut(Self::Data) -> B,\n    B: Buf,
    Maps this body’s data value to a different value.
    Source§
    fn map_err<F, E>(self, f: F) -> MapErr<Self, F>
    where\n    Self: Sized,\n    F: FnMut(Self::Error) -> E,
    Maps this body’s error value to a different value.
    Source§
    fn collect(self) -> Collect<Self>
    where\n    Self: Sized,
    Turn this body into Collected body which will collect all the DATA frames\nand trailers.
    Source§
    fn boxed(self) -> BoxBody<Self::Data, Self::Error>
    where\n    Self: Sized + Send + Sync + 'static,
    Turn this body into a boxed trait object.
    Source§
    fn boxed_unsync(self) -> UnsyncBoxBody<Self::Data, Self::Error>
    where\n    Self: Sized + Send + 'static,
    Turn this body into a boxed trait object that is !Sync.
    ","Body","bdk_esplora::blocking_ext::Error"],["
    1.1.0 · Source§
    impl<T, A> Borrow<T> for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    Source§
    fn borrow(&self) -> &T
    Immutably borrows from an owned value. Read more
    ","Borrow","bdk_esplora::blocking_ext::Error"],["
    1.1.0 · Source§
    impl<T, A> BorrowMut<T> for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    Source§
    fn borrow_mut(&mut self) -> &mut T
    Mutably borrows from an owned value. Read more
    ","BorrowMut","bdk_esplora::blocking_ext::Error"],["
    §
    impl<M, P> BoundDataProvider<M> for Box<P>
    where\n    M: DataMarker,\n    P: BoundDataProvider<M> + ?Sized,
    §
    fn load_bound(&self, req: DataRequest<'_>) -> Result<DataResponse<M>, DataError>
    Query the provider for data, returning the result. Read more
    §
    fn bound_key(&self) -> DataKey
    Returns the [DataKey] that this provider uses for loading data.
    ","BoundDataProvider","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T> Box<T>
    where\n    T: ?Sized,
    1.4.0 · Source
    pub unsafe fn from_raw(raw: *mut T) -> Box<T>
    Constructs a box from a raw pointer.
    \n
    After calling this function, the raw pointer is owned by the\nresulting Box. Specifically, the Box destructor will call\nthe destructor of T and free the allocated memory. For this\nto be safe, the memory must have been allocated in accordance\nwith the memory layout used by Box .
    \n
    §Safety
    \n
    This function is unsafe because improper use may lead to\nmemory problems. For example, a double-free may occur if the\nfunction is called twice on the same raw pointer.
    \n
    The raw pointer must point to a block of memory allocated by the global allocator.
    \n
    The safety conditions are described in the memory layout section.
    \n
    §Examples
    \n
    Recreate a Box which was previously converted to a raw pointer\nusing Box::into_raw:
    \n\n
    let x = Box::new(5);\nlet ptr = Box::into_raw(x);\nlet x = unsafe { Box::from_raw(ptr) };
    \n
    Manually create a Box from scratch by using the global allocator:
    \n\n
    use std::alloc::{alloc, Layout};\n\nunsafe {\n    let ptr = alloc(Layout::new::<i32>()) as *mut i32;\n    // In general .write is required to avoid attempting to destruct\n    // the (uninitialized) previous contents of `ptr`, though for this\n    // simple example `*ptr = 5` would have worked as well.\n    ptr.write(5);\n    let x = Box::from_raw(ptr);\n}
    \n
    Source
    pub unsafe fn from_non_null(ptr: NonNull<T>) -> Box<T>
    🔬This is a nightly-only experimental API. (box_vec_non_null)
    Constructs a box from a NonNull pointer.
    \n
    After calling this function, the NonNull pointer is owned by\nthe resulting Box. Specifically, the Box destructor will call\nthe destructor of T and free the allocated memory. For this\nto be safe, the memory must have been allocated in accordance\nwith the memory layout used by Box .
    \n
    §Safety
    \n
    This function is unsafe because improper use may lead to\nmemory problems. For example, a double-free may occur if the\nfunction is called twice on the same NonNull pointer.
    \n
    The safety conditions are described in the memory layout section.
    \n
    §Examples
    \n
    Recreate a Box which was previously converted to a NonNull\npointer using Box::into_non_null:
    \n\n
    #![feature(box_vec_non_null)]\n\nlet x = Box::new(5);\nlet non_null = Box::into_non_null(x);\nlet x = unsafe { Box::from_non_null(non_null) };
    \n
    Manually create a Box from scratch by using the global allocator:
    \n\n
    #![feature(box_vec_non_null)]\n\nuse std::alloc::{alloc, Layout};\nuse std::ptr::NonNull;\n\nunsafe {\n    let non_null = NonNull::new(alloc(Layout::new::<i32>()).cast::<i32>())\n        .expect(\"allocation failed\");\n    // In general .write is required to avoid attempting to destruct\n    // the (uninitialized) previous contents of `non_null`.\n    non_null.write(5);\n    let x = Box::from_non_null(non_null);\n}
    \n
    ",0,"bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T> Box<T>
    1.0.0 · Source
    pub fn new(x: T) -> Box<T>
    Allocates memory on the heap and then places x into it.
    \n
    This doesn’t actually allocate if T is zero-sized.
    \n
    §Examples
    \n
    let five = Box::new(5);
    \n
    1.82.0 · Source
    pub fn new_uninit() -> Box<MaybeUninit<T>>
    Constructs a new box with uninitialized contents.
    \n
    §Examples
    \n
    let mut five = Box::<u32>::new_uninit();\n\nlet five = unsafe {\n    // Deferred initialization:\n    five.as_mut_ptr().write(5);\n\n    five.assume_init()\n};\n\nassert_eq!(*five, 5)
    \n
    Source
    pub fn new_zeroed() -> Box<MaybeUninit<T>>
    🔬This is a nightly-only experimental API. (new_zeroed_alloc)
    Constructs a new Box with uninitialized contents, with the memory\nbeing filled with 0 bytes.
    \n
    See MaybeUninit::zeroed for examples of correct and incorrect usage\nof this method.
    \n
    §Examples
    \n
    #![feature(new_zeroed_alloc)]\n\nlet zero = Box::<u32>::new_zeroed();\nlet zero = unsafe { zero.assume_init() };\n\nassert_eq!(*zero, 0)
    \n
    1.33.0 · Source
    pub fn pin(x: T) -> Pin<Box<T>>
    Constructs a new Pin<Box<T>>. If T does not implement Unpin, then\nx will be pinned in memory and unable to be moved.
    \n
    Constructing and pinning of the Box can also be done in two steps: Box::pin(x)\ndoes the same as Box::into_pin(Box::new(x)). Consider using\ninto_pin if you already have a Box<T>, or if you want to\nconstruct a (pinned) Box in a different way than with Box::new.
    \n
    Source
    pub fn try_new(x: T) -> Result<Box<T>, AllocError>
    🔬This is a nightly-only experimental API. (allocator_api)
    Allocates memory on the heap then places x into it,\nreturning an error if the allocation fails
    \n
    This doesn’t actually allocate if T is zero-sized.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nlet five = Box::try_new(5)?;
    \n
    Source
    pub fn try_new_uninit() -> Result<Box<MaybeUninit<T>>, AllocError>
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new box with uninitialized contents on the heap,\nreturning an error if the allocation fails
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nlet mut five = Box::<u32>::try_new_uninit()?;\n\nlet five = unsafe {\n    // Deferred initialization:\n    five.as_mut_ptr().write(5);\n\n    five.assume_init()\n};\n\nassert_eq!(*five, 5);
    \n
    Source
    pub fn try_new_zeroed() -> Result<Box<MaybeUninit<T>>, AllocError>
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new Box with uninitialized contents, with the memory\nbeing filled with 0 bytes on the heap
    \n
    See MaybeUninit::zeroed for examples of correct and incorrect usage\nof this method.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nlet zero = Box::<u32>::try_new_zeroed()?;\nlet zero = unsafe { zero.assume_init() };\n\nassert_eq!(*zero, 0);
    \n
    ",0,"bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T, A> Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    Source
    pub const unsafe fn from_raw_in(raw: *mut T, alloc: A) -> Box<T, A>
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a box from a raw pointer in the given allocator.
    \n
    After calling this function, the raw pointer is owned by the\nresulting Box. Specifically, the Box destructor will call\nthe destructor of T and free the allocated memory. For this\nto be safe, the memory must have been allocated in accordance\nwith the memory layout used by Box .
    \n
    §Safety
    \n
    This function is unsafe because improper use may lead to\nmemory problems. For example, a double-free may occur if the\nfunction is called twice on the same raw pointer.
    \n
    The raw pointer must point to a block of memory allocated by alloc
    \n
    §Examples
    \n
    Recreate a Box which was previously converted to a raw pointer\nusing Box::into_raw_with_allocator:
    \n\n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet x = Box::new_in(5, System);\nlet (ptr, alloc) = Box::into_raw_with_allocator(x);\nlet x = unsafe { Box::from_raw_in(ptr, alloc) };
    \n
    Manually create a Box from scratch by using the system allocator:
    \n\n
    #![feature(allocator_api, slice_ptr_get)]\n\nuse std::alloc::{Allocator, Layout, System};\n\nunsafe {\n    let ptr = System.allocate(Layout::new::<i32>())?.as_mut_ptr() as *mut i32;\n    // In general .write is required to avoid attempting to destruct\n    // the (uninitialized) previous contents of `ptr`, though for this\n    // simple example `*ptr = 5` would have worked as well.\n    ptr.write(5);\n    let x = Box::from_raw_in(ptr, System);\n}
    \n
    Source
    pub const unsafe fn from_non_null_in(raw: NonNull<T>, alloc: A) -> Box<T, A>
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a box from a NonNull pointer in the given allocator.
    \n
    After calling this function, the NonNull pointer is owned by\nthe resulting Box. Specifically, the Box destructor will call\nthe destructor of T and free the allocated memory. For this\nto be safe, the memory must have been allocated in accordance\nwith the memory layout used by Box .
    \n
    §Safety
    \n
    This function is unsafe because improper use may lead to\nmemory problems. For example, a double-free may occur if the\nfunction is called twice on the same raw pointer.
    \n
    §Examples
    \n
    Recreate a Box which was previously converted to a NonNull pointer\nusing Box::into_non_null_with_allocator:
    \n\n
    #![feature(allocator_api, box_vec_non_null)]\n\nuse std::alloc::System;\n\nlet x = Box::new_in(5, System);\nlet (non_null, alloc) = Box::into_non_null_with_allocator(x);\nlet x = unsafe { Box::from_non_null_in(non_null, alloc) };
    \n
    Manually create a Box from scratch by using the system allocator:
    \n\n
    #![feature(allocator_api, box_vec_non_null, slice_ptr_get)]\n\nuse std::alloc::{Allocator, Layout, System};\n\nunsafe {\n    let non_null = System.allocate(Layout::new::<i32>())?.cast::<i32>();\n    // In general .write is required to avoid attempting to destruct\n    // the (uninitialized) previous contents of `non_null`.\n    non_null.write(5);\n    let x = Box::from_non_null_in(non_null, System);\n}
    \n
    1.4.0 · Source
    pub fn into_raw(b: Box<T, A>) -> *mut T
    Consumes the Box, returning a wrapped raw pointer.
    \n
    The pointer will be properly aligned and non-null.
    \n
    After calling this function, the caller is responsible for the\nmemory previously managed by the Box. In particular, the\ncaller should properly destroy T and release the memory, taking\ninto account the memory layout used by Box. The easiest way to\ndo this is to convert the raw pointer back into a Box with the\nBox::from_raw function, allowing the Box destructor to perform\nthe cleanup.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::into_raw(b) instead of b.into_raw(). This\nis so that there is no conflict with a method on the inner type.
    \n
    §Examples
    \n
    Converting the raw pointer back into a Box with Box::from_raw\nfor automatic cleanup:
    \n\n
    let x = Box::new(String::from(\"Hello\"));\nlet ptr = Box::into_raw(x);\nlet x = unsafe { Box::from_raw(ptr) };
    \n
    Manual cleanup by explicitly running the destructor and deallocating\nthe memory:
    \n\n
    use std::alloc::{dealloc, Layout};\nuse std::ptr;\n\nlet x = Box::new(String::from(\"Hello\"));\nlet ptr = Box::into_raw(x);\nunsafe {\n    ptr::drop_in_place(ptr);\n    dealloc(ptr as *mut u8, Layout::new::<String>());\n}
    \n
    Note: This is equivalent to the following:
    \n\n
    let x = Box::new(String::from(\"Hello\"));\nlet ptr = Box::into_raw(x);\nunsafe {\n    drop(Box::from_raw(ptr));\n}
    \n
    Source
    pub fn into_non_null(b: Box<T, A>) -> NonNull<T>
    🔬This is a nightly-only experimental API. (box_vec_non_null)
    Consumes the Box, returning a wrapped NonNull pointer.
    \n
    The pointer will be properly aligned.
    \n
    After calling this function, the caller is responsible for the\nmemory previously managed by the Box. In particular, the\ncaller should properly destroy T and release the memory, taking\ninto account the memory layout used by Box. The easiest way to\ndo this is to convert the NonNull pointer back into a Box with the\nBox::from_non_null function, allowing the Box destructor to\nperform the cleanup.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::into_non_null(b) instead of b.into_non_null().\nThis is so that there is no conflict with a method on the inner type.
    \n
    §Examples
    \n
    Converting the NonNull pointer back into a Box with Box::from_non_null\nfor automatic cleanup:
    \n\n
    #![feature(box_vec_non_null)]\n\nlet x = Box::new(String::from(\"Hello\"));\nlet non_null = Box::into_non_null(x);\nlet x = unsafe { Box::from_non_null(non_null) };
    \n
    Manual cleanup by explicitly running the destructor and deallocating\nthe memory:
    \n\n
    #![feature(box_vec_non_null)]\n\nuse std::alloc::{dealloc, Layout};\n\nlet x = Box::new(String::from(\"Hello\"));\nlet non_null = Box::into_non_null(x);\nunsafe {\n    non_null.drop_in_place();\n    dealloc(non_null.as_ptr().cast::<u8>(), Layout::new::<String>());\n}
    \n
    Note: This is equivalent to the following:
    \n\n
    #![feature(box_vec_non_null)]\n\nlet x = Box::new(String::from(\"Hello\"));\nlet non_null = Box::into_non_null(x);\nunsafe {\n    drop(Box::from_non_null(non_null));\n}
    \n
    Source
    pub fn into_raw_with_allocator(b: Box<T, A>) -> (*mut T, A)
    🔬This is a nightly-only experimental API. (allocator_api)
    Consumes the Box, returning a wrapped raw pointer and the allocator.
    \n
    The pointer will be properly aligned and non-null.
    \n
    After calling this function, the caller is responsible for the\nmemory previously managed by the Box. In particular, the\ncaller should properly destroy T and release the memory, taking\ninto account the memory layout used by Box. The easiest way to\ndo this is to convert the raw pointer back into a Box with the\nBox::from_raw_in function, allowing the Box destructor to perform\nthe cleanup.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::into_raw_with_allocator(b) instead of b.into_raw_with_allocator(). This\nis so that there is no conflict with a method on the inner type.
    \n
    §Examples
    \n
    Converting the raw pointer back into a Box with Box::from_raw_in\nfor automatic cleanup:
    \n\n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet x = Box::new_in(String::from(\"Hello\"), System);\nlet (ptr, alloc) = Box::into_raw_with_allocator(x);\nlet x = unsafe { Box::from_raw_in(ptr, alloc) };
    \n
    Manual cleanup by explicitly running the destructor and deallocating\nthe memory:
    \n\n
    #![feature(allocator_api)]\n\nuse std::alloc::{Allocator, Layout, System};\nuse std::ptr::{self, NonNull};\n\nlet x = Box::new_in(String::from(\"Hello\"), System);\nlet (ptr, alloc) = Box::into_raw_with_allocator(x);\nunsafe {\n    ptr::drop_in_place(ptr);\n    let non_null = NonNull::new_unchecked(ptr);\n    alloc.deallocate(non_null.cast(), Layout::new::<String>());\n}
    \n
    Source
    pub fn into_non_null_with_allocator(b: Box<T, A>) -> (NonNull<T>, A)
    🔬This is a nightly-only experimental API. (allocator_api)
    Consumes the Box, returning a wrapped NonNull pointer and the allocator.
    \n
    The pointer will be properly aligned.
    \n
    After calling this function, the caller is responsible for the\nmemory previously managed by the Box. In particular, the\ncaller should properly destroy T and release the memory, taking\ninto account the memory layout used by Box. The easiest way to\ndo this is to convert the NonNull pointer back into a Box with the\nBox::from_non_null_in function, allowing the Box destructor to\nperform the cleanup.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::into_non_null_with_allocator(b) instead of\nb.into_non_null_with_allocator(). This is so that there is no\nconflict with a method on the inner type.
    \n
    §Examples
    \n
    Converting the NonNull pointer back into a Box with\nBox::from_non_null_in for automatic cleanup:
    \n\n
    #![feature(allocator_api, box_vec_non_null)]\n\nuse std::alloc::System;\n\nlet x = Box::new_in(String::from(\"Hello\"), System);\nlet (non_null, alloc) = Box::into_non_null_with_allocator(x);\nlet x = unsafe { Box::from_non_null_in(non_null, alloc) };
    \n
    Manual cleanup by explicitly running the destructor and deallocating\nthe memory:
    \n\n
    #![feature(allocator_api, box_vec_non_null)]\n\nuse std::alloc::{Allocator, Layout, System};\n\nlet x = Box::new_in(String::from(\"Hello\"), System);\nlet (non_null, alloc) = Box::into_non_null_with_allocator(x);\nunsafe {\n    non_null.drop_in_place();\n    alloc.deallocate(non_null.cast::<u8>(), Layout::new::<String>());\n}
    \n
    Source
    pub fn as_mut_ptr(b: &mut Box<T, A>) -> *mut T
    🔬This is a nightly-only experimental API. (box_as_ptr)
    Returns a raw mutable pointer to the Box’s contents.
    \n
    The caller must ensure that the Box outlives the pointer this\nfunction returns, or else it will end up dangling.
    \n
    This method guarantees that for the purpose of the aliasing model, this method\ndoes not materialize a reference to the underlying memory, and thus the returned pointer\nwill remain valid when mixed with other calls to as_ptr and as_mut_ptr.\nNote that calling other methods that materialize references to the memory\nmay still invalidate this pointer.\nSee the example below for how this guarantee can be used.
    \n
    §Examples
    \n
    Due to the aliasing guarantee, the following code is legal:
    \n\n
    #![feature(box_as_ptr)]\n\nunsafe {\n    let mut b = Box::new(0);\n    let ptr1 = Box::as_mut_ptr(&mut b);\n    ptr1.write(1);\n    let ptr2 = Box::as_mut_ptr(&mut b);\n    ptr2.write(2);\n    // Notably, the write to `ptr2` did *not* invalidate `ptr1`:\n    ptr1.write(3);\n}
    \n
    Source
    pub fn as_ptr(b: &Box<T, A>) -> *const T
    🔬This is a nightly-only experimental API. (box_as_ptr)
    Returns a raw pointer to the Box’s contents.
    \n
    The caller must ensure that the Box outlives the pointer this\nfunction returns, or else it will end up dangling.
    \n
    The caller must also ensure that the memory the pointer (non-transitively) points to\nis never written to (except inside an UnsafeCell) using this pointer or any pointer\nderived from it. If you need to mutate the contents of the Box, use as_mut_ptr.
    \n
    This method guarantees that for the purpose of the aliasing model, this method\ndoes not materialize a reference to the underlying memory, and thus the returned pointer\nwill remain valid when mixed with other calls to as_ptr and as_mut_ptr.\nNote that calling other methods that materialize mutable references to the memory,\nas well as writing to this memory, may still invalidate this pointer.\nSee the example below for how this guarantee can be used.
    \n
    §Examples
    \n
    Due to the aliasing guarantee, the following code is legal:
    \n\n
    #![feature(box_as_ptr)]\n\nunsafe {\n    let mut v = Box::new(0);\n    let ptr1 = Box::as_ptr(&v);\n    let ptr2 = Box::as_mut_ptr(&mut v);\n    let _val = ptr2.read();\n    // No write to this memory has happened yet, so `ptr1` is still valid.\n    let _val = ptr1.read();\n    // However, once we do a write...\n    ptr2.write(1);\n    // ... `ptr1` is no longer valid.\n    // This would be UB: let _val = ptr1.read();\n}
    \n
    Source
    pub const fn allocator(b: &Box<T, A>) -> &A
    🔬This is a nightly-only experimental API. (allocator_api)
    Returns a reference to the underlying allocator.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::allocator(&b) instead of b.allocator(). This\nis so that there is no conflict with a method on the inner type.
    \n
    1.26.0 · Source
    pub fn leak<'a>(b: Box<T, A>) -> &'a mut T
    where\n    A: 'a,
    Consumes and leaks the Box, returning a mutable reference,\n&'a mut T.
    \n
    Note that the type T must outlive the chosen lifetime 'a. If the type\nhas only static references, or none at all, then this may be chosen to be\n'static.
    \n
    This function is mainly useful for data that lives for the remainder of\nthe program’s life. Dropping the returned reference will cause a memory\nleak. If this is not acceptable, the reference should first be wrapped\nwith the Box::from_raw function producing a Box. This Box can\nthen be dropped which will properly destroy T and release the\nallocated memory.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::leak(b) instead of b.leak(). This\nis so that there is no conflict with a method on the inner type.
    \n
    §Examples
    \n
    Simple usage:
    \n\n
    let x = Box::new(41);\nlet static_ref: &'static mut usize = Box::leak(x);\n*static_ref += 1;\nassert_eq!(*static_ref, 42);
    \n
    Unsized data:
    \n\n
    let x = vec![1, 2, 3].into_boxed_slice();\nlet static_ref = Box::leak(x);\nstatic_ref[0] = 4;\nassert_eq!(*static_ref, [4, 2, 3]);
    \n
    1.63.0 (const: unstable) · Source
    pub fn into_pin(boxed: Box<T, A>) -> Pin<Box<T, A>>
    where\n    A: 'static,
    Converts a Box<T> into a Pin<Box<T>>. If T does not implement Unpin, then\n*boxed will be pinned in memory and unable to be moved.
    \n
    This conversion does not allocate on the heap and happens in place.
    \n
    This is also available via From.
    \n
    Constructing and pinning a Box with Box::into_pin(Box::new(x))\ncan also be written more concisely using Box::pin(x).\nThis into_pin method is useful if you already have a Box<T>, or you are\nconstructing a (pinned) Box in a different way than with Box::new.
    \n
    §Notes
    \n
    It’s not recommended that crates add an impl like From<Box<T>> for Pin<T>,\nas it’ll introduce an ambiguity when calling Pin::from.\nA demonstration of such a poor impl is shown below.
    \n\n
    ⓘ
    struct Foo; // A type defined in this crate.\nimpl From<Box<()>> for Pin<Foo> {\n    fn from(_: Box<()>) -> Pin<Foo> {\n        Pin::new(Foo)\n    }\n}\n\nlet foo = Box::new(());\nlet bar = Pin::from(foo);
    \n
    ",0,"bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T, A> Box<T, A>
    where\n    A: Allocator,
    Source
    pub fn new_in(x: T, alloc: A) -> Box<T, A>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Allocates memory in the given allocator then places x into it.
    \n
    This doesn’t actually allocate if T is zero-sized.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet five = Box::new_in(5, System);
    \n
    Source
    pub fn try_new_in(x: T, alloc: A) -> Result<Box<T, A>, AllocError>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Allocates memory in the given allocator then places x into it,\nreturning an error if the allocation fails
    \n
    This doesn’t actually allocate if T is zero-sized.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet five = Box::try_new_in(5, System)?;
    \n
    Source
    pub fn new_uninit_in(alloc: A) -> Box<MaybeUninit<T>, A>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new box with uninitialized contents in the provided allocator.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet mut five = Box::<u32, _>::new_uninit_in(System);\n\nlet five = unsafe {\n    // Deferred initialization:\n    five.as_mut_ptr().write(5);\n\n    five.assume_init()\n};\n\nassert_eq!(*five, 5)
    \n
    Source
    pub fn try_new_uninit_in(alloc: A) -> Result<Box<MaybeUninit<T>, A>, AllocError>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new box with uninitialized contents in the provided allocator,\nreturning an error if the allocation fails
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet mut five = Box::<u32, _>::try_new_uninit_in(System)?;\n\nlet five = unsafe {\n    // Deferred initialization:\n    five.as_mut_ptr().write(5);\n\n    five.assume_init()\n};\n\nassert_eq!(*five, 5);
    \n
    Source
    pub fn new_zeroed_in(alloc: A) -> Box<MaybeUninit<T>, A>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new Box with uninitialized contents, with the memory\nbeing filled with 0 bytes in the provided allocator.
    \n
    See MaybeUninit::zeroed for examples of correct and incorrect usage\nof this method.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet zero = Box::<u32, _>::new_zeroed_in(System);\nlet zero = unsafe { zero.assume_init() };\n\nassert_eq!(*zero, 0)
    \n
    Source
    pub fn try_new_zeroed_in(alloc: A) -> Result<Box<MaybeUninit<T>, A>, AllocError>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new Box with uninitialized contents, with the memory\nbeing filled with 0 bytes in the provided allocator,\nreturning an error if the allocation fails,
    \n
    See MaybeUninit::zeroed for examples of correct and incorrect usage\nof this method.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet zero = Box::<u32, _>::try_new_zeroed_in(System)?;\nlet zero = unsafe { zero.assume_init() };\n\nassert_eq!(*zero, 0);
    \n
    Source
    pub fn pin_in(x: T, alloc: A) -> Pin<Box<T, A>>
    where\n    A: 'static + Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new Pin<Box<T, A>>. If T does not implement Unpin, then\nx will be pinned in memory and unable to be moved.
    \n
    Constructing and pinning of the Box can also be done in two steps: Box::pin_in(x, alloc)\ndoes the same as Box::into_pin(Box::new_in(x, alloc)). Consider using\ninto_pin if you already have a Box<T, A>, or if you want to\nconstruct a (pinned) Box in a different way than with Box::new_in.
    \n
    Source
    pub fn into_boxed_slice(boxed: Box<T, A>) -> Box<[T], A>
    🔬This is a nightly-only experimental API. (box_into_boxed_slice)
    Converts a Box<T> into a Box<[T]>
    \n
    This conversion does not allocate on the heap and happens in place.
    \n
    Source
    pub fn into_inner(boxed: Box<T, A>) -> T
    🔬This is a nightly-only experimental API. (box_into_inner)
    Consumes the Box, returning the wrapped value.
    \n
    §Examples
    \n
    #![feature(box_into_inner)]\n\nlet c = Box::new(5);\n\nassert_eq!(Box::into_inner(c), 5);
    \n
    ",0,"bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> Buf for Box<T>
    where\n    T: Buf + ?Sized,
    §
    fn remaining(&self) -> usize
    Returns the number of bytes between the current position and the end of\nthe buffer. Read more
    §
    fn chunk(&self) -> &[u8] ⓘ
    Returns a slice starting at the current position and of length between 0\nand Buf::remaining(). Note that this can return a shorter slice (this\nallows non-continuous internal representation). Read more
    §
    fn chunks_vectored<'b>(&'b self, dst: &mut [IoSlice<'b>]) -> usize
    Fills dst with potentially multiple slices starting at self’s\ncurrent position. Read more
    §
    fn advance(&mut self, cnt: usize)
    Advance the internal cursor of the Buf Read more
    §
    fn has_remaining(&self) -> bool
    Returns true if there are any more bytes to consume Read more
    §
    fn copy_to_slice(&mut self, dst: &mut [u8])
    Copies bytes from self into dst. Read more
    §
    fn get_u8(&mut self) -> u8
    Gets an unsigned 8 bit integer from self. Read more
    §
    fn get_i8(&mut self) -> i8
    Gets a signed 8 bit integer from self. Read more
    §
    fn get_u16(&mut self) -> u16
    Gets an unsigned 16 bit integer from self in big-endian byte order. Read more
    §
    fn get_u16_le(&mut self) -> u16
    Gets an unsigned 16 bit integer from self in little-endian byte order. Read more
    §
    fn get_u16_ne(&mut self) -> u16
    Gets an unsigned 16 bit integer from self in native-endian byte order. Read more
    §
    fn get_i16(&mut self) -> i16
    Gets a signed 16 bit integer from self in big-endian byte order. Read more
    §
    fn get_i16_le(&mut self) -> i16
    Gets a signed 16 bit integer from self in little-endian byte order. Read more
    §
    fn get_i16_ne(&mut self) -> i16
    Gets a signed 16 bit integer from self in native-endian byte order. Read more
    §
    fn get_u32(&mut self) -> u32
    Gets an unsigned 32 bit integer from self in the big-endian byte order. Read more
    §
    fn get_u32_le(&mut self) -> u32
    Gets an unsigned 32 bit integer from self in the little-endian byte order. Read more
    §
    fn get_u32_ne(&mut self) -> u32
    Gets an unsigned 32 bit integer from self in native-endian byte order. Read more
    §
    fn get_i32(&mut self) -> i32
    Gets a signed 32 bit integer from self in big-endian byte order. Read more
    §
    fn get_i32_le(&mut self) -> i32
    Gets a signed 32 bit integer from self in little-endian byte order. Read more
    §
    fn get_i32_ne(&mut self) -> i32
    Gets a signed 32 bit integer from self in native-endian byte order. Read more
    §
    fn get_u64(&mut self) -> u64
    Gets an unsigned 64 bit integer from self in big-endian byte order. Read more
    §
    fn get_u64_le(&mut self) -> u64
    Gets an unsigned 64 bit integer from self in little-endian byte order. Read more
    §
    fn get_u64_ne(&mut self) -> u64
    Gets an unsigned 64 bit integer from self in native-endian byte order. Read more
    §
    fn get_i64(&mut self) -> i64
    Gets a signed 64 bit integer from self in big-endian byte order. Read more
    §
    fn get_i64_le(&mut self) -> i64
    Gets a signed 64 bit integer from self in little-endian byte order. Read more
    §
    fn get_i64_ne(&mut self) -> i64
    Gets a signed 64 bit integer from self in native-endian byte order. Read more
    §
    fn get_uint(&mut self, nbytes: usize) -> u64
    Gets an unsigned n-byte integer from self in big-endian byte order. Read more
    §
    fn get_uint_le(&mut self, nbytes: usize) -> u64
    Gets an unsigned n-byte integer from self in little-endian byte order. Read more
    §
    fn get_uint_ne(&mut self, nbytes: usize) -> u64
    Gets an unsigned n-byte integer from self in native-endian byte order. Read more
    §
    fn get_int(&mut self, nbytes: usize) -> i64
    Gets a signed n-byte integer from self in big-endian byte order. Read more
    §
    fn get_int_le(&mut self, nbytes: usize) -> i64
    Gets a signed n-byte integer from self in little-endian byte order. Read more
    §
    fn get_int_ne(&mut self, nbytes: usize) -> i64
    Gets a signed n-byte integer from self in native-endian byte order. Read more
    §
    fn copy_to_bytes(&mut self, len: usize) -> Bytes
    Consumes len bytes inside self and returns new instance of Bytes\nwith this data. Read more
    §
    fn get_u128(&mut self) -> u128
    Gets an unsigned 128 bit integer from self in big-endian byte order. Read more
    §
    fn get_u128_le(&mut self) -> u128
    Gets an unsigned 128 bit integer from self in little-endian byte order. Read more
    §
    fn get_u128_ne(&mut self) -> u128
    Gets an unsigned 128 bit integer from self in native-endian byte order. Read more
    §
    fn get_i128(&mut self) -> i128
    Gets a signed 128 bit integer from self in big-endian byte order. Read more
    §
    fn get_i128_le(&mut self) -> i128
    Gets a signed 128 bit integer from self in little-endian byte order. Read more
    §
    fn get_i128_ne(&mut self) -> i128
    Gets a signed 128 bit integer from self in native-endian byte order. Read more
    §
    fn get_f32(&mut self) -> f32
    Gets an IEEE754 single-precision (4 bytes) floating point number from\nself in big-endian byte order. Read more
    §
    fn get_f32_le(&mut self) -> f32
    Gets an IEEE754 single-precision (4 bytes) floating point number from\nself in little-endian byte order. Read more
    §
    fn get_f32_ne(&mut self) -> f32
    Gets an IEEE754 single-precision (4 bytes) floating point number from\nself in native-endian byte order. Read more
    §
    fn get_f64(&mut self) -> f64
    Gets an IEEE754 double-precision (8 bytes) floating point number from\nself in big-endian byte order. Read more
    §
    fn get_f64_le(&mut self) -> f64
    Gets an IEEE754 double-precision (8 bytes) floating point number from\nself in little-endian byte order. Read more
    §
    fn get_f64_ne(&mut self) -> f64
    Gets an IEEE754 double-precision (8 bytes) floating point number from\nself in native-endian byte order. Read more
    §
    fn take(self, limit: usize) -> Take<Self>
    where\n    Self: Sized,
    Creates an adaptor which will read at most limit bytes from self. Read more
    §
    fn chain<U>(self, next: U) -> Chain<Self, U>
    where\n    U: Buf,\n    Self: Sized,
    Creates an adaptor which will chain this buffer with another. Read more
    §
    fn reader(self) -> Reader<Self>
    where\n    Self: Sized,
    Creates an adaptor which implements the Read trait for self. Read more
    ","Buf","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> BufMut for Box<T>
    where\n    T: BufMut + ?Sized,
    §
    fn remaining_mut(&self) -> usize
    Returns the number of bytes that can be written from the current\nposition until the end of the buffer is reached. Read more
    §
    fn chunk_mut(&mut self) -> &mut UninitSlice
    Returns a mutable slice starting at the current BufMut position and of\nlength between 0 and BufMut::remaining_mut(). Note that this can be shorter than the\nwhole remainder of the buffer (this allows non-continuous implementation). Read more
    §
    unsafe fn advance_mut(&mut self, cnt: usize)
    Advance the internal cursor of the BufMut Read more
    §
    fn put_slice(&mut self, src: &[u8])
    Transfer bytes into self from src and advance the cursor by the\nnumber of bytes written. Read more
    §
    fn put_u8(&mut self, n: u8)
    Writes an unsigned 8 bit integer to self. Read more
    §
    fn put_i8(&mut self, n: i8)
    Writes a signed 8 bit integer to self. Read more
    §
    fn put_u16(&mut self, n: u16)
    Writes an unsigned 16 bit integer to self in big-endian byte order. Read more
    §
    fn put_u16_le(&mut self, n: u16)
    Writes an unsigned 16 bit integer to self in little-endian byte order. Read more
    §
    fn put_u16_ne(&mut self, n: u16)
    Writes an unsigned 16 bit integer to self in native-endian byte order. Read more
    §
    fn put_i16(&mut self, n: i16)
    Writes a signed 16 bit integer to self in big-endian byte order. Read more
    §
    fn put_i16_le(&mut self, n: i16)
    Writes a signed 16 bit integer to self in little-endian byte order. Read more
    §
    fn put_i16_ne(&mut self, n: i16)
    Writes a signed 16 bit integer to self in native-endian byte order. Read more
    §
    fn put_u32(&mut self, n: u32)
    Writes an unsigned 32 bit integer to self in big-endian byte order. Read more
    §
    fn put_u32_le(&mut self, n: u32)
    Writes an unsigned 32 bit integer to self in little-endian byte order. Read more
    §
    fn put_u32_ne(&mut self, n: u32)
    Writes an unsigned 32 bit integer to self in native-endian byte order. Read more
    §
    fn put_i32(&mut self, n: i32)
    Writes a signed 32 bit integer to self in big-endian byte order. Read more
    §
    fn put_i32_le(&mut self, n: i32)
    Writes a signed 32 bit integer to self in little-endian byte order. Read more
    §
    fn put_i32_ne(&mut self, n: i32)
    Writes a signed 32 bit integer to self in native-endian byte order. Read more
    §
    fn put_u64(&mut self, n: u64)
    Writes an unsigned 64 bit integer to self in the big-endian byte order. Read more
    §
    fn put_u64_le(&mut self, n: u64)
    Writes an unsigned 64 bit integer to self in little-endian byte order. Read more
    §
    fn put_u64_ne(&mut self, n: u64)
    Writes an unsigned 64 bit integer to self in native-endian byte order. Read more
    §
    fn put_i64(&mut self, n: i64)
    Writes a signed 64 bit integer to self in the big-endian byte order. Read more
    §
    fn put_i64_le(&mut self, n: i64)
    Writes a signed 64 bit integer to self in little-endian byte order. Read more
    §
    fn put_i64_ne(&mut self, n: i64)
    Writes a signed 64 bit integer to self in native-endian byte order. Read more
    §
    fn has_remaining_mut(&self) -> bool
    Returns true if there is space in self for more bytes. Read more
    §
    fn put<T>(&mut self, src: T)
    where\n    T: Buf,\n    Self: Sized,
    Transfer bytes into self from src and advance the cursor by the\nnumber of bytes written. Read more
    §
    fn put_bytes(&mut self, val: u8, cnt: usize)
    Put cnt bytes val into self. Read more
    §
    fn put_u128(&mut self, n: u128)
    Writes an unsigned 128 bit integer to self in the big-endian byte order. Read more
    §
    fn put_u128_le(&mut self, n: u128)
    Writes an unsigned 128 bit integer to self in little-endian byte order. Read more
    §
    fn put_u128_ne(&mut self, n: u128)
    Writes an unsigned 128 bit integer to self in native-endian byte order. Read more
    §
    fn put_i128(&mut self, n: i128)
    Writes a signed 128 bit integer to self in the big-endian byte order. Read more
    §
    fn put_i128_le(&mut self, n: i128)
    Writes a signed 128 bit integer to self in little-endian byte order. Read more
    §
    fn put_i128_ne(&mut self, n: i128)
    Writes a signed 128 bit integer to self in native-endian byte order. Read more
    §
    fn put_uint(&mut self, n: u64, nbytes: usize)
    Writes an unsigned n-byte integer to self in big-endian byte order. Read more
    §
    fn put_uint_le(&mut self, n: u64, nbytes: usize)
    Writes an unsigned n-byte integer to self in the little-endian byte order. Read more
    §
    fn put_uint_ne(&mut self, n: u64, nbytes: usize)
    Writes an unsigned n-byte integer to self in the native-endian byte order. Read more
    §
    fn put_int(&mut self, n: i64, nbytes: usize)
    Writes low nbytes of a signed integer to self in big-endian byte order. Read more
    §
    fn put_int_le(&mut self, n: i64, nbytes: usize)
    Writes low nbytes of a signed integer to self in little-endian byte order. Read more
    §
    fn put_int_ne(&mut self, n: i64, nbytes: usize)
    Writes low nbytes of a signed integer to self in native-endian byte order. Read more
    §
    fn put_f32(&mut self, n: f32)
    Writes an IEEE754 single-precision (4 bytes) floating point number to\nself in big-endian byte order. Read more
    §
    fn put_f32_le(&mut self, n: f32)
    Writes an IEEE754 single-precision (4 bytes) floating point number to\nself in little-endian byte order. Read more
    §
    fn put_f32_ne(&mut self, n: f32)
    Writes an IEEE754 single-precision (4 bytes) floating point number to\nself in native-endian byte order. Read more
    §
    fn put_f64(&mut self, n: f64)
    Writes an IEEE754 double-precision (8 bytes) floating point number to\nself in big-endian byte order. Read more
    §
    fn put_f64_le(&mut self, n: f64)
    Writes an IEEE754 double-precision (8 bytes) floating point number to\nself in little-endian byte order. Read more
    §
    fn put_f64_ne(&mut self, n: f64)
    Writes an IEEE754 double-precision (8 bytes) floating point number to\nself in native-endian byte order. Read more
    §
    fn limit(self, limit: usize) -> Limit<Self>
    where\n    Self: Sized,
    Creates an adaptor which can write at most limit bytes to self. Read more
    §
    fn writer(self) -> Writer<Self>
    where\n    Self: Sized,
    Creates an adaptor which implements the Write trait for self. Read more
    §
    fn chain_mut<U>(self, next: U) -> Chain<Self, U>
    where\n    U: BufMut,\n    Self: Sized,
    Creates an adapter which will chain this buffer with another. Read more
    ","BufMut","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<B> BufRead for Box<B>
    where\n    B: BufRead + ?Sized,
    Source§
    fn fill_buf(&mut self) -> Result<&[u8], Error>
    Returns the contents of the internal buffer, filling it with more data\nfrom the inner reader if it is empty. Read more
    Source§
    fn consume(&mut self, amt: usize)
    Tells this buffer that amt bytes have been consumed from the buffer,\nso they should no longer be returned in calls to read. Read more
    Source§
    fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize, Error>
    Reads all bytes into buf until the delimiter byte or EOF is reached. Read more
    Source§
    fn read_line(&mut self, buf: &mut String) -> Result<usize, Error>
    Reads all bytes until a newline (the 0xA byte) is reached, and append\nthem to the provided String buffer. Read more
    Source§
    fn has_data_left(&mut self) -> Result<bool, Error>
    🔬This is a nightly-only experimental API. (buf_read_has_data_left)
    Checks if the underlying Read has any data left to be read. Read more
    1.83.0 · Source§
    fn skip_until(&mut self, byte: u8) -> Result<usize, Error>
    Skips all bytes until the delimiter byte or EOF is reached. Read more
    1.0.0 · Source§
    fn split(self, byte: u8) -> Split<Self>
    where\n    Self: Sized,
    Returns an iterator over the contents of this reader split on the byte\nbyte. Read more
    1.0.0 · Source§
    fn lines(self) -> Lines<Self>
    where\n    Self: Sized,
    Returns an iterator over the lines of this reader. Read more
    ","BufRead","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> BufferProvider for Box<T>
    where\n    T: BufferProvider + ?Sized,
    §
    fn load_buffer(\n    &self,\n    key: DataKey,\n    req: DataRequest<'_>,\n) -> Result<DataResponse<BufferMarker>, DataError>
    Loads a [DataPayload]<[BufferMarker]> according to the key and request.
    ","BufferProvider","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> Clone for Box<T, A>
    where\n    T: Clone,\n    A: Allocator + Clone,
    Source§
    fn clone(&self) -> Box<T, A>
    Returns a new box with a clone() of this box’s contents.
    \n
    §Examples
    \n
    let x = Box::new(5);\nlet y = x.clone();\n\n// The value is the same\nassert_eq!(x, y);\n\n// But they are unique objects\nassert_ne!(&*x as *const i32, &*y as *const i32);
    \n
    Source§
    fn clone_from(&mut self, source: &Box<T, A>)
    Copies source’s contents into self without creating a new allocation.
    \n
    §Examples
    \n
    let x = Box::new(5);\nlet mut y = Box::new(10);\nlet yp: *const i32 = &*y;\n\ny.clone_from(&x);\n\n// The value is the same\nassert_eq!(x, y);\n\n// And no allocation occurred\nassert_eq!(yp, &*y);
    \n
    ","Clone","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<G, R, A> Coroutine<R> for Box<G, A>
    where\n    G: Coroutine<R> + Unpin + ?Sized,\n    A: Allocator,
    Source§
    type Yield = <G as Coroutine<R>>::Yield
    🔬This is a nightly-only experimental API. (coroutine_trait)
    The type of value this coroutine yields. Read more
    Source§
    type Return = <G as Coroutine<R>>::Return
    🔬This is a nightly-only experimental API. (coroutine_trait)
    The type of value this coroutine returns. Read more
    Source§
    fn resume(\n    self: Pin<&mut Box<G, A>>,\n    arg: R,\n) -> CoroutineState<<Box<G, A> as Coroutine<R>>::Yield, <Box<G, A> as Coroutine<R>>::Return>
    🔬This is a nightly-only experimental API. (coroutine_trait)
    Resumes the execution of this coroutine. Read more
    ","Coroutine","bdk_esplora::blocking_ext::Error"],["
    §
    impl<M, P> DataProvider<M> for Box<P>
    where\n    M: KeyedDataMarker,\n    P: DataProvider<M> + ?Sized,
    §
    fn load(&self, req: DataRequest<'_>) -> Result<DataResponse<M>, DataError>
    Query the provider for data, returning the result. Read more
    ","DataProvider","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> Debug for Box<T, A>
    where\n    T: Debug + ?Sized,\n    A: Allocator,
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T> Default for Box<T>
    where\n    T: Default,
    Source§
    fn default() -> Box<T>
    Creates a Box<T>, with the Default value for T.
    \n
    ","Default","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> Deref for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    Source§
    type Target = T
    The resulting type after dereferencing.
    Source§
    fn deref(&self) -> &T
    Dereferences the value.
    ","Deref","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> DerefMut for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    Source§
    fn deref_mut(&mut self) -> &mut T
    Mutably dereferences the value.
    ","DerefMut","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<'de, T> Deserialize<'de> for Box<T>
    where\n    T: Deserialize<'de>,
    Source§
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<Box<T>, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> Display for Box<T, A>
    where\n    T: Display + ?Sized,\n    A: Allocator,
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Display","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<I, A> DoubleEndedIterator for Box<I, A>
    where\n    I: DoubleEndedIterator + ?Sized,\n    A: Allocator,
    Source§
    fn next_back(&mut self) -> Option<<I as Iterator>::Item>
    Removes and returns an element from the end of the iterator. Read more
    Source§
    fn nth_back(&mut self, n: usize) -> Option<<I as Iterator>::Item>
    Returns the nth element from the end of the iterator. Read more
    Source§
    fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>
    🔬This is a nightly-only experimental API. (iter_advance_by)
    Advances the iterator from the back by n elements. Read more
    1.27.0 · Source§
    fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R
    where\n    Self: Sized,\n    F: FnMut(B, Self::Item) -> R,\n    R: Try<Output = B>,
    This is the reverse version of Iterator::try_fold(): it takes\nelements starting from the back of the iterator. Read more
    1.27.0 · Source§
    fn rfold<B, F>(self, init: B, f: F) -> B
    where\n    Self: Sized,\n    F: FnMut(B, Self::Item) -> B,
    An iterator method that reduces the iterator’s elements to a single,\nfinal value, starting from the back. Read more
    1.27.0 · Source§
    fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item>
    where\n    Self: Sized,\n    P: FnMut(&Self::Item) -> bool,
    Searches for an element of an iterator from the back that satisfies a predicate. Read more
    ","DoubleEndedIterator","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> Drop for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    Source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    ","Drop","bdk_esplora::blocking_ext::Error"],["
    §
    impl<M, P> DynamicDataProvider<M> for Box<P>
    where\n    M: DataMarker,\n    P: DynamicDataProvider<M> + ?Sized,
    §
    fn load_data(\n    &self,\n    key: DataKey,\n    req: DataRequest<'_>,\n) -> Result<DataResponse<M>, DataError>
    Query the provider for data, returning the result. Read more
    ","DynamicDataProvider","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> EncodeAsVarULE<T> for Box<T>
    where\n    T: VarULE + ?Sized,
    §
    fn encode_var_ule_as_slices<R>(&self, cb: impl FnOnce(&[&[u8]]) -> R) -> R
    Calls cb with a piecewise list of byte slices that when concatenated\nproduce the memory pattern of the corresponding instance of T. Read more
    §
    fn encode_var_ule_len(&self) -> usize
    Return the length, in bytes, of the corresponding [VarULE] type
    §
    fn encode_var_ule_write(&self, dst: &mut [u8])
    Write the corresponding [VarULE] type to the dst buffer. dst should\nbe the size of [Self::encode_var_ule_len()]
    ","EncodeAsVarULE","bdk_esplora::blocking_ext::Error"],["
    1.8.0 · Source§
    impl<E> Error for Box<E>
    where\n    E: Error,
    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
    Source§
    fn source(&self) -> Option<&(dyn Error + 'static)>
    Returns the lower-level source of this error, if any. Read more
    Source§
    fn provide<'b>(&'b self, request: &mut Request<'b>)
    🔬This is a nightly-only experimental API. (error_generic_member_access)
    Provides type-based access to context intended for error reports. Read more
    ","Error","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<I, A> ExactSizeIterator for Box<I, A>
    where\n    I: ExactSizeIterator + ?Sized,\n    A: Allocator,
    Source§
    fn len(&self) -> usize
    Returns the exact remaining length of the iterator. Read more
    Source§
    fn is_empty(&self) -> bool
    🔬This is a nightly-only experimental API. (exact_size_is_empty)
    Returns true if the iterator is empty. Read more
    ","ExactSizeIterator","bdk_esplora::blocking_ext::Error"],["
    1.35.0 · Source§
    impl<Args, F, A> Fn<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: Fn<Args> + ?Sized,\n    A: Allocator,
    Source§
    extern "rust-call" fn call(\n    &self,\n    args: Args,\n) -> <Box<F, A> as FnOnce<Args>>::Output
    🔬This is a nightly-only experimental API. (fn_traits)
    Performs the call operation.
    ","Fn","bdk_esplora::blocking_ext::Error"],["
    1.35.0 · Source§
    impl<Args, F, A> FnMut<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: FnMut<Args> + ?Sized,\n    A: Allocator,
    Source§
    extern "rust-call" fn call_mut(\n    &mut self,\n    args: Args,\n) -> <Box<F, A> as FnOnce<Args>>::Output
    🔬This is a nightly-only experimental API. (fn_traits)
    Performs the call operation.
    ","FnMut","bdk_esplora::blocking_ext::Error"],["
    1.35.0 · Source§
    impl<Args, F, A> FnOnce<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: FnOnce<Args> + ?Sized,\n    A: Allocator,
    Source§
    type Output = <F as FnOnce<Args>>::Output
    The returned type after the call operator is used.
    Source§
    extern "rust-call" fn call_once(\n    self,\n    args: Args,\n) -> <Box<F, A> as FnOnce<Args>>::Output
    🔬This is a nightly-only experimental API. (fn_traits)
    Performs the call operation.
    ","FnOnce","bdk_esplora::blocking_ext::Error"],["
    1.6.0 · Source§
    impl<T> From<T> for Box<T>
    Source§
    fn from(t: T) -> Box<T>
    Converts a T into a Box<T>
    \n
    The conversion allocates on the heap and moves t\nfrom the stack into it.
    \n
    §Examples
    \n
    let x = 5;\nlet boxed = Box::new(5);\n\nassert_eq!(Box::from(x), boxed);
    \n
    ","From","bdk_esplora::blocking_ext::Error"],["
    §
    impl<F> FusedFuture for Box<F>
    where\n    F: FusedFuture + Unpin + ?Sized,
    §
    fn is_terminated(&self) -> bool
    Returns true if the underlying future should no longer be polled.
    ","FusedFuture","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S> FusedStream for Box<S>
    where\n    S: FusedStream + Unpin + ?Sized,
    §
    fn is_terminated(&self) -> bool
    Returns true if the stream should no longer be polled.
    ","FusedStream","bdk_esplora::blocking_ext::Error"],["
    1.36.0 · Source§
    impl<F, A> Future for Box<F, A>
    where\n    F: Future + Unpin + ?Sized,\n    A: Allocator,
    Source§
    type Output = <F as Future>::Output
    The type of value produced on completion.
    Source§
    fn poll(\n    self: Pin<&mut Box<F, A>>,\n    cx: &mut Context<'_>,\n) -> Poll<<Box<F, A> as Future>::Output>
    Attempts to resolve the future to a final value, registering\nthe current task for wakeup if the value is not yet available. Read more
    ","Future","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> Hash for Box<T, A>
    where\n    T: Hash + ?Sized,\n    A: Allocator,
    Source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · Source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where\n    H: Hasher,\n    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_esplora::blocking_ext::Error"],["
    1.22.0 · Source§
    impl<T, A> Hasher for Box<T, A>
    where\n    T: Hasher + ?Sized,\n    A: Allocator,
    Source§
    fn finish(&self) -> u64
    Returns the hash value for the values written so far. Read more
    Source§
    fn write(&mut self, bytes: &[u8])
    Writes some data into this Hasher. Read more
    Source§
    fn write_u8(&mut self, i: u8)
    Writes a single u8 into this hasher.
    Source§
    fn write_u16(&mut self, i: u16)
    Writes a single u16 into this hasher.
    Source§
    fn write_u32(&mut self, i: u32)
    Writes a single u32 into this hasher.
    Source§
    fn write_u64(&mut self, i: u64)
    Writes a single u64 into this hasher.
    Source§
    fn write_u128(&mut self, i: u128)
    Writes a single u128 into this hasher.
    Source§
    fn write_usize(&mut self, i: usize)
    Writes a single usize into this hasher.
    Source§
    fn write_i8(&mut self, i: i8)
    Writes a single i8 into this hasher.
    Source§
    fn write_i16(&mut self, i: i16)
    Writes a single i16 into this hasher.
    Source§
    fn write_i32(&mut self, i: i32)
    Writes a single i32 into this hasher.
    Source§
    fn write_i64(&mut self, i: i64)
    Writes a single i64 into this hasher.
    Source§
    fn write_i128(&mut self, i: i128)
    Writes a single i128 into this hasher.
    Source§
    fn write_isize(&mut self, i: isize)
    Writes a single isize into this hasher.
    Source§
    fn write_length_prefix(&mut self, len: usize)
    🔬This is a nightly-only experimental API. (hasher_prefixfree_extras)
    Writes a length prefix into this hasher, as part of being prefix-free. Read more
    Source§
    fn write_str(&mut self, s: &str)
    🔬This is a nightly-only experimental API. (hasher_prefixfree_extras)
    Writes a single str into this hasher. Read more
    ","Hasher","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<I, A> Iterator for Box<I, A>
    where\n    I: Iterator + ?Sized,\n    A: Allocator,
    Source§
    type Item = <I as Iterator>::Item
    The type of the elements being iterated over.
    Source§
    fn next(&mut self) -> Option<<I as Iterator>::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 nth(&mut self, n: usize) -> Option<<I as Iterator>::Item>
    Returns the nth element of the iterator. Read more
    Source§
    fn last(self) -> Option<<I as Iterator>::Item>
    Consumes the iterator, returning the last element. Read more
    Source§
    fn next_chunk<const N: usize>(\n    &mut self,\n) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>
    where\n    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\n    Self: Sized,
    Consumes the iterator, counting the number of iterations and returning it. 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\n    Self: Sized,
    Creates an iterator starting at the same point, but stepping by\nthe given amount at each iteration. Read more
    1.0.0 · Source§
    fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>
    where\n    Self: Sized,\n    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\n    Self: Sized,\n    U: IntoIterator,
    ‘Zips up’ two iterators into a single iterator of pairs. Read more
    Source§
    fn intersperse(self, separator: Self::Item) -> Intersperse<Self>
    where\n    Self: Sized,\n    Self::Item: Clone,
    🔬This is a nightly-only experimental API. (iter_intersperse)
    Creates a new iterator which places a copy of separator between adjacent\nitems of the original iterator. Read more
    Source§
    fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>
    where\n    Self: Sized,\n    G: FnMut() -> Self::Item,
    🔬This is a nightly-only experimental API. (iter_intersperse)
    Creates a new iterator which places an item generated by separator\nbetween adjacent items of the original iterator. Read more
    1.0.0 · Source§
    fn map<B, F>(self, f: F) -> Map<Self, F>
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> B,
    Takes a closure and creates an iterator which calls that closure on each\nelement. Read more
    1.21.0 · Source§
    fn for_each<F>(self, f: F)
    where\n    Self: Sized,\n    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\n    Self: Sized,\n    P: FnMut(&Self::Item) -> bool,
    Creates an iterator which uses a closure to determine if an element\nshould be yielded. Read more
    1.0.0 · Source§
    fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>
    where\n    Self: Sized,\n    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\n    Self: Sized,
    Creates an iterator which gives the current iteration count as well as\nthe next value. Read more
    1.0.0 · Source§
    fn peekable(self) -> Peekable<Self>
    where\n    Self: Sized,
    Creates an iterator which can use the peek and peek_mut methods\nto look at the next element of the iterator without consuming it. See\ntheir documentation for more information. Read more
    1.0.0 · Source§
    fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>
    where\n    Self: Sized,\n    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\n    Self: Sized,\n    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\n    Self: Sized,\n    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\n    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\n    Self: Sized,
    Creates an iterator that yields the first n elements, or fewer\nif 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\n    Self: Sized,\n    F: FnMut(&mut St, Self::Item) -> Option<B>,
    An iterator adapter which, like fold, holds internal state, but\nunlike fold, produces a new iterator. Read more
    1.0.0 · Source§
    fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>
    where\n    Self: Sized,\n    U: IntoIterator,\n    F: FnMut(Self::Item) -> U,
    Creates an iterator that works like map, but flattens nested structure. Read more
    1.29.0 · Source§
    fn flatten(self) -> Flatten<Self>
    where\n    Self: Sized,\n    Self::Item: IntoIterator,
    Creates an iterator that flattens nested structure. Read more
    Source§
    fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>
    where\n    Self: Sized,\n    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\nself and returns an iterator over the outputs of f. Like slice::windows(),\nthe windows during mapping overlap as well. Read more
    1.0.0 · Source§
    fn fuse(self) -> Fuse<Self>
    where\n    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\n    Self: Sized,\n    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\n    Self: Sized,
    Borrows an iterator, rather than consuming it. Read more
    1.0.0 · Source§
    fn collect<B>(self) -> B
    where\n    B: FromIterator<Self::Item>,\n    Self: Sized,
    Transforms an iterator into a collection. Read more
    Source§
    fn try_collect<B>(\n    &mut self,\n) -> <<Self::Item as Try>::Residual as Residual<B>>::TryType
    where\n    Self: Sized,\n    Self::Item: Try,\n    <Self::Item as Try>::Residual: Residual<B>,\n    B: FromIterator<<Self::Item as Try>::Output>,
    🔬This is a nightly-only experimental API. (iterator_try_collect)
    Fallibly transforms an iterator into a collection, short circuiting if\na failure is encountered. Read more
    Source§
    fn collect_into<E>(self, collection: &mut E) -> &mut E
    where\n    E: Extend<Self::Item>,\n    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\n    Self: Sized,\n    B: Default + Extend<Self::Item>,\n    F: FnMut(&Self::Item) -> bool,
    Consumes an iterator, creating two collections from it. Read more
    Source§
    fn partition_in_place<'a, T, P>(self, predicate: P) -> usize
    where\n    T: 'a,\n    Self: Sized + DoubleEndedIterator<Item = &'a mut T>,\n    P: FnMut(&T) -> bool,
    🔬This is a nightly-only experimental API. (iter_partition_in_place)
    Reorders the elements of this iterator in-place according to the given predicate,\nsuch that all those that return true precede all those that return false.\nReturns the number of true elements found. Read more
    Source§
    fn is_partitioned<P>(self, predicate: P) -> bool
    where\n    Self: Sized,\n    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,\nsuch 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\n    Self: Sized,\n    F: FnMut(B, Self::Item) -> R,\n    R: Try<Output = B>,
    An iterator method that applies a function as long as it returns\nsuccessfully, producing a single, final value. Read more
    1.27.0 · Source§
    fn try_for_each<F, R>(&mut self, f: F) -> R
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> R,\n    R: Try<Output = ()>,
    An iterator method that applies a fallible function to each item in the\niterator, 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\n    Self: Sized,\n    F: FnMut(B, Self::Item) -> B,
    Folds every element into an accumulator by applying an operation,\nreturning the final result. Read more
    1.51.0 · Source§
    fn reduce<F>(self, f: F) -> Option<Self::Item>
    where\n    Self: Sized,\n    F: FnMut(Self::Item, Self::Item) -> Self::Item,
    Reduces the elements to a single one, by repeatedly applying a reducing\noperation. Read more
    Source§
    fn try_reduce<R>(\n    &mut self,\n    f: impl FnMut(Self::Item, Self::Item) -> R,\n) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType
    where\n    Self: Sized,\n    R: Try<Output = Self::Item>,\n    <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\nclosure 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\n    Self: Sized,\n    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\n    Self: Sized,\n    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\n    Self: Sized,\n    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\n    Self: Sized,\n    F: FnMut(Self::Item) -> Option<B>,
    Applies function to the elements of iterator and returns\nthe first non-none result. Read more
    Source§
    fn try_find<R>(\n    &mut self,\n    f: impl FnMut(&Self::Item) -> R,\n) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType
    where\n    Self: Sized,\n    R: Try<Output = bool>,\n    <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\nthe first true result or the first error. Read more
    1.0.0 · Source§
    fn position<P>(&mut self, predicate: P) -> Option<usize>
    where\n    Self: Sized,\n    P: FnMut(Self::Item) -> bool,
    Searches for an element in an iterator, returning its index. Read more
    1.0.0 · Source§
    fn rposition<P>(&mut self, predicate: P) -> Option<usize>
    where\n    P: FnMut(Self::Item) -> bool,\n    Self: Sized + ExactSizeIterator + DoubleEndedIterator,
    Searches for an element in an iterator from the right, returning its\nindex. Read more
    1.0.0 · Source§
    fn max(self) -> Option<Self::Item>
    where\n    Self: Sized,\n    Self::Item: Ord,
    Returns the maximum element of an iterator. Read more
    1.0.0 · Source§
    fn min(self) -> Option<Self::Item>
    where\n    Self: Sized,\n    Self::Item: Ord,
    Returns the minimum element of an iterator. Read more
    1.6.0 · Source§
    fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>
    where\n    B: Ord,\n    Self: Sized,\n    F: FnMut(&Self::Item) -> B,
    Returns the element that gives the maximum value from the\nspecified function. Read more
    1.15.0 · Source§
    fn max_by<F>(self, compare: F) -> Option<Self::Item>
    where\n    Self: Sized,\n    F: FnMut(&Self::Item, &Self::Item) -> Ordering,
    Returns the element that gives the maximum value with respect to the\nspecified comparison function. Read more
    1.6.0 · Source§
    fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>
    where\n    B: Ord,\n    Self: Sized,\n    F: FnMut(&Self::Item) -> B,
    Returns the element that gives the minimum value from the\nspecified function. Read more
    1.15.0 · Source§
    fn min_by<F>(self, compare: F) -> Option<Self::Item>
    where\n    Self: Sized,\n    F: FnMut(&Self::Item, &Self::Item) -> Ordering,
    Returns the element that gives the minimum value with respect to the\nspecified comparison function. Read more
    1.0.0 · Source§
    fn rev(self) -> Rev<Self>
    where\n    Self: Sized + DoubleEndedIterator,
    Reverses an iterator’s direction. Read more
    1.0.0 · Source§
    fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)
    where\n    FromA: Default + Extend<A>,\n    FromB: Default + Extend<B>,\n    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\n    T: 'a + Copy,\n    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\n    T: 'a + Clone,\n    Self: Sized + Iterator<Item = &'a T>,
    Creates an iterator which clones all of its elements. Read more
    1.0.0 · Source§
    fn cycle(self) -> Cycle<Self>
    where\n    Self: Sized + Clone,
    Repeats an iterator endlessly. Read more
    Source§
    fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>
    where\n    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\n    Self: Sized,\n    S: Sum<Self::Item>,
    Sums the elements of an iterator. Read more
    1.11.0 · Source§
    fn product<P>(self) -> P
    where\n    Self: Sized,\n    P: Product<Self::Item>,
    Iterates over the entire iterator, multiplying all the elements Read more
    1.5.0 · Source§
    fn cmp<I>(self, other: I) -> Ordering
    where\n    I: IntoIterator<Item = Self::Item>,\n    Self::Item: Ord,\n    Self: Sized,
    Lexicographically compares the elements of this Iterator with those\nof another. Read more
    Source§
    fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering
    where\n    Self: Sized,\n    I: IntoIterator,\n    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\nof another with respect to the specified comparison function. Read more
    1.5.0 · Source§
    fn partial_cmp<I>(self, other: I) -> Option<Ordering>
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Lexicographically compares the PartialOrd elements of\nthis Iterator with those of another. The comparison works like short-circuit\nevaluation, returning a result without comparing the remaining elements.\nAs 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\n    Self: Sized,\n    I: IntoIterator,\n    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\nof another with respect to the specified comparison function. Read more
    1.5.0 · Source§
    fn eq<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialEq<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are equal to those of\nanother. Read more
    Source§
    fn eq_by<I, F>(self, other: I, eq: F) -> bool
    where\n    Self: Sized,\n    I: IntoIterator,\n    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\nanother with respect to the specified equality function. Read more
    1.5.0 · Source§
    fn ne<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialEq<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are not equal to those of\nanother. Read more
    1.5.0 · Source§
    fn lt<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are lexicographically\nless than those of another. Read more
    1.5.0 · Source§
    fn le<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are lexicographically\nless or equal to those of another. Read more
    1.5.0 · Source§
    fn gt<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are lexicographically\ngreater than those of another. Read more
    1.5.0 · Source§
    fn ge<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are lexicographically\ngreater than or equal to those of another. Read more
    1.82.0 · Source§
    fn is_sorted(self) -> bool
    where\n    Self: Sized,\n    Self::Item: PartialOrd,
    Checks if the elements of this iterator are sorted. Read more
    1.82.0 · Source§
    fn is_sorted_by<F>(self, compare: F) -> bool
    where\n    Self: Sized,\n    F: FnMut(&Self::Item, &Self::Item) -> bool,
    Checks if the elements of this iterator are sorted using the given comparator function. Read more
    1.82.0 · Source§
    fn is_sorted_by_key<F, K>(self, f: F) -> bool
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> K,\n    K: PartialOrd,
    Checks if the elements of this iterator are sorted using the given key extraction\nfunction. Read more
    ","Iterator","bdk_esplora::blocking_ext::Error"],["
    §
    impl<Sp> LocalSpawn for Box<Sp>
    where\n    Sp: LocalSpawn + ?Sized,
    §
    fn spawn_local_obj(\n    &self,\n    future: LocalFutureObj<'static, ()>,\n) -> Result<(), SpawnError>
    Spawns a future that will be run to completion. Read more
    §
    fn status_local(&self) -> Result<(), SpawnError>
    Determines whether the executor is able to spawn new tasks. Read more
    ","LocalSpawn","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> Ord for Box<T, A>
    where\n    T: Ord + ?Sized,\n    A: Allocator,
    Source§
    fn cmp(&self, other: &Box<T, A>) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> PartialEq for Box<T, A>
    where\n    T: PartialEq + ?Sized,\n    A: Allocator,
    Source§
    fn eq(&self, other: &Box<T, A>) -> bool
    Tests for self and other values to be equal, and is used by ==.
    Source§
    fn ne(&self, other: &Box<T, A>) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> PartialOrd for Box<T, A>
    where\n    T: PartialOrd + ?Sized,\n    A: Allocator,
    Source§
    fn partial_cmp(&self, other: &Box<T, A>) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    Source§
    fn lt(&self, other: &Box<T, A>) -> bool
    Tests less than (for self and other) and is used by the < operator. Read more
    Source§
    fn le(&self, other: &Box<T, A>) -> bool
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    Source§
    fn ge(&self, other: &Box<T, A>) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    Source§
    fn gt(&self, other: &Box<T, A>) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    ","PartialOrd","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> Pointer for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Pointer","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<R> Read for Box<R>
    where\n    R: Read + ?Sized,
    Source§
    fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>
    Pull some bytes from this source into the specified buffer, returning\nhow many bytes were read. Read more
    Source§
    fn read_buf(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>
    🔬This is a nightly-only experimental API. (read_buf)
    Pull some bytes from this source into the specified buffer. Read more
    Source§
    fn read_vectored(&mut self, bufs: &mut [IoSliceMut<'_>]) -> Result<usize, Error>
    Like read, except that it reads into a slice of buffers. Read more
    Source§
    fn is_read_vectored(&self) -> bool
    🔬This is a nightly-only experimental API. (can_vector)
    Determines if this Reader has an efficient read_vectored\nimplementation. Read more
    Source§
    fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>
    Reads all bytes until EOF in this source, placing them into buf. Read more
    Source§
    fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>
    Reads all bytes until EOF in this source, appending them to buf. Read more
    Source§
    fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>
    Reads the exact number of bytes required to fill buf. Read more
    Source§
    fn read_buf_exact(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>
    🔬This is a nightly-only experimental API. (read_buf)
    Reads the exact number of bytes required to fill cursor. Read more
    1.0.0 · Source§
    fn by_ref(&mut self) -> &mut Self
    where\n    Self: Sized,
    Creates a “by reference” adaptor for this instance of Read. Read more
    1.0.0 · Source§
    fn bytes(self) -> Bytes<Self>
    where\n    Self: Sized,
    Transforms this Read instance to an Iterator over its bytes. Read more
    1.0.0 · Source§
    fn chain<R>(self, next: R) -> Chain<Self, R>
    where\n    R: Read,\n    Self: Sized,
    Creates an adapter which will chain this stream with another. Read more
    1.0.0 · Source§
    fn take(self, limit: u64) -> Take<Self>
    where\n    Self: Sized,
    Creates an adapter which will read at most limit bytes from it. Read more
    ","Read","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<R> RngCore for Box<R>
    where\n    R: RngCore + ?Sized,
    Source§
    fn next_u32(&mut self) -> u32
    Return the next random u32. Read more
    Source§
    fn next_u64(&mut self) -> u64
    Return the next random u64. Read more
    Source§
    fn fill_bytes(&mut self, dest: &mut [u8])
    Fill dest with random data. Read more
    Source§
    fn try_fill_bytes(&mut self, dest: &mut [u8]) -> Result<(), Error>
    Fill dest entirely with random data. Read more
    ","RngCore","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<S> Seek for Box<S>
    where\n    S: Seek + ?Sized,
    Source§
    fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>
    Seek to an offset, in bytes, in a stream. Read more
    Source§
    fn stream_position(&mut self) -> Result<u64, Error>
    Returns the current seek position from the start of the stream. Read more
    1.55.0 · Source§
    fn rewind(&mut self) -> Result<(), Error>
    Rewind to the beginning of a stream. Read more
    Source§
    fn stream_len(&mut self) -> Result<u64, Error>
    🔬This is a nightly-only experimental API. (seek_stream_len)
    Returns the length of this stream (in bytes). Read more
    1.80.0 · Source§
    fn seek_relative(&mut self, offset: i64) -> Result<(), Error>
    Seeks relative to the current position. Read more
    ","Seek","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T> Serialize for Box<T>
    where\n    T: Serialize + ?Sized,
    Source§
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S, Request> Service<Request> for Box<S>
    where\n    S: Service<Request> + ?Sized,
    §
    type Response = <S as Service<Request>>::Response
    Responses given by the service.
    §
    type Error = <S as Service<Request>>::Error
    Errors produced by the service.
    §
    type Future = <S as Service<Request>>::Future
    The future response value.
    §
    fn poll_ready(\n    &mut self,\n    cx: &mut Context<'_>,\n) -> Poll<Result<(), <S as Service<Request>>::Error>>
    Returns Poll::Ready(Ok(())) when the service is able to process requests. Read more
    §
    fn call(&mut self, request: Request) -> <S as Service<Request>>::Future
    Process the request and return the response asynchronously. Read more
    ","Service","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S, Item> Sink<Item> for Box<S>
    where\n    S: Sink<Item> + Unpin + ?Sized,
    §
    type Error = <S as Sink<Item>>::Error
    The type of value produced by the sink when an error occurs.
    §
    fn poll_ready(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<(), <Box<S> as Sink<Item>>::Error>>
    Attempts to prepare the Sink to receive a value. Read more
    §
    fn start_send(\n    self: Pin<&mut Box<S>>,\n    item: Item,\n) -> Result<(), <Box<S> as Sink<Item>>::Error>
    Begin the process of sending a value to the sink.\nEach call to this function must be preceded by a successful call to\npoll_ready which returned Poll::Ready(Ok(())). Read more
    §
    fn poll_flush(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<(), <Box<S> as Sink<Item>>::Error>>
    Flush any remaining output from this sink. Read more
    §
    fn poll_close(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>,\n) -> Poll<Result<(), <Box<S> as Sink<Item>>::Error>>
    Flush any remaining output and close this sink, if necessary. Read more
    ","Sink","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> Source for Box<T>
    where\n    T: Source + ?Sized,
    §
    fn register(\n    &mut self,\n    registry: &Registry,\n    token: Token,\n    interests: Interest,\n) -> Result<(), Error>
    Register self with the given Registry instance. Read more
    §
    fn reregister(\n    &mut self,\n    registry: &Registry,\n    token: Token,\n    interests: Interest,\n) -> Result<(), Error>
    Re-register self with the given Registry instance. Read more
    §
    fn deregister(&mut self, registry: &Registry) -> Result<(), Error>
    Deregister self from the given Registry instance. Read more
    ","Source","bdk_esplora::blocking_ext::Error"],["
    §
    impl<Sp> Spawn for Box<Sp>
    where\n    Sp: Spawn + ?Sized,
    §
    fn spawn_obj(&self, future: FutureObj<'static, ()>) -> Result<(), SpawnError>
    Spawns a future that will be run to completion. Read more
    §
    fn status(&self) -> Result<(), SpawnError>
    Determines whether the executor is able to spawn new tasks. Read more
    ","Spawn","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S> Stream for Box<S>
    where\n    S: Stream + Unpin + ?Sized,
    §
    type Item = <S as Stream>::Item
    Values yielded by the stream.
    §
    fn poll_next(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>,\n) -> Poll<Option<<Box<S> as Stream>::Item>>
    Attempt to pull out the next value of this stream, registering the\ncurrent task for wakeup if the value is not yet available, and returning\nNone if the stream is exhausted. Read more
    §
    fn size_hint(&self) -> (usize, Option<usize>)
    Returns the bounds on the remaining length of the stream. Read more
    ","Stream","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S> Subscriber for Box<S>
    where\n    S: Subscriber + ?Sized,
    §
    fn register_callsite(&self, metadata: &'static Metadata<'static>) -> Interest
    Registers a new callsite with this subscriber, returning whether or not\nthe subscriber is interested in being notified about the callsite. Read more
    §
    fn enabled(&self, metadata: &Metadata<'_>) -> bool
    Returns true if a span or event with the specified metadata would be\nrecorded. Read more
    §
    fn max_level_hint(&self) -> Option<LevelFilter>
    Returns the highest verbosity level that this Subscriber will\nenable, or None, if the subscriber does not implement level-based\nfiltering or chooses not to implement this method. Read more
    §
    fn new_span(&self, span: &Attributes<'_>) -> Id
    Visit the construction of a new span, returning a new span ID for the\nspan being constructed. Read more
    §
    fn record(&self, span: &Id, values: &Record<'_>)
    Record a set of values on a span. Read more
    §
    fn record_follows_from(&self, span: &Id, follows: &Id)
    Adds an indication that span follows from the span with the id\nfollows. Read more
    §
    fn event_enabled(&self, event: &Event<'_>) -> bool
    Determine if an [Event] should be recorded. Read more
    §
    fn event(&self, event: &Event<'_>)
    Records that an Event has occurred. Read more
    §
    fn enter(&self, span: &Id)
    Records that a span has been entered. Read more
    §
    fn exit(&self, span: &Id)
    Records that a span has been exited. Read more
    §
    fn clone_span(&self, id: &Id) -> Id
    Notifies the subscriber that a span ID has been cloned. Read more
    §
    fn try_close(&self, id: Id) -> bool
    Notifies the subscriber that a span ID has been dropped, and returns\ntrue if there are now 0 IDs that refer to that span. Read more
    §
    fn drop_span(&self, id: Id)
    👎Deprecated since 0.1.2: use Subscriber::try_close instead
    This method is deprecated. Read more
    §
    fn current_span(&self) -> Current
    Returns a type representing this subscriber’s view of the current span. Read more
    §
    unsafe fn downcast_raw(&self, id: TypeId) -> Option<*const ()>
    If self is the same type as the provided TypeId, returns an untyped\n*const pointer to that type. Otherwise, returns None. Read more
    §
    fn on_register_dispatch(&self, subscriber: &Dispatch)
    Invoked when this subscriber becomes a [Dispatch]. Read more
    ","Subscriber","bdk_esplora::blocking_ext::Error"],["
    §
    impl<'a, T, F> UnsafeFutureObj<'a, T> for Box<F>
    where\n    F: Future<Output = T> + 'a,
    §
    fn into_raw(self) -> *mut dyn Future<Output = T> + 'a
    Convert an owned instance into a (conceptually owned) fat pointer. Read more
    §
    unsafe fn drop(ptr: *mut dyn Future<Output = T> + 'a)
    Drops the future represented by the given fat pointer. Read more
    ","UnsafeFutureObj<'a, T>","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> Value for Box<T>
    where\n    T: Value + ?Sized,
    §
    fn record(&self, key: &Field, visitor: &mut dyn Visit)
    Visits this value with the given Visitor.
    ","Value","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<W> Write for Box<W>
    where\n    W: Write + ?Sized,
    Source§
    fn write(&mut self, buf: &[u8]) -> Result<usize, Error>
    Writes a buffer into this writer, returning how many bytes were written. Read more
    Source§
    fn write_vectored(&mut self, bufs: &[IoSlice<'_>]) -> Result<usize, Error>
    Like write, except that it writes from a slice of buffers. Read more
    Source§
    fn is_write_vectored(&self) -> bool
    🔬This is a nightly-only experimental API. (can_vector)
    Determines if this Writer has an efficient write_vectored\nimplementation. Read more
    Source§
    fn flush(&mut self) -> Result<(), Error>
    Flushes this output stream, ensuring that all intermediately buffered\ncontents reach their destination. Read more
    Source§
    fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>
    Attempts to write an entire buffer into this writer. Read more
    Source§
    fn write_fmt(&mut self, fmt: Arguments<'_>) -> Result<(), Error>
    Writes a formatted string into this writer, returning any error\nencountered. Read more
    Source§
    fn write_all_vectored(&mut self, bufs: &mut [IoSlice<'_>]) -> Result<(), Error>
    🔬This is a nightly-only experimental API. (write_all_vectored)
    Attempts to write multiple buffers into this writer. Read more
    1.0.0 · Source§
    fn by_ref(&mut self) -> &mut Self
    where\n    Self: Sized,
    Creates a “by reference” adapter for this instance of Write. Read more
    ","Write","bdk_esplora::blocking_ext::Error"],["
    §
    impl<'a, T> Writeable for Box<T>
    where\n    T: Writeable + ?Sized,
    §
    fn write_to<W>(&self, sink: &mut W) -> Result<(), Error>
    where\n    W: Write + ?Sized,
    Writes a string to the given sink. Errors from the sink are bubbled up.\nThe default implementation delegates to write_to_parts, and discards any\nPart annotations.
    §
    fn write_to_parts<W>(&self, sink: &mut W) -> Result<(), Error>
    where\n    W: PartsWrite + ?Sized,
    Write bytes and Part annotations to the given sink. Errors from the\nsink are bubbled up. The default implementation delegates to write_to,\nand doesn’t produce any Part annotations.
    §
    fn writeable_length_hint(&self) -> LengthHint
    Returns a hint for the number of UTF-8 bytes that will be written to the sink. Read more
    §
    fn write_to_string(&self) -> Cow<'_, str>
    Creates a new String with the data from this Writeable. Like ToString,\nbut smaller and faster. Read more
    §
    fn writeable_cmp_bytes(&self, other: &[u8]) -> Ordering
    Compares the contents of this Writeable to the given bytes\nwithout allocating a String to hold the Writeable contents. Read more
    ","Writeable","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> CartablePointerLike for Box<T>
    ","CartablePointerLike","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T, U, A> CoerceUnsized<Box<U, A>> for Box<T, A>
    where\n    T: Unsize<U> + ?Sized,\n    A: Allocator,\n    U: ?Sized,
    ","CoerceUnsized>","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<R> CryptoRng for Box<R>
    where\n    R: CryptoRng + ?Sized,
    ","CryptoRng","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T, A> DerefPure for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    ","DerefPure","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T, U> DispatchFromDyn<Box<U>> for Box<T>
    where\n    T: Unsize<U> + ?Sized,\n    U: ?Sized,
    ","DispatchFromDyn>","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · Source§
    impl<T, A> Eq for Box<T, A>
    where\n    T: Eq + ?Sized,\n    A: Allocator,
    ","Eq","bdk_esplora::blocking_ext::Error"],["
    1.26.0 · Source§
    impl<I, A> FusedIterator for Box<I, A>
    where\n    I: FusedIterator + ?Sized,\n    A: Allocator,
    ","FusedIterator","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T, A> PinCoerceUnsized for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    ","PinCoerceUnsized","bdk_esplora::blocking_ext::Error"],["
    Source§
    impl<T> PointerLike for Box<T>
    ","PointerLike","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> StableDeref for Box<T>
    where\n    T: ?Sized,
    ","StableDeref","bdk_esplora::blocking_ext::Error"],["
    1.33.0 · Source§
    impl<T, A> Unpin for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    ","Unpin","bdk_esplora::blocking_ext::Error"]]]]);
     if (window.register_type_impls) {
         window.register_type_impls(type_impls);
     } else {
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/alloc/collections/btree/map/struct.BTreeMap.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/alloc/collections/btree/map/struct.BTreeMap.js
index f8be26f624..907f8307b8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/alloc/collections/btree/map/struct.BTreeMap.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/alloc/collections/btree/map/struct.BTreeMap.js
@@ -1,9 +1,9 @@
 (function() {
-    var type_impls = Object.fromEntries([["bdk_chain",[["
    Source§
    impl<K, V> BTreeMap<K, V>
    1.0.0 (const: 1.66.0) · Source
    pub const fn new() -> BTreeMap<K, V>
    Makes a new, empty BTreeMap.
    \n
    Does not allocate anything on its own.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\n\n// entries can now be inserted into the empty map\nmap.insert(1, \"a\");
    \n
    ",0,"bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    Source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · Source
    pub fn iter(&self) -> Iter<'_, K, V> ⓘ
    Gets an iterator over the entries of the map, sorted by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(3, \"c\");\nmap.insert(2, \"b\");\nmap.insert(1, \"a\");\n\nfor (key, value) in map.iter() {\n    println!(\"{key}: {value}\");\n}\n\nlet (first_key, first_value) = map.iter().next().unwrap();\nassert_eq!((*first_key, *first_value), (1, \"a\"));
    \n
    1.0.0 · Source
    pub fn iter_mut(&mut self) -> IterMut<'_, K, V> ⓘ
    Gets a mutable iterator over the entries of the map, sorted by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::from([\n   (\"a\", 1),\n   (\"b\", 2),\n   (\"c\", 3),\n]);\n\n// add 10 to the value if the key isn't \"a\"\nfor (key, value) in map.iter_mut() {\n    if key != &\"a\" {\n        *value += 10;\n    }\n}
    \n
    1.0.0 · Source
    pub fn keys(&self) -> Keys<'_, K, V> ⓘ
    Gets an iterator over the keys of the map, in sorted order.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(2, \"b\");\na.insert(1, \"a\");\n\nlet keys: Vec<_> = a.keys().cloned().collect();\nassert_eq!(keys, [1, 2]);
    \n
    1.0.0 · Source
    pub fn values(&self) -> Values<'_, K, V> ⓘ
    Gets an iterator over the values of the map, in order by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"hello\");\na.insert(2, \"goodbye\");\n\nlet values: Vec<&str> = a.values().cloned().collect();\nassert_eq!(values, [\"hello\", \"goodbye\"]);
    \n
    1.10.0 · Source
    pub fn values_mut(&mut self) -> ValuesMut<'_, K, V> ⓘ
    Gets a mutable iterator over the values of the map, in order by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, String::from(\"hello\"));\na.insert(2, String::from(\"goodbye\"));\n\nfor value in a.values_mut() {\n    value.push_str(\"!\");\n}\n\nlet values: Vec<String> = a.values().cloned().collect();\nassert_eq!(values, [String::from(\"hello!\"),\n                    String::from(\"goodbye!\")]);
    \n
    1.0.0 (const: unstable) · Source
    pub fn len(&self) -> usize
    Returns the number of elements in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\nassert_eq!(a.len(), 0);\na.insert(1, \"a\");\nassert_eq!(a.len(), 1);
    \n
    1.0.0 (const: unstable) · Source
    pub fn is_empty(&self) -> bool
    Returns true if the map contains no elements.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\nassert!(a.is_empty());\na.insert(1, \"a\");\nassert!(!a.is_empty());
    \n
    Source
    pub fn lower_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a Cursor pointing at the gap before the smallest key\ngreater than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap before the smallest key greater than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap before the smallest key greater than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap before the smallest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet cursor = map.lower_bound(Bound::Included(&2));\nassert_eq!(cursor.peek_prev(), Some((&1, &\"a\")));\nassert_eq!(cursor.peek_next(), Some((&2, &\"b\")));\n\nlet cursor = map.lower_bound(Bound::Excluded(&2));\nassert_eq!(cursor.peek_prev(), Some((&2, &\"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &\"c\")));\n\nlet cursor = map.lower_bound(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), None);\nassert_eq!(cursor.peek_next(), Some((&1, &\"a\")));
    \n
    Source
    pub fn lower_bound_mut<Q>(&mut self, bound: Bound<&Q>) -> CursorMut<'_, K, V, A>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a CursorMut pointing at the gap before the smallest key\ngreater than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap before the smallest key greater than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap before the smallest key greater than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap before the smallest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet mut map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet mut cursor = map.lower_bound_mut(Bound::Included(&2));\nassert_eq!(cursor.peek_prev(), Some((&1, &mut \"a\")));\nassert_eq!(cursor.peek_next(), Some((&2, &mut \"b\")));\n\nlet mut cursor = map.lower_bound_mut(Bound::Excluded(&2));\nassert_eq!(cursor.peek_prev(), Some((&2, &mut \"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &mut \"c\")));\n\nlet mut cursor = map.lower_bound_mut(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), None);\nassert_eq!(cursor.peek_next(), Some((&1, &mut \"a\")));
    \n
    Source
    pub fn upper_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a Cursor pointing at the gap after the greatest key\nsmaller than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap after the greatest key smaller than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap after the greatest key smaller than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap after the greatest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet cursor = map.upper_bound(Bound::Included(&3));\nassert_eq!(cursor.peek_prev(), Some((&3, &\"c\")));\nassert_eq!(cursor.peek_next(), Some((&4, &\"d\")));\n\nlet cursor = map.upper_bound(Bound::Excluded(&3));\nassert_eq!(cursor.peek_prev(), Some((&2, &\"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &\"c\")));\n\nlet cursor = map.upper_bound(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), Some((&4, &\"d\")));\nassert_eq!(cursor.peek_next(), None);
    \n
    Source
    pub fn upper_bound_mut<Q>(&mut self, bound: Bound<&Q>) -> CursorMut<'_, K, V, A>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a CursorMut pointing at the gap after the greatest key\nsmaller than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap after the greatest key smaller than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap after the greatest key smaller than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap after the greatest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet mut map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet mut cursor = map.upper_bound_mut(Bound::Included(&3));\nassert_eq!(cursor.peek_prev(), Some((&3, &mut \"c\")));\nassert_eq!(cursor.peek_next(), Some((&4, &mut \"d\")));\n\nlet mut cursor = map.upper_bound_mut(Bound::Excluded(&3));\nassert_eq!(cursor.peek_prev(), Some((&2, &mut \"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &mut \"c\")));\n\nlet mut cursor = map.upper_bound_mut(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), Some((&4, &mut \"d\")));\nassert_eq!(cursor.peek_next(), None);
    \n
    ",0,"bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    Source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · Source
    pub fn clear(&mut self)
    Clears the map, removing all elements.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.clear();\nassert!(a.is_empty());
    \n
    Source
    pub const fn new_in(alloc: A) -> BTreeMap<K, V, A>
    🔬This is a nightly-only experimental API. (btreemap_alloc)
    Makes a new empty BTreeMap with a reasonable choice for B.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\nuse std::alloc::Global;\n\nlet mut map = BTreeMap::new_in(Global);\n\n// entries can now be inserted into the empty map\nmap.insert(1, \"a\");
    \n
    ",0,"bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    Source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · Source
    pub fn get<Q>(&self, key: &Q) -> Option<&V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns a reference to the value corresponding to the key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.get(&1), Some(&\"a\"));\nassert_eq!(map.get(&2), None);
    \n
    1.40.0 · Source
    pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns the key-value pair corresponding to the supplied key. This is\npotentially useful:
    \n
      \n
    • for key types where non-identical keys can be considered equal;
      • \n
    • for getting the &K stored key value from a borrowed &Q lookup key; or
      • \n
    • for getting a reference to a key with the same lifetime as the collection.
      • \n
    \n
    The supplied key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::cmp::Ordering;\nuse std::collections::BTreeMap;\n\n#[derive(Clone, Copy, Debug)]\nstruct S {\n    id: u32,\n    name: &'static str, // ignored by equality and ordering operations\n}\n\nimpl PartialEq for S {\n    fn eq(&self, other: &S) -> bool {\n        self.id == other.id\n    }\n}\n\nimpl Eq for S {}\n\nimpl PartialOrd for S {\n    fn partial_cmp(&self, other: &S) -> Option<Ordering> {\n        self.id.partial_cmp(&other.id)\n    }\n}\n\nimpl Ord for S {\n    fn cmp(&self, other: &S) -> Ordering {\n        self.id.cmp(&other.id)\n    }\n}\n\nlet j_a = S { id: 1, name: \"Jessica\" };\nlet j_b = S { id: 1, name: \"Jess\" };\nlet p = S { id: 2, name: \"Paul\" };\nassert_eq!(j_a, j_b);\n\nlet mut map = BTreeMap::new();\nmap.insert(j_a, \"Paris\");\nassert_eq!(map.get_key_value(&j_a), Some((&j_a, &\"Paris\")));\nassert_eq!(map.get_key_value(&j_b), Some((&j_a, &\"Paris\"))); // the notable case\nassert_eq!(map.get_key_value(&p), None);
    \n
    1.66.0 · Source
    pub fn first_key_value(&self) -> Option<(&K, &V)>
    where\n    K: Ord,
    Returns the first key-value pair in the map.\nThe key in this pair is the minimum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.first_key_value(), None);\nmap.insert(1, \"b\");\nmap.insert(2, \"a\");\nassert_eq!(map.first_key_value(), Some((&1, &\"b\")));
    \n
    1.66.0 · Source
    pub fn first_entry(&mut self) -> Option<OccupiedEntry<'_, K, V, A>>
    where\n    K: Ord,
    Returns the first entry in the map for in-place manipulation.\nThe key of this entry is the minimum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nif let Some(mut entry) = map.first_entry() {\n    if *entry.key() > 0 {\n        entry.insert(\"first\");\n    }\n}\nassert_eq!(*map.get(&1).unwrap(), \"first\");\nassert_eq!(*map.get(&2).unwrap(), \"b\");
    \n
    1.66.0 · Source
    pub fn pop_first(&mut self) -> Option<(K, V)>
    where\n    K: Ord,
    Removes and returns the first element in the map.\nThe key of this element is the minimum key that was in the map.
    \n
    §Examples
    \n
    Draining elements in ascending order, while keeping a usable map each iteration.
    \n\n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nwhile let Some((key, _val)) = map.pop_first() {\n    assert!(map.iter().all(|(k, _v)| *k > key));\n}\nassert!(map.is_empty());
    \n
    1.66.0 · Source
    pub fn last_key_value(&self) -> Option<(&K, &V)>
    where\n    K: Ord,
    Returns the last key-value pair in the map.\nThe key in this pair is the maximum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"b\");\nmap.insert(2, \"a\");\nassert_eq!(map.last_key_value(), Some((&2, &\"a\")));
    \n
    1.66.0 · Source
    pub fn last_entry(&mut self) -> Option<OccupiedEntry<'_, K, V, A>>
    where\n    K: Ord,
    Returns the last entry in the map for in-place manipulation.\nThe key of this entry is the maximum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nif let Some(mut entry) = map.last_entry() {\n    if *entry.key() > 0 {\n        entry.insert(\"last\");\n    }\n}\nassert_eq!(*map.get(&1).unwrap(), \"a\");\nassert_eq!(*map.get(&2).unwrap(), \"last\");
    \n
    1.66.0 · Source
    pub fn pop_last(&mut self) -> Option<(K, V)>
    where\n    K: Ord,
    Removes and returns the last element in the map.\nThe key of this element is the maximum key that was in the map.
    \n
    §Examples
    \n
    Draining elements in descending order, while keeping a usable map each iteration.
    \n\n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nwhile let Some((key, _val)) = map.pop_last() {\n    assert!(map.iter().all(|(k, _v)| *k < key));\n}\nassert!(map.is_empty());
    \n
    1.0.0 · Source
    pub fn contains_key<Q>(&self, key: &Q) -> bool
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns true if the map contains a value for the specified key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.contains_key(&1), true);\nassert_eq!(map.contains_key(&2), false);
    \n
    1.0.0 · Source
    pub fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns a mutable reference to the value corresponding to the key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nif let Some(x) = map.get_mut(&1) {\n    *x = \"b\";\n}\nassert_eq!(map[&1], \"b\");
    \n
    1.0.0 · Source
    pub fn insert(&mut self, key: K, value: V) -> Option<V>
    where\n    K: Ord,
    Inserts a key-value pair into the map.
    \n
    If the map did not have this key present, None is returned.
    \n
    If the map did have this key present, the value is updated, and the old\nvalue is returned. The key is not updated, though; this matters for\ntypes that can be == without being identical. See the module-level\ndocumentation for more.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.insert(37, \"a\"), None);\nassert_eq!(map.is_empty(), false);\n\nmap.insert(37, \"b\");\nassert_eq!(map.insert(37, \"c\"), Some(\"b\"));\nassert_eq!(map[&37], \"c\");
    \n
    Source
    pub fn try_insert(\n    &mut self,\n    key: K,\n    value: V,\n) -> Result<&mut V, OccupiedError<'_, K, V, A>>
    where\n    K: Ord,
    🔬This is a nightly-only experimental API. (map_try_insert)
    Tries to insert a key-value pair into the map, and returns\na mutable reference to the value in the entry.
    \n
    If the map already had this key present, nothing is updated, and\nan error containing the occupied entry and the value is returned.
    \n
    §Examples
    \n
    #![feature(map_try_insert)]\n\nuse std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.try_insert(37, \"a\").unwrap(), &\"a\");\n\nlet err = map.try_insert(37, \"b\").unwrap_err();\nassert_eq!(err.entry.key(), &37);\nassert_eq!(err.entry.get(), &\"a\");\nassert_eq!(err.value, \"b\");
    \n
    1.0.0 · Source
    pub fn remove<Q>(&mut self, key: &Q) -> Option<V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Removes a key from the map, returning the value at the key if the key\nwas previously in the map.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.remove(&1), Some(\"a\"));\nassert_eq!(map.remove(&1), None);
    \n
    1.45.0 · Source
    pub fn remove_entry<Q>(&mut self, key: &Q) -> Option<(K, V)>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Removes a key from the map, returning the stored key and value if the key\nwas previously in the map.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.remove_entry(&1), Some((1, \"a\")));\nassert_eq!(map.remove_entry(&1), None);
    \n
    1.53.0 · Source
    pub fn retain<F>(&mut self, f: F)
    where\n    K: Ord,\n    F: FnMut(&K, &mut V) -> bool,
    Retains only the elements specified by the predicate.
    \n
    In other words, remove all pairs (k, v) for which f(&k, &mut v) returns false.\nThe elements are visited in ascending key order.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map: BTreeMap<i32, i32> = (0..8).map(|x| (x, x*10)).collect();\n// Keep only the elements with even-numbered keys.\nmap.retain(|&k, _| k % 2 == 0);\nassert!(map.into_iter().eq(vec![(0, 0), (2, 20), (4, 40), (6, 60)]));
    \n
    1.11.0 · Source
    pub fn append(&mut self, other: &mut BTreeMap<K, V, A>)
    where\n    K: Ord,\n    A: Clone,
    Moves all elements from other into self, leaving other empty.
    \n
    If a key from other is already present in self, the respective\nvalue from self will be overwritten with the respective value from other.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.insert(2, \"b\");\na.insert(3, \"c\"); // Note: Key (3) also present in b.\n\nlet mut b = BTreeMap::new();\nb.insert(3, \"d\"); // Note: Key (3) also present in a.\nb.insert(4, \"e\");\nb.insert(5, \"f\");\n\na.append(&mut b);\n\nassert_eq!(a.len(), 5);\nassert_eq!(b.len(), 0);\n\nassert_eq!(a[&1], \"a\");\nassert_eq!(a[&2], \"b\");\nassert_eq!(a[&3], \"d\"); // Note: \"c\" has been overwritten.\nassert_eq!(a[&4], \"e\");\nassert_eq!(a[&5], \"f\");
    \n
    1.17.0 · Source
    pub fn range<T, R>(&self, range: R) -> Range<'_, K, V> ⓘ
    where\n    T: Ord + ?Sized,\n    K: Borrow<T> + Ord,\n    R: RangeBounds<T>,
    Constructs a double-ended iterator over a sub-range of elements in the map.\nThe simplest way is to use the range syntax min..max, thus range(min..max) will\nyield elements from min (inclusive) to max (exclusive).\nThe range may also be entered as (Bound<T>, Bound<T>), so for example\nrange((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive\nrange from 4 to 10.
    \n
    §Panics
    \n
    Panics if range start > end.\nPanics if range start == end and both bounds are Excluded.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\nuse std::ops::Bound::Included;\n\nlet mut map = BTreeMap::new();\nmap.insert(3, \"a\");\nmap.insert(5, \"b\");\nmap.insert(8, \"c\");\nfor (&key, &value) in map.range((Included(&4), Included(&8))) {\n    println!(\"{key}: {value}\");\n}\nassert_eq!(Some((&5, &\"b\")), map.range(4..).next());
    \n
    1.17.0 · Source
    pub fn range_mut<T, R>(&mut self, range: R) -> RangeMut<'_, K, V> ⓘ
    where\n    T: Ord + ?Sized,\n    K: Borrow<T> + Ord,\n    R: RangeBounds<T>,
    Constructs a mutable double-ended iterator over a sub-range of elements in the map.\nThe simplest way is to use the range syntax min..max, thus range(min..max) will\nyield elements from min (inclusive) to max (exclusive).\nThe range may also be entered as (Bound<T>, Bound<T>), so for example\nrange((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive\nrange from 4 to 10.
    \n
    §Panics
    \n
    Panics if range start > end.\nPanics if range start == end and both bounds are Excluded.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map: BTreeMap<&str, i32> =\n    [(\"Alice\", 0), (\"Bob\", 0), (\"Carol\", 0), (\"Cheryl\", 0)].into();\nfor (_, balance) in map.range_mut(\"B\"..\"Cheryl\") {\n    *balance += 100;\n}\nfor (name, balance) in &map {\n    println!(\"{name} => {balance}\");\n}
    \n
    1.0.0 · Source
    pub fn entry(&mut self, key: K) -> Entry<'_, K, V, A>
    where\n    K: Ord,
    Gets the given key’s corresponding entry in the map for in-place manipulation.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut count: BTreeMap<&str, usize> = BTreeMap::new();\n\n// count the number of occurrences of letters in the vec\nfor x in [\"a\", \"b\", \"a\", \"c\", \"a\", \"b\"] {\n    count.entry(x).and_modify(|curr| *curr += 1).or_insert(1);\n}\n\nassert_eq!(count[\"a\"], 3);\nassert_eq!(count[\"b\"], 2);\nassert_eq!(count[\"c\"], 1);
    \n
    1.11.0 · Source
    pub fn split_off<Q>(&mut self, key: &Q) -> BTreeMap<K, V, A>
    where\n    Q: Ord + ?Sized,\n    K: Borrow<Q> + Ord,\n    A: Clone,
    Splits the collection into two at the given key. Returns everything after the given key,\nincluding the key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.insert(2, \"b\");\na.insert(3, \"c\");\na.insert(17, \"d\");\na.insert(41, \"e\");\n\nlet b = a.split_off(&3);\n\nassert_eq!(a.len(), 2);\nassert_eq!(b.len(), 3);\n\nassert_eq!(a[&1], \"a\");\nassert_eq!(a[&2], \"b\");\n\nassert_eq!(b[&3], \"c\");\nassert_eq!(b[&17], \"d\");\nassert_eq!(b[&41], \"e\");
    \n
    Source
    pub fn extract_if<F>(&mut self, pred: F) -> ExtractIf<'_, K, V, F, A> ⓘ
    where\n    K: Ord,\n    F: FnMut(&K, &mut V) -> bool,
    🔬This is a nightly-only experimental API. (btree_extract_if)
    Creates an iterator that visits all elements (key-value pairs) in\nascending key order and uses a closure to determine if an element should\nbe removed. If the closure returns true, the element is removed from\nthe map and yielded. If the closure returns false, or panics, the\nelement remains in the map and will not be yielded.
    \n
    The iterator also lets you mutate the value of each element in the\nclosure, regardless of whether you choose to keep or remove it.
    \n
    If the returned ExtractIf is not exhausted, e.g. because it is dropped without iterating\nor the iteration short-circuits, then the remaining elements will be retained.\nUse retain with a negated predicate if you do not need the returned iterator.
    \n
    §Examples
    \n
    Splitting a map into even and odd keys, reusing the original map:
    \n\n
    #![feature(btree_extract_if)]\nuse std::collections::BTreeMap;\n\nlet mut map: BTreeMap<i32, i32> = (0..8).map(|x| (x, x)).collect();\nlet evens: BTreeMap<_, _> = map.extract_if(|k, _v| k % 2 == 0).collect();\nlet odds = map;\nassert_eq!(evens.keys().copied().collect::<Vec<_>>(), [0, 2, 4, 6]);\nassert_eq!(odds.keys().copied().collect::<Vec<_>>(), [1, 3, 5, 7]);
    \n
    1.54.0 · Source
    pub fn into_keys(self) -> IntoKeys<K, V, A> ⓘ
    Creates a consuming iterator visiting all the keys, in sorted order.\nThe map cannot be used after calling this.\nThe iterator element type is K.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(2, \"b\");\na.insert(1, \"a\");\n\nlet keys: Vec<i32> = a.into_keys().collect();\nassert_eq!(keys, [1, 2]);
    \n
    1.54.0 · Source
    pub fn into_values(self) -> IntoValues<K, V, A> ⓘ
    Creates a consuming iterator visiting all the values, in order by key.\nThe map cannot be used after calling this.\nThe iterator element type is V.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"hello\");\na.insert(2, \"goodbye\");\n\nlet values: Vec<&str> = a.into_values().collect();\nassert_eq!(values, [\"hello\", \"goodbye\"]);
    \n
    ",0,"bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V, A> Clone for BTreeMap<K, V, A>
    where\n    K: Clone,\n    V: Clone,\n    A: Allocator + Clone,
    Source§
    fn clone(&self) -> BTreeMap<K, V, 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
    ","Clone","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V, A> Debug for BTreeMap<K, V, A>
    where\n    K: Debug,\n    V: Debug,\n    A: Allocator + Clone,
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V> Default for BTreeMap<K, V>
    Source§
    fn default() -> BTreeMap<K, V>
    Creates an empty BTreeMap.
    \n
    ","Default","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    Source§
    impl<'de, K, V> Deserialize<'de> for BTreeMap<K, V>
    where\n    K: Deserialize<'de> + Ord,\n    V: Deserialize<'de>,
    Source§
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<BTreeMap<K, V>, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.7.0 · Source§
    impl<K, V, A> Drop for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    Source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    ","Drop","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.2.0 · Source§
    impl<'a, K, V, A> Extend<(&'a K, &'a V)> for BTreeMap<K, V, A>
    where\n    K: Ord + Copy,\n    V: Copy,\n    A: Allocator + Clone,
    Source§
    fn extend<I>(&mut self, iter: I)
    where\n    I: IntoIterator<Item = (&'a K, &'a V)>,
    Extends a collection with the contents of an iterator. Read more
    Source§
    fn extend_one(&mut self, _: (&'a K, &'a V))
    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    Source§
    fn extend_reserve(&mut self, additional: usize)
    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    ","Extend<(&'a K, &'a V)>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V, A> Extend<(K, V)> for BTreeMap<K, V, A>
    where\n    K: Ord,\n    A: Allocator + Clone,
    Source§
    fn extend<T>(&mut self, iter: T)
    where\n    T: IntoIterator<Item = (K, V)>,
    Extends a collection with the contents of an iterator. Read more
    Source§
    fn extend_one(&mut self, _: (K, V))
    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    Source§
    fn extend_reserve(&mut self, additional: usize)
    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    ","Extend<(K, V)>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.56.0 · Source§
    impl<K, V, const N: usize> From<[(K, V); N]> for BTreeMap<K, V>
    where\n    K: Ord,
    Source§
    fn from(arr: [(K, V); N]) -> BTreeMap<K, V>
    Converts a [(K, V); N] into a BTreeMap<K, V>.
    \n
    If any entries in the array have equal keys,\nall but one of the corresponding values will be dropped.
    \n\n
    use std::collections::BTreeMap;\n\nlet map1 = BTreeMap::from([(1, 2), (3, 4)]);\nlet map2: BTreeMap<_, _> = [(1, 2), (3, 4)].into();\nassert_eq!(map1, map2);
    \n
    ","From<[(K, V); N]>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V> FromIterator<(K, V)> for BTreeMap<K, V>
    where\n    K: Ord,
    Source§
    fn from_iter<T>(iter: T) -> BTreeMap<K, V>
    where\n    T: IntoIterator<Item = (K, V)>,
    Constructs a BTreeMap<K, V> from an iterator of key-value pairs.
    \n
    If the iterator produces any pairs with equal keys,\nall but one of the corresponding values will be dropped.
    \n
    ","FromIterator<(K, V)>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V, A> Hash for BTreeMap<K, V, A>
    where\n    K: Hash,\n    V: Hash,\n    A: Allocator + Clone,
    Source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · Source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where\n    H: Hasher,\n    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, Q, V, A> Index<&Q> for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Source§
    fn index(&self, key: &Q) -> &V
    Returns a reference to the value corresponding to the supplied key.
    \n
    §Panics
    \n
    Panics if the key is not present in the BTreeMap.
    \n
    Source§
    type Output = V
    The returned type after indexing.
    ","Index<&Q>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    Source§
    impl<'de, K, V, E> IntoDeserializer<'de, E> for BTreeMap<K, V>
    where\n    K: IntoDeserializer<'de, E> + Eq + Ord,\n    V: IntoDeserializer<'de, E>,\n    E: Error,
    Source§
    type Deserializer = MapDeserializer<'de, <BTreeMap<K, V> as IntoIterator>::IntoIter, E>
    The type of the deserializer being converted into.
    Source§
    fn into_deserializer(\n    self,\n) -> <BTreeMap<K, V> as IntoDeserializer<'de, E>>::Deserializer
    Convert this value into a deserializer.
    ","IntoDeserializer<'de, E>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V, A> IntoIterator for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    Source§
    fn into_iter(self) -> IntoIter<K, V, A> ⓘ
    Gets an owning iterator over the entries of the map, sorted by key.
    \n
    Source§
    type Item = (K, V)
    The type of the elements being iterated over.
    Source§
    type IntoIter = IntoIter<K, V, A>
    Which kind of iterator are we turning this into?
    ","IntoIterator","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    Source§
    impl<K, V> Merge for BTreeMap<K, V>
    where\n    K: Ord,
    Source§
    fn merge(&mut self, other: BTreeMap<K, V>)
    Merge another object of the same type onto self.
    Source§
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    Source§
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    ","Merge","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V, A> Ord for BTreeMap<K, V, A>
    where\n    K: Ord,\n    V: Ord,\n    A: Allocator + Clone,
    Source§
    fn cmp(&self, other: &BTreeMap<K, V, A>) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V, A> PartialEq for BTreeMap<K, V, A>
    where\n    K: PartialEq,\n    V: PartialEq,\n    A: Allocator + Clone,
    Source§
    fn eq(&self, other: &BTreeMap<K, V, A>) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V, A> PartialOrd for BTreeMap<K, V, A>
    where\n    K: PartialOrd,\n    V: PartialOrd,\n    A: Allocator + Clone,
    Source§
    fn partial_cmp(&self, other: &BTreeMap<K, V, A>) -> 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
    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
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    1.0.0 · Source§
    fn gt(&self, other: &Rhs) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    1.0.0 · Source§
    fn ge(&self, other: &Rhs) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    ","PartialOrd","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    Source§
    impl<K, V> Serialize for BTreeMap<K, V>
    where\n    K: Serialize,\n    V: Serialize,
    Source§
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V, A> Eq for BTreeMap<K, V, A>
    where\n    K: Eq,\n    V: Eq,\n    A: Allocator + Clone,
    ","Eq","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.64.0 · Source§
    impl<K, V, A> UnwindSafe for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone + UnwindSafe,\n    K: RefUnwindSafe,\n    V: RefUnwindSafe,
    ","UnwindSafe","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"]]],["bdk_wallet",[["
    Source§
    impl<K, V> BTreeMap<K, V>
    1.0.0 (const: 1.66.0) · Source
    pub const fn new() -> BTreeMap<K, V>
    Makes a new, empty BTreeMap.
    \n
    Does not allocate anything on its own.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\n\n// entries can now be inserted into the empty map\nmap.insert(1, \"a\");
    \n
    ",0,"bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    Source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · Source
    pub fn iter(&self) -> Iter<'_, K, V>
    Gets an iterator over the entries of the map, sorted by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(3, \"c\");\nmap.insert(2, \"b\");\nmap.insert(1, \"a\");\n\nfor (key, value) in map.iter() {\n    println!(\"{key}: {value}\");\n}\n\nlet (first_key, first_value) = map.iter().next().unwrap();\nassert_eq!((*first_key, *first_value), (1, \"a\"));
    \n
    1.0.0 · Source
    pub fn iter_mut(&mut self) -> IterMut<'_, K, V>
    Gets a mutable iterator over the entries of the map, sorted by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::from([\n   (\"a\", 1),\n   (\"b\", 2),\n   (\"c\", 3),\n]);\n\n// add 10 to the value if the key isn't \"a\"\nfor (key, value) in map.iter_mut() {\n    if key != &\"a\" {\n        *value += 10;\n    }\n}
    \n
    1.0.0 · Source
    pub fn keys(&self) -> Keys<'_, K, V>
    Gets an iterator over the keys of the map, in sorted order.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(2, \"b\");\na.insert(1, \"a\");\n\nlet keys: Vec<_> = a.keys().cloned().collect();\nassert_eq!(keys, [1, 2]);
    \n
    1.0.0 · Source
    pub fn values(&self) -> Values<'_, K, V>
    Gets an iterator over the values of the map, in order by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"hello\");\na.insert(2, \"goodbye\");\n\nlet values: Vec<&str> = a.values().cloned().collect();\nassert_eq!(values, [\"hello\", \"goodbye\"]);
    \n
    1.10.0 · Source
    pub fn values_mut(&mut self) -> ValuesMut<'_, K, V>
    Gets a mutable iterator over the values of the map, in order by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, String::from(\"hello\"));\na.insert(2, String::from(\"goodbye\"));\n\nfor value in a.values_mut() {\n    value.push_str(\"!\");\n}\n\nlet values: Vec<String> = a.values().cloned().collect();\nassert_eq!(values, [String::from(\"hello!\"),\n                    String::from(\"goodbye!\")]);
    \n
    1.0.0 (const: unstable) · Source
    pub fn len(&self) -> usize
    Returns the number of elements in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\nassert_eq!(a.len(), 0);\na.insert(1, \"a\");\nassert_eq!(a.len(), 1);
    \n
    1.0.0 (const: unstable) · Source
    pub fn is_empty(&self) -> bool
    Returns true if the map contains no elements.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\nassert!(a.is_empty());\na.insert(1, \"a\");\nassert!(!a.is_empty());
    \n
    Source
    pub fn lower_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a Cursor pointing at the gap before the smallest key\ngreater than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap before the smallest key greater than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap before the smallest key greater than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap before the smallest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet cursor = map.lower_bound(Bound::Included(&2));\nassert_eq!(cursor.peek_prev(), Some((&1, &\"a\")));\nassert_eq!(cursor.peek_next(), Some((&2, &\"b\")));\n\nlet cursor = map.lower_bound(Bound::Excluded(&2));\nassert_eq!(cursor.peek_prev(), Some((&2, &\"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &\"c\")));\n\nlet cursor = map.lower_bound(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), None);\nassert_eq!(cursor.peek_next(), Some((&1, &\"a\")));
    \n
    Source
    pub fn lower_bound_mut<Q>(&mut self, bound: Bound<&Q>) -> CursorMut<'_, K, V, A>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a CursorMut pointing at the gap before the smallest key\ngreater than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap before the smallest key greater than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap before the smallest key greater than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap before the smallest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet mut map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet mut cursor = map.lower_bound_mut(Bound::Included(&2));\nassert_eq!(cursor.peek_prev(), Some((&1, &mut \"a\")));\nassert_eq!(cursor.peek_next(), Some((&2, &mut \"b\")));\n\nlet mut cursor = map.lower_bound_mut(Bound::Excluded(&2));\nassert_eq!(cursor.peek_prev(), Some((&2, &mut \"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &mut \"c\")));\n\nlet mut cursor = map.lower_bound_mut(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), None);\nassert_eq!(cursor.peek_next(), Some((&1, &mut \"a\")));
    \n
    Source
    pub fn upper_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a Cursor pointing at the gap after the greatest key\nsmaller than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap after the greatest key smaller than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap after the greatest key smaller than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap after the greatest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet cursor = map.upper_bound(Bound::Included(&3));\nassert_eq!(cursor.peek_prev(), Some((&3, &\"c\")));\nassert_eq!(cursor.peek_next(), Some((&4, &\"d\")));\n\nlet cursor = map.upper_bound(Bound::Excluded(&3));\nassert_eq!(cursor.peek_prev(), Some((&2, &\"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &\"c\")));\n\nlet cursor = map.upper_bound(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), Some((&4, &\"d\")));\nassert_eq!(cursor.peek_next(), None);
    \n
    Source
    pub fn upper_bound_mut<Q>(&mut self, bound: Bound<&Q>) -> CursorMut<'_, K, V, A>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a CursorMut pointing at the gap after the greatest key\nsmaller than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap after the greatest key smaller than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap after the greatest key smaller than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap after the greatest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet mut map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet mut cursor = map.upper_bound_mut(Bound::Included(&3));\nassert_eq!(cursor.peek_prev(), Some((&3, &mut \"c\")));\nassert_eq!(cursor.peek_next(), Some((&4, &mut \"d\")));\n\nlet mut cursor = map.upper_bound_mut(Bound::Excluded(&3));\nassert_eq!(cursor.peek_prev(), Some((&2, &mut \"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &mut \"c\")));\n\nlet mut cursor = map.upper_bound_mut(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), Some((&4, &mut \"d\")));\nassert_eq!(cursor.peek_next(), None);
    \n
    ",0,"bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    Source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · Source
    pub fn clear(&mut self)
    Clears the map, removing all elements.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.clear();\nassert!(a.is_empty());
    \n
    Source
    pub const fn new_in(alloc: A) -> BTreeMap<K, V, A>
    🔬This is a nightly-only experimental API. (btreemap_alloc)
    Makes a new empty BTreeMap with a reasonable choice for B.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\nuse std::alloc::Global;\n\nlet mut map = BTreeMap::new_in(Global);\n\n// entries can now be inserted into the empty map\nmap.insert(1, \"a\");
    \n
    ",0,"bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    Source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · Source
    pub fn get<Q>(&self, key: &Q) -> Option<&V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns a reference to the value corresponding to the key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.get(&1), Some(&\"a\"));\nassert_eq!(map.get(&2), None);
    \n
    1.40.0 · Source
    pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns the key-value pair corresponding to the supplied key. This is\npotentially useful:
    \n
      \n
    • for key types where non-identical keys can be considered equal;
      • \n
    • for getting the &K stored key value from a borrowed &Q lookup key; or
      • \n
    • for getting a reference to a key with the same lifetime as the collection.
      • \n
    \n
    The supplied key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::cmp::Ordering;\nuse std::collections::BTreeMap;\n\n#[derive(Clone, Copy, Debug)]\nstruct S {\n    id: u32,\n    name: &'static str, // ignored by equality and ordering operations\n}\n\nimpl PartialEq for S {\n    fn eq(&self, other: &S) -> bool {\n        self.id == other.id\n    }\n}\n\nimpl Eq for S {}\n\nimpl PartialOrd for S {\n    fn partial_cmp(&self, other: &S) -> Option<Ordering> {\n        self.id.partial_cmp(&other.id)\n    }\n}\n\nimpl Ord for S {\n    fn cmp(&self, other: &S) -> Ordering {\n        self.id.cmp(&other.id)\n    }\n}\n\nlet j_a = S { id: 1, name: \"Jessica\" };\nlet j_b = S { id: 1, name: \"Jess\" };\nlet p = S { id: 2, name: \"Paul\" };\nassert_eq!(j_a, j_b);\n\nlet mut map = BTreeMap::new();\nmap.insert(j_a, \"Paris\");\nassert_eq!(map.get_key_value(&j_a), Some((&j_a, &\"Paris\")));\nassert_eq!(map.get_key_value(&j_b), Some((&j_a, &\"Paris\"))); // the notable case\nassert_eq!(map.get_key_value(&p), None);
    \n
    1.66.0 · Source
    pub fn first_key_value(&self) -> Option<(&K, &V)>
    where\n    K: Ord,
    Returns the first key-value pair in the map.\nThe key in this pair is the minimum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.first_key_value(), None);\nmap.insert(1, \"b\");\nmap.insert(2, \"a\");\nassert_eq!(map.first_key_value(), Some((&1, &\"b\")));
    \n
    1.66.0 · Source
    pub fn first_entry(&mut self) -> Option<OccupiedEntry<'_, K, V, A>>
    where\n    K: Ord,
    Returns the first entry in the map for in-place manipulation.\nThe key of this entry is the minimum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nif let Some(mut entry) = map.first_entry() {\n    if *entry.key() > 0 {\n        entry.insert(\"first\");\n    }\n}\nassert_eq!(*map.get(&1).unwrap(), \"first\");\nassert_eq!(*map.get(&2).unwrap(), \"b\");
    \n
    1.66.0 · Source
    pub fn pop_first(&mut self) -> Option<(K, V)>
    where\n    K: Ord,
    Removes and returns the first element in the map.\nThe key of this element is the minimum key that was in the map.
    \n
    §Examples
    \n
    Draining elements in ascending order, while keeping a usable map each iteration.
    \n\n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nwhile let Some((key, _val)) = map.pop_first() {\n    assert!(map.iter().all(|(k, _v)| *k > key));\n}\nassert!(map.is_empty());
    \n
    1.66.0 · Source
    pub fn last_key_value(&self) -> Option<(&K, &V)>
    where\n    K: Ord,
    Returns the last key-value pair in the map.\nThe key in this pair is the maximum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"b\");\nmap.insert(2, \"a\");\nassert_eq!(map.last_key_value(), Some((&2, &\"a\")));
    \n
    1.66.0 · Source
    pub fn last_entry(&mut self) -> Option<OccupiedEntry<'_, K, V, A>>
    where\n    K: Ord,
    Returns the last entry in the map for in-place manipulation.\nThe key of this entry is the maximum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nif let Some(mut entry) = map.last_entry() {\n    if *entry.key() > 0 {\n        entry.insert(\"last\");\n    }\n}\nassert_eq!(*map.get(&1).unwrap(), \"a\");\nassert_eq!(*map.get(&2).unwrap(), \"last\");
    \n
    1.66.0 · Source
    pub fn pop_last(&mut self) -> Option<(K, V)>
    where\n    K: Ord,
    Removes and returns the last element in the map.\nThe key of this element is the maximum key that was in the map.
    \n
    §Examples
    \n
    Draining elements in descending order, while keeping a usable map each iteration.
    \n\n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nwhile let Some((key, _val)) = map.pop_last() {\n    assert!(map.iter().all(|(k, _v)| *k < key));\n}\nassert!(map.is_empty());
    \n
    1.0.0 · Source
    pub fn contains_key<Q>(&self, key: &Q) -> bool
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns true if the map contains a value for the specified key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.contains_key(&1), true);\nassert_eq!(map.contains_key(&2), false);
    \n
    1.0.0 · Source
    pub fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns a mutable reference to the value corresponding to the key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nif let Some(x) = map.get_mut(&1) {\n    *x = \"b\";\n}\nassert_eq!(map[&1], \"b\");
    \n
    1.0.0 · Source
    pub fn insert(&mut self, key: K, value: V) -> Option<V>
    where\n    K: Ord,
    Inserts a key-value pair into the map.
    \n
    If the map did not have this key present, None is returned.
    \n
    If the map did have this key present, the value is updated, and the old\nvalue is returned. The key is not updated, though; this matters for\ntypes that can be == without being identical. See the module-level\ndocumentation for more.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.insert(37, \"a\"), None);\nassert_eq!(map.is_empty(), false);\n\nmap.insert(37, \"b\");\nassert_eq!(map.insert(37, \"c\"), Some(\"b\"));\nassert_eq!(map[&37], \"c\");
    \n
    Source
    pub fn try_insert(\n    &mut self,\n    key: K,\n    value: V,\n) -> Result<&mut V, OccupiedError<'_, K, V, A>>
    where\n    K: Ord,
    🔬This is a nightly-only experimental API. (map_try_insert)
    Tries to insert a key-value pair into the map, and returns\na mutable reference to the value in the entry.
    \n
    If the map already had this key present, nothing is updated, and\nan error containing the occupied entry and the value is returned.
    \n
    §Examples
    \n
    #![feature(map_try_insert)]\n\nuse std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.try_insert(37, \"a\").unwrap(), &\"a\");\n\nlet err = map.try_insert(37, \"b\").unwrap_err();\nassert_eq!(err.entry.key(), &37);\nassert_eq!(err.entry.get(), &\"a\");\nassert_eq!(err.value, \"b\");
    \n
    1.0.0 · Source
    pub fn remove<Q>(&mut self, key: &Q) -> Option<V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Removes a key from the map, returning the value at the key if the key\nwas previously in the map.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.remove(&1), Some(\"a\"));\nassert_eq!(map.remove(&1), None);
    \n
    1.45.0 · Source
    pub fn remove_entry<Q>(&mut self, key: &Q) -> Option<(K, V)>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Removes a key from the map, returning the stored key and value if the key\nwas previously in the map.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.remove_entry(&1), Some((1, \"a\")));\nassert_eq!(map.remove_entry(&1), None);
    \n
    1.53.0 · Source
    pub fn retain<F>(&mut self, f: F)
    where\n    K: Ord,\n    F: FnMut(&K, &mut V) -> bool,
    Retains only the elements specified by the predicate.
    \n
    In other words, remove all pairs (k, v) for which f(&k, &mut v) returns false.\nThe elements are visited in ascending key order.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map: BTreeMap<i32, i32> = (0..8).map(|x| (x, x*10)).collect();\n// Keep only the elements with even-numbered keys.\nmap.retain(|&k, _| k % 2 == 0);\nassert!(map.into_iter().eq(vec![(0, 0), (2, 20), (4, 40), (6, 60)]));
    \n
    1.11.0 · Source
    pub fn append(&mut self, other: &mut BTreeMap<K, V, A>)
    where\n    K: Ord,\n    A: Clone,
    Moves all elements from other into self, leaving other empty.
    \n
    If a key from other is already present in self, the respective\nvalue from self will be overwritten with the respective value from other.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.insert(2, \"b\");\na.insert(3, \"c\"); // Note: Key (3) also present in b.\n\nlet mut b = BTreeMap::new();\nb.insert(3, \"d\"); // Note: Key (3) also present in a.\nb.insert(4, \"e\");\nb.insert(5, \"f\");\n\na.append(&mut b);\n\nassert_eq!(a.len(), 5);\nassert_eq!(b.len(), 0);\n\nassert_eq!(a[&1], \"a\");\nassert_eq!(a[&2], \"b\");\nassert_eq!(a[&3], \"d\"); // Note: \"c\" has been overwritten.\nassert_eq!(a[&4], \"e\");\nassert_eq!(a[&5], \"f\");
    \n
    1.17.0 · Source
    pub fn range<T, R>(&self, range: R) -> Range<'_, K, V>
    where\n    T: Ord + ?Sized,\n    K: Borrow<T> + Ord,\n    R: RangeBounds<T>,
    Constructs a double-ended iterator over a sub-range of elements in the map.\nThe simplest way is to use the range syntax min..max, thus range(min..max) will\nyield elements from min (inclusive) to max (exclusive).\nThe range may also be entered as (Bound<T>, Bound<T>), so for example\nrange((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive\nrange from 4 to 10.
    \n
    §Panics
    \n
    Panics if range start > end.\nPanics if range start == end and both bounds are Excluded.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\nuse std::ops::Bound::Included;\n\nlet mut map = BTreeMap::new();\nmap.insert(3, \"a\");\nmap.insert(5, \"b\");\nmap.insert(8, \"c\");\nfor (&key, &value) in map.range((Included(&4), Included(&8))) {\n    println!(\"{key}: {value}\");\n}\nassert_eq!(Some((&5, &\"b\")), map.range(4..).next());
    \n
    1.17.0 · Source
    pub fn range_mut<T, R>(&mut self, range: R) -> RangeMut<'_, K, V>
    where\n    T: Ord + ?Sized,\n    K: Borrow<T> + Ord,\n    R: RangeBounds<T>,
    Constructs a mutable double-ended iterator over a sub-range of elements in the map.\nThe simplest way is to use the range syntax min..max, thus range(min..max) will\nyield elements from min (inclusive) to max (exclusive).\nThe range may also be entered as (Bound<T>, Bound<T>), so for example\nrange((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive\nrange from 4 to 10.
    \n
    §Panics
    \n
    Panics if range start > end.\nPanics if range start == end and both bounds are Excluded.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map: BTreeMap<&str, i32> =\n    [(\"Alice\", 0), (\"Bob\", 0), (\"Carol\", 0), (\"Cheryl\", 0)].into();\nfor (_, balance) in map.range_mut(\"B\"..\"Cheryl\") {\n    *balance += 100;\n}\nfor (name, balance) in &map {\n    println!(\"{name} => {balance}\");\n}
    \n
    1.0.0 · Source
    pub fn entry(&mut self, key: K) -> Entry<'_, K, V, A>
    where\n    K: Ord,
    Gets the given key’s corresponding entry in the map for in-place manipulation.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut count: BTreeMap<&str, usize> = BTreeMap::new();\n\n// count the number of occurrences of letters in the vec\nfor x in [\"a\", \"b\", \"a\", \"c\", \"a\", \"b\"] {\n    count.entry(x).and_modify(|curr| *curr += 1).or_insert(1);\n}\n\nassert_eq!(count[\"a\"], 3);\nassert_eq!(count[\"b\"], 2);\nassert_eq!(count[\"c\"], 1);
    \n
    1.11.0 · Source
    pub fn split_off<Q>(&mut self, key: &Q) -> BTreeMap<K, V, A>
    where\n    Q: Ord + ?Sized,\n    K: Borrow<Q> + Ord,\n    A: Clone,
    Splits the collection into two at the given key. Returns everything after the given key,\nincluding the key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.insert(2, \"b\");\na.insert(3, \"c\");\na.insert(17, \"d\");\na.insert(41, \"e\");\n\nlet b = a.split_off(&3);\n\nassert_eq!(a.len(), 2);\nassert_eq!(b.len(), 3);\n\nassert_eq!(a[&1], \"a\");\nassert_eq!(a[&2], \"b\");\n\nassert_eq!(b[&3], \"c\");\nassert_eq!(b[&17], \"d\");\nassert_eq!(b[&41], \"e\");
    \n
    Source
    pub fn extract_if<F>(&mut self, pred: F) -> ExtractIf<'_, K, V, F, A>
    where\n    K: Ord,\n    F: FnMut(&K, &mut V) -> bool,
    🔬This is a nightly-only experimental API. (btree_extract_if)
    Creates an iterator that visits all elements (key-value pairs) in\nascending key order and uses a closure to determine if an element should\nbe removed. If the closure returns true, the element is removed from\nthe map and yielded. If the closure returns false, or panics, the\nelement remains in the map and will not be yielded.
    \n
    The iterator also lets you mutate the value of each element in the\nclosure, regardless of whether you choose to keep or remove it.
    \n
    If the returned ExtractIf is not exhausted, e.g. because it is dropped without iterating\nor the iteration short-circuits, then the remaining elements will be retained.\nUse retain with a negated predicate if you do not need the returned iterator.
    \n
    §Examples
    \n
    Splitting a map into even and odd keys, reusing the original map:
    \n\n
    #![feature(btree_extract_if)]\nuse std::collections::BTreeMap;\n\nlet mut map: BTreeMap<i32, i32> = (0..8).map(|x| (x, x)).collect();\nlet evens: BTreeMap<_, _> = map.extract_if(|k, _v| k % 2 == 0).collect();\nlet odds = map;\nassert_eq!(evens.keys().copied().collect::<Vec<_>>(), [0, 2, 4, 6]);\nassert_eq!(odds.keys().copied().collect::<Vec<_>>(), [1, 3, 5, 7]);
    \n
    1.54.0 · Source
    pub fn into_keys(self) -> IntoKeys<K, V, A>
    Creates a consuming iterator visiting all the keys, in sorted order.\nThe map cannot be used after calling this.\nThe iterator element type is K.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(2, \"b\");\na.insert(1, \"a\");\n\nlet keys: Vec<i32> = a.into_keys().collect();\nassert_eq!(keys, [1, 2]);
    \n
    1.54.0 · Source
    pub fn into_values(self) -> IntoValues<K, V, A>
    Creates a consuming iterator visiting all the values, in order by key.\nThe map cannot be used after calling this.\nThe iterator element type is V.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"hello\");\na.insert(2, \"goodbye\");\n\nlet values: Vec<&str> = a.into_values().collect();\nassert_eq!(values, [\"hello\", \"goodbye\"]);
    \n
    ",0,"bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V, A> Clone for BTreeMap<K, V, A>
    where\n    K: Clone,\n    V: Clone,\n    A: Allocator + Clone,
    Source§
    fn clone(&self) -> BTreeMap<K, V, 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
    ","Clone","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V, A> Debug for BTreeMap<K, V, A>
    where\n    K: Debug,\n    V: Debug,\n    A: Allocator + Clone,
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V> Default for BTreeMap<K, V>
    Source§
    fn default() -> BTreeMap<K, V>
    Creates an empty BTreeMap.
    \n
    ","Default","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    Source§
    impl<'de, K, V> Deserialize<'de> for BTreeMap<K, V>
    where\n    K: Deserialize<'de> + Ord,\n    V: Deserialize<'de>,
    Source§
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<BTreeMap<K, V>, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.7.0 · Source§
    impl<K, V, A> Drop for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    Source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    ","Drop","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.2.0 · Source§
    impl<'a, K, V, A> Extend<(&'a K, &'a V)> for BTreeMap<K, V, A>
    where\n    K: Ord + Copy,\n    V: Copy,\n    A: Allocator + Clone,
    Source§
    fn extend<I>(&mut self, iter: I)
    where\n    I: IntoIterator<Item = (&'a K, &'a V)>,
    Extends a collection with the contents of an iterator. Read more
    Source§
    fn extend_one(&mut self, _: (&'a K, &'a V))
    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    Source§
    fn extend_reserve(&mut self, additional: usize)
    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    ","Extend<(&'a K, &'a V)>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V, A> Extend<(K, V)> for BTreeMap<K, V, A>
    where\n    K: Ord,\n    A: Allocator + Clone,
    Source§
    fn extend<T>(&mut self, iter: T)
    where\n    T: IntoIterator<Item = (K, V)>,
    Extends a collection with the contents of an iterator. Read more
    Source§
    fn extend_one(&mut self, _: (K, V))
    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    Source§
    fn extend_reserve(&mut self, additional: usize)
    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    ","Extend<(K, V)>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.56.0 · Source§
    impl<K, V, const N: usize> From<[(K, V); N]> for BTreeMap<K, V>
    where\n    K: Ord,
    Source§
    fn from(arr: [(K, V); N]) -> BTreeMap<K, V>
    Converts a [(K, V); N] into a BTreeMap<K, V>.
    \n
    If any entries in the array have equal keys,\nall but one of the corresponding values will be dropped.
    \n\n
    use std::collections::BTreeMap;\n\nlet map1 = BTreeMap::from([(1, 2), (3, 4)]);\nlet map2: BTreeMap<_, _> = [(1, 2), (3, 4)].into();\nassert_eq!(map1, map2);
    \n
    ","From<[(K, V); N]>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V> FromIterator<(K, V)> for BTreeMap<K, V>
    where\n    K: Ord,
    Source§
    fn from_iter<T>(iter: T) -> BTreeMap<K, V>
    where\n    T: IntoIterator<Item = (K, V)>,
    Constructs a BTreeMap<K, V> from an iterator of key-value pairs.
    \n
    If the iterator produces any pairs with equal keys,\nall but one of the corresponding values will be dropped.
    \n
    ","FromIterator<(K, V)>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V, A> Hash for BTreeMap<K, V, A>
    where\n    K: Hash,\n    V: Hash,\n    A: Allocator + Clone,
    Source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · Source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where\n    H: Hasher,\n    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, Q, V, A> Index<&Q> for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Source§
    fn index(&self, key: &Q) -> &V
    Returns a reference to the value corresponding to the supplied key.
    \n
    §Panics
    \n
    Panics if the key is not present in the BTreeMap.
    \n
    Source§
    type Output = V
    The returned type after indexing.
    ","Index<&Q>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    §
    impl IntoAssets for BTreeMap<DescriptorPublicKey, DescriptorSecretKey>
    §
    fn into_assets(self) -> Assets
    Convert self into a Assets struct
    ","IntoAssets","bdk_wallet::keys::KeyMap"],["
    Source§
    impl<'de, K, V, E> IntoDeserializer<'de, E> for BTreeMap<K, V>
    where\n    K: IntoDeserializer<'de, E> + Eq + Ord,\n    V: IntoDeserializer<'de, E>,\n    E: Error,
    Source§
    type Deserializer = MapDeserializer<'de, <BTreeMap<K, V> as IntoIterator>::IntoIter, E>
    The type of the deserializer being converted into.
    Source§
    fn into_deserializer(\n    self,\n) -> <BTreeMap<K, V> as IntoDeserializer<'de, E>>::Deserializer
    Convert this value into a deserializer.
    ","IntoDeserializer<'de, E>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V, A> IntoIterator for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    Source§
    fn into_iter(self) -> IntoIter<K, V, A>
    Gets an owning iterator over the entries of the map, sorted by key.
    \n
    Source§
    type Item = (K, V)
    The type of the elements being iterated over.
    Source§
    type IntoIter = IntoIter<K, V, A>
    Which kind of iterator are we turning this into?
    ","IntoIterator","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    Source§
    impl<K, V> Merge for BTreeMap<K, V>
    where\n    K: Ord,
    Source§
    fn merge(&mut self, other: BTreeMap<K, V>)
    Merge another object of the same type onto self.
    Source§
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    Source§
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    ","Merge","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V, A> Ord for BTreeMap<K, V, A>
    where\n    K: Ord,\n    V: Ord,\n    A: Allocator + Clone,
    Source§
    fn cmp(&self, other: &BTreeMap<K, V, A>) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V, A> PartialEq for BTreeMap<K, V, A>
    where\n    K: PartialEq,\n    V: PartialEq,\n    A: Allocator + Clone,
    Source§
    fn eq(&self, other: &BTreeMap<K, V, A>) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V, A> PartialOrd for BTreeMap<K, V, A>
    where\n    K: PartialOrd,\n    V: PartialOrd,\n    A: Allocator + Clone,
    Source§
    fn partial_cmp(&self, other: &BTreeMap<K, V, A>) -> 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
    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
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    1.0.0 · Source§
    fn gt(&self, other: &Rhs) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    1.0.0 · Source§
    fn ge(&self, other: &Rhs) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    ","PartialOrd","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    Source§
    impl<K, V> Serialize for BTreeMap<K, V>
    where\n    K: Serialize,\n    V: Serialize,
    Source§
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V, A> Eq for BTreeMap<K, V, A>
    where\n    K: Eq,\n    V: Eq,\n    A: Allocator + Clone,
    ","Eq","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.64.0 · Source§
    impl<K, V, A> UnwindSafe for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone + UnwindSafe,\n    K: RefUnwindSafe,\n    V: RefUnwindSafe,
    ","UnwindSafe","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"]]]]);
+    var type_impls = Object.fromEntries([["bdk_chain",[["
    Source§
    impl<K, V> BTreeMap<K, V>
    1.0.0 (const: 1.66.0) · Source
    pub const fn new() -> BTreeMap<K, V>
    Makes a new, empty BTreeMap.
    \n
    Does not allocate anything on its own.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\n\n// entries can now be inserted into the empty map\nmap.insert(1, \"a\");
    \n
    ",0,"bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    Source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · Source
    pub fn iter(&self) -> Iter<'_, K, V> ⓘ
    Gets an iterator over the entries of the map, sorted by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(3, \"c\");\nmap.insert(2, \"b\");\nmap.insert(1, \"a\");\n\nfor (key, value) in map.iter() {\n    println!(\"{key}: {value}\");\n}\n\nlet (first_key, first_value) = map.iter().next().unwrap();\nassert_eq!((*first_key, *first_value), (1, \"a\"));
    \n
    1.0.0 · Source
    pub fn iter_mut(&mut self) -> IterMut<'_, K, V> ⓘ
    Gets a mutable iterator over the entries of the map, sorted by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::from([\n   (\"a\", 1),\n   (\"b\", 2),\n   (\"c\", 3),\n]);\n\n// add 10 to the value if the key isn't \"a\"\nfor (key, value) in map.iter_mut() {\n    if key != &\"a\" {\n        *value += 10;\n    }\n}
    \n
    1.0.0 · Source
    pub fn keys(&self) -> Keys<'_, K, V> ⓘ
    Gets an iterator over the keys of the map, in sorted order.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(2, \"b\");\na.insert(1, \"a\");\n\nlet keys: Vec<_> = a.keys().cloned().collect();\nassert_eq!(keys, [1, 2]);
    \n
    1.0.0 · Source
    pub fn values(&self) -> Values<'_, K, V> ⓘ
    Gets an iterator over the values of the map, in order by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"hello\");\na.insert(2, \"goodbye\");\n\nlet values: Vec<&str> = a.values().cloned().collect();\nassert_eq!(values, [\"hello\", \"goodbye\"]);
    \n
    1.10.0 · Source
    pub fn values_mut(&mut self) -> ValuesMut<'_, K, V> ⓘ
    Gets a mutable iterator over the values of the map, in order by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, String::from(\"hello\"));\na.insert(2, String::from(\"goodbye\"));\n\nfor value in a.values_mut() {\n    value.push_str(\"!\");\n}\n\nlet values: Vec<String> = a.values().cloned().collect();\nassert_eq!(values, [String::from(\"hello!\"),\n                    String::from(\"goodbye!\")]);
    \n
    1.0.0 (const: unstable) · Source
    pub fn len(&self) -> usize
    Returns the number of elements in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\nassert_eq!(a.len(), 0);\na.insert(1, \"a\");\nassert_eq!(a.len(), 1);
    \n
    1.0.0 (const: unstable) · Source
    pub fn is_empty(&self) -> bool
    Returns true if the map contains no elements.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\nassert!(a.is_empty());\na.insert(1, \"a\");\nassert!(!a.is_empty());
    \n
    Source
    pub fn lower_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a Cursor pointing at the gap before the smallest key\ngreater than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap before the smallest key greater than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap before the smallest key greater than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap before the smallest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet cursor = map.lower_bound(Bound::Included(&2));\nassert_eq!(cursor.peek_prev(), Some((&1, &\"a\")));\nassert_eq!(cursor.peek_next(), Some((&2, &\"b\")));\n\nlet cursor = map.lower_bound(Bound::Excluded(&2));\nassert_eq!(cursor.peek_prev(), Some((&2, &\"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &\"c\")));\n\nlet cursor = map.lower_bound(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), None);\nassert_eq!(cursor.peek_next(), Some((&1, &\"a\")));
    \n
    Source
    pub fn lower_bound_mut<Q>(&mut self, bound: Bound<&Q>) -> CursorMut<'_, K, V, A>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a CursorMut pointing at the gap before the smallest key\ngreater than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap before the smallest key greater than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap before the smallest key greater than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap before the smallest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet mut map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet mut cursor = map.lower_bound_mut(Bound::Included(&2));\nassert_eq!(cursor.peek_prev(), Some((&1, &mut \"a\")));\nassert_eq!(cursor.peek_next(), Some((&2, &mut \"b\")));\n\nlet mut cursor = map.lower_bound_mut(Bound::Excluded(&2));\nassert_eq!(cursor.peek_prev(), Some((&2, &mut \"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &mut \"c\")));\n\nlet mut cursor = map.lower_bound_mut(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), None);\nassert_eq!(cursor.peek_next(), Some((&1, &mut \"a\")));
    \n
    Source
    pub fn upper_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a Cursor pointing at the gap after the greatest key\nsmaller than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap after the greatest key smaller than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap after the greatest key smaller than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap after the greatest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet cursor = map.upper_bound(Bound::Included(&3));\nassert_eq!(cursor.peek_prev(), Some((&3, &\"c\")));\nassert_eq!(cursor.peek_next(), Some((&4, &\"d\")));\n\nlet cursor = map.upper_bound(Bound::Excluded(&3));\nassert_eq!(cursor.peek_prev(), Some((&2, &\"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &\"c\")));\n\nlet cursor = map.upper_bound(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), Some((&4, &\"d\")));\nassert_eq!(cursor.peek_next(), None);
    \n
    Source
    pub fn upper_bound_mut<Q>(&mut self, bound: Bound<&Q>) -> CursorMut<'_, K, V, A>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a CursorMut pointing at the gap after the greatest key\nsmaller than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap after the greatest key smaller than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap after the greatest key smaller than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap after the greatest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet mut map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet mut cursor = map.upper_bound_mut(Bound::Included(&3));\nassert_eq!(cursor.peek_prev(), Some((&3, &mut \"c\")));\nassert_eq!(cursor.peek_next(), Some((&4, &mut \"d\")));\n\nlet mut cursor = map.upper_bound_mut(Bound::Excluded(&3));\nassert_eq!(cursor.peek_prev(), Some((&2, &mut \"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &mut \"c\")));\n\nlet mut cursor = map.upper_bound_mut(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), Some((&4, &mut \"d\")));\nassert_eq!(cursor.peek_next(), None);
    \n
    ",0,"bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    Source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · Source
    pub fn clear(&mut self)
    Clears the map, removing all elements.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.clear();\nassert!(a.is_empty());
    \n
    Source
    pub const fn new_in(alloc: A) -> BTreeMap<K, V, A>
    🔬This is a nightly-only experimental API. (btreemap_alloc)
    Makes a new empty BTreeMap with a reasonable choice for B.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\nuse std::alloc::Global;\n\nlet mut map = BTreeMap::new_in(Global);\n\n// entries can now be inserted into the empty map\nmap.insert(1, \"a\");
    \n
    ",0,"bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    Source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · Source
    pub fn get<Q>(&self, key: &Q) -> Option<&V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns a reference to the value corresponding to the key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.get(&1), Some(&\"a\"));\nassert_eq!(map.get(&2), None);
    \n
    1.40.0 · Source
    pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns the key-value pair corresponding to the supplied key. This is\npotentially useful:
    \n
      \n
    • for key types where non-identical keys can be considered equal;
      • \n
    • for getting the &K stored key value from a borrowed &Q lookup key; or
      • \n
    • for getting a reference to a key with the same lifetime as the collection.
      • \n
    \n
    The supplied key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::cmp::Ordering;\nuse std::collections::BTreeMap;\n\n#[derive(Clone, Copy, Debug)]\nstruct S {\n    id: u32,\n    name: &'static str, // ignored by equality and ordering operations\n}\n\nimpl PartialEq for S {\n    fn eq(&self, other: &S) -> bool {\n        self.id == other.id\n    }\n}\n\nimpl Eq for S {}\n\nimpl PartialOrd for S {\n    fn partial_cmp(&self, other: &S) -> Option<Ordering> {\n        self.id.partial_cmp(&other.id)\n    }\n}\n\nimpl Ord for S {\n    fn cmp(&self, other: &S) -> Ordering {\n        self.id.cmp(&other.id)\n    }\n}\n\nlet j_a = S { id: 1, name: \"Jessica\" };\nlet j_b = S { id: 1, name: \"Jess\" };\nlet p = S { id: 2, name: \"Paul\" };\nassert_eq!(j_a, j_b);\n\nlet mut map = BTreeMap::new();\nmap.insert(j_a, \"Paris\");\nassert_eq!(map.get_key_value(&j_a), Some((&j_a, &\"Paris\")));\nassert_eq!(map.get_key_value(&j_b), Some((&j_a, &\"Paris\"))); // the notable case\nassert_eq!(map.get_key_value(&p), None);
    \n
    1.66.0 · Source
    pub fn first_key_value(&self) -> Option<(&K, &V)>
    where\n    K: Ord,
    Returns the first key-value pair in the map.\nThe key in this pair is the minimum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.first_key_value(), None);\nmap.insert(1, \"b\");\nmap.insert(2, \"a\");\nassert_eq!(map.first_key_value(), Some((&1, &\"b\")));
    \n
    1.66.0 · Source
    pub fn first_entry(&mut self) -> Option<OccupiedEntry<'_, K, V, A>>
    where\n    K: Ord,
    Returns the first entry in the map for in-place manipulation.\nThe key of this entry is the minimum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nif let Some(mut entry) = map.first_entry() {\n    if *entry.key() > 0 {\n        entry.insert(\"first\");\n    }\n}\nassert_eq!(*map.get(&1).unwrap(), \"first\");\nassert_eq!(*map.get(&2).unwrap(), \"b\");
    \n
    1.66.0 · Source
    pub fn pop_first(&mut self) -> Option<(K, V)>
    where\n    K: Ord,
    Removes and returns the first element in the map.\nThe key of this element is the minimum key that was in the map.
    \n
    §Examples
    \n
    Draining elements in ascending order, while keeping a usable map each iteration.
    \n\n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nwhile let Some((key, _val)) = map.pop_first() {\n    assert!(map.iter().all(|(k, _v)| *k > key));\n}\nassert!(map.is_empty());
    \n
    1.66.0 · Source
    pub fn last_key_value(&self) -> Option<(&K, &V)>
    where\n    K: Ord,
    Returns the last key-value pair in the map.\nThe key in this pair is the maximum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"b\");\nmap.insert(2, \"a\");\nassert_eq!(map.last_key_value(), Some((&2, &\"a\")));
    \n
    1.66.0 · Source
    pub fn last_entry(&mut self) -> Option<OccupiedEntry<'_, K, V, A>>
    where\n    K: Ord,
    Returns the last entry in the map for in-place manipulation.\nThe key of this entry is the maximum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nif let Some(mut entry) = map.last_entry() {\n    if *entry.key() > 0 {\n        entry.insert(\"last\");\n    }\n}\nassert_eq!(*map.get(&1).unwrap(), \"a\");\nassert_eq!(*map.get(&2).unwrap(), \"last\");
    \n
    1.66.0 · Source
    pub fn pop_last(&mut self) -> Option<(K, V)>
    where\n    K: Ord,
    Removes and returns the last element in the map.\nThe key of this element is the maximum key that was in the map.
    \n
    §Examples
    \n
    Draining elements in descending order, while keeping a usable map each iteration.
    \n\n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nwhile let Some((key, _val)) = map.pop_last() {\n    assert!(map.iter().all(|(k, _v)| *k < key));\n}\nassert!(map.is_empty());
    \n
    1.0.0 · Source
    pub fn contains_key<Q>(&self, key: &Q) -> bool
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns true if the map contains a value for the specified key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.contains_key(&1), true);\nassert_eq!(map.contains_key(&2), false);
    \n
    1.0.0 · Source
    pub fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns a mutable reference to the value corresponding to the key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nif let Some(x) = map.get_mut(&1) {\n    *x = \"b\";\n}\nassert_eq!(map[&1], \"b\");
    \n
    1.0.0 · Source
    pub fn insert(&mut self, key: K, value: V) -> Option<V>
    where\n    K: Ord,
    Inserts a key-value pair into the map.
    \n
    If the map did not have this key present, None is returned.
    \n
    If the map did have this key present, the value is updated, and the old\nvalue is returned. The key is not updated, though; this matters for\ntypes that can be == without being identical. See the module-level\ndocumentation for more.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.insert(37, \"a\"), None);\nassert_eq!(map.is_empty(), false);\n\nmap.insert(37, \"b\");\nassert_eq!(map.insert(37, \"c\"), Some(\"b\"));\nassert_eq!(map[&37], \"c\");
    \n
    Source
    pub fn try_insert(\n    &mut self,\n    key: K,\n    value: V,\n) -> Result<&mut V, OccupiedError<'_, K, V, A>>
    where\n    K: Ord,
    🔬This is a nightly-only experimental API. (map_try_insert)
    Tries to insert a key-value pair into the map, and returns\na mutable reference to the value in the entry.
    \n
    If the map already had this key present, nothing is updated, and\nan error containing the occupied entry and the value is returned.
    \n
    §Examples
    \n
    #![feature(map_try_insert)]\n\nuse std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.try_insert(37, \"a\").unwrap(), &\"a\");\n\nlet err = map.try_insert(37, \"b\").unwrap_err();\nassert_eq!(err.entry.key(), &37);\nassert_eq!(err.entry.get(), &\"a\");\nassert_eq!(err.value, \"b\");
    \n
    1.0.0 · Source
    pub fn remove<Q>(&mut self, key: &Q) -> Option<V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Removes a key from the map, returning the value at the key if the key\nwas previously in the map.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.remove(&1), Some(\"a\"));\nassert_eq!(map.remove(&1), None);
    \n
    1.45.0 · Source
    pub fn remove_entry<Q>(&mut self, key: &Q) -> Option<(K, V)>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Removes a key from the map, returning the stored key and value if the key\nwas previously in the map.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.remove_entry(&1), Some((1, \"a\")));\nassert_eq!(map.remove_entry(&1), None);
    \n
    1.53.0 · Source
    pub fn retain<F>(&mut self, f: F)
    where\n    K: Ord,\n    F: FnMut(&K, &mut V) -> bool,
    Retains only the elements specified by the predicate.
    \n
    In other words, remove all pairs (k, v) for which f(&k, &mut v) returns false.\nThe elements are visited in ascending key order.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map: BTreeMap<i32, i32> = (0..8).map(|x| (x, x*10)).collect();\n// Keep only the elements with even-numbered keys.\nmap.retain(|&k, _| k % 2 == 0);\nassert!(map.into_iter().eq(vec![(0, 0), (2, 20), (4, 40), (6, 60)]));
    \n
    1.11.0 · Source
    pub fn append(&mut self, other: &mut BTreeMap<K, V, A>)
    where\n    K: Ord,\n    A: Clone,
    Moves all elements from other into self, leaving other empty.
    \n
    If a key from other is already present in self, the respective\nvalue from self will be overwritten with the respective value from other.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.insert(2, \"b\");\na.insert(3, \"c\"); // Note: Key (3) also present in b.\n\nlet mut b = BTreeMap::new();\nb.insert(3, \"d\"); // Note: Key (3) also present in a.\nb.insert(4, \"e\");\nb.insert(5, \"f\");\n\na.append(&mut b);\n\nassert_eq!(a.len(), 5);\nassert_eq!(b.len(), 0);\n\nassert_eq!(a[&1], \"a\");\nassert_eq!(a[&2], \"b\");\nassert_eq!(a[&3], \"d\"); // Note: \"c\" has been overwritten.\nassert_eq!(a[&4], \"e\");\nassert_eq!(a[&5], \"f\");
    \n
    1.17.0 · Source
    pub fn range<T, R>(&self, range: R) -> Range<'_, K, V> ⓘ
    where\n    T: Ord + ?Sized,\n    K: Borrow<T> + Ord,\n    R: RangeBounds<T>,
    Constructs a double-ended iterator over a sub-range of elements in the map.\nThe simplest way is to use the range syntax min..max, thus range(min..max) will\nyield elements from min (inclusive) to max (exclusive).\nThe range may also be entered as (Bound<T>, Bound<T>), so for example\nrange((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive\nrange from 4 to 10.
    \n
    §Panics
    \n
    Panics if range start > end.\nPanics if range start == end and both bounds are Excluded.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\nuse std::ops::Bound::Included;\n\nlet mut map = BTreeMap::new();\nmap.insert(3, \"a\");\nmap.insert(5, \"b\");\nmap.insert(8, \"c\");\nfor (&key, &value) in map.range((Included(&4), Included(&8))) {\n    println!(\"{key}: {value}\");\n}\nassert_eq!(Some((&5, &\"b\")), map.range(4..).next());
    \n
    1.17.0 · Source
    pub fn range_mut<T, R>(&mut self, range: R) -> RangeMut<'_, K, V> ⓘ
    where\n    T: Ord + ?Sized,\n    K: Borrow<T> + Ord,\n    R: RangeBounds<T>,
    Constructs a mutable double-ended iterator over a sub-range of elements in the map.\nThe simplest way is to use the range syntax min..max, thus range(min..max) will\nyield elements from min (inclusive) to max (exclusive).\nThe range may also be entered as (Bound<T>, Bound<T>), so for example\nrange((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive\nrange from 4 to 10.
    \n
    §Panics
    \n
    Panics if range start > end.\nPanics if range start == end and both bounds are Excluded.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map: BTreeMap<&str, i32> =\n    [(\"Alice\", 0), (\"Bob\", 0), (\"Carol\", 0), (\"Cheryl\", 0)].into();\nfor (_, balance) in map.range_mut(\"B\"..\"Cheryl\") {\n    *balance += 100;\n}\nfor (name, balance) in &map {\n    println!(\"{name} => {balance}\");\n}
    \n
    1.0.0 · Source
    pub fn entry(&mut self, key: K) -> Entry<'_, K, V, A>
    where\n    K: Ord,
    Gets the given key’s corresponding entry in the map for in-place manipulation.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut count: BTreeMap<&str, usize> = BTreeMap::new();\n\n// count the number of occurrences of letters in the vec\nfor x in [\"a\", \"b\", \"a\", \"c\", \"a\", \"b\"] {\n    count.entry(x).and_modify(|curr| *curr += 1).or_insert(1);\n}\n\nassert_eq!(count[\"a\"], 3);\nassert_eq!(count[\"b\"], 2);\nassert_eq!(count[\"c\"], 1);
    \n
    1.11.0 · Source
    pub fn split_off<Q>(&mut self, key: &Q) -> BTreeMap<K, V, A>
    where\n    Q: Ord + ?Sized,\n    K: Borrow<Q> + Ord,\n    A: Clone,
    Splits the collection into two at the given key. Returns everything after the given key,\nincluding the key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.insert(2, \"b\");\na.insert(3, \"c\");\na.insert(17, \"d\");\na.insert(41, \"e\");\n\nlet b = a.split_off(&3);\n\nassert_eq!(a.len(), 2);\nassert_eq!(b.len(), 3);\n\nassert_eq!(a[&1], \"a\");\nassert_eq!(a[&2], \"b\");\n\nassert_eq!(b[&3], \"c\");\nassert_eq!(b[&17], \"d\");\nassert_eq!(b[&41], \"e\");
    \n
    Source
    pub fn extract_if<F>(&mut self, pred: F) -> ExtractIf<'_, K, V, F, A> ⓘ
    where\n    K: Ord,\n    F: FnMut(&K, &mut V) -> bool,
    🔬This is a nightly-only experimental API. (btree_extract_if)
    Creates an iterator that visits all elements (key-value pairs) in\nascending key order and uses a closure to determine if an element should\nbe removed. If the closure returns true, the element is removed from\nthe map and yielded. If the closure returns false, or panics, the\nelement remains in the map and will not be yielded.
    \n
    The iterator also lets you mutate the value of each element in the\nclosure, regardless of whether you choose to keep or remove it.
    \n
    If the returned ExtractIf is not exhausted, e.g. because it is dropped without iterating\nor the iteration short-circuits, then the remaining elements will be retained.\nUse retain with a negated predicate if you do not need the returned iterator.
    \n
    §Examples
    \n
    Splitting a map into even and odd keys, reusing the original map:
    \n\n
    #![feature(btree_extract_if)]\nuse std::collections::BTreeMap;\n\nlet mut map: BTreeMap<i32, i32> = (0..8).map(|x| (x, x)).collect();\nlet evens: BTreeMap<_, _> = map.extract_if(|k, _v| k % 2 == 0).collect();\nlet odds = map;\nassert_eq!(evens.keys().copied().collect::<Vec<_>>(), [0, 2, 4, 6]);\nassert_eq!(odds.keys().copied().collect::<Vec<_>>(), [1, 3, 5, 7]);
    \n
    1.54.0 · Source
    pub fn into_keys(self) -> IntoKeys<K, V, A> ⓘ
    Creates a consuming iterator visiting all the keys, in sorted order.\nThe map cannot be used after calling this.\nThe iterator element type is K.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(2, \"b\");\na.insert(1, \"a\");\n\nlet keys: Vec<i32> = a.into_keys().collect();\nassert_eq!(keys, [1, 2]);
    \n
    1.54.0 · Source
    pub fn into_values(self) -> IntoValues<K, V, A> ⓘ
    Creates a consuming iterator visiting all the values, in order by key.\nThe map cannot be used after calling this.\nThe iterator element type is V.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"hello\");\na.insert(2, \"goodbye\");\n\nlet values: Vec<&str> = a.into_values().collect();\nassert_eq!(values, [\"hello\", \"goodbye\"]);
    \n
    ",0,"bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V, A> Clone for BTreeMap<K, V, A>
    where\n    K: Clone,\n    V: Clone,\n    A: Allocator + Clone,
    Source§
    fn clone(&self) -> BTreeMap<K, V, 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
    ","Clone","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V, A> Debug for BTreeMap<K, V, A>
    where\n    K: Debug,\n    V: Debug,\n    A: Allocator + Clone,
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V> Default for BTreeMap<K, V>
    Source§
    fn default() -> BTreeMap<K, V>
    Creates an empty BTreeMap.
    \n
    ","Default","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    Source§
    impl<'de, K, V> Deserialize<'de> for BTreeMap<K, V>
    where\n    K: Deserialize<'de> + Ord,\n    V: Deserialize<'de>,
    Source§
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<BTreeMap<K, V>, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.7.0 · Source§
    impl<K, V, A> Drop for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    Source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    ","Drop","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.2.0 · Source§
    impl<'a, K, V, A> Extend<(&'a K, &'a V)> for BTreeMap<K, V, A>
    where\n    K: Ord + Copy,\n    V: Copy,\n    A: Allocator + Clone,
    Source§
    fn extend<I>(&mut self, iter: I)
    where\n    I: IntoIterator<Item = (&'a K, &'a V)>,
    Extends a collection with the contents of an iterator. Read more
    Source§
    fn extend_one(&mut self, _: (&'a K, &'a V))
    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    Source§
    fn extend_reserve(&mut self, additional: usize)
    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    ","Extend<(&'a K, &'a V)>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V, A> Extend<(K, V)> for BTreeMap<K, V, A>
    where\n    K: Ord,\n    A: Allocator + Clone,
    Source§
    fn extend<T>(&mut self, iter: T)
    where\n    T: IntoIterator<Item = (K, V)>,
    Extends a collection with the contents of an iterator. Read more
    Source§
    fn extend_one(&mut self, _: (K, V))
    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    Source§
    fn extend_reserve(&mut self, additional: usize)
    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    ","Extend<(K, V)>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.56.0 · Source§
    impl<K, V, const N: usize> From<[(K, V); N]> for BTreeMap<K, V>
    where\n    K: Ord,
    Source§
    fn from(arr: [(K, V); N]) -> BTreeMap<K, V>
    Converts a [(K, V); N] into a BTreeMap<K, V>.
    \n
    If any entries in the array have equal keys,\nall but one of the corresponding values will be dropped.
    \n\n
    use std::collections::BTreeMap;\n\nlet map1 = BTreeMap::from([(1, 2), (3, 4)]);\nlet map2: BTreeMap<_, _> = [(1, 2), (3, 4)].into();\nassert_eq!(map1, map2);
    \n
    ","From<[(K, V); N]>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V> FromIterator<(K, V)> for BTreeMap<K, V>
    where\n    K: Ord,
    Source§
    fn from_iter<T>(iter: T) -> BTreeMap<K, V>
    where\n    T: IntoIterator<Item = (K, V)>,
    Constructs a BTreeMap<K, V> from an iterator of key-value pairs.
    \n
    If the iterator produces any pairs with equal keys,\nall but one of the corresponding values will be dropped.
    \n
    ","FromIterator<(K, V)>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V, A> Hash for BTreeMap<K, V, A>
    where\n    K: Hash,\n    V: Hash,\n    A: Allocator + Clone,
    Source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · Source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where\n    H: Hasher,\n    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, Q, V, A> Index<&Q> for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Source§
    fn index(&self, key: &Q) -> &V
    Returns a reference to the value corresponding to the supplied key.
    \n
    §Panics
    \n
    Panics if the key is not present in the BTreeMap.
    \n
    Source§
    type Output = V
    The returned type after indexing.
    ","Index<&Q>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    Source§
    impl<'de, K, V, E> IntoDeserializer<'de, E> for BTreeMap<K, V>
    where\n    K: IntoDeserializer<'de, E> + Eq + Ord,\n    V: IntoDeserializer<'de, E>,\n    E: Error,
    Source§
    type Deserializer = MapDeserializer<'de, <BTreeMap<K, V> as IntoIterator>::IntoIter, E>
    The type of the deserializer being converted into.
    Source§
    fn into_deserializer(\n    self,\n) -> <BTreeMap<K, V> as IntoDeserializer<'de, E>>::Deserializer
    Convert this value into a deserializer.
    ","IntoDeserializer<'de, E>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V, A> IntoIterator for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    Source§
    fn into_iter(self) -> IntoIter<K, V, A> ⓘ
    Gets an owning iterator over the entries of the map, sorted by key.
    \n
    Source§
    type Item = (K, V)
    The type of the elements being iterated over.
    Source§
    type IntoIter = IntoIter<K, V, A>
    Which kind of iterator are we turning this into?
    ","IntoIterator","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    §
    impl<K, V> Merge for BTreeMap<K, V>
    where\n    K: Ord,
    §
    fn merge(&mut self, other: BTreeMap<K, V>)
    Merge another object of the same type onto self.
    §
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    §
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    ","Merge","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V, A> Ord for BTreeMap<K, V, A>
    where\n    K: Ord,\n    V: Ord,\n    A: Allocator + Clone,
    Source§
    fn cmp(&self, other: &BTreeMap<K, V, A>) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V, A> PartialEq for BTreeMap<K, V, A>
    where\n    K: PartialEq,\n    V: PartialEq,\n    A: Allocator + Clone,
    Source§
    fn eq(&self, other: &BTreeMap<K, V, A>) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V, A> PartialOrd for BTreeMap<K, V, A>
    where\n    K: PartialOrd,\n    V: PartialOrd,\n    A: Allocator + Clone,
    Source§
    fn partial_cmp(&self, other: &BTreeMap<K, V, A>) -> 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
    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
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    1.0.0 · Source§
    fn gt(&self, other: &Rhs) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    1.0.0 · Source§
    fn ge(&self, other: &Rhs) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    ","PartialOrd","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    Source§
    impl<K, V> Serialize for BTreeMap<K, V>
    where\n    K: Serialize,\n    V: Serialize,
    Source§
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · Source§
    impl<K, V, A> Eq for BTreeMap<K, V, A>
    where\n    K: Eq,\n    V: Eq,\n    A: Allocator + Clone,
    ","Eq","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.64.0 · Source§
    impl<K, V, A> UnwindSafe for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone + UnwindSafe,\n    K: RefUnwindSafe,\n    V: RefUnwindSafe,
    ","UnwindSafe","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"]]],["bdk_wallet",[["
    Source§
    impl<K, V> BTreeMap<K, V>
    1.0.0 (const: 1.66.0) · Source
    pub const fn new() -> BTreeMap<K, V>
    Makes a new, empty BTreeMap.
    \n
    Does not allocate anything on its own.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\n\n// entries can now be inserted into the empty map\nmap.insert(1, \"a\");
    \n
    ",0,"bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    Source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · Source
    pub fn iter(&self) -> Iter<'_, K, V>
    Gets an iterator over the entries of the map, sorted by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(3, \"c\");\nmap.insert(2, \"b\");\nmap.insert(1, \"a\");\n\nfor (key, value) in map.iter() {\n    println!(\"{key}: {value}\");\n}\n\nlet (first_key, first_value) = map.iter().next().unwrap();\nassert_eq!((*first_key, *first_value), (1, \"a\"));
    \n
    1.0.0 · Source
    pub fn iter_mut(&mut self) -> IterMut<'_, K, V>
    Gets a mutable iterator over the entries of the map, sorted by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::from([\n   (\"a\", 1),\n   (\"b\", 2),\n   (\"c\", 3),\n]);\n\n// add 10 to the value if the key isn't \"a\"\nfor (key, value) in map.iter_mut() {\n    if key != &\"a\" {\n        *value += 10;\n    }\n}
    \n
    1.0.0 · Source
    pub fn keys(&self) -> Keys<'_, K, V>
    Gets an iterator over the keys of the map, in sorted order.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(2, \"b\");\na.insert(1, \"a\");\n\nlet keys: Vec<_> = a.keys().cloned().collect();\nassert_eq!(keys, [1, 2]);
    \n
    1.0.0 · Source
    pub fn values(&self) -> Values<'_, K, V>
    Gets an iterator over the values of the map, in order by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"hello\");\na.insert(2, \"goodbye\");\n\nlet values: Vec<&str> = a.values().cloned().collect();\nassert_eq!(values, [\"hello\", \"goodbye\"]);
    \n
    1.10.0 · Source
    pub fn values_mut(&mut self) -> ValuesMut<'_, K, V>
    Gets a mutable iterator over the values of the map, in order by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, String::from(\"hello\"));\na.insert(2, String::from(\"goodbye\"));\n\nfor value in a.values_mut() {\n    value.push_str(\"!\");\n}\n\nlet values: Vec<String> = a.values().cloned().collect();\nassert_eq!(values, [String::from(\"hello!\"),\n                    String::from(\"goodbye!\")]);
    \n
    1.0.0 (const: unstable) · Source
    pub fn len(&self) -> usize
    Returns the number of elements in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\nassert_eq!(a.len(), 0);\na.insert(1, \"a\");\nassert_eq!(a.len(), 1);
    \n
    1.0.0 (const: unstable) · Source
    pub fn is_empty(&self) -> bool
    Returns true if the map contains no elements.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\nassert!(a.is_empty());\na.insert(1, \"a\");\nassert!(!a.is_empty());
    \n
    Source
    pub fn lower_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a Cursor pointing at the gap before the smallest key\ngreater than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap before the smallest key greater than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap before the smallest key greater than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap before the smallest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet cursor = map.lower_bound(Bound::Included(&2));\nassert_eq!(cursor.peek_prev(), Some((&1, &\"a\")));\nassert_eq!(cursor.peek_next(), Some((&2, &\"b\")));\n\nlet cursor = map.lower_bound(Bound::Excluded(&2));\nassert_eq!(cursor.peek_prev(), Some((&2, &\"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &\"c\")));\n\nlet cursor = map.lower_bound(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), None);\nassert_eq!(cursor.peek_next(), Some((&1, &\"a\")));
    \n
    Source
    pub fn lower_bound_mut<Q>(&mut self, bound: Bound<&Q>) -> CursorMut<'_, K, V, A>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a CursorMut pointing at the gap before the smallest key\ngreater than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap before the smallest key greater than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap before the smallest key greater than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap before the smallest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet mut map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet mut cursor = map.lower_bound_mut(Bound::Included(&2));\nassert_eq!(cursor.peek_prev(), Some((&1, &mut \"a\")));\nassert_eq!(cursor.peek_next(), Some((&2, &mut \"b\")));\n\nlet mut cursor = map.lower_bound_mut(Bound::Excluded(&2));\nassert_eq!(cursor.peek_prev(), Some((&2, &mut \"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &mut \"c\")));\n\nlet mut cursor = map.lower_bound_mut(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), None);\nassert_eq!(cursor.peek_next(), Some((&1, &mut \"a\")));
    \n
    Source
    pub fn upper_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a Cursor pointing at the gap after the greatest key\nsmaller than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap after the greatest key smaller than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap after the greatest key smaller than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap after the greatest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet cursor = map.upper_bound(Bound::Included(&3));\nassert_eq!(cursor.peek_prev(), Some((&3, &\"c\")));\nassert_eq!(cursor.peek_next(), Some((&4, &\"d\")));\n\nlet cursor = map.upper_bound(Bound::Excluded(&3));\nassert_eq!(cursor.peek_prev(), Some((&2, &\"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &\"c\")));\n\nlet cursor = map.upper_bound(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), Some((&4, &\"d\")));\nassert_eq!(cursor.peek_next(), None);
    \n
    Source
    pub fn upper_bound_mut<Q>(&mut self, bound: Bound<&Q>) -> CursorMut<'_, K, V, A>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a CursorMut pointing at the gap after the greatest key\nsmaller than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap after the greatest key smaller than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap after the greatest key smaller than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap after the greatest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet mut map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet mut cursor = map.upper_bound_mut(Bound::Included(&3));\nassert_eq!(cursor.peek_prev(), Some((&3, &mut \"c\")));\nassert_eq!(cursor.peek_next(), Some((&4, &mut \"d\")));\n\nlet mut cursor = map.upper_bound_mut(Bound::Excluded(&3));\nassert_eq!(cursor.peek_prev(), Some((&2, &mut \"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &mut \"c\")));\n\nlet mut cursor = map.upper_bound_mut(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), Some((&4, &mut \"d\")));\nassert_eq!(cursor.peek_next(), None);
    \n
    ",0,"bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    Source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · Source
    pub fn clear(&mut self)
    Clears the map, removing all elements.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.clear();\nassert!(a.is_empty());
    \n
    Source
    pub const fn new_in(alloc: A) -> BTreeMap<K, V, A>
    🔬This is a nightly-only experimental API. (btreemap_alloc)
    Makes a new empty BTreeMap with a reasonable choice for B.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\nuse std::alloc::Global;\n\nlet mut map = BTreeMap::new_in(Global);\n\n// entries can now be inserted into the empty map\nmap.insert(1, \"a\");
    \n
    ",0,"bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    Source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · Source
    pub fn get<Q>(&self, key: &Q) -> Option<&V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns a reference to the value corresponding to the key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.get(&1), Some(&\"a\"));\nassert_eq!(map.get(&2), None);
    \n
    1.40.0 · Source
    pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns the key-value pair corresponding to the supplied key. This is\npotentially useful:
    \n
      \n
    • for key types where non-identical keys can be considered equal;
      • \n
    • for getting the &K stored key value from a borrowed &Q lookup key; or
      • \n
    • for getting a reference to a key with the same lifetime as the collection.
      • \n
    \n
    The supplied key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::cmp::Ordering;\nuse std::collections::BTreeMap;\n\n#[derive(Clone, Copy, Debug)]\nstruct S {\n    id: u32,\n    name: &'static str, // ignored by equality and ordering operations\n}\n\nimpl PartialEq for S {\n    fn eq(&self, other: &S) -> bool {\n        self.id == other.id\n    }\n}\n\nimpl Eq for S {}\n\nimpl PartialOrd for S {\n    fn partial_cmp(&self, other: &S) -> Option<Ordering> {\n        self.id.partial_cmp(&other.id)\n    }\n}\n\nimpl Ord for S {\n    fn cmp(&self, other: &S) -> Ordering {\n        self.id.cmp(&other.id)\n    }\n}\n\nlet j_a = S { id: 1, name: \"Jessica\" };\nlet j_b = S { id: 1, name: \"Jess\" };\nlet p = S { id: 2, name: \"Paul\" };\nassert_eq!(j_a, j_b);\n\nlet mut map = BTreeMap::new();\nmap.insert(j_a, \"Paris\");\nassert_eq!(map.get_key_value(&j_a), Some((&j_a, &\"Paris\")));\nassert_eq!(map.get_key_value(&j_b), Some((&j_a, &\"Paris\"))); // the notable case\nassert_eq!(map.get_key_value(&p), None);
    \n
    1.66.0 · Source
    pub fn first_key_value(&self) -> Option<(&K, &V)>
    where\n    K: Ord,
    Returns the first key-value pair in the map.\nThe key in this pair is the minimum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.first_key_value(), None);\nmap.insert(1, \"b\");\nmap.insert(2, \"a\");\nassert_eq!(map.first_key_value(), Some((&1, &\"b\")));
    \n
    1.66.0 · Source
    pub fn first_entry(&mut self) -> Option<OccupiedEntry<'_, K, V, A>>
    where\n    K: Ord,
    Returns the first entry in the map for in-place manipulation.\nThe key of this entry is the minimum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nif let Some(mut entry) = map.first_entry() {\n    if *entry.key() > 0 {\n        entry.insert(\"first\");\n    }\n}\nassert_eq!(*map.get(&1).unwrap(), \"first\");\nassert_eq!(*map.get(&2).unwrap(), \"b\");
    \n
    1.66.0 · Source
    pub fn pop_first(&mut self) -> Option<(K, V)>
    where\n    K: Ord,
    Removes and returns the first element in the map.\nThe key of this element is the minimum key that was in the map.
    \n
    §Examples
    \n
    Draining elements in ascending order, while keeping a usable map each iteration.
    \n\n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nwhile let Some((key, _val)) = map.pop_first() {\n    assert!(map.iter().all(|(k, _v)| *k > key));\n}\nassert!(map.is_empty());
    \n
    1.66.0 · Source
    pub fn last_key_value(&self) -> Option<(&K, &V)>
    where\n    K: Ord,
    Returns the last key-value pair in the map.\nThe key in this pair is the maximum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"b\");\nmap.insert(2, \"a\");\nassert_eq!(map.last_key_value(), Some((&2, &\"a\")));
    \n
    1.66.0 · Source
    pub fn last_entry(&mut self) -> Option<OccupiedEntry<'_, K, V, A>>
    where\n    K: Ord,
    Returns the last entry in the map for in-place manipulation.\nThe key of this entry is the maximum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nif let Some(mut entry) = map.last_entry() {\n    if *entry.key() > 0 {\n        entry.insert(\"last\");\n    }\n}\nassert_eq!(*map.get(&1).unwrap(), \"a\");\nassert_eq!(*map.get(&2).unwrap(), \"last\");
    \n
    1.66.0 · Source
    pub fn pop_last(&mut self) -> Option<(K, V)>
    where\n    K: Ord,
    Removes and returns the last element in the map.\nThe key of this element is the maximum key that was in the map.
    \n
    §Examples
    \n
    Draining elements in descending order, while keeping a usable map each iteration.
    \n\n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nwhile let Some((key, _val)) = map.pop_last() {\n    assert!(map.iter().all(|(k, _v)| *k < key));\n}\nassert!(map.is_empty());
    \n
    1.0.0 · Source
    pub fn contains_key<Q>(&self, key: &Q) -> bool
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns true if the map contains a value for the specified key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.contains_key(&1), true);\nassert_eq!(map.contains_key(&2), false);
    \n
    1.0.0 · Source
    pub fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns a mutable reference to the value corresponding to the key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nif let Some(x) = map.get_mut(&1) {\n    *x = \"b\";\n}\nassert_eq!(map[&1], \"b\");
    \n
    1.0.0 · Source
    pub fn insert(&mut self, key: K, value: V) -> Option<V>
    where\n    K: Ord,
    Inserts a key-value pair into the map.
    \n
    If the map did not have this key present, None is returned.
    \n
    If the map did have this key present, the value is updated, and the old\nvalue is returned. The key is not updated, though; this matters for\ntypes that can be == without being identical. See the module-level\ndocumentation for more.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.insert(37, \"a\"), None);\nassert_eq!(map.is_empty(), false);\n\nmap.insert(37, \"b\");\nassert_eq!(map.insert(37, \"c\"), Some(\"b\"));\nassert_eq!(map[&37], \"c\");
    \n
    Source
    pub fn try_insert(\n    &mut self,\n    key: K,\n    value: V,\n) -> Result<&mut V, OccupiedError<'_, K, V, A>>
    where\n    K: Ord,
    🔬This is a nightly-only experimental API. (map_try_insert)
    Tries to insert a key-value pair into the map, and returns\na mutable reference to the value in the entry.
    \n
    If the map already had this key present, nothing is updated, and\nan error containing the occupied entry and the value is returned.
    \n
    §Examples
    \n
    #![feature(map_try_insert)]\n\nuse std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.try_insert(37, \"a\").unwrap(), &\"a\");\n\nlet err = map.try_insert(37, \"b\").unwrap_err();\nassert_eq!(err.entry.key(), &37);\nassert_eq!(err.entry.get(), &\"a\");\nassert_eq!(err.value, \"b\");
    \n
    1.0.0 · Source
    pub fn remove<Q>(&mut self, key: &Q) -> Option<V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Removes a key from the map, returning the value at the key if the key\nwas previously in the map.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.remove(&1), Some(\"a\"));\nassert_eq!(map.remove(&1), None);
    \n
    1.45.0 · Source
    pub fn remove_entry<Q>(&mut self, key: &Q) -> Option<(K, V)>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Removes a key from the map, returning the stored key and value if the key\nwas previously in the map.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.remove_entry(&1), Some((1, \"a\")));\nassert_eq!(map.remove_entry(&1), None);
    \n
    1.53.0 · Source
    pub fn retain<F>(&mut self, f: F)
    where\n    K: Ord,\n    F: FnMut(&K, &mut V) -> bool,
    Retains only the elements specified by the predicate.
    \n
    In other words, remove all pairs (k, v) for which f(&k, &mut v) returns false.\nThe elements are visited in ascending key order.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map: BTreeMap<i32, i32> = (0..8).map(|x| (x, x*10)).collect();\n// Keep only the elements with even-numbered keys.\nmap.retain(|&k, _| k % 2 == 0);\nassert!(map.into_iter().eq(vec![(0, 0), (2, 20), (4, 40), (6, 60)]));
    \n
    1.11.0 · Source
    pub fn append(&mut self, other: &mut BTreeMap<K, V, A>)
    where\n    K: Ord,\n    A: Clone,
    Moves all elements from other into self, leaving other empty.
    \n
    If a key from other is already present in self, the respective\nvalue from self will be overwritten with the respective value from other.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.insert(2, \"b\");\na.insert(3, \"c\"); // Note: Key (3) also present in b.\n\nlet mut b = BTreeMap::new();\nb.insert(3, \"d\"); // Note: Key (3) also present in a.\nb.insert(4, \"e\");\nb.insert(5, \"f\");\n\na.append(&mut b);\n\nassert_eq!(a.len(), 5);\nassert_eq!(b.len(), 0);\n\nassert_eq!(a[&1], \"a\");\nassert_eq!(a[&2], \"b\");\nassert_eq!(a[&3], \"d\"); // Note: \"c\" has been overwritten.\nassert_eq!(a[&4], \"e\");\nassert_eq!(a[&5], \"f\");
    \n
    1.17.0 · Source
    pub fn range<T, R>(&self, range: R) -> Range<'_, K, V>
    where\n    T: Ord + ?Sized,\n    K: Borrow<T> + Ord,\n    R: RangeBounds<T>,
    Constructs a double-ended iterator over a sub-range of elements in the map.\nThe simplest way is to use the range syntax min..max, thus range(min..max) will\nyield elements from min (inclusive) to max (exclusive).\nThe range may also be entered as (Bound<T>, Bound<T>), so for example\nrange((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive\nrange from 4 to 10.
    \n
    §Panics
    \n
    Panics if range start > end.\nPanics if range start == end and both bounds are Excluded.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\nuse std::ops::Bound::Included;\n\nlet mut map = BTreeMap::new();\nmap.insert(3, \"a\");\nmap.insert(5, \"b\");\nmap.insert(8, \"c\");\nfor (&key, &value) in map.range((Included(&4), Included(&8))) {\n    println!(\"{key}: {value}\");\n}\nassert_eq!(Some((&5, &\"b\")), map.range(4..).next());
    \n
    1.17.0 · Source
    pub fn range_mut<T, R>(&mut self, range: R) -> RangeMut<'_, K, V>
    where\n    T: Ord + ?Sized,\n    K: Borrow<T> + Ord,\n    R: RangeBounds<T>,
    Constructs a mutable double-ended iterator over a sub-range of elements in the map.\nThe simplest way is to use the range syntax min..max, thus range(min..max) will\nyield elements from min (inclusive) to max (exclusive).\nThe range may also be entered as (Bound<T>, Bound<T>), so for example\nrange((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive\nrange from 4 to 10.
    \n
    §Panics
    \n
    Panics if range start > end.\nPanics if range start == end and both bounds are Excluded.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map: BTreeMap<&str, i32> =\n    [(\"Alice\", 0), (\"Bob\", 0), (\"Carol\", 0), (\"Cheryl\", 0)].into();\nfor (_, balance) in map.range_mut(\"B\"..\"Cheryl\") {\n    *balance += 100;\n}\nfor (name, balance) in &map {\n    println!(\"{name} => {balance}\");\n}
    \n
    1.0.0 · Source
    pub fn entry(&mut self, key: K) -> Entry<'_, K, V, A>
    where\n    K: Ord,
    Gets the given key’s corresponding entry in the map for in-place manipulation.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut count: BTreeMap<&str, usize> = BTreeMap::new();\n\n// count the number of occurrences of letters in the vec\nfor x in [\"a\", \"b\", \"a\", \"c\", \"a\", \"b\"] {\n    count.entry(x).and_modify(|curr| *curr += 1).or_insert(1);\n}\n\nassert_eq!(count[\"a\"], 3);\nassert_eq!(count[\"b\"], 2);\nassert_eq!(count[\"c\"], 1);
    \n
    1.11.0 · Source
    pub fn split_off<Q>(&mut self, key: &Q) -> BTreeMap<K, V, A>
    where\n    Q: Ord + ?Sized,\n    K: Borrow<Q> + Ord,\n    A: Clone,
    Splits the collection into two at the given key. Returns everything after the given key,\nincluding the key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.insert(2, \"b\");\na.insert(3, \"c\");\na.insert(17, \"d\");\na.insert(41, \"e\");\n\nlet b = a.split_off(&3);\n\nassert_eq!(a.len(), 2);\nassert_eq!(b.len(), 3);\n\nassert_eq!(a[&1], \"a\");\nassert_eq!(a[&2], \"b\");\n\nassert_eq!(b[&3], \"c\");\nassert_eq!(b[&17], \"d\");\nassert_eq!(b[&41], \"e\");
    \n
    Source
    pub fn extract_if<F>(&mut self, pred: F) -> ExtractIf<'_, K, V, F, A>
    where\n    K: Ord,\n    F: FnMut(&K, &mut V) -> bool,
    🔬This is a nightly-only experimental API. (btree_extract_if)
    Creates an iterator that visits all elements (key-value pairs) in\nascending key order and uses a closure to determine if an element should\nbe removed. If the closure returns true, the element is removed from\nthe map and yielded. If the closure returns false, or panics, the\nelement remains in the map and will not be yielded.
    \n
    The iterator also lets you mutate the value of each element in the\nclosure, regardless of whether you choose to keep or remove it.
    \n
    If the returned ExtractIf is not exhausted, e.g. because it is dropped without iterating\nor the iteration short-circuits, then the remaining elements will be retained.\nUse retain with a negated predicate if you do not need the returned iterator.
    \n
    §Examples
    \n
    Splitting a map into even and odd keys, reusing the original map:
    \n\n
    #![feature(btree_extract_if)]\nuse std::collections::BTreeMap;\n\nlet mut map: BTreeMap<i32, i32> = (0..8).map(|x| (x, x)).collect();\nlet evens: BTreeMap<_, _> = map.extract_if(|k, _v| k % 2 == 0).collect();\nlet odds = map;\nassert_eq!(evens.keys().copied().collect::<Vec<_>>(), [0, 2, 4, 6]);\nassert_eq!(odds.keys().copied().collect::<Vec<_>>(), [1, 3, 5, 7]);
    \n
    1.54.0 · Source
    pub fn into_keys(self) -> IntoKeys<K, V, A>
    Creates a consuming iterator visiting all the keys, in sorted order.\nThe map cannot be used after calling this.\nThe iterator element type is K.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(2, \"b\");\na.insert(1, \"a\");\n\nlet keys: Vec<i32> = a.into_keys().collect();\nassert_eq!(keys, [1, 2]);
    \n
    1.54.0 · Source
    pub fn into_values(self) -> IntoValues<K, V, A>
    Creates a consuming iterator visiting all the values, in order by key.\nThe map cannot be used after calling this.\nThe iterator element type is V.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"hello\");\na.insert(2, \"goodbye\");\n\nlet values: Vec<&str> = a.into_values().collect();\nassert_eq!(values, [\"hello\", \"goodbye\"]);
    \n
    ",0,"bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V, A> Clone for BTreeMap<K, V, A>
    where\n    K: Clone,\n    V: Clone,\n    A: Allocator + Clone,
    Source§
    fn clone(&self) -> BTreeMap<K, V, 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
    ","Clone","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V, A> Debug for BTreeMap<K, V, A>
    where\n    K: Debug,\n    V: Debug,\n    A: Allocator + Clone,
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V> Default for BTreeMap<K, V>
    Source§
    fn default() -> BTreeMap<K, V>
    Creates an empty BTreeMap.
    \n
    ","Default","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    Source§
    impl<'de, K, V> Deserialize<'de> for BTreeMap<K, V>
    where\n    K: Deserialize<'de> + Ord,\n    V: Deserialize<'de>,
    Source§
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<BTreeMap<K, V>, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.7.0 · Source§
    impl<K, V, A> Drop for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    Source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    ","Drop","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.2.0 · Source§
    impl<'a, K, V, A> Extend<(&'a K, &'a V)> for BTreeMap<K, V, A>
    where\n    K: Ord + Copy,\n    V: Copy,\n    A: Allocator + Clone,
    Source§
    fn extend<I>(&mut self, iter: I)
    where\n    I: IntoIterator<Item = (&'a K, &'a V)>,
    Extends a collection with the contents of an iterator. Read more
    Source§
    fn extend_one(&mut self, _: (&'a K, &'a V))
    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    Source§
    fn extend_reserve(&mut self, additional: usize)
    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    ","Extend<(&'a K, &'a V)>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V, A> Extend<(K, V)> for BTreeMap<K, V, A>
    where\n    K: Ord,\n    A: Allocator + Clone,
    Source§
    fn extend<T>(&mut self, iter: T)
    where\n    T: IntoIterator<Item = (K, V)>,
    Extends a collection with the contents of an iterator. Read more
    Source§
    fn extend_one(&mut self, _: (K, V))
    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    Source§
    fn extend_reserve(&mut self, additional: usize)
    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    ","Extend<(K, V)>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.56.0 · Source§
    impl<K, V, const N: usize> From<[(K, V); N]> for BTreeMap<K, V>
    where\n    K: Ord,
    Source§
    fn from(arr: [(K, V); N]) -> BTreeMap<K, V>
    Converts a [(K, V); N] into a BTreeMap<K, V>.
    \n
    If any entries in the array have equal keys,\nall but one of the corresponding values will be dropped.
    \n\n
    use std::collections::BTreeMap;\n\nlet map1 = BTreeMap::from([(1, 2), (3, 4)]);\nlet map2: BTreeMap<_, _> = [(1, 2), (3, 4)].into();\nassert_eq!(map1, map2);
    \n
    ","From<[(K, V); N]>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V> FromIterator<(K, V)> for BTreeMap<K, V>
    where\n    K: Ord,
    Source§
    fn from_iter<T>(iter: T) -> BTreeMap<K, V>
    where\n    T: IntoIterator<Item = (K, V)>,
    Constructs a BTreeMap<K, V> from an iterator of key-value pairs.
    \n
    If the iterator produces any pairs with equal keys,\nall but one of the corresponding values will be dropped.
    \n
    ","FromIterator<(K, V)>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V, A> Hash for BTreeMap<K, V, A>
    where\n    K: Hash,\n    V: Hash,\n    A: Allocator + Clone,
    Source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · Source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where\n    H: Hasher,\n    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, Q, V, A> Index<&Q> for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Source§
    fn index(&self, key: &Q) -> &V
    Returns a reference to the value corresponding to the supplied key.
    \n
    §Panics
    \n
    Panics if the key is not present in the BTreeMap.
    \n
    Source§
    type Output = V
    The returned type after indexing.
    ","Index<&Q>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    §
    impl IntoAssets for BTreeMap<DescriptorPublicKey, DescriptorSecretKey>
    §
    fn into_assets(self) -> Assets
    Convert self into a Assets struct
    ","IntoAssets","bdk_wallet::keys::KeyMap"],["
    Source§
    impl<'de, K, V, E> IntoDeserializer<'de, E> for BTreeMap<K, V>
    where\n    K: IntoDeserializer<'de, E> + Eq + Ord,\n    V: IntoDeserializer<'de, E>,\n    E: Error,
    Source§
    type Deserializer = MapDeserializer<'de, <BTreeMap<K, V> as IntoIterator>::IntoIter, E>
    The type of the deserializer being converted into.
    Source§
    fn into_deserializer(\n    self,\n) -> <BTreeMap<K, V> as IntoDeserializer<'de, E>>::Deserializer
    Convert this value into a deserializer.
    ","IntoDeserializer<'de, E>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V, A> IntoIterator for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    Source§
    fn into_iter(self) -> IntoIter<K, V, A>
    Gets an owning iterator over the entries of the map, sorted by key.
    \n
    Source§
    type Item = (K, V)
    The type of the elements being iterated over.
    Source§
    type IntoIter = IntoIter<K, V, A>
    Which kind of iterator are we turning this into?
    ","IntoIterator","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    §
    impl<K, V> Merge for BTreeMap<K, V>
    where\n    K: Ord,
    §
    fn merge(&mut self, other: BTreeMap<K, V>)
    Merge another object of the same type onto self.
    §
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    §
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    ","Merge","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V, A> Ord for BTreeMap<K, V, A>
    where\n    K: Ord,\n    V: Ord,\n    A: Allocator + Clone,
    Source§
    fn cmp(&self, other: &BTreeMap<K, V, A>) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V, A> PartialEq for BTreeMap<K, V, A>
    where\n    K: PartialEq,\n    V: PartialEq,\n    A: Allocator + Clone,
    Source§
    fn eq(&self, other: &BTreeMap<K, V, A>) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V, A> PartialOrd for BTreeMap<K, V, A>
    where\n    K: PartialOrd,\n    V: PartialOrd,\n    A: Allocator + Clone,
    Source§
    fn partial_cmp(&self, other: &BTreeMap<K, V, A>) -> 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
    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
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    1.0.0 · Source§
    fn gt(&self, other: &Rhs) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    1.0.0 · Source§
    fn ge(&self, other: &Rhs) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    ","PartialOrd","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    Source§
    impl<K, V> Serialize for BTreeMap<K, V>
    where\n    K: Serialize,\n    V: Serialize,
    Source§
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · Source§
    impl<K, V, A> Eq for BTreeMap<K, V, A>
    where\n    K: Eq,\n    V: Eq,\n    A: Allocator + Clone,
    ","Eq","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.64.0 · Source§
    impl<K, V, A> UnwindSafe for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone + UnwindSafe,\n    K: RefUnwindSafe,\n    V: RefUnwindSafe,
    ","UnwindSafe","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"]]]]);
     if (window.register_type_impls) {
         window.register_type_impls(type_impls);
     } else {
         window.pending_type_impls = type_impls;
     }
 })()
-//{"start":55,"fragment_lengths":[170944,173853]}
\ No newline at end of file
+//{"start":55,"fragment_lengths":[170640,173278]}
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_chain/indexed_tx_graph/struct.IndexedTxGraph.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_chain/indexed_tx_graph/struct.IndexedTxGraph.js
index 496f0f7448..6b60a40577 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_chain/indexed_tx_graph/struct.IndexedTxGraph.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_chain/indexed_tx_graph/struct.IndexedTxGraph.js
@@ -1,9 +1,9 @@
 (function() {
-    var type_impls = Object.fromEntries([["example_cli",[["
    Source§
    impl<A, I> AsRef<TxGraph<A>> for IndexedTxGraph<A, I>
    Source§
    fn as_ref(&self) -> &TxGraph<A>
    Converts this type into a shared reference of the (usually inferred) input type.
    ","AsRef>","example_cli::KeychainTxGraph"],["
    Source§
    impl<A, I> Clone for IndexedTxGraph<A, I>
    where\n    A: Clone,\n    I: Clone,
    Source§
    fn clone(&self) -> IndexedTxGraph<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
    ","Clone","example_cli::KeychainTxGraph"],["
    Source§
    impl<A, I> Debug for IndexedTxGraph<A, I>
    where\n    A: Debug,\n    I: Debug,
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","example_cli::KeychainTxGraph"],["
    Source§
    impl<A, I> Default for IndexedTxGraph<A, I>
    where\n    I: Default,
    Source§
    fn default() -> IndexedTxGraph<A, I>
    Returns the “default value” for a type. Read more
    ","Default","example_cli::KeychainTxGraph"],["
    Source§
    impl<A, I> IndexedTxGraph<A, I>
    where\n    <I as Indexer>::ChangeSet: Default + Merge,\n    A: for<'b> Anchor + for<'b> From<TxPosInBlock<'b>>,\n    I: Indexer,
    Methods are available if the anchor (A) can be created from TxPosInBlock.
    \n
    Source
    pub fn apply_block_relevant(\n    &mut self,\n    block: &Block,\n    height: u32,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Batch insert all transactions of the given block of height, filtering out those that are\nirrelevant.
    \n
    Each inserted transaction’s anchor will be constructed using TxPosInBlock.
    \n
    Relevancy is determined by the internal Indexer::is_tx_relevant implementation of I.\nIrrelevant transactions in txs will be ignored.
    \n
    Source
    pub fn apply_block(\n    &mut self,\n    block: Block,\n    height: u32,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Batch insert all transactions of the given block of height.
    \n
    Each inserted transaction’s anchor will be constructed using TxPosInBlock.
    \n
    To only insert relevant transactions, use apply_block_relevant instead.
    \n
    ",0,"example_cli::KeychainTxGraph"],["
    Source§
    impl<A, I> IndexedTxGraph<A, I>
    Source
    pub fn new(index: I) -> IndexedTxGraph<A, I>
    Construct a new IndexedTxGraph with a given index.
    \n
    Source
    pub fn graph(&self) -> &TxGraph<A>
    Get a reference of the internal transaction graph.
    \n
    ",0,"example_cli::KeychainTxGraph"],["
    Source§
    impl<A, I> IndexedTxGraph<A, I>
    where\n    A: Anchor,\n    I: Indexer,
    Source
    pub fn apply_changeset(\n    &mut self,\n    changeset: ChangeSet<A, <I as Indexer>::ChangeSet>,\n)
    Applies the ChangeSet to the IndexedTxGraph.
    \n
    Source
    pub fn initial_changeset(&self) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Determines the ChangeSet between self and an empty IndexedTxGraph.
    \n
    ",0,"example_cli::KeychainTxGraph"],["
    Source§
    impl<A, I> IndexedTxGraph<A, I>
    where\n    A: Anchor,\n    I: Indexer,\n    <I as Indexer>::ChangeSet: Default + Merge,
    Source
    pub fn apply_update(\n    &mut self,\n    update: TxUpdate<A>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Apply an update directly.
    \n
    update is a tx_graph::TxUpdate<A> and the resultant changes is returned as ChangeSet.
    \n
    Source
    pub fn apply_update_at(\n    &mut self,\n    update: TxUpdate<A>,\n    seen_at: Option<u64>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Apply the given update with an optional seen_at timestamp.
    \n
    seen_at represents when the update is seen (in unix seconds). It is used to determine the\nlast_seens for all transactions in the update which have no corresponding anchor(s). The\nlast_seen value is used internally to determine precedence of conflicting unconfirmed\ntransactions (where the transaction with the lower last_seen value is omitted from the\ncanonical history).
    \n
    Not setting a seen_at value means unconfirmed transactions introduced by this update will\nnot be part of the canonical history of transactions.
    \n
    Use apply_update to have the seen_at value automatically\nset to the current time.
    \n
    Source
    pub fn insert_txout(\n    &mut self,\n    outpoint: OutPoint,\n    txout: TxOut,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Insert a floating txout of given outpoint.
    \n
    Source
    pub fn insert_tx<T>(&mut self, tx: T) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    where\n    T: Into<Arc<Transaction>>,
    Insert and index a transaction into the graph.
    \n
    Source
    pub fn insert_anchor(\n    &mut self,\n    txid: Txid,\n    anchor: A,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Insert an anchor for a given transaction.
    \n
    Source
    pub fn insert_seen_at(\n    &mut self,\n    txid: Txid,\n    seen_at: u64,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Insert a unix timestamp of when a transaction is seen in the mempool.
    \n
    This is used for transaction conflict resolution in TxGraph where the transaction with\nthe later last-seen is prioritized.
    \n
    Source
    pub fn batch_insert_relevant<T>(\n    &mut self,\n    txs: impl IntoIterator<Item = (T, impl IntoIterator<Item = A>)>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    where\n    T: Into<Arc<Transaction>>,
    Batch insert transactions, filtering out those that are irrelevant.
    \n
    Relevancy is determined by the Indexer::is_tx_relevant implementation of I. Irrelevant\ntransactions in txs will be ignored. txs do not need to be in topological order.
    \n
    Source
    pub fn batch_insert_relevant_unconfirmed<T>(\n    &mut self,\n    unconfirmed_txs: impl IntoIterator<Item = (T, u64)>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    where\n    T: Into<Arc<Transaction>>,
    Batch insert unconfirmed transactions, filtering out those that are irrelevant.
    \n
    Relevancy is determined by the internal Indexer::is_tx_relevant implementation of I.\nIrrelevant transactions in txs will be ignored.
    \n
    Items of txs are tuples containing the transaction and a last seen timestamp. The\nlast seen communicates when the transaction is last seen in the mempool which is used for\nconflict-resolution in TxGraph (refer to TxGraph::insert_seen_at for details).
    \n
    Source
    pub fn batch_insert_unconfirmed<T>(\n    &mut self,\n    txs: impl IntoIterator<Item = (T, u64)>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    where\n    T: Into<Arc<Transaction>>,
    Batch insert unconfirmed transactions.
    \n
    Items of txs are tuples containing the transaction and a last seen timestamp. The\nlast seen communicates when the transaction is last seen in the mempool which is used for\nconflict-resolution in TxGraph (refer to TxGraph::insert_seen_at for details).
    \n
    To filter out irrelevant transactions, use batch_insert_relevant_unconfirmed instead.
    \n
    ",0,"example_cli::KeychainTxGraph"]]]]);
+    var type_impls = Object.fromEntries([["example_cli",[["
    §
    impl<A, I> AsRef<TxGraph<A>> for IndexedTxGraph<A, I>
    §
    fn as_ref(&self) -> &TxGraph<A>
    Converts this type into a shared reference of the (usually inferred) input type.
    ","AsRef>","example_cli::KeychainTxGraph"],["
    §
    impl<A, I> Clone for IndexedTxGraph<A, I>
    where\n    A: Clone,\n    I: Clone,
    §
    fn clone(&self) -> IndexedTxGraph<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
    ","Clone","example_cli::KeychainTxGraph"],["
    §
    impl<A, I> Debug for IndexedTxGraph<A, I>
    where\n    A: Debug,\n    I: Debug,
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","example_cli::KeychainTxGraph"],["
    §
    impl<A, I> Default for IndexedTxGraph<A, I>
    where\n    I: Default,
    §
    fn default() -> IndexedTxGraph<A, I>
    Returns the “default value” for a type. Read more
    ","Default","example_cli::KeychainTxGraph"],["
    §
    impl<A, I> IndexedTxGraph<A, I>
    pub fn new(index: I) -> IndexedTxGraph<A, I>
    Construct a new [IndexedTxGraph] with a given index.
    \n
    pub fn graph(&self) -> &TxGraph<A>
    Get a reference of the internal transaction graph.
    \n
    ",0,"example_cli::KeychainTxGraph"],["
    §
    impl<A, I> IndexedTxGraph<A, I>
    where\n    <I as Indexer>::ChangeSet: Default + Merge,\n    A: for<'b> Anchor + for<'b> From<TxPosInBlock<'b>>,\n    I: Indexer,
    Methods are available if the anchor (A) can be created from [TxPosInBlock].
    \n
    pub fn apply_block_relevant(\n    &mut self,\n    block: &Block,\n    height: u32,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Batch insert all transactions of the given block of height, filtering out those that are\nirrelevant.
    \n
    Each inserted transaction’s anchor will be constructed using [TxPosInBlock].
    \n
    Relevancy is determined by the internal [Indexer::is_tx_relevant] implementation of I.\nIrrelevant transactions in txs will be ignored.
    \n
    pub fn apply_block(\n    &mut self,\n    block: Block,\n    height: u32,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Batch insert all transactions of the given block of height.
    \n
    Each inserted transaction’s anchor will be constructed using [TxPosInBlock].
    \n
    To only insert relevant transactions, use apply_block_relevant instead.
    \n
    ",0,"example_cli::KeychainTxGraph"],["
    §
    impl<A, I> IndexedTxGraph<A, I>
    where\n    A: Anchor,\n    I: Indexer,
    pub fn apply_changeset(\n    &mut self,\n    changeset: ChangeSet<A, <I as Indexer>::ChangeSet>,\n)
    Applies the [ChangeSet] to the [IndexedTxGraph].
    \n
    pub fn initial_changeset(&self) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Determines the [ChangeSet] between self and an empty [IndexedTxGraph].
    \n
    ",0,"example_cli::KeychainTxGraph"],["
    §
    impl<A, I> IndexedTxGraph<A, I>
    where\n    A: Anchor,\n    I: Indexer,\n    <I as Indexer>::ChangeSet: Default + Merge,
    pub fn apply_update(\n    &mut self,\n    update: TxUpdate<A>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Apply an update directly.
    \n
    update is a [tx_graph::TxUpdate<A>] and the resultant changes is returned as [ChangeSet].
    \n
    pub fn apply_update_at(\n    &mut self,\n    update: TxUpdate<A>,\n    seen_at: Option<u64>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Apply the given update with an optional seen_at timestamp.
    \n
    seen_at represents when the update is seen (in unix seconds). It is used to determine the\nlast_seens for all transactions in the update which have no corresponding anchor(s). The\nlast_seen value is used internally to determine precedence of conflicting unconfirmed\ntransactions (where the transaction with the lower last_seen value is omitted from the\ncanonical history).
    \n
    Not setting a seen_at value means unconfirmed transactions introduced by this update will\nnot be part of the canonical history of transactions.
    \n
    Use apply_update to have the seen_at value automatically\nset to the current time.
    \n
    pub fn insert_txout(\n    &mut self,\n    outpoint: OutPoint,\n    txout: TxOut,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Insert a floating txout of given outpoint.
    \n
    pub fn insert_tx<T>(&mut self, tx: T) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    where\n    T: Into<Arc<Transaction>>,
    Insert and index a transaction into the graph.
    \n
    pub fn insert_anchor(\n    &mut self,\n    txid: Txid,\n    anchor: A,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Insert an anchor for a given transaction.
    \n
    pub fn insert_seen_at(\n    &mut self,\n    txid: Txid,\n    seen_at: u64,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Insert a unix timestamp of when a transaction is seen in the mempool.
    \n
    This is used for transaction conflict resolution in [TxGraph] where the transaction with\nthe later last-seen is prioritized.
    \n
    pub fn batch_insert_relevant<T>(\n    &mut self,\n    txs: impl IntoIterator<Item = (T, impl IntoIterator<Item = A>)>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    where\n    T: Into<Arc<Transaction>>,
    Batch insert transactions, filtering out those that are irrelevant.
    \n
    Relevancy is determined by the [Indexer::is_tx_relevant] implementation of I. Irrelevant\ntransactions in txs will be ignored. txs do not need to be in topological order.
    \n
    pub fn batch_insert_relevant_unconfirmed<T>(\n    &mut self,\n    unconfirmed_txs: impl IntoIterator<Item = (T, u64)>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    where\n    T: Into<Arc<Transaction>>,
    Batch insert unconfirmed transactions, filtering out those that are irrelevant.
    \n
    Relevancy is determined by the internal [Indexer::is_tx_relevant] implementation of I.\nIrrelevant transactions in txs will be ignored.
    \n
    Items of txs are tuples containing the transaction and a last seen timestamp. The\nlast seen communicates when the transaction is last seen in the mempool which is used for\nconflict-resolution in [TxGraph] (refer to [TxGraph::insert_seen_at] for details).
    \n
    pub fn batch_insert_unconfirmed<T>(\n    &mut self,\n    txs: impl IntoIterator<Item = (T, u64)>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    where\n    T: Into<Arc<Transaction>>,
    Batch insert unconfirmed transactions.
    \n
    Items of txs are tuples containing the transaction and a last seen timestamp. The\nlast seen communicates when the transaction is last seen in the mempool which is used for\nconflict-resolution in [TxGraph] (refer to [TxGraph::insert_seen_at] for details).
    \n
    To filter out irrelevant transactions, use batch_insert_relevant_unconfirmed instead.
    \n
    ",0,"example_cli::KeychainTxGraph"]]]]);
     if (window.register_type_impls) {
         window.register_type_impls(type_impls);
     } else {
         window.pending_type_impls = type_impls;
     }
 })()
-//{"start":55,"fragment_lengths":[36299]}
\ No newline at end of file
+//{"start":55,"fragment_lengths":[20862]}
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_chain/tx_graph/struct.CanonicalTx.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_chain/tx_graph/struct.CanonicalTx.js
index e26a1c97b6..11ddca0a8a 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_chain/tx_graph/struct.CanonicalTx.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_chain/tx_graph/struct.CanonicalTx.js
@@ -1,9 +1,9 @@
 (function() {
-    var type_impls = Object.fromEntries([["bdk_wallet",[["
    Source§
    impl<'a, T, A> Clone for CanonicalTx<'a, T, A>
    where\n    T: Clone,\n    A: Clone,
    Source§
    fn clone(&self) -> CanonicalTx<'a, T, 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
    ","Clone","bdk_wallet::wallet::WalletTx"],["
    Source§
    impl<'a, T, A> Debug for CanonicalTx<'a, T, A>
    where\n    T: Debug,\n    A: Debug,
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_wallet::wallet::WalletTx"],["
    Source§
    impl<'a, T, A> Ord for CanonicalTx<'a, T, A>
    where\n    T: Ord,\n    A: Ord,
    Source§
    fn cmp(&self, other: &CanonicalTx<'a, T, A>) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_wallet::wallet::WalletTx"],["
    Source§
    impl<'a, T, A> PartialEq for CanonicalTx<'a, T, A>
    where\n    T: PartialEq,\n    A: PartialEq,
    Source§
    fn eq(&self, other: &CanonicalTx<'a, T, A>) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_wallet::wallet::WalletTx"],["
    Source§
    impl<'a, T, A> PartialOrd for CanonicalTx<'a, T, A>
    where\n    T: PartialOrd,\n    A: PartialOrd,
    Source§
    fn partial_cmp(&self, other: &CanonicalTx<'a, T, A>) -> 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
    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
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    1.0.0 · Source§
    fn gt(&self, other: &Rhs) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    1.0.0 · Source§
    fn ge(&self, other: &Rhs) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    ","PartialOrd","bdk_wallet::wallet::WalletTx"],["
    Source§
    impl<'a, T, A> Eq for CanonicalTx<'a, T, A>
    where\n    T: Eq,\n    A: Eq,
    ","Eq","bdk_wallet::wallet::WalletTx"],["
    Source§
    impl<'a, T, A> StructuralPartialEq for CanonicalTx<'a, T, A>
    ","StructuralPartialEq","bdk_wallet::wallet::WalletTx"]]]]);
+    var type_impls = Object.fromEntries([["bdk_wallet",[["
    §
    impl<'a, T, A> Clone for CanonicalTx<'a, T, A>
    where\n    T: Clone,\n    A: Clone,
    §
    fn clone(&self) -> CanonicalTx<'a, T, 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
    ","Clone","bdk_wallet::wallet::WalletTx"],["
    §
    impl<'a, T, A> Debug for CanonicalTx<'a, T, A>
    where\n    T: Debug,\n    A: Debug,
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_wallet::wallet::WalletTx"],["
    §
    impl<'a, T, A> Ord for CanonicalTx<'a, T, A>
    where\n    T: Ord,\n    A: Ord,
    §
    fn cmp(&self, other: &CanonicalTx<'a, T, A>) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_wallet::wallet::WalletTx"],["
    §
    impl<'a, T, A> PartialEq for CanonicalTx<'a, T, A>
    where\n    T: PartialEq,\n    A: PartialEq,
    §
    fn eq(&self, other: &CanonicalTx<'a, T, A>) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_wallet::wallet::WalletTx"],["
    §
    impl<'a, T, A> PartialOrd for CanonicalTx<'a, T, A>
    where\n    T: PartialOrd,\n    A: PartialOrd,
    §
    fn partial_cmp(&self, other: &CanonicalTx<'a, T, A>) -> 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
    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
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    1.0.0 · Source§
    fn gt(&self, other: &Rhs) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    1.0.0 · Source§
    fn ge(&self, other: &Rhs) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    ","PartialOrd","bdk_wallet::wallet::WalletTx"],["
    §
    impl<'a, T, A> Eq for CanonicalTx<'a, T, A>
    where\n    T: Eq,\n    A: Eq,
    ","Eq","bdk_wallet::wallet::WalletTx"],["
    §
    impl<'a, T, A> StructuralPartialEq for CanonicalTx<'a, T, A>
    ","StructuralPartialEq","bdk_wallet::wallet::WalletTx"]]]]);
     if (window.register_type_impls) {
         window.register_type_impls(type_impls);
     } else {
         window.pending_type_impls = type_impls;
     }
 })()
-//{"start":55,"fragment_lengths":[20397]}
\ No newline at end of file
+//{"start":55,"fragment_lengths":[18039]}
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_wallet/descriptor/enum.Descriptor.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_wallet/descriptor/enum.Descriptor.js
index e5210c3115..a66bf7548f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_wallet/descriptor/enum.Descriptor.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_wallet/descriptor/enum.Descriptor.js
@@ -1,9 +1,9 @@
 (function() {
-    var type_impls = Object.fromEntries([["bdk_wallet",[["
    §
    impl<Pk> Clone for Descriptor<Pk>
    where\n    Pk: Clone + MiniscriptKey,
    §
    fn clone(&self) -> Descriptor<Pk>
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    ","Clone","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> Debug for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl Descriptor<DefiniteDescriptorKey>
    pub fn derived_descriptor<C>(\n    &self,\n    secp: &Secp256k1<C>,\n) -> Result<Descriptor<PublicKey>, ConversionError>
    where\n    C: Verification,
    Convert all the public keys in the descriptor to [bitcoin::PublicKey] by deriving them or\notherwise converting them. All [bitcoin::secp256k1::XOnlyPublicKey]s are converted to by adding a\ndefault(0x02) y-coordinate.
    \n
    §Examples
    \n
    use miniscript::descriptor::{Descriptor, DescriptorPublicKey};\nuse miniscript::bitcoin::secp256k1;\nuse std::str::FromStr;\n\n// test from bip 86\nlet secp = secp256k1::Secp256k1::verification_only();\nlet descriptor = Descriptor::<DescriptorPublicKey>::from_str(\"tr(xpub6BgBgsespWvERF3LHQu6CnqdvfEvtMcQjYrcRzx53QJjSxarj2afYWcLteoGVky7D3UKDP9QyrLprQ3VCECoY49yfdDEHGCtMMj92pReUsQ/0/*)\")\n    .expect(\"Valid ranged descriptor\");\nlet result = descriptor.at_derivation_index(0).unwrap().derived_descriptor(&secp).expect(\"Non-hardened derivation\");\nassert_eq!(result.to_string(), \"tr(03cc8a4bc64d897bddc5fbc2f670f7a8ba0b386779106cf1223c6fc5d7cd6fc115)#6qm9h8ym\");
    \n
    §Errors
    \n
    This function will return an error if hardened derivation is attempted.
    \n
    ",0,"bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl Descriptor<DefiniteDescriptorKey>
    pub fn plan<P>(\n    self,\n    provider: &P,\n) -> Result<Plan, Descriptor<DefiniteDescriptorKey>>
    where\n    P: AssetProvider<DefiniteDescriptorKey>,
    Returns a plan if the provided assets are sufficient to produce a non-malleable satisfaction
    \n
    If the assets aren’t sufficient for generating a Plan, the descriptor is returned
    \n
    pub fn plan_mall<P>(\n    self,\n    provider: &P,\n) -> Result<Plan, Descriptor<DefiniteDescriptorKey>>
    where\n    P: AssetProvider<DefiniteDescriptorKey>,
    Returns a plan if the provided assets are sufficient to produce a malleable satisfaction
    \n
    If the assets aren’t sufficient for generating a Plan, the descriptor is returned
    \n
    ",0,"bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl Descriptor<DescriptorPublicKey>
    pub fn is_deriveable(&self) -> bool
    👎Deprecated: use has_wildcards instead
    Whether or not the descriptor has any wildcards
    \n
    pub fn has_wildcard(&self) -> bool
    Whether or not the descriptor has any wildcards i.e. /*.
    \n
    pub fn at_derivation_index(\n    &self,\n    index: u32,\n) -> Result<Descriptor<DefiniteDescriptorKey>, ConversionError>
    Replaces all wildcards (i.e. /*) in the descriptor with a particular derivation index,\nturning it into a definite descriptor.
    \n
    §Errors
    \n
      \n
    • If index ≥ 2^31
      • \n
    \n
    pub fn derive(\n    &self,\n    index: u32,\n) -> Result<Descriptor<DefiniteDescriptorKey>, ConversionError>
    👎Deprecated: use at_derivation_index instead
    Deprecated name for Self::at_derivation_index.
    \n
    pub fn derived_descriptor<C>(\n    &self,\n    secp: &Secp256k1<C>,\n    index: u32,\n) -> Result<Descriptor<PublicKey>, ConversionError>
    where\n    C: Verification,
    Convert all the public keys in the descriptor to [bitcoin::PublicKey] by deriving them or\notherwise converting them. All [bitcoin::secp256k1::XOnlyPublicKey]s are converted to by adding a\ndefault(0x02) y-coordinate.
    \n
    This is a shorthand for:
    \n\n
        .expect(\"Valid ranged descriptor\");\nlet derived_descriptor = descriptor.at_derivation_index(index).unwrap().derived_descriptor(&secp).unwrap();
    \n
    and is only here really here for backwards compatibility.\nSee at_derivation_index and [derived_descriptor] for more documentation.
    \n
    §Errors
    \n
    This function will return an error if hardened derivation is attempted.
    \n
    pub fn parse_descriptor<C>(\n    secp: &Secp256k1<C>,\n    s: &str,\n) -> Result<(Descriptor<DescriptorPublicKey>, BTreeMap<DescriptorPublicKey, DescriptorSecretKey>), Error>
    where\n    C: Signing,
    Parse a descriptor that may contain secret keys
    \n
    Internally turns every secret key found into the corresponding public key and then returns a\na descriptor that only contains public keys and a map to lookup the secret key given a public key.
    \n
    pub fn to_string_with_secret(\n    &self,\n    key_map: &BTreeMap<DescriptorPublicKey, DescriptorSecretKey>,\n) -> String
    Serialize a descriptor to string with its secret keys
    \n
    pub fn find_derivation_index_for_spk<C>(\n    &self,\n    secp: &Secp256k1<C>,\n    script_pubkey: &Script,\n    range: Range<u32>,\n) -> Result<Option<(u32, Descriptor<PublicKey>)>, ConversionError>
    where\n    C: Verification,
    Utility method for deriving the descriptor at each index in a range to find one matching\nscript_pubkey.
    \n
    If it finds a match then it returns the index it was derived at and the concrete\ndescriptor at that index. If the descriptor is non-derivable then it will simply check the\nscript pubkey against the descriptor and return it if it matches (in this case the index\nreturned will be meaningless).
    \n
    pub fn is_multipath(&self) -> bool
    Whether this descriptor contains a key that has multiple derivation paths.
    \n
    pub fn into_single_descriptors(\n    self,\n) -> Result<Vec<Descriptor<DescriptorPublicKey>>, Error>
    Get as many descriptors as different paths in this descriptor.
    \n
    For multipath descriptors it will return as many descriptors as there is\n“parallel” paths. For regular descriptors it will just return itself.
    \n
    ",0,"bdk_wallet::descriptor::ExtendedDescriptor"],["
    §
    impl<Pk> Descriptor<Pk>
    where\n    Pk: MiniscriptKey + ToPublicKey,
    pub fn address(&self, network: Network) -> Result<Address, Error>
    Computes the Bitcoin address of the descriptor, if one exists
    \n
    Some descriptors like pk() don’t have an address.
    \n
    §Errors
    \n
    For raw/bare descriptors that don’t have an address.
    \n
    pub fn script_pubkey(&self) -> ScriptBuf
    Computes the scriptpubkey of the descriptor.
    \n
    pub fn unsigned_script_sig(&self) -> ScriptBuf
    Computes the scriptSig that will be in place for an unsigned input\nspending an output with this descriptor. For pre-segwit descriptors,\nwhich use the scriptSig for signatures, this returns the empty script.
    \n
    This is used in Segwit transactions to produce an unsigned transaction\nwhose txid will not change during signing (since only the witness data\nwill change).
    \n
    pub fn explicit_script(&self) -> Result<ScriptBuf, Error>
    Computes the the underlying script before any hashing is done. For\nBare, Pkh and Wpkh this is the scriptPubkey; for ShWpkh and Sh\nthis is the redeemScript; for the others it is the witness script.
    \n
    §Errors
    \n
    If the descriptor is a taproot descriptor.
    \n
    pub fn script_code(&self) -> Result<ScriptBuf, Error>
    Computes the scriptCode of a transaction output.
    \n
    The scriptCode is the Script of the previous transaction output being\nserialized in the sighash when evaluating a CHECKSIG & co. OP code.
    \n
    §Errors
    \n
    If the descriptor is a taproot descriptor.
    \n
    pub fn get_satisfaction<S>(\n    &self,\n    satisfier: S,\n) -> Result<(Vec<Vec<u8>>, ScriptBuf), Error>
    where\n    S: Satisfier<Pk>,
    Returns satisfying non-malleable witness and scriptSig to spend an\noutput controlled by the given descriptor if it possible to\nconstruct one using the satisfier S.
    \n
    pub fn get_satisfaction_mall<S>(\n    &self,\n    satisfier: S,\n) -> Result<(Vec<Vec<u8>>, ScriptBuf), Error>
    where\n    S: Satisfier<Pk>,
    Returns a possilbly mallable satisfying non-malleable witness and scriptSig to spend an\noutput controlled by the given descriptor if it possible to\nconstruct one using the satisfier S.
    \n
    pub fn satisfy<S>(&self, txin: &mut TxIn, satisfier: S) -> Result<(), Error>
    where\n    S: Satisfier<Pk>,
    Attempts to produce a non-malleable satisfying witness and scriptSig to spend an\noutput controlled by the given descriptor; add the data to a given\nTxIn output.
    \n
    ",0,"bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    pub fn new_pk(pk: Pk) -> Descriptor<Pk>
    Create a new pk descriptor
    \n
    pub fn new_pkh(pk: Pk) -> Result<Descriptor<Pk>, Error>
    Create a new PkH descriptor
    \n
    pub fn new_wpkh(pk: Pk) -> Result<Descriptor<Pk>, Error>
    Create a new Wpkh descriptor\nWill return Err if uncompressed key is used
    \n
    pub fn new_sh_wpkh(pk: Pk) -> Result<Descriptor<Pk>, Error>
    Create a new sh wrapped wpkh from Pk.\nErrors when uncompressed keys are supplied
    \n
    pub fn new_sh(ms: Miniscript<Pk, Legacy>) -> Result<Descriptor<Pk>, Error>
    Create a new sh for a given redeem script\nErrors when miniscript exceeds resource limits under p2sh context\nor does not type check at the top level
    \n
    pub fn new_wsh(ms: Miniscript<Pk, Segwitv0>) -> Result<Descriptor<Pk>, Error>
    Create a new wsh descriptor from witness script\nErrors when miniscript exceeds resource limits under p2sh context\nor does not type check at the top level
    \n
    pub fn new_sh_wsh(ms: Miniscript<Pk, Segwitv0>) -> Result<Descriptor<Pk>, Error>
    Create a new sh wrapped wsh descriptor with witness script\nErrors when miniscript exceeds resource limits under wsh context\nor does not type check at the top level
    \n
    pub fn new_bare(ms: Miniscript<Pk, BareCtx>) -> Result<Descriptor<Pk>, Error>
    Create a new bare descriptor from witness script\nErrors when miniscript exceeds resource limits under bare context\nor does not type check at the top level
    \n
    pub fn new_sh_with_wpkh(wpkh: Wpkh<Pk>) -> Descriptor<Pk>
    Create a new sh wrapper for the given wpkh descriptor
    \n
    pub fn new_sh_with_wsh(wsh: Wsh<Pk>) -> Descriptor<Pk>
    Create a new sh wrapper for the given wsh descriptor
    \n
    pub fn new_sh_sortedmulti(\n    k: usize,\n    pks: Vec<Pk>,\n) -> Result<Descriptor<Pk>, Error>
    Create a new sh sortedmulti descriptor with threshold k\nand Vec of pks.\nErrors when miniscript exceeds resource limits under p2sh context
    \n
    pub fn new_sh_wsh_sortedmulti(\n    k: usize,\n    pks: Vec<Pk>,\n) -> Result<Descriptor<Pk>, Error>
    Create a new sh wrapped wsh sortedmulti descriptor from threshold\nk and Vec of pks\nErrors when miniscript exceeds resource limits under segwit context
    \n
    pub fn new_wsh_sortedmulti(\n    k: usize,\n    pks: Vec<Pk>,\n) -> Result<Descriptor<Pk>, Error>
    Create a new wsh sorted multi descriptor\nErrors when miniscript exceeds resource limits under p2sh context
    \n
    pub fn new_tr(\n    key: Pk,\n    script: Option<TapTree<Pk>>,\n) -> Result<Descriptor<Pk>, Error>
    Create new tr descriptor\nErrors when miniscript exceeds resource limits under Tap context
    \n
    pub fn desc_type(&self) -> DescriptorType
    Get the [DescriptorType] of Descriptor
    \n
    pub fn sanity_check(&self) -> Result<(), Error>
    Checks whether the descriptor is safe.
    \n
    Checks whether all the spend paths in the descriptor are possible on the\nbitcoin network under the current standardness and consensus rules. Also\nchecks whether the descriptor requires signatures on all spend paths and\nwhether the script is malleable.
    \n
    In general, all the guarantees of miniscript hold only for safe scripts.\nThe signer may not be able to find satisfactions even if one exists.
    \n
    pub fn max_weight_to_satisfy(&self) -> Result<Weight, Error>
    Computes an upper bound on the difference between a non-satisfied\nTxIn’s segwit_weight and a satisfied TxIn’s segwit_weight
    \n
    Since this method uses segwit_weight instead of legacy_weight,\nif you want to include only legacy inputs in your transaction,\nyou should remove 1WU from each input’s max_weight_to_satisfy\nfor a more accurate estimate.
    \n
    In other words, for segwit inputs or legacy inputs included in\nsegwit transactions, the following will hold for each input if\nthat input was satisfied with the largest possible witness:
    \n\n
    ⓘ
    for i in 0..transaction.input.len() {\n    assert_eq!(\n        descriptor_for_input[i].max_weight_to_satisfy(),\n        transaction.input[i].segwit_weight() - TxIn::default().segwit_weight()\n    );\n}
    \n
    Instead, for legacy transactions, the following will hold for each input\nif that input was satisfied with the largest possible witness:
    \n\n
    ⓘ
    for i in 0..transaction.input.len() {\n    assert_eq!(\n        descriptor_for_input[i].max_weight_to_satisfy(),\n        transaction.input[i].legacy_weight() - TxIn::default().legacy_weight()\n    );\n}
    \n
    Assumes all ECDSA signatures are 73 bytes, including push opcode and\nsighash suffix.\nAssumes all Schnorr signatures are 66 bytes, including push opcode and\nsighash suffix.
    \n
    §Errors
    \n
    When the descriptor is impossible to safisfy (ex: sh(OP_FALSE)).
    \n
    pub fn max_satisfaction_weight(&self) -> Result<usize, Error>
    👎Deprecated since 10.0.0: Use max_weight_to_satisfy instead. The method to count bytes was redesigned and the results will differ from max_weight_to_satisfy. For more details check rust-bitcoin/rust-miniscript#476.
    Computes an upper bound on the weight of a satisfying witness to the\ntransaction.
    \n
    Assumes all ec-signatures are 73 bytes, including push opcode and\nsighash suffix. Includes the weight of the VarInts encoding the\nscriptSig and witness stack length.
    \n
    §Errors
    \n
    When the descriptor is impossible to safisfy (ex: sh(OP_FALSE)).
    \n
    ",0,"bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    Source§
    impl DescriptorExt for Descriptor<DescriptorPublicKey>
    Source§
    fn dust_value(&self) -> Amount
    Returns the minimum [Amount] at which an output is broadcast-able.\nPanics if the descriptor wildcard is hardened.
    Source§
    fn descriptor_id(&self) -> DescriptorId
    Returns the descriptor ID, calculated as the sha256 hash of the spk derived from the\ndescriptor at index 0.
    ","DescriptorExt","bdk_wallet::descriptor::ExtendedDescriptor"],["
    §
    impl<'de, Pk> Deserialize<'de> for Descriptor<Pk>
    where\n    Pk: FromStrKey,
    §
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<Descriptor<Pk>, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> Display for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Display","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    Source§
    impl ExtractPolicy for Descriptor<DescriptorPublicKey>
    Source§
    fn extract_policy(\n    &self,\n    signers: &SignersContainer,\n    build_sat: BuildSatisfaction<'_>,\n    secp: &Secp256k1<All>,\n) -> Result<Option<Policy>, Error>
    Extract the spending policy
    ","ExtractPolicy","bdk_wallet::descriptor::ExtendedDescriptor"],["
    §
    impl<Pk> ForEachKey<Pk> for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn for_each_key<'a, F>(&'a self, pred: F) -> bool
    where\n    F: FnMut(&'a Pk) -> bool,
    Run a predicate on every key in the descriptor, returning whether\nthe predicate returned true for every key
    §
    fn for_any_key<'a, F>(&'a self, pred: F) -> bool
    where\n    F: FnMut(&'a Pk) -> bool,\n    Pk: 'a,
    Run a predicate on every key in the descriptor, returning whether\nthe predicate returned true for any key
    ","ForEachKey","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> From<Bare<Pk>> for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn from(inner: Bare<Pk>) -> Descriptor<Pk>
    Converts to this type from the input type.
    ","From>","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> From<Pkh<Pk>> for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn from(inner: Pkh<Pk>) -> Descriptor<Pk>
    Converts to this type from the input type.
    ","From>","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> From<Sh<Pk>> for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn from(inner: Sh<Pk>) -> Descriptor<Pk>
    Converts to this type from the input type.
    ","From>","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> From<Tr<Pk>> for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn from(inner: Tr<Pk>) -> Descriptor<Pk>
    Converts to this type from the input type.
    ","From>","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> From<Wpkh<Pk>> for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn from(inner: Wpkh<Pk>) -> Descriptor<Pk>
    Converts to this type from the input type.
    ","From>","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> From<Wsh<Pk>> for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn from(inner: Wsh<Pk>) -> Descriptor<Pk>
    Converts to this type from the input type.
    ","From>","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> FromStr for Descriptor<Pk>
    where\n    Pk: FromStrKey,
    §
    type Err = Error
    The associated error which can be returned from parsing.
    §
    fn from_str(s: &str) -> Result<Descriptor<Pk>, Error>
    Parses a string s to return a value of this type. Read more
    ","FromStr","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> FromTree for Descriptor<Pk>
    where\n    Pk: FromStrKey,
    §
    fn from_tree(top: &Tree<'_>) -> Result<Descriptor<Pk>, Error>
    Parse an expression tree into a descriptor.
    \n
    ","FromTree","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> Hash for Descriptor<Pk>
    where\n    Pk: Hash + MiniscriptKey,
    §
    fn hash<__H>(&self, state: &mut __H)
    where\n    __H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · Source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where\n    H: Hasher,\n    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> Liftable<Pk> for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn lift(&self) -> Result<Policy<Pk>, Error>
    Converts this object into an abstract policy.
    ","Liftable","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> Ord for Descriptor<Pk>
    where\n    Pk: Ord + MiniscriptKey,
    §
    fn cmp(&self, other: &Descriptor<Pk>) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> PartialEq for Descriptor<Pk>
    where\n    Pk: PartialEq + MiniscriptKey,
    §
    fn eq(&self, other: &Descriptor<Pk>) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> PartialOrd for Descriptor<Pk>
    where\n    Pk: PartialOrd + MiniscriptKey,
    §
    fn partial_cmp(&self, other: &Descriptor<Pk>) -> 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
    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
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    1.0.0 · Source§
    fn gt(&self, other: &Rhs) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    1.0.0 · Source§
    fn ge(&self, other: &Rhs) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    ","PartialOrd","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<'de, Pk> Serialize for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<P, Q> TranslatePk<P, Q> for Descriptor<P>
    where\n    P: MiniscriptKey,\n    Q: MiniscriptKey,
    §
    fn translate_pk<T, E>(\n    &self,\n    t: &mut T,\n) -> Result<<Descriptor<P> as TranslatePk<P, Q>>::Output, TranslateErr<E>>
    where\n    T: Translator<P, Q, E>,
    Converts a descriptor using abstract keys to one using specific keys.
    \n
    §
    type Output = Descriptor<Q>
    The associated output type. This must be Self<Q>.
    ","TranslatePk","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> Eq for Descriptor<Pk>
    where\n    Pk: Eq + MiniscriptKey,
    ","Eq","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> StructuralPartialEq for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    ","StructuralPartialEq","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"]]]]);
+    var type_impls = Object.fromEntries([["bdk_wallet",[["
    §
    impl<Pk> Clone for Descriptor<Pk>
    where\n    Pk: Clone + MiniscriptKey,
    §
    fn clone(&self) -> Descriptor<Pk>
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    ","Clone","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> Debug for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl Descriptor<DefiniteDescriptorKey>
    pub fn derived_descriptor<C>(\n    &self,\n    secp: &Secp256k1<C>,\n) -> Result<Descriptor<PublicKey>, ConversionError>
    where\n    C: Verification,
    Convert all the public keys in the descriptor to [bitcoin::PublicKey] by deriving them or\notherwise converting them. All [bitcoin::secp256k1::XOnlyPublicKey]s are converted to by adding a\ndefault(0x02) y-coordinate.
    \n
    §Examples
    \n
    use miniscript::descriptor::{Descriptor, DescriptorPublicKey};\nuse miniscript::bitcoin::secp256k1;\nuse std::str::FromStr;\n\n// test from bip 86\nlet secp = secp256k1::Secp256k1::verification_only();\nlet descriptor = Descriptor::<DescriptorPublicKey>::from_str(\"tr(xpub6BgBgsespWvERF3LHQu6CnqdvfEvtMcQjYrcRzx53QJjSxarj2afYWcLteoGVky7D3UKDP9QyrLprQ3VCECoY49yfdDEHGCtMMj92pReUsQ/0/*)\")\n    .expect(\"Valid ranged descriptor\");\nlet result = descriptor.at_derivation_index(0).unwrap().derived_descriptor(&secp).expect(\"Non-hardened derivation\");\nassert_eq!(result.to_string(), \"tr(03cc8a4bc64d897bddc5fbc2f670f7a8ba0b386779106cf1223c6fc5d7cd6fc115)#6qm9h8ym\");
    \n
    §Errors
    \n
    This function will return an error if hardened derivation is attempted.
    \n
    ",0,"bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl Descriptor<DefiniteDescriptorKey>
    pub fn plan<P>(\n    self,\n    provider: &P,\n) -> Result<Plan, Descriptor<DefiniteDescriptorKey>>
    where\n    P: AssetProvider<DefiniteDescriptorKey>,
    Returns a plan if the provided assets are sufficient to produce a non-malleable satisfaction
    \n
    If the assets aren’t sufficient for generating a Plan, the descriptor is returned
    \n
    pub fn plan_mall<P>(\n    self,\n    provider: &P,\n) -> Result<Plan, Descriptor<DefiniteDescriptorKey>>
    where\n    P: AssetProvider<DefiniteDescriptorKey>,
    Returns a plan if the provided assets are sufficient to produce a malleable satisfaction
    \n
    If the assets aren’t sufficient for generating a Plan, the descriptor is returned
    \n
    ",0,"bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl Descriptor<DescriptorPublicKey>
    pub fn is_deriveable(&self) -> bool
    👎Deprecated: use has_wildcards instead
    Whether or not the descriptor has any wildcards
    \n
    pub fn has_wildcard(&self) -> bool
    Whether or not the descriptor has any wildcards i.e. /*.
    \n
    pub fn at_derivation_index(\n    &self,\n    index: u32,\n) -> Result<Descriptor<DefiniteDescriptorKey>, ConversionError>
    Replaces all wildcards (i.e. /*) in the descriptor with a particular derivation index,\nturning it into a definite descriptor.
    \n
    §Errors
    \n
      \n
    • If index ≥ 2^31
      • \n
    \n
    pub fn derive(\n    &self,\n    index: u32,\n) -> Result<Descriptor<DefiniteDescriptorKey>, ConversionError>
    👎Deprecated: use at_derivation_index instead
    Deprecated name for Self::at_derivation_index.
    \n
    pub fn derived_descriptor<C>(\n    &self,\n    secp: &Secp256k1<C>,\n    index: u32,\n) -> Result<Descriptor<PublicKey>, ConversionError>
    where\n    C: Verification,
    Convert all the public keys in the descriptor to [bitcoin::PublicKey] by deriving them or\notherwise converting them. All [bitcoin::secp256k1::XOnlyPublicKey]s are converted to by adding a\ndefault(0x02) y-coordinate.
    \n
    This is a shorthand for:
    \n\n
        .expect(\"Valid ranged descriptor\");\nlet derived_descriptor = descriptor.at_derivation_index(index).unwrap().derived_descriptor(&secp).unwrap();
    \n
    and is only here really here for backwards compatibility.\nSee at_derivation_index and [derived_descriptor] for more documentation.
    \n
    §Errors
    \n
    This function will return an error if hardened derivation is attempted.
    \n
    pub fn parse_descriptor<C>(\n    secp: &Secp256k1<C>,\n    s: &str,\n) -> Result<(Descriptor<DescriptorPublicKey>, BTreeMap<DescriptorPublicKey, DescriptorSecretKey>), Error>
    where\n    C: Signing,
    Parse a descriptor that may contain secret keys
    \n
    Internally turns every secret key found into the corresponding public key and then returns a\na descriptor that only contains public keys and a map to lookup the secret key given a public key.
    \n
    pub fn to_string_with_secret(\n    &self,\n    key_map: &BTreeMap<DescriptorPublicKey, DescriptorSecretKey>,\n) -> String
    Serialize a descriptor to string with its secret keys
    \n
    pub fn find_derivation_index_for_spk<C>(\n    &self,\n    secp: &Secp256k1<C>,\n    script_pubkey: &Script,\n    range: Range<u32>,\n) -> Result<Option<(u32, Descriptor<PublicKey>)>, ConversionError>
    where\n    C: Verification,
    Utility method for deriving the descriptor at each index in a range to find one matching\nscript_pubkey.
    \n
    If it finds a match then it returns the index it was derived at and the concrete\ndescriptor at that index. If the descriptor is non-derivable then it will simply check the\nscript pubkey against the descriptor and return it if it matches (in this case the index\nreturned will be meaningless).
    \n
    pub fn is_multipath(&self) -> bool
    Whether this descriptor contains a key that has multiple derivation paths.
    \n
    pub fn into_single_descriptors(\n    self,\n) -> Result<Vec<Descriptor<DescriptorPublicKey>>, Error>
    Get as many descriptors as different paths in this descriptor.
    \n
    For multipath descriptors it will return as many descriptors as there is\n“parallel” paths. For regular descriptors it will just return itself.
    \n
    ",0,"bdk_wallet::descriptor::ExtendedDescriptor"],["
    §
    impl<Pk> Descriptor<Pk>
    where\n    Pk: MiniscriptKey + ToPublicKey,
    pub fn address(&self, network: Network) -> Result<Address, Error>
    Computes the Bitcoin address of the descriptor, if one exists
    \n
    Some descriptors like pk() don’t have an address.
    \n
    §Errors
    \n
    For raw/bare descriptors that don’t have an address.
    \n
    pub fn script_pubkey(&self) -> ScriptBuf
    Computes the scriptpubkey of the descriptor.
    \n
    pub fn unsigned_script_sig(&self) -> ScriptBuf
    Computes the scriptSig that will be in place for an unsigned input\nspending an output with this descriptor. For pre-segwit descriptors,\nwhich use the scriptSig for signatures, this returns the empty script.
    \n
    This is used in Segwit transactions to produce an unsigned transaction\nwhose txid will not change during signing (since only the witness data\nwill change).
    \n
    pub fn explicit_script(&self) -> Result<ScriptBuf, Error>
    Computes the the underlying script before any hashing is done. For\nBare, Pkh and Wpkh this is the scriptPubkey; for ShWpkh and Sh\nthis is the redeemScript; for the others it is the witness script.
    \n
    §Errors
    \n
    If the descriptor is a taproot descriptor.
    \n
    pub fn script_code(&self) -> Result<ScriptBuf, Error>
    Computes the scriptCode of a transaction output.
    \n
    The scriptCode is the Script of the previous transaction output being\nserialized in the sighash when evaluating a CHECKSIG & co. OP code.
    \n
    §Errors
    \n
    If the descriptor is a taproot descriptor.
    \n
    pub fn get_satisfaction<S>(\n    &self,\n    satisfier: S,\n) -> Result<(Vec<Vec<u8>>, ScriptBuf), Error>
    where\n    S: Satisfier<Pk>,
    Returns satisfying non-malleable witness and scriptSig to spend an\noutput controlled by the given descriptor if it possible to\nconstruct one using the satisfier S.
    \n
    pub fn get_satisfaction_mall<S>(\n    &self,\n    satisfier: S,\n) -> Result<(Vec<Vec<u8>>, ScriptBuf), Error>
    where\n    S: Satisfier<Pk>,
    Returns a possilbly mallable satisfying non-malleable witness and scriptSig to spend an\noutput controlled by the given descriptor if it possible to\nconstruct one using the satisfier S.
    \n
    pub fn satisfy<S>(&self, txin: &mut TxIn, satisfier: S) -> Result<(), Error>
    where\n    S: Satisfier<Pk>,
    Attempts to produce a non-malleable satisfying witness and scriptSig to spend an\noutput controlled by the given descriptor; add the data to a given\nTxIn output.
    \n
    ",0,"bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    pub fn new_pk(pk: Pk) -> Descriptor<Pk>
    Create a new pk descriptor
    \n
    pub fn new_pkh(pk: Pk) -> Result<Descriptor<Pk>, Error>
    Create a new PkH descriptor
    \n
    pub fn new_wpkh(pk: Pk) -> Result<Descriptor<Pk>, Error>
    Create a new Wpkh descriptor\nWill return Err if uncompressed key is used
    \n
    pub fn new_sh_wpkh(pk: Pk) -> Result<Descriptor<Pk>, Error>
    Create a new sh wrapped wpkh from Pk.\nErrors when uncompressed keys are supplied
    \n
    pub fn new_sh(ms: Miniscript<Pk, Legacy>) -> Result<Descriptor<Pk>, Error>
    Create a new sh for a given redeem script\nErrors when miniscript exceeds resource limits under p2sh context\nor does not type check at the top level
    \n
    pub fn new_wsh(ms: Miniscript<Pk, Segwitv0>) -> Result<Descriptor<Pk>, Error>
    Create a new wsh descriptor from witness script\nErrors when miniscript exceeds resource limits under p2sh context\nor does not type check at the top level
    \n
    pub fn new_sh_wsh(ms: Miniscript<Pk, Segwitv0>) -> Result<Descriptor<Pk>, Error>
    Create a new sh wrapped wsh descriptor with witness script\nErrors when miniscript exceeds resource limits under wsh context\nor does not type check at the top level
    \n
    pub fn new_bare(ms: Miniscript<Pk, BareCtx>) -> Result<Descriptor<Pk>, Error>
    Create a new bare descriptor from witness script\nErrors when miniscript exceeds resource limits under bare context\nor does not type check at the top level
    \n
    pub fn new_sh_with_wpkh(wpkh: Wpkh<Pk>) -> Descriptor<Pk>
    Create a new sh wrapper for the given wpkh descriptor
    \n
    pub fn new_sh_with_wsh(wsh: Wsh<Pk>) -> Descriptor<Pk>
    Create a new sh wrapper for the given wsh descriptor
    \n
    pub fn new_sh_sortedmulti(\n    k: usize,\n    pks: Vec<Pk>,\n) -> Result<Descriptor<Pk>, Error>
    Create a new sh sortedmulti descriptor with threshold k\nand Vec of pks.\nErrors when miniscript exceeds resource limits under p2sh context
    \n
    pub fn new_sh_wsh_sortedmulti(\n    k: usize,\n    pks: Vec<Pk>,\n) -> Result<Descriptor<Pk>, Error>
    Create a new sh wrapped wsh sortedmulti descriptor from threshold\nk and Vec of pks\nErrors when miniscript exceeds resource limits under segwit context
    \n
    pub fn new_wsh_sortedmulti(\n    k: usize,\n    pks: Vec<Pk>,\n) -> Result<Descriptor<Pk>, Error>
    Create a new wsh sorted multi descriptor\nErrors when miniscript exceeds resource limits under p2sh context
    \n
    pub fn new_tr(\n    key: Pk,\n    script: Option<TapTree<Pk>>,\n) -> Result<Descriptor<Pk>, Error>
    Create new tr descriptor\nErrors when miniscript exceeds resource limits under Tap context
    \n
    pub fn desc_type(&self) -> DescriptorType
    Get the [DescriptorType] of Descriptor
    \n
    pub fn sanity_check(&self) -> Result<(), Error>
    Checks whether the descriptor is safe.
    \n
    Checks whether all the spend paths in the descriptor are possible on the\nbitcoin network under the current standardness and consensus rules. Also\nchecks whether the descriptor requires signatures on all spend paths and\nwhether the script is malleable.
    \n
    In general, all the guarantees of miniscript hold only for safe scripts.\nThe signer may not be able to find satisfactions even if one exists.
    \n
    pub fn max_weight_to_satisfy(&self) -> Result<Weight, Error>
    Computes an upper bound on the difference between a non-satisfied\nTxIn’s segwit_weight and a satisfied TxIn’s segwit_weight
    \n
    Since this method uses segwit_weight instead of legacy_weight,\nif you want to include only legacy inputs in your transaction,\nyou should remove 1WU from each input’s max_weight_to_satisfy\nfor a more accurate estimate.
    \n
    In other words, for segwit inputs or legacy inputs included in\nsegwit transactions, the following will hold for each input if\nthat input was satisfied with the largest possible witness:
    \n\n
    ⓘ
    for i in 0..transaction.input.len() {\n    assert_eq!(\n        descriptor_for_input[i].max_weight_to_satisfy(),\n        transaction.input[i].segwit_weight() - TxIn::default().segwit_weight()\n    );\n}
    \n
    Instead, for legacy transactions, the following will hold for each input\nif that input was satisfied with the largest possible witness:
    \n\n
    ⓘ
    for i in 0..transaction.input.len() {\n    assert_eq!(\n        descriptor_for_input[i].max_weight_to_satisfy(),\n        transaction.input[i].legacy_weight() - TxIn::default().legacy_weight()\n    );\n}
    \n
    Assumes all ECDSA signatures are 73 bytes, including push opcode and\nsighash suffix.\nAssumes all Schnorr signatures are 66 bytes, including push opcode and\nsighash suffix.
    \n
    §Errors
    \n
    When the descriptor is impossible to safisfy (ex: sh(OP_FALSE)).
    \n
    pub fn max_satisfaction_weight(&self) -> Result<usize, Error>
    👎Deprecated since 10.0.0: Use max_weight_to_satisfy instead. The method to count bytes was redesigned and the results will differ from max_weight_to_satisfy. For more details check rust-bitcoin/rust-miniscript#476.
    Computes an upper bound on the weight of a satisfying witness to the\ntransaction.
    \n
    Assumes all ec-signatures are 73 bytes, including push opcode and\nsighash suffix. Includes the weight of the VarInts encoding the\nscriptSig and witness stack length.
    \n
    §Errors
    \n
    When the descriptor is impossible to safisfy (ex: sh(OP_FALSE)).
    \n
    ",0,"bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl DescriptorExt for Descriptor<DescriptorPublicKey>
    §
    fn dust_value(&self) -> Amount
    Returns the minimum [Amount] at which an output is broadcast-able.\nPanics if the descriptor wildcard is hardened.
    §
    fn descriptor_id(&self) -> DescriptorId
    Returns the descriptor ID, calculated as the sha256 hash of the spk derived from the\ndescriptor at index 0.
    ","DescriptorExt","bdk_wallet::descriptor::ExtendedDescriptor"],["
    §
    impl<'de, Pk> Deserialize<'de> for Descriptor<Pk>
    where\n    Pk: FromStrKey,
    §
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<Descriptor<Pk>, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> Display for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Display","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    Source§
    impl ExtractPolicy for Descriptor<DescriptorPublicKey>
    Source§
    fn extract_policy(\n    &self,\n    signers: &SignersContainer,\n    build_sat: BuildSatisfaction<'_>,\n    secp: &Secp256k1<All>,\n) -> Result<Option<Policy>, Error>
    Extract the spending policy
    ","ExtractPolicy","bdk_wallet::descriptor::ExtendedDescriptor"],["
    §
    impl<Pk> ForEachKey<Pk> for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn for_each_key<'a, F>(&'a self, pred: F) -> bool
    where\n    F: FnMut(&'a Pk) -> bool,
    Run a predicate on every key in the descriptor, returning whether\nthe predicate returned true for every key
    §
    fn for_any_key<'a, F>(&'a self, pred: F) -> bool
    where\n    F: FnMut(&'a Pk) -> bool,\n    Pk: 'a,
    Run a predicate on every key in the descriptor, returning whether\nthe predicate returned true for any key
    ","ForEachKey","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> From<Bare<Pk>> for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn from(inner: Bare<Pk>) -> Descriptor<Pk>
    Converts to this type from the input type.
    ","From>","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> From<Pkh<Pk>> for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn from(inner: Pkh<Pk>) -> Descriptor<Pk>
    Converts to this type from the input type.
    ","From>","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> From<Sh<Pk>> for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn from(inner: Sh<Pk>) -> Descriptor<Pk>
    Converts to this type from the input type.
    ","From>","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> From<Tr<Pk>> for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn from(inner: Tr<Pk>) -> Descriptor<Pk>
    Converts to this type from the input type.
    ","From>","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> From<Wpkh<Pk>> for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn from(inner: Wpkh<Pk>) -> Descriptor<Pk>
    Converts to this type from the input type.
    ","From>","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> From<Wsh<Pk>> for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn from(inner: Wsh<Pk>) -> Descriptor<Pk>
    Converts to this type from the input type.
    ","From>","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> FromStr for Descriptor<Pk>
    where\n    Pk: FromStrKey,
    §
    type Err = Error
    The associated error which can be returned from parsing.
    §
    fn from_str(s: &str) -> Result<Descriptor<Pk>, Error>
    Parses a string s to return a value of this type. Read more
    ","FromStr","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> FromTree for Descriptor<Pk>
    where\n    Pk: FromStrKey,
    §
    fn from_tree(top: &Tree<'_>) -> Result<Descriptor<Pk>, Error>
    Parse an expression tree into a descriptor.
    \n
    ","FromTree","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> Hash for Descriptor<Pk>
    where\n    Pk: Hash + MiniscriptKey,
    §
    fn hash<__H>(&self, state: &mut __H)
    where\n    __H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · Source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where\n    H: Hasher,\n    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> Liftable<Pk> for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn lift(&self) -> Result<Policy<Pk>, Error>
    Converts this object into an abstract policy.
    ","Liftable","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> Ord for Descriptor<Pk>
    where\n    Pk: Ord + MiniscriptKey,
    §
    fn cmp(&self, other: &Descriptor<Pk>) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> PartialEq for Descriptor<Pk>
    where\n    Pk: PartialEq + MiniscriptKey,
    §
    fn eq(&self, other: &Descriptor<Pk>) -> bool
    Tests for self and other values to be equal, and is used by ==.
    1.0.0 · Source§
    fn ne(&self, other: &Rhs) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> PartialOrd for Descriptor<Pk>
    where\n    Pk: PartialOrd + MiniscriptKey,
    §
    fn partial_cmp(&self, other: &Descriptor<Pk>) -> 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
    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
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    1.0.0 · Source§
    fn gt(&self, other: &Rhs) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    1.0.0 · Source§
    fn ge(&self, other: &Rhs) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    ","PartialOrd","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<'de, Pk> Serialize for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    §
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<P, Q> TranslatePk<P, Q> for Descriptor<P>
    where\n    P: MiniscriptKey,\n    Q: MiniscriptKey,
    §
    fn translate_pk<T, E>(\n    &self,\n    t: &mut T,\n) -> Result<<Descriptor<P> as TranslatePk<P, Q>>::Output, TranslateErr<E>>
    where\n    T: Translator<P, Q, E>,
    Converts a descriptor using abstract keys to one using specific keys.
    \n
    §
    type Output = Descriptor<Q>
    The associated output type. This must be Self<Q>.
    ","TranslatePk","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> Eq for Descriptor<Pk>
    where\n    Pk: Eq + MiniscriptKey,
    ","Eq","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"],["
    §
    impl<Pk> StructuralPartialEq for Descriptor<Pk>
    where\n    Pk: MiniscriptKey,
    ","StructuralPartialEq","bdk_wallet::descriptor::ExtendedDescriptor","bdk_wallet::descriptor::DerivedDescriptor"]]]]);
     if (window.register_type_impls) {
         window.register_type_impls(type_impls);
     } else {
         window.pending_type_impls = type_impls;
     }
 })()
-//{"start":55,"fragment_lengths":[94101]}
\ No newline at end of file
+//{"start":55,"fragment_lengths":[93403]}
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.i32.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.i32.js
index 3ab918aa5c..b0f307bd1b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.i32.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.i32.js
@@ -1,9 +1,9 @@
 (function() {
-    var type_impls = Object.fromEntries([["bdk_chain",[["
    1.0.0 · Source§
    impl Add<&i32> for i32
    Source§
    type Output = <i32 as Add>::Output
    The resulting type after applying the + operator.
    Source§
    fn add(self, other: &i32) -> <i32 as Add>::Output
    Performs the + operation. Read more
    ","Add<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Add for i32
    Source§
    type Output = i32
    The resulting type after applying the + operator.
    Source§
    const fn add(self, other: i32) -> i32
    Performs the + operation. Read more
    ","Add","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl AddAssign<&i32> for i32
    Source§
    fn add_assign(&mut self, other: &i32)
    Performs the += operation. Read more
    ","AddAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl AddAssign for i32
    Source§
    fn add_assign(&mut self, other: i32)
    Performs the += operation. Read more
    ","AddAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Binary for i32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Binary","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl BitAnd<&i32> for i32
    Source§
    type Output = <i32 as BitAnd>::Output
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, other: &i32) -> <i32 as BitAnd>::Output
    Performs the & operation. Read more
    ","BitAnd<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl BitAnd for i32
    Source§
    type Output = i32
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, rhs: i32) -> i32
    Performs the & operation. Read more
    ","BitAnd","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl BitAndAssign<&i32> for i32
    Source§
    fn bitand_assign(&mut self, other: &i32)
    Performs the &= operation. Read more
    ","BitAndAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl BitAndAssign for i32
    Source§
    fn bitand_assign(&mut self, other: i32)
    Performs the &= operation. Read more
    ","BitAndAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl BitOr<&i32> for i32
    Source§
    type Output = <i32 as BitOr>::Output
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, other: &i32) -> <i32 as BitOr>::Output
    Performs the | operation. Read more
    ","BitOr<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl BitOr for i32
    Source§
    type Output = i32
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, rhs: i32) -> i32
    Performs the | operation. Read more
    ","BitOr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl BitOrAssign<&i32> for i32
    Source§
    fn bitor_assign(&mut self, other: &i32)
    Performs the |= operation. Read more
    ","BitOrAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl BitOrAssign for i32
    Source§
    fn bitor_assign(&mut self, other: i32)
    Performs the |= operation. Read more
    ","BitOrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl BitXor<&i32> for i32
    Source§
    type Output = <i32 as BitXor>::Output
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: &i32) -> <i32 as BitXor>::Output
    Performs the ^ operation. Read more
    ","BitXor<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl BitXor for i32
    Source§
    type Output = i32
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: i32) -> i32
    Performs the ^ operation. Read more
    ","BitXor","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl BitXorAssign<&i32> for i32
    Source§
    fn bitxor_assign(&mut self, other: &i32)
    Performs the ^= operation. Read more
    ","BitXorAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl BitXorAssign for i32
    Source§
    fn bitxor_assign(&mut self, other: i32)
    Performs the ^= operation. Read more
    ","BitXorAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl CarryingMulAdd for i32
    Source§
    type Unsigned = u32
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    Source§
    const fn carrying_mul_add(self, a: i32, b: i32, c: i32) -> (u32, i32)
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    ","CarryingMulAdd","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Clone for i32
    Source§
    fn clone(&self) -> i32
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    ","Clone","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Debug for i32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    §
    impl Decodable for i32
    §
    fn consensus_decode<R>(r: &mut R) -> Result<i32, Error>
    where\n    R: Read + ?Sized,
    Decode an object with a well-defined format. Read more
    §
    fn consensus_decode_from_finite_reader<R>(reader: &mut R) -> Result<Self, Error>
    where\n    R: Read + ?Sized,
    Decode Self from a size-limited reader. Read more
    ","Decodable","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Default for i32
    Source§
    fn default() -> i32
    Returns the default value of 0
    \n
    ","Default","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl<'de> Deserialize<'de> for i32
    Source§
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<i32, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Display for i32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Display","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Div<&i32> for i32
    Source§
    type Output = <i32 as Div>::Output
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: &i32) -> <i32 as Div>::Output
    Performs the / operation. Read more
    ","Div<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Div for i32
    This operation rounds towards zero, truncating any\nfractional part of the exact result.
    \n
    §Panics
    \n
    This operation will panic if other == 0 or the division results in overflow.
    \n
    Source§
    type Output = i32
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: i32) -> i32
    Performs the / operation. Read more
    ","Div","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl DivAssign<&i32> for i32
    Source§
    fn div_assign(&mut self, other: &i32)
    Performs the /= operation. Read more
    ","DivAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl DivAssign for i32
    Source§
    fn div_assign(&mut self, other: i32)
    Performs the /= operation. Read more
    ","DivAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    §
    impl Encodable for i32
    §
    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where\n    W: Write + ?Sized,
    Encodes an object with a well-defined format. Read more
    ","Encodable","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    §
    impl<O> From<I16<O>> for i32
    where\n    O: ByteOrder,
    §
    fn from(x: I16<O>) -> i32
    Converts to this type from the input type.
    ","From>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    §
    impl<O> From<I32<O>> for i32
    where\n    O: ByteOrder,
    §
    fn from(x: I32<O>) -> i32
    Converts to this type from the input type.
    ","From>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    §
    impl From<Parity> for i32
    The conversion returns 0 for even parity and 1 for odd.
    \n
    §
    fn from(parity: Parity) -> i32
    Converts to this type from the input type.
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.28.0 · Source§
    impl From<bool> for i32
    Source§
    fn from(small: bool) -> i32
    Converts a bool to i32 losslessly.\nThe resulting value is 0 for false and 1 for true values.
    \n
    §Examples
    \n
    assert_eq!(i32::from(true), 1);\nassert_eq!(i32::from(false), 0);
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.5.0 · Source§
    impl From<i16> for i32
    Source§
    fn from(small: i16) -> i32
    Converts i16 to i32 losslessly.
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.5.0 · Source§
    impl From<i8> for i32
    Source§
    fn from(small: i8) -> i32
    Converts i8 to i32 losslessly.
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.5.0 · Source§
    impl From<u16> for i32
    Source§
    fn from(small: u16) -> i32
    Converts u16 to i32 losslessly.
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.5.0 · Source§
    impl From<u8> for i32
    Source§
    fn from(small: u8) -> i32
    Converts u8 to i32 losslessly.
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl FromStr for i32
    Source§
    type Err = ParseIntError
    The associated error which can be returned from parsing.
    Source§
    fn from_str(src: &str) -> Result<i32, ParseIntError>
    Parses a string s to return a value of this type. Read more
    ","FromStr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Hash for i32
    Source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    Source§
    fn hash_slice<H>(data: &[i32], state: &mut H)
    where\n    H: Hasher,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl<'de, E> IntoDeserializer<'de, E> for i32
    where\n    E: Error,
    Source§
    type Deserializer = I32Deserializer<E>
    The type of the deserializer being converted into.
    Source§
    fn into_deserializer(self) -> I32Deserializer<E>
    Convert this value into a deserializer.
    ","IntoDeserializer<'de, E>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.42.0 · Source§
    impl LowerExp for i32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerExp","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl LowerHex for i32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerHex","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Mul<&i32> for i32
    Source§
    type Output = <i32 as Mul>::Output
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: &i32) -> <i32 as Mul>::Output
    Performs the * operation. Read more
    ","Mul<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Mul for i32
    Source§
    type Output = i32
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: i32) -> i32
    Performs the * operation. Read more
    ","Mul","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl MulAssign<&i32> for i32
    Source§
    fn mul_assign(&mut self, other: &i32)
    Performs the *= operation. Read more
    ","MulAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl MulAssign for i32
    Source§
    fn mul_assign(&mut self, other: i32)
    Performs the *= operation. Read more
    ","MulAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Neg for i32
    Source§
    type Output = i32
    The resulting type after applying the - operator.
    Source§
    fn neg(self) -> i32
    Performs the unary - operation. Read more
    ","Neg","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Not for i32
    Source§
    type Output = i32
    The resulting type after applying the ! operator.
    Source§
    fn not(self) -> i32
    Performs the unary ! operation. Read more
    ","Not","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Octal for i32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Octal","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Ord for i32
    Source§
    fn cmp(&self, other: &i32) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl PartialEq for i32
    Source§
    fn eq(&self, other: &i32) -> bool
    Tests for self and other values to be equal, and is used by ==.
    Source§
    fn ne(&self, other: &i32) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl PartialOrd for i32
    Source§
    fn partial_cmp(&self, other: &i32) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    Source§
    fn lt(&self, other: &i32) -> bool
    Tests less than (for self and other) and is used by the < operator. Read more
    Source§
    fn le(&self, other: &i32) -> bool
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    Source§
    fn ge(&self, other: &i32) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    Source§
    fn gt(&self, other: &i32) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    ","PartialOrd","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.12.0 · Source§
    impl<'a> Product<&'a i32> for i32
    Source§
    fn product<I>(iter: I) -> i32
    where\n    I: Iterator<Item = &'a i32>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product<&'a i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.12.0 · Source§
    impl Product for i32
    Source§
    fn product<I>(iter: I) -> i32
    where\n    I: Iterator<Item = i32>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl Random for i32
    Source§
    fn random(source: &mut (impl RandomSource + ?Sized)) -> i32
    🔬This is a nightly-only experimental API. (random)
    Generates a random value.
    \n
    Warning: Be careful when manipulating the resulting value! This\nmethod samples according to a uniform distribution, so a value of 1 is\njust as likely as MAX. By using modulo operations, some\nvalues can become more likely than others. Use audited crates when in\ndoubt.
    \n
    ","Random","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Rem<&i32> for i32
    Source§
    type Output = <i32 as Rem>::Output
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: &i32) -> <i32 as Rem>::Output
    Performs the % operation. Read more
    ","Rem<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Rem for i32
    This operation satisfies n % d == n - (n / d) * d. The\nresult has the same sign as the left operand.
    \n
    §Panics
    \n
    This operation will panic if other == 0 or if self / other results in overflow.
    \n
    Source§
    type Output = i32
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: i32) -> i32
    Performs the % operation. Read more
    ","Rem","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl RemAssign<&i32> for i32
    Source§
    fn rem_assign(&mut self, other: &i32)
    Performs the %= operation. Read more
    ","RemAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl RemAssign for i32
    Source§
    fn rem_assign(&mut self, other: i32)
    Performs the %= operation. Read more
    ","RemAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl SampleUniform for i32
    Source§
    type Sampler = UniformInt<i32>
    The UniformSampler implementation supporting type X.
    ","SampleUniform","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl Serialize for i32
    Source§
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&i128> for i32
    Source§
    type Output = <i32 as Shl<i128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i128) -> <i32 as Shl<i128>>::Output
    Performs the << operation. Read more
    ","Shl<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&i16> for i32
    Source§
    type Output = <i32 as Shl<i16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i16) -> <i32 as Shl<i16>>::Output
    Performs the << operation. Read more
    ","Shl<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&i32> for i32
    Source§
    type Output = <i32 as Shl>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i32) -> <i32 as Shl>::Output
    Performs the << operation. Read more
    ","Shl<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&i64> for i32
    Source§
    type Output = <i32 as Shl<i64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i64) -> <i32 as Shl<i64>>::Output
    Performs the << operation. Read more
    ","Shl<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&i8> for i32
    Source§
    type Output = <i32 as Shl<i8>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i8) -> <i32 as Shl<i8>>::Output
    Performs the << operation. Read more
    ","Shl<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&isize> for i32
    Source§
    type Output = <i32 as Shl<isize>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &isize) -> <i32 as Shl<isize>>::Output
    Performs the << operation. Read more
    ","Shl<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&u128> for i32
    Source§
    type Output = <i32 as Shl<u128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u128) -> <i32 as Shl<u128>>::Output
    Performs the << operation. Read more
    ","Shl<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&u16> for i32
    Source§
    type Output = <i32 as Shl<u16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u16) -> <i32 as Shl<u16>>::Output
    Performs the << operation. Read more
    ","Shl<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&u32> for i32
    Source§
    type Output = <i32 as Shl<u32>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u32) -> <i32 as Shl<u32>>::Output
    Performs the << operation. Read more
    ","Shl<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&u64> for i32
    Source§
    type Output = <i32 as Shl<u64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u64) -> <i32 as Shl<u64>>::Output
    Performs the << operation. Read more
    ","Shl<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&u8> for i32
    Source§
    type Output = <i32 as Shl<u8>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u8) -> <i32 as Shl<u8>>::Output
    Performs the << operation. Read more
    ","Shl<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&usize> for i32
    Source§
    type Output = <i32 as Shl<usize>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &usize) -> <i32 as Shl<usize>>::Output
    Performs the << operation. Read more
    ","Shl<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<i128> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i128) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<i16> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i16) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<i64> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i64) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<i8> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i8) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<isize> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: isize) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<u128> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u128) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<u16> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u16) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<u32> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u32) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<u64> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u64) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<u8> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u8) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<usize> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: usize) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i32) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&i128> for i32
    Source§
    fn shl_assign(&mut self, other: &i128)
    Performs the <<= operation. Read more
    ","ShlAssign<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&i16> for i32
    Source§
    fn shl_assign(&mut self, other: &i16)
    Performs the <<= operation. Read more
    ","ShlAssign<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&i32> for i32
    Source§
    fn shl_assign(&mut self, other: &i32)
    Performs the <<= operation. Read more
    ","ShlAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&i64> for i32
    Source§
    fn shl_assign(&mut self, other: &i64)
    Performs the <<= operation. Read more
    ","ShlAssign<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&i8> for i32
    Source§
    fn shl_assign(&mut self, other: &i8)
    Performs the <<= operation. Read more
    ","ShlAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&isize> for i32
    Source§
    fn shl_assign(&mut self, other: &isize)
    Performs the <<= operation. Read more
    ","ShlAssign<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&u128> for i32
    Source§
    fn shl_assign(&mut self, other: &u128)
    Performs the <<= operation. Read more
    ","ShlAssign<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&u16> for i32
    Source§
    fn shl_assign(&mut self, other: &u16)
    Performs the <<= operation. Read more
    ","ShlAssign<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&u32> for i32
    Source§
    fn shl_assign(&mut self, other: &u32)
    Performs the <<= operation. Read more
    ","ShlAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&u64> for i32
    Source§
    fn shl_assign(&mut self, other: &u64)
    Performs the <<= operation. Read more
    ","ShlAssign<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&u8> for i32
    Source§
    fn shl_assign(&mut self, other: &u8)
    Performs the <<= operation. Read more
    ","ShlAssign<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&usize> for i32
    Source§
    fn shl_assign(&mut self, other: &usize)
    Performs the <<= operation. Read more
    ","ShlAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<i128> for i32
    Source§
    fn shl_assign(&mut self, other: i128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<i16> for i32
    Source§
    fn shl_assign(&mut self, other: i16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<i64> for i32
    Source§
    fn shl_assign(&mut self, other: i64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<i8> for i32
    Source§
    fn shl_assign(&mut self, other: i8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<isize> for i32
    Source§
    fn shl_assign(&mut self, other: isize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<u128> for i32
    Source§
    fn shl_assign(&mut self, other: u128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<u16> for i32
    Source§
    fn shl_assign(&mut self, other: u16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<u32> for i32
    Source§
    fn shl_assign(&mut self, other: u32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<u64> for i32
    Source§
    fn shl_assign(&mut self, other: u64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<u8> for i32
    Source§
    fn shl_assign(&mut self, other: u8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<usize> for i32
    Source§
    fn shl_assign(&mut self, other: usize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign for i32
    Source§
    fn shl_assign(&mut self, other: i32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&i128> for i32
    Source§
    type Output = <i32 as Shr<i128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i128) -> <i32 as Shr<i128>>::Output
    Performs the >> operation. Read more
    ","Shr<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&i16> for i32
    Source§
    type Output = <i32 as Shr<i16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i16) -> <i32 as Shr<i16>>::Output
    Performs the >> operation. Read more
    ","Shr<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&i32> for i32
    Source§
    type Output = <i32 as Shr>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i32) -> <i32 as Shr>::Output
    Performs the >> operation. Read more
    ","Shr<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&i64> for i32
    Source§
    type Output = <i32 as Shr<i64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i64) -> <i32 as Shr<i64>>::Output
    Performs the >> operation. Read more
    ","Shr<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&i8> for i32
    Source§
    type Output = <i32 as Shr<i8>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i8) -> <i32 as Shr<i8>>::Output
    Performs the >> operation. Read more
    ","Shr<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&isize> for i32
    Source§
    type Output = <i32 as Shr<isize>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &isize) -> <i32 as Shr<isize>>::Output
    Performs the >> operation. Read more
    ","Shr<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&u128> for i32
    Source§
    type Output = <i32 as Shr<u128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u128) -> <i32 as Shr<u128>>::Output
    Performs the >> operation. Read more
    ","Shr<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&u16> for i32
    Source§
    type Output = <i32 as Shr<u16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u16) -> <i32 as Shr<u16>>::Output
    Performs the >> operation. Read more
    ","Shr<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&u32> for i32
    Source§
    type Output = <i32 as Shr<u32>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u32) -> <i32 as Shr<u32>>::Output
    Performs the >> operation. Read more
    ","Shr<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&u64> for i32
    Source§
    type Output = <i32 as Shr<u64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u64) -> <i32 as Shr<u64>>::Output
    Performs the >> operation. Read more
    ","Shr<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&u8> for i32
    Source§
    type Output = <i32 as Shr<u8>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u8) -> <i32 as Shr<u8>>::Output
    Performs the >> operation. Read more
    ","Shr<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&usize> for i32
    Source§
    type Output = <i32 as Shr<usize>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &usize) -> <i32 as Shr<usize>>::Output
    Performs the >> operation. Read more
    ","Shr<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<i128> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i128) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<i16> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i16) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<i64> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i64) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<i8> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i8) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<isize> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: isize) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<u128> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u128) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<u16> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u16) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<u32> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u32) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<u64> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u64) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<u8> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u8) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<usize> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: usize) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i32) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&i128> for i32
    Source§
    fn shr_assign(&mut self, other: &i128)
    Performs the >>= operation. Read more
    ","ShrAssign<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&i16> for i32
    Source§
    fn shr_assign(&mut self, other: &i16)
    Performs the >>= operation. Read more
    ","ShrAssign<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&i32> for i32
    Source§
    fn shr_assign(&mut self, other: &i32)
    Performs the >>= operation. Read more
    ","ShrAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&i64> for i32
    Source§
    fn shr_assign(&mut self, other: &i64)
    Performs the >>= operation. Read more
    ","ShrAssign<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&i8> for i32
    Source§
    fn shr_assign(&mut self, other: &i8)
    Performs the >>= operation. Read more
    ","ShrAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&isize> for i32
    Source§
    fn shr_assign(&mut self, other: &isize)
    Performs the >>= operation. Read more
    ","ShrAssign<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&u128> for i32
    Source§
    fn shr_assign(&mut self, other: &u128)
    Performs the >>= operation. Read more
    ","ShrAssign<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&u16> for i32
    Source§
    fn shr_assign(&mut self, other: &u16)
    Performs the >>= operation. Read more
    ","ShrAssign<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&u32> for i32
    Source§
    fn shr_assign(&mut self, other: &u32)
    Performs the >>= operation. Read more
    ","ShrAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&u64> for i32
    Source§
    fn shr_assign(&mut self, other: &u64)
    Performs the >>= operation. Read more
    ","ShrAssign<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&u8> for i32
    Source§
    fn shr_assign(&mut self, other: &u8)
    Performs the >>= operation. Read more
    ","ShrAssign<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&usize> for i32
    Source§
    fn shr_assign(&mut self, other: &usize)
    Performs the >>= operation. Read more
    ","ShrAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<i128> for i32
    Source§
    fn shr_assign(&mut self, other: i128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<i16> for i32
    Source§
    fn shr_assign(&mut self, other: i16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<i64> for i32
    Source§
    fn shr_assign(&mut self, other: i64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<i8> for i32
    Source§
    fn shr_assign(&mut self, other: i8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<isize> for i32
    Source§
    fn shr_assign(&mut self, other: isize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<u128> for i32
    Source§
    fn shr_assign(&mut self, other: u128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<u16> for i32
    Source§
    fn shr_assign(&mut self, other: u16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<u32> for i32
    Source§
    fn shr_assign(&mut self, other: u32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<u64> for i32
    Source§
    fn shr_assign(&mut self, other: u64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<u8> for i32
    Source§
    fn shr_assign(&mut self, other: u8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<usize> for i32
    Source§
    fn shr_assign(&mut self, other: usize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign for i32
    Source§
    fn shr_assign(&mut self, other: i32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl SimdElement for i32
    Source§
    type Mask = i32
    🔬This is a nightly-only experimental API. (portable_simd)
    The mask element type corresponding to this element type.
    ","SimdElement","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl Step for i32
    Source§
    fn forward(start: i32, n: usize) -> i32
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward(start: i32, n: usize) -> i32
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    unsafe fn forward_unchecked(start: i32, n: usize) -> i32
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    unsafe fn backward_unchecked(start: i32, n: usize) -> i32
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    fn steps_between(start: &i32, end: &i32) -> (usize, Option<usize>)
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the bounds on the number of successor steps required to get from start to end\nlike Iterator::size_hint(). Read more
    Source§
    fn forward_checked(start: i32, n: usize) -> Option<i32>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward_checked(start: i32, n: usize) -> Option<i32>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    ","Step","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Sub<&i32> for i32
    Source§
    type Output = <i32 as Sub>::Output
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: &i32) -> <i32 as Sub>::Output
    Performs the - operation. Read more
    ","Sub<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Sub for i32
    Source§
    type Output = i32
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: i32) -> i32
    Performs the - operation. Read more
    ","Sub","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl SubAssign<&i32> for i32
    Source§
    fn sub_assign(&mut self, other: &i32)
    Performs the -= operation. Read more
    ","SubAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl SubAssign for i32
    Source§
    fn sub_assign(&mut self, other: i32)
    Performs the -= operation. Read more
    ","SubAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.12.0 · Source§
    impl<'a> Sum<&'a i32> for i32
    Source§
    fn sum<I>(iter: I) -> i32
    where\n    I: Iterator<Item = &'a i32>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum<&'a i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.12.0 · Source§
    impl Sum for i32
    Source§
    fn sum<I>(iter: I) -> i32
    where\n    I: Iterator<Item = i32>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.34.0 · Source§
    impl TryFrom<i128> for i32
    Source§
    fn try_from(u: i128) -> Result<i32, <i32 as TryFrom<i128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.34.0 · Source§
    impl TryFrom<i64> for i32
    Source§
    fn try_from(u: i64) -> Result<i32, <i32 as TryFrom<i64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.34.0 · Source§
    impl TryFrom<isize> for i32
    Source§
    fn try_from(u: isize) -> Result<i32, <i32 as TryFrom<isize>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.34.0 · Source§
    impl TryFrom<u128> for i32
    Source§
    fn try_from(u: u128) -> Result<i32, <i32 as TryFrom<u128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.34.0 · Source§
    impl TryFrom<u32> for i32
    Source§
    fn try_from(u: u32) -> Result<i32, <i32 as TryFrom<u32>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.34.0 · Source§
    impl TryFrom<u64> for i32
    Source§
    fn try_from(u: u64) -> Result<i32, <i32 as TryFrom<u64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.34.0 · Source§
    impl TryFrom<usize> for i32
    Source§
    fn try_from(u: usize) -> Result<i32, <i32 as TryFrom<usize>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.42.0 · Source§
    impl UpperExp for i32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperExp","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl UpperHex for i32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperHex","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl ConstParamTy_ for i32
    ","ConstParamTy_","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Copy for i32
    ","Copy","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Eq for i32
    ","Eq","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl MaskElement for i32
    ","MaskElement","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl SimdCast for i32
    ","SimdCast","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl StructuralPartialEq for i32
    ","StructuralPartialEq","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl TrustedStep for i32
    ","TrustedStep","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl UnsizedConstParamTy for i32
    ","UnsizedConstParamTy","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl Weight for i32
    ","Weight","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl ZeroablePrimitive for i32
    ","ZeroablePrimitive","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"]]]]);
+    var type_impls = Object.fromEntries([["bdk_chain",[["
    1.0.0 · Source§
    impl Add<&i32> for i32
    Source§
    type Output = <i32 as Add>::Output
    The resulting type after applying the + operator.
    Source§
    fn add(self, other: &i32) -> <i32 as Add>::Output
    Performs the + operation. Read more
    ","Add<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Add for i32
    Source§
    type Output = i32
    The resulting type after applying the + operator.
    Source§
    const fn add(self, other: i32) -> i32
    Performs the + operation. Read more
    ","Add","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl AddAssign<&i32> for i32
    Source§
    fn add_assign(&mut self, other: &i32)
    Performs the += operation. Read more
    ","AddAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl AddAssign for i32
    Source§
    fn add_assign(&mut self, other: i32)
    Performs the += operation. Read more
    ","AddAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Binary for i32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Binary","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl BitAnd<&i32> for i32
    Source§
    type Output = <i32 as BitAnd>::Output
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, other: &i32) -> <i32 as BitAnd>::Output
    Performs the & operation. Read more
    ","BitAnd<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl BitAnd for i32
    Source§
    type Output = i32
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, rhs: i32) -> i32
    Performs the & operation. Read more
    ","BitAnd","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl BitAndAssign<&i32> for i32
    Source§
    fn bitand_assign(&mut self, other: &i32)
    Performs the &= operation. Read more
    ","BitAndAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl BitAndAssign for i32
    Source§
    fn bitand_assign(&mut self, other: i32)
    Performs the &= operation. Read more
    ","BitAndAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl BitOr<&i32> for i32
    Source§
    type Output = <i32 as BitOr>::Output
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, other: &i32) -> <i32 as BitOr>::Output
    Performs the | operation. Read more
    ","BitOr<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl BitOr for i32
    Source§
    type Output = i32
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, rhs: i32) -> i32
    Performs the | operation. Read more
    ","BitOr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl BitOrAssign<&i32> for i32
    Source§
    fn bitor_assign(&mut self, other: &i32)
    Performs the |= operation. Read more
    ","BitOrAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl BitOrAssign for i32
    Source§
    fn bitor_assign(&mut self, other: i32)
    Performs the |= operation. Read more
    ","BitOrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl BitXor<&i32> for i32
    Source§
    type Output = <i32 as BitXor>::Output
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: &i32) -> <i32 as BitXor>::Output
    Performs the ^ operation. Read more
    ","BitXor<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl BitXor for i32
    Source§
    type Output = i32
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: i32) -> i32
    Performs the ^ operation. Read more
    ","BitXor","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl BitXorAssign<&i32> for i32
    Source§
    fn bitxor_assign(&mut self, other: &i32)
    Performs the ^= operation. Read more
    ","BitXorAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl BitXorAssign for i32
    Source§
    fn bitxor_assign(&mut self, other: i32)
    Performs the ^= operation. Read more
    ","BitXorAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl CarryingMulAdd for i32
    Source§
    type Unsigned = u32
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    Source§
    const fn carrying_mul_add(self, a: i32, b: i32, c: i32) -> (u32, i32)
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    ","CarryingMulAdd","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Clone for i32
    Source§
    fn clone(&self) -> i32
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    ","Clone","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Debug for i32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    §
    impl Decodable for i32
    §
    fn consensus_decode<R>(r: &mut R) -> Result<i32, Error>
    where\n    R: Read + ?Sized,
    Decode an object with a well-defined format. Read more
    §
    fn consensus_decode_from_finite_reader<R>(reader: &mut R) -> Result<Self, Error>
    where\n    R: Read + ?Sized,
    Decode Self from a size-limited reader. Read more
    ","Decodable","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Default for i32
    Source§
    fn default() -> i32
    Returns the default value of 0
    \n
    ","Default","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl<'de> Deserialize<'de> for i32
    Source§
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<i32, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Display for i32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Display","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Div<&i32> for i32
    Source§
    type Output = <i32 as Div>::Output
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: &i32) -> <i32 as Div>::Output
    Performs the / operation. Read more
    ","Div<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Div for i32
    This operation rounds towards zero, truncating any\nfractional part of the exact result.
    \n
    §Panics
    \n
    This operation will panic if other == 0 or the division results in overflow.
    \n
    Source§
    type Output = i32
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: i32) -> i32
    Performs the / operation. Read more
    ","Div","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl DivAssign<&i32> for i32
    Source§
    fn div_assign(&mut self, other: &i32)
    Performs the /= operation. Read more
    ","DivAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl DivAssign for i32
    Source§
    fn div_assign(&mut self, other: i32)
    Performs the /= operation. Read more
    ","DivAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    §
    impl Encodable for i32
    §
    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where\n    W: Write + ?Sized,
    Encodes an object with a well-defined format. Read more
    ","Encodable","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    §
    impl<O> From<I16<O>> for i32
    where\n    O: ByteOrder,
    §
    fn from(x: I16<O>) -> i32
    Converts to this type from the input type.
    ","From>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    §
    impl<O> From<I32<O>> for i32
    where\n    O: ByteOrder,
    §
    fn from(x: I32<O>) -> i32
    Converts to this type from the input type.
    ","From>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    §
    impl From<Parity> for i32
    The conversion returns 0 for even parity and 1 for odd.
    \n
    §
    fn from(parity: Parity) -> i32
    Converts to this type from the input type.
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.28.0 · Source§
    impl From<bool> for i32
    Source§
    fn from(small: bool) -> i32
    Converts a bool to i32 losslessly.\nThe resulting value is 0 for false and 1 for true values.
    \n
    §Examples
    \n
    assert_eq!(i32::from(true), 1);\nassert_eq!(i32::from(false), 0);
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.5.0 · Source§
    impl From<i16> for i32
    Source§
    fn from(small: i16) -> i32
    Converts i16 to i32 losslessly.
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.5.0 · Source§
    impl From<i8> for i32
    Source§
    fn from(small: i8) -> i32
    Converts i8 to i32 losslessly.
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.5.0 · Source§
    impl From<u16> for i32
    Source§
    fn from(small: u16) -> i32
    Converts u16 to i32 losslessly.
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.5.0 · Source§
    impl From<u8> for i32
    Source§
    fn from(small: u8) -> i32
    Converts u8 to i32 losslessly.
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl FromStr for i32
    Source§
    type Err = ParseIntError
    The associated error which can be returned from parsing.
    Source§
    fn from_str(src: &str) -> Result<i32, ParseIntError>
    Parses a string s to return a value of this type. Read more
    ","FromStr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Hash for i32
    Source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    Source§
    fn hash_slice<H>(data: &[i32], state: &mut H)
    where\n    H: Hasher,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl<'de, E> IntoDeserializer<'de, E> for i32
    where\n    E: Error,
    Source§
    type Deserializer = I32Deserializer<E>
    The type of the deserializer being converted into.
    Source§
    fn into_deserializer(self) -> I32Deserializer<E>
    Convert this value into a deserializer.
    ","IntoDeserializer<'de, E>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.42.0 · Source§
    impl LowerExp for i32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerExp","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl LowerHex for i32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerHex","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Mul<&i32> for i32
    Source§
    type Output = <i32 as Mul>::Output
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: &i32) -> <i32 as Mul>::Output
    Performs the * operation. Read more
    ","Mul<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Mul for i32
    Source§
    type Output = i32
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: i32) -> i32
    Performs the * operation. Read more
    ","Mul","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl MulAssign<&i32> for i32
    Source§
    fn mul_assign(&mut self, other: &i32)
    Performs the *= operation. Read more
    ","MulAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl MulAssign for i32
    Source§
    fn mul_assign(&mut self, other: i32)
    Performs the *= operation. Read more
    ","MulAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Neg for i32
    Source§
    type Output = i32
    The resulting type after applying the - operator.
    Source§
    fn neg(self) -> i32
    Performs the unary - operation. Read more
    ","Neg","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Not for i32
    Source§
    type Output = i32
    The resulting type after applying the ! operator.
    Source§
    fn not(self) -> i32
    Performs the unary ! operation. Read more
    ","Not","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Octal for i32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Octal","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Ord for i32
    Source§
    fn cmp(&self, other: &i32) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl PartialEq for i32
    Source§
    fn eq(&self, other: &i32) -> bool
    Tests for self and other values to be equal, and is used by ==.
    Source§
    fn ne(&self, other: &i32) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl PartialOrd for i32
    Source§
    fn partial_cmp(&self, other: &i32) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    Source§
    fn lt(&self, other: &i32) -> bool
    Tests less than (for self and other) and is used by the < operator. Read more
    Source§
    fn le(&self, other: &i32) -> bool
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    Source§
    fn ge(&self, other: &i32) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    Source§
    fn gt(&self, other: &i32) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    ","PartialOrd","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.12.0 · Source§
    impl<'a> Product<&'a i32> for i32
    Source§
    fn product<I>(iter: I) -> i32
    where\n    I: Iterator<Item = &'a i32>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product<&'a i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.12.0 · Source§
    impl Product for i32
    Source§
    fn product<I>(iter: I) -> i32
    where\n    I: Iterator<Item = i32>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl Random for i32
    Source§
    fn random(source: &mut (impl RandomSource + ?Sized)) -> i32
    🔬This is a nightly-only experimental API. (random)
    Generates a random value.
    \n
    Warning: Be careful when manipulating the resulting value! This\nmethod samples according to a uniform distribution, so a value of 1 is\njust as likely as MAX. By using modulo operations, some\nvalues can become more likely than others. Use audited crates when in\ndoubt.
    \n
    ","Random","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Rem<&i32> for i32
    Source§
    type Output = <i32 as Rem>::Output
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: &i32) -> <i32 as Rem>::Output
    Performs the % operation. Read more
    ","Rem<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Rem for i32
    This operation satisfies n % d == n - (n / d) * d. The\nresult has the same sign as the left operand.
    \n
    §Panics
    \n
    This operation will panic if other == 0 or if self / other results in overflow.
    \n
    Source§
    type Output = i32
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: i32) -> i32
    Performs the % operation. Read more
    ","Rem","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl RemAssign<&i32> for i32
    Source§
    fn rem_assign(&mut self, other: &i32)
    Performs the %= operation. Read more
    ","RemAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl RemAssign for i32
    Source§
    fn rem_assign(&mut self, other: i32)
    Performs the %= operation. Read more
    ","RemAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl SampleUniform for i32
    Source§
    type Sampler = UniformInt<i32>
    The UniformSampler implementation supporting type X.
    ","SampleUniform","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl Serialize for i32
    Source§
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&i128> for i32
    Source§
    type Output = <i32 as Shl<i128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i128) -> <i32 as Shl<i128>>::Output
    Performs the << operation. Read more
    ","Shl<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&i16> for i32
    Source§
    type Output = <i32 as Shl<i16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i16) -> <i32 as Shl<i16>>::Output
    Performs the << operation. Read more
    ","Shl<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&i32> for i32
    Source§
    type Output = <i32 as Shl>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i32) -> <i32 as Shl>::Output
    Performs the << operation. Read more
    ","Shl<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&i64> for i32
    Source§
    type Output = <i32 as Shl<i64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i64) -> <i32 as Shl<i64>>::Output
    Performs the << operation. Read more
    ","Shl<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&i8> for i32
    Source§
    type Output = <i32 as Shl<i8>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i8) -> <i32 as Shl<i8>>::Output
    Performs the << operation. Read more
    ","Shl<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&isize> for i32
    Source§
    type Output = <i32 as Shl<isize>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &isize) -> <i32 as Shl<isize>>::Output
    Performs the << operation. Read more
    ","Shl<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&u128> for i32
    Source§
    type Output = <i32 as Shl<u128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u128) -> <i32 as Shl<u128>>::Output
    Performs the << operation. Read more
    ","Shl<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&u16> for i32
    Source§
    type Output = <i32 as Shl<u16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u16) -> <i32 as Shl<u16>>::Output
    Performs the << operation. Read more
    ","Shl<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&u32> for i32
    Source§
    type Output = <i32 as Shl<u32>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u32) -> <i32 as Shl<u32>>::Output
    Performs the << operation. Read more
    ","Shl<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&u64> for i32
    Source§
    type Output = <i32 as Shl<u64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u64) -> <i32 as Shl<u64>>::Output
    Performs the << operation. Read more
    ","Shl<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&u8> for i32
    Source§
    type Output = <i32 as Shl<u8>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u8) -> <i32 as Shl<u8>>::Output
    Performs the << operation. Read more
    ","Shl<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<&usize> for i32
    Source§
    type Output = <i32 as Shl<usize>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &usize) -> <i32 as Shl<usize>>::Output
    Performs the << operation. Read more
    ","Shl<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<i128> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i128) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<i16> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i16) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<i64> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i64) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<i8> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i8) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<isize> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: isize) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<u128> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u128) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<u16> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u16) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<u32> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u32) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<u64> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u64) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<u8> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u8) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl<usize> for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: usize) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shl for i32
    Source§
    type Output = i32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i32) -> i32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&i128> for i32
    Source§
    fn shl_assign(&mut self, other: &i128)
    Performs the <<= operation. Read more
    ","ShlAssign<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&i16> for i32
    Source§
    fn shl_assign(&mut self, other: &i16)
    Performs the <<= operation. Read more
    ","ShlAssign<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&i32> for i32
    Source§
    fn shl_assign(&mut self, other: &i32)
    Performs the <<= operation. Read more
    ","ShlAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&i64> for i32
    Source§
    fn shl_assign(&mut self, other: &i64)
    Performs the <<= operation. Read more
    ","ShlAssign<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&i8> for i32
    Source§
    fn shl_assign(&mut self, other: &i8)
    Performs the <<= operation. Read more
    ","ShlAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&isize> for i32
    Source§
    fn shl_assign(&mut self, other: &isize)
    Performs the <<= operation. Read more
    ","ShlAssign<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&u128> for i32
    Source§
    fn shl_assign(&mut self, other: &u128)
    Performs the <<= operation. Read more
    ","ShlAssign<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&u16> for i32
    Source§
    fn shl_assign(&mut self, other: &u16)
    Performs the <<= operation. Read more
    ","ShlAssign<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&u32> for i32
    Source§
    fn shl_assign(&mut self, other: &u32)
    Performs the <<= operation. Read more
    ","ShlAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&u64> for i32
    Source§
    fn shl_assign(&mut self, other: &u64)
    Performs the <<= operation. Read more
    ","ShlAssign<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&u8> for i32
    Source§
    fn shl_assign(&mut self, other: &u8)
    Performs the <<= operation. Read more
    ","ShlAssign<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShlAssign<&usize> for i32
    Source§
    fn shl_assign(&mut self, other: &usize)
    Performs the <<= operation. Read more
    ","ShlAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<i128> for i32
    Source§
    fn shl_assign(&mut self, other: i128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<i16> for i32
    Source§
    fn shl_assign(&mut self, other: i16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<i64> for i32
    Source§
    fn shl_assign(&mut self, other: i64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<i8> for i32
    Source§
    fn shl_assign(&mut self, other: i8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<isize> for i32
    Source§
    fn shl_assign(&mut self, other: isize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<u128> for i32
    Source§
    fn shl_assign(&mut self, other: u128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<u16> for i32
    Source§
    fn shl_assign(&mut self, other: u16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<u32> for i32
    Source§
    fn shl_assign(&mut self, other: u32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<u64> for i32
    Source§
    fn shl_assign(&mut self, other: u64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<u8> for i32
    Source§
    fn shl_assign(&mut self, other: u8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign<usize> for i32
    Source§
    fn shl_assign(&mut self, other: usize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShlAssign for i32
    Source§
    fn shl_assign(&mut self, other: i32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&i128> for i32
    Source§
    type Output = <i32 as Shr<i128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i128) -> <i32 as Shr<i128>>::Output
    Performs the >> operation. Read more
    ","Shr<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&i16> for i32
    Source§
    type Output = <i32 as Shr<i16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i16) -> <i32 as Shr<i16>>::Output
    Performs the >> operation. Read more
    ","Shr<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&i32> for i32
    Source§
    type Output = <i32 as Shr>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i32) -> <i32 as Shr>::Output
    Performs the >> operation. Read more
    ","Shr<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&i64> for i32
    Source§
    type Output = <i32 as Shr<i64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i64) -> <i32 as Shr<i64>>::Output
    Performs the >> operation. Read more
    ","Shr<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&i8> for i32
    Source§
    type Output = <i32 as Shr<i8>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i8) -> <i32 as Shr<i8>>::Output
    Performs the >> operation. Read more
    ","Shr<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&isize> for i32
    Source§
    type Output = <i32 as Shr<isize>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &isize) -> <i32 as Shr<isize>>::Output
    Performs the >> operation. Read more
    ","Shr<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&u128> for i32
    Source§
    type Output = <i32 as Shr<u128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u128) -> <i32 as Shr<u128>>::Output
    Performs the >> operation. Read more
    ","Shr<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&u16> for i32
    Source§
    type Output = <i32 as Shr<u16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u16) -> <i32 as Shr<u16>>::Output
    Performs the >> operation. Read more
    ","Shr<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&u32> for i32
    Source§
    type Output = <i32 as Shr<u32>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u32) -> <i32 as Shr<u32>>::Output
    Performs the >> operation. Read more
    ","Shr<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&u64> for i32
    Source§
    type Output = <i32 as Shr<u64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u64) -> <i32 as Shr<u64>>::Output
    Performs the >> operation. Read more
    ","Shr<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&u8> for i32
    Source§
    type Output = <i32 as Shr<u8>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u8) -> <i32 as Shr<u8>>::Output
    Performs the >> operation. Read more
    ","Shr<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<&usize> for i32
    Source§
    type Output = <i32 as Shr<usize>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &usize) -> <i32 as Shr<usize>>::Output
    Performs the >> operation. Read more
    ","Shr<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<i128> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i128) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<i16> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i16) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<i64> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i64) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<i8> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i8) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<isize> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: isize) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<u128> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u128) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<u16> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u16) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<u32> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u32) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<u64> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u64) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<u8> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u8) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr<usize> for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: usize) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Shr for i32
    Source§
    type Output = i32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i32) -> i32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&i128> for i32
    Source§
    fn shr_assign(&mut self, other: &i128)
    Performs the >>= operation. Read more
    ","ShrAssign<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&i16> for i32
    Source§
    fn shr_assign(&mut self, other: &i16)
    Performs the >>= operation. Read more
    ","ShrAssign<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&i32> for i32
    Source§
    fn shr_assign(&mut self, other: &i32)
    Performs the >>= operation. Read more
    ","ShrAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&i64> for i32
    Source§
    fn shr_assign(&mut self, other: &i64)
    Performs the >>= operation. Read more
    ","ShrAssign<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&i8> for i32
    Source§
    fn shr_assign(&mut self, other: &i8)
    Performs the >>= operation. Read more
    ","ShrAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&isize> for i32
    Source§
    fn shr_assign(&mut self, other: &isize)
    Performs the >>= operation. Read more
    ","ShrAssign<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&u128> for i32
    Source§
    fn shr_assign(&mut self, other: &u128)
    Performs the >>= operation. Read more
    ","ShrAssign<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&u16> for i32
    Source§
    fn shr_assign(&mut self, other: &u16)
    Performs the >>= operation. Read more
    ","ShrAssign<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&u32> for i32
    Source§
    fn shr_assign(&mut self, other: &u32)
    Performs the >>= operation. Read more
    ","ShrAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&u64> for i32
    Source§
    fn shr_assign(&mut self, other: &u64)
    Performs the >>= operation. Read more
    ","ShrAssign<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&u8> for i32
    Source§
    fn shr_assign(&mut self, other: &u8)
    Performs the >>= operation. Read more
    ","ShrAssign<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl ShrAssign<&usize> for i32
    Source§
    fn shr_assign(&mut self, other: &usize)
    Performs the >>= operation. Read more
    ","ShrAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<i128> for i32
    Source§
    fn shr_assign(&mut self, other: i128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<i16> for i32
    Source§
    fn shr_assign(&mut self, other: i16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<i64> for i32
    Source§
    fn shr_assign(&mut self, other: i64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<i8> for i32
    Source§
    fn shr_assign(&mut self, other: i8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<isize> for i32
    Source§
    fn shr_assign(&mut self, other: isize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<u128> for i32
    Source§
    fn shr_assign(&mut self, other: u128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<u16> for i32
    Source§
    fn shr_assign(&mut self, other: u16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<u32> for i32
    Source§
    fn shr_assign(&mut self, other: u32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<u64> for i32
    Source§
    fn shr_assign(&mut self, other: u64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<u8> for i32
    Source§
    fn shr_assign(&mut self, other: u8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign<usize> for i32
    Source§
    fn shr_assign(&mut self, other: usize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl ShrAssign for i32
    Source§
    fn shr_assign(&mut self, other: i32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl SimdElement for i32
    Source§
    type Mask = i32
    🔬This is a nightly-only experimental API. (portable_simd)
    The mask element type corresponding to this element type.
    ","SimdElement","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl Step for i32
    Source§
    fn forward(start: i32, n: usize) -> i32
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward(start: i32, n: usize) -> i32
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    unsafe fn forward_unchecked(start: i32, n: usize) -> i32
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    unsafe fn backward_unchecked(start: i32, n: usize) -> i32
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    fn steps_between(start: &i32, end: &i32) -> (usize, Option<usize>)
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the bounds on the number of successor steps required to get from start to end\nlike Iterator::size_hint(). Read more
    Source§
    fn forward_checked(start: i32, n: usize) -> Option<i32>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward_checked(start: i32, n: usize) -> Option<i32>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    ","Step","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Sub<&i32> for i32
    Source§
    type Output = <i32 as Sub>::Output
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: &i32) -> <i32 as Sub>::Output
    Performs the - operation. Read more
    ","Sub<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Sub for i32
    Source§
    type Output = i32
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: i32) -> i32
    Performs the - operation. Read more
    ","Sub","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.22.0 · Source§
    impl SubAssign<&i32> for i32
    Source§
    fn sub_assign(&mut self, other: &i32)
    Performs the -= operation. Read more
    ","SubAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.8.0 · Source§
    impl SubAssign for i32
    Source§
    fn sub_assign(&mut self, other: i32)
    Performs the -= operation. Read more
    ","SubAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.12.0 · Source§
    impl<'a> Sum<&'a i32> for i32
    Source§
    fn sum<I>(iter: I) -> i32
    where\n    I: Iterator<Item = &'a i32>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum<&'a i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.12.0 · Source§
    impl Sum for i32
    Source§
    fn sum<I>(iter: I) -> i32
    where\n    I: Iterator<Item = i32>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.34.0 · Source§
    impl TryFrom<i128> for i32
    Source§
    fn try_from(u: i128) -> Result<i32, <i32 as TryFrom<i128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.34.0 · Source§
    impl TryFrom<i64> for i32
    Source§
    fn try_from(u: i64) -> Result<i32, <i32 as TryFrom<i64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.34.0 · Source§
    impl TryFrom<isize> for i32
    Source§
    fn try_from(u: isize) -> Result<i32, <i32 as TryFrom<isize>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.34.0 · Source§
    impl TryFrom<u128> for i32
    Source§
    fn try_from(u: u128) -> Result<i32, <i32 as TryFrom<u128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.34.0 · Source§
    impl TryFrom<u32> for i32
    Source§
    fn try_from(u: u32) -> Result<i32, <i32 as TryFrom<u32>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.34.0 · Source§
    impl TryFrom<u64> for i32
    Source§
    fn try_from(u: u64) -> Result<i32, <i32 as TryFrom<u64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.34.0 · Source§
    impl TryFrom<usize> for i32
    Source§
    fn try_from(u: usize) -> Result<i32, <i32 as TryFrom<usize>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.42.0 · Source§
    impl UpperExp for i32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperExp","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl UpperHex for i32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperHex","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl ConstParamTy_ for i32
    ","ConstParamTy_","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Copy for i32
    ","Copy","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    1.0.0 · Source§
    impl Eq for i32
    ","Eq","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl MaskElement for i32
    ","MaskElement","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl SimdCast for i32
    ","SimdCast","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl StructuralPartialEq for i32
    ","StructuralPartialEq","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl TrustedStep for i32
    ","TrustedStep","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl UnsizedConstParamTy for i32
    ","UnsizedConstParamTy","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl Weight for i32
    ","Weight","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"],["
    Source§
    impl ZeroablePrimitive for i32
    ","ZeroablePrimitive","bdk_chain::bitcoin::secp256k1::ffi::types::c_int"]]]]);
     if (window.register_type_impls) {
         window.register_type_impls(type_impls);
     } else {
         window.pending_type_impls = type_impls;
     }
 })()
-//{"start":55,"fragment_lengths":[411164]}
\ No newline at end of file
+//{"start":55,"fragment_lengths":[411163]}
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.i8.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.i8.js
index 81ecfdaac2..e1e6cc6e4e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.i8.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.i8.js
@@ -1,9 +1,9 @@
 (function() {
-    var type_impls = Object.fromEntries([["bdk_chain",[["
    1.0.0 · Source§
    impl Add<&i8> for i8
    Source§
    type Output = <i8 as Add>::Output
    The resulting type after applying the + operator.
    Source§
    fn add(self, other: &i8) -> <i8 as Add>::Output
    Performs the + operation. Read more
    ","Add<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Add for i8
    Source§
    type Output = i8
    The resulting type after applying the + operator.
    Source§
    const fn add(self, other: i8) -> i8
    Performs the + operation. Read more
    ","Add","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl AddAssign<&i8> for i8
    Source§
    fn add_assign(&mut self, other: &i8)
    Performs the += operation. Read more
    ","AddAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl AddAssign for i8
    Source§
    fn add_assign(&mut self, other: i8)
    Performs the += operation. Read more
    ","AddAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Binary for i8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Binary","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl BitAnd<&i8> for i8
    Source§
    type Output = <i8 as BitAnd>::Output
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, other: &i8) -> <i8 as BitAnd>::Output
    Performs the & operation. Read more
    ","BitAnd<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl BitAnd for i8
    Source§
    type Output = i8
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, rhs: i8) -> i8
    Performs the & operation. Read more
    ","BitAnd","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl BitAndAssign<&i8> for i8
    Source§
    fn bitand_assign(&mut self, other: &i8)
    Performs the &= operation. Read more
    ","BitAndAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl BitAndAssign for i8
    Source§
    fn bitand_assign(&mut self, other: i8)
    Performs the &= operation. Read more
    ","BitAndAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl BitOr<&i8> for i8
    Source§
    type Output = <i8 as BitOr>::Output
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, other: &i8) -> <i8 as BitOr>::Output
    Performs the | operation. Read more
    ","BitOr<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl BitOr for i8
    Source§
    type Output = i8
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, rhs: i8) -> i8
    Performs the | operation. Read more
    ","BitOr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl BitOrAssign<&i8> for i8
    Source§
    fn bitor_assign(&mut self, other: &i8)
    Performs the |= operation. Read more
    ","BitOrAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl BitOrAssign for i8
    Source§
    fn bitor_assign(&mut self, other: i8)
    Performs the |= operation. Read more
    ","BitOrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl BitXor<&i8> for i8
    Source§
    type Output = <i8 as BitXor>::Output
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: &i8) -> <i8 as BitXor>::Output
    Performs the ^ operation. Read more
    ","BitXor<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl BitXor for i8
    Source§
    type Output = i8
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: i8) -> i8
    Performs the ^ operation. Read more
    ","BitXor","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl BitXorAssign<&i8> for i8
    Source§
    fn bitxor_assign(&mut self, other: &i8)
    Performs the ^= operation. Read more
    ","BitXorAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl BitXorAssign for i8
    Source§
    fn bitxor_assign(&mut self, other: i8)
    Performs the ^= operation. Read more
    ","BitXorAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl CarryingMulAdd for i8
    Source§
    type Unsigned = u8
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    Source§
    const fn carrying_mul_add(self, a: i8, b: i8, c: i8) -> (u8, i8)
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    ","CarryingMulAdd","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Clone for i8
    Source§
    fn clone(&self) -> i8
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    ","Clone","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Debug for i8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    §
    impl Decodable for i8
    §
    fn consensus_decode<R>(r: &mut R) -> Result<i8, Error>
    where\n    R: Read + ?Sized,
    Decode an object with a well-defined format. Read more
    §
    fn consensus_decode_from_finite_reader<R>(reader: &mut R) -> Result<Self, Error>
    where\n    R: Read + ?Sized,
    Decode Self from a size-limited reader. Read more
    ","Decodable","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Default for i8
    Source§
    fn default() -> i8
    Returns the default value of 0
    \n
    ","Default","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl<'de> Deserialize<'de> for i8
    Source§
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<i8, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Display for i8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Display","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Div<&i8> for i8
    Source§
    type Output = <i8 as Div>::Output
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: &i8) -> <i8 as Div>::Output
    Performs the / operation. Read more
    ","Div<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Div for i8
    This operation rounds towards zero, truncating any\nfractional part of the exact result.
    \n
    §Panics
    \n
    This operation will panic if other == 0 or the division results in overflow.
    \n
    Source§
    type Output = i8
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: i8) -> i8
    Performs the / operation. Read more
    ","Div","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl DivAssign<&i8> for i8
    Source§
    fn div_assign(&mut self, other: &i8)
    Performs the /= operation. Read more
    ","DivAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl DivAssign for i8
    Source§
    fn div_assign(&mut self, other: i8)
    Performs the /= operation. Read more
    ","DivAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    §
    impl Encodable for i8
    §
    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where\n    W: Write + ?Sized,
    Encodes an object with a well-defined format. Read more
    ","Encodable","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.28.0 · Source§
    impl From<bool> for i8
    Source§
    fn from(small: bool) -> i8
    Converts a bool to i8 losslessly.\nThe resulting value is 0 for false and 1 for true values.
    \n
    §Examples
    \n
    assert_eq!(i8::from(true), 1);\nassert_eq!(i8::from(false), 0);
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl FromStr for i8
    Source§
    type Err = ParseIntError
    The associated error which can be returned from parsing.
    Source§
    fn from_str(src: &str) -> Result<i8, ParseIntError>
    Parses a string s to return a value of this type. Read more
    ","FromStr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Hash for i8
    Source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    Source§
    fn hash_slice<H>(data: &[i8], state: &mut H)
    where\n    H: Hasher,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl<'de, E> IntoDeserializer<'de, E> for i8
    where\n    E: Error,
    Source§
    type Deserializer = I8Deserializer<E>
    The type of the deserializer being converted into.
    Source§
    fn into_deserializer(self) -> I8Deserializer<E>
    Convert this value into a deserializer.
    ","IntoDeserializer<'de, E>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.42.0 · Source§
    impl LowerExp for i8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerExp","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl LowerHex for i8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerHex","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Mul<&i8> for i8
    Source§
    type Output = <i8 as Mul>::Output
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: &i8) -> <i8 as Mul>::Output
    Performs the * operation. Read more
    ","Mul<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Mul for i8
    Source§
    type Output = i8
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: i8) -> i8
    Performs the * operation. Read more
    ","Mul","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl MulAssign<&i8> for i8
    Source§
    fn mul_assign(&mut self, other: &i8)
    Performs the *= operation. Read more
    ","MulAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl MulAssign for i8
    Source§
    fn mul_assign(&mut self, other: i8)
    Performs the *= operation. Read more
    ","MulAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Neg for i8
    Source§
    type Output = i8
    The resulting type after applying the - operator.
    Source§
    fn neg(self) -> i8
    Performs the unary - operation. Read more
    ","Neg","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Not for i8
    Source§
    type Output = i8
    The resulting type after applying the ! operator.
    Source§
    fn not(self) -> i8
    Performs the unary ! operation. Read more
    ","Not","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Octal for i8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Octal","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Ord for i8
    Source§
    fn cmp(&self, other: &i8) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl PartialEq for i8
    Source§
    fn eq(&self, other: &i8) -> bool
    Tests for self and other values to be equal, and is used by ==.
    Source§
    fn ne(&self, other: &i8) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl PartialOrd for i8
    Source§
    fn partial_cmp(&self, other: &i8) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    Source§
    fn lt(&self, other: &i8) -> bool
    Tests less than (for self and other) and is used by the < operator. Read more
    Source§
    fn le(&self, other: &i8) -> bool
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    Source§
    fn ge(&self, other: &i8) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    Source§
    fn gt(&self, other: &i8) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    ","PartialOrd","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.12.0 · Source§
    impl<'a> Product<&'a i8> for i8
    Source§
    fn product<I>(iter: I) -> i8
    where\n    I: Iterator<Item = &'a i8>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product<&'a i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.12.0 · Source§
    impl Product for i8
    Source§
    fn product<I>(iter: I) -> i8
    where\n    I: Iterator<Item = i8>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl Random for i8
    Source§
    fn random(source: &mut (impl RandomSource + ?Sized)) -> i8
    🔬This is a nightly-only experimental API. (random)
    Generates a random value.
    \n
    Warning: Be careful when manipulating the resulting value! This\nmethod samples according to a uniform distribution, so a value of 1 is\njust as likely as MAX. By using modulo operations, some\nvalues can become more likely than others. Use audited crates when in\ndoubt.
    \n
    ","Random","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Rem<&i8> for i8
    Source§
    type Output = <i8 as Rem>::Output
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: &i8) -> <i8 as Rem>::Output
    Performs the % operation. Read more
    ","Rem<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Rem for i8
    This operation satisfies n % d == n - (n / d) * d. The\nresult has the same sign as the left operand.
    \n
    §Panics
    \n
    This operation will panic if other == 0 or if self / other results in overflow.
    \n
    Source§
    type Output = i8
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: i8) -> i8
    Performs the % operation. Read more
    ","Rem","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl RemAssign<&i8> for i8
    Source§
    fn rem_assign(&mut self, other: &i8)
    Performs the %= operation. Read more
    ","RemAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl RemAssign for i8
    Source§
    fn rem_assign(&mut self, other: i8)
    Performs the %= operation. Read more
    ","RemAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl SampleUniform for i8
    Source§
    type Sampler = UniformInt<i8>
    The UniformSampler implementation supporting type X.
    ","SampleUniform","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl Serialize for i8
    Source§
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&i128> for i8
    Source§
    type Output = <i8 as Shl<i128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i128) -> <i8 as Shl<i128>>::Output
    Performs the << operation. Read more
    ","Shl<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&i16> for i8
    Source§
    type Output = <i8 as Shl<i16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i16) -> <i8 as Shl<i16>>::Output
    Performs the << operation. Read more
    ","Shl<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&i32> for i8
    Source§
    type Output = <i8 as Shl<i32>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i32) -> <i8 as Shl<i32>>::Output
    Performs the << operation. Read more
    ","Shl<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&i64> for i8
    Source§
    type Output = <i8 as Shl<i64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i64) -> <i8 as Shl<i64>>::Output
    Performs the << operation. Read more
    ","Shl<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&i8> for i8
    Source§
    type Output = <i8 as Shl>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i8) -> <i8 as Shl>::Output
    Performs the << operation. Read more
    ","Shl<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&isize> for i8
    Source§
    type Output = <i8 as Shl<isize>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &isize) -> <i8 as Shl<isize>>::Output
    Performs the << operation. Read more
    ","Shl<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&u128> for i8
    Source§
    type Output = <i8 as Shl<u128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u128) -> <i8 as Shl<u128>>::Output
    Performs the << operation. Read more
    ","Shl<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&u16> for i8
    Source§
    type Output = <i8 as Shl<u16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u16) -> <i8 as Shl<u16>>::Output
    Performs the << operation. Read more
    ","Shl<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&u32> for i8
    Source§
    type Output = <i8 as Shl<u32>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u32) -> <i8 as Shl<u32>>::Output
    Performs the << operation. Read more
    ","Shl<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&u64> for i8
    Source§
    type Output = <i8 as Shl<u64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u64) -> <i8 as Shl<u64>>::Output
    Performs the << operation. Read more
    ","Shl<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&u8> for i8
    Source§
    type Output = <i8 as Shl<u8>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u8) -> <i8 as Shl<u8>>::Output
    Performs the << operation. Read more
    ","Shl<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&usize> for i8
    Source§
    type Output = <i8 as Shl<usize>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &usize) -> <i8 as Shl<usize>>::Output
    Performs the << operation. Read more
    ","Shl<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<i128> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i128) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<i16> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i16) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<i32> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i32) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<i64> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i64) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<isize> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: isize) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<u128> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u128) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<u16> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u16) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<u32> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u32) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<u64> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u64) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<u8> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u8) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<usize> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: usize) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i8) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&i128> for i8
    Source§
    fn shl_assign(&mut self, other: &i128)
    Performs the <<= operation. Read more
    ","ShlAssign<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&i16> for i8
    Source§
    fn shl_assign(&mut self, other: &i16)
    Performs the <<= operation. Read more
    ","ShlAssign<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&i32> for i8
    Source§
    fn shl_assign(&mut self, other: &i32)
    Performs the <<= operation. Read more
    ","ShlAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&i64> for i8
    Source§
    fn shl_assign(&mut self, other: &i64)
    Performs the <<= operation. Read more
    ","ShlAssign<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&i8> for i8
    Source§
    fn shl_assign(&mut self, other: &i8)
    Performs the <<= operation. Read more
    ","ShlAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&isize> for i8
    Source§
    fn shl_assign(&mut self, other: &isize)
    Performs the <<= operation. Read more
    ","ShlAssign<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&u128> for i8
    Source§
    fn shl_assign(&mut self, other: &u128)
    Performs the <<= operation. Read more
    ","ShlAssign<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&u16> for i8
    Source§
    fn shl_assign(&mut self, other: &u16)
    Performs the <<= operation. Read more
    ","ShlAssign<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&u32> for i8
    Source§
    fn shl_assign(&mut self, other: &u32)
    Performs the <<= operation. Read more
    ","ShlAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&u64> for i8
    Source§
    fn shl_assign(&mut self, other: &u64)
    Performs the <<= operation. Read more
    ","ShlAssign<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&u8> for i8
    Source§
    fn shl_assign(&mut self, other: &u8)
    Performs the <<= operation. Read more
    ","ShlAssign<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&usize> for i8
    Source§
    fn shl_assign(&mut self, other: &usize)
    Performs the <<= operation. Read more
    ","ShlAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<i128> for i8
    Source§
    fn shl_assign(&mut self, other: i128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<i16> for i8
    Source§
    fn shl_assign(&mut self, other: i16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<i32> for i8
    Source§
    fn shl_assign(&mut self, other: i32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<i64> for i8
    Source§
    fn shl_assign(&mut self, other: i64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<isize> for i8
    Source§
    fn shl_assign(&mut self, other: isize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<u128> for i8
    Source§
    fn shl_assign(&mut self, other: u128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<u16> for i8
    Source§
    fn shl_assign(&mut self, other: u16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<u32> for i8
    Source§
    fn shl_assign(&mut self, other: u32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<u64> for i8
    Source§
    fn shl_assign(&mut self, other: u64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<u8> for i8
    Source§
    fn shl_assign(&mut self, other: u8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<usize> for i8
    Source§
    fn shl_assign(&mut self, other: usize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign for i8
    Source§
    fn shl_assign(&mut self, other: i8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&i128> for i8
    Source§
    type Output = <i8 as Shr<i128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i128) -> <i8 as Shr<i128>>::Output
    Performs the >> operation. Read more
    ","Shr<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&i16> for i8
    Source§
    type Output = <i8 as Shr<i16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i16) -> <i8 as Shr<i16>>::Output
    Performs the >> operation. Read more
    ","Shr<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&i32> for i8
    Source§
    type Output = <i8 as Shr<i32>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i32) -> <i8 as Shr<i32>>::Output
    Performs the >> operation. Read more
    ","Shr<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&i64> for i8
    Source§
    type Output = <i8 as Shr<i64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i64) -> <i8 as Shr<i64>>::Output
    Performs the >> operation. Read more
    ","Shr<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&i8> for i8
    Source§
    type Output = <i8 as Shr>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i8) -> <i8 as Shr>::Output
    Performs the >> operation. Read more
    ","Shr<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&isize> for i8
    Source§
    type Output = <i8 as Shr<isize>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &isize) -> <i8 as Shr<isize>>::Output
    Performs the >> operation. Read more
    ","Shr<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&u128> for i8
    Source§
    type Output = <i8 as Shr<u128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u128) -> <i8 as Shr<u128>>::Output
    Performs the >> operation. Read more
    ","Shr<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&u16> for i8
    Source§
    type Output = <i8 as Shr<u16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u16) -> <i8 as Shr<u16>>::Output
    Performs the >> operation. Read more
    ","Shr<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&u32> for i8
    Source§
    type Output = <i8 as Shr<u32>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u32) -> <i8 as Shr<u32>>::Output
    Performs the >> operation. Read more
    ","Shr<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&u64> for i8
    Source§
    type Output = <i8 as Shr<u64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u64) -> <i8 as Shr<u64>>::Output
    Performs the >> operation. Read more
    ","Shr<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&u8> for i8
    Source§
    type Output = <i8 as Shr<u8>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u8) -> <i8 as Shr<u8>>::Output
    Performs the >> operation. Read more
    ","Shr<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&usize> for i8
    Source§
    type Output = <i8 as Shr<usize>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &usize) -> <i8 as Shr<usize>>::Output
    Performs the >> operation. Read more
    ","Shr<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<i128> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i128) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<i16> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i16) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<i32> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i32) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<i64> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i64) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<isize> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: isize) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<u128> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u128) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<u16> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u16) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<u32> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u32) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<u64> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u64) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<u8> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u8) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<usize> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: usize) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i8) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&i128> for i8
    Source§
    fn shr_assign(&mut self, other: &i128)
    Performs the >>= operation. Read more
    ","ShrAssign<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&i16> for i8
    Source§
    fn shr_assign(&mut self, other: &i16)
    Performs the >>= operation. Read more
    ","ShrAssign<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&i32> for i8
    Source§
    fn shr_assign(&mut self, other: &i32)
    Performs the >>= operation. Read more
    ","ShrAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&i64> for i8
    Source§
    fn shr_assign(&mut self, other: &i64)
    Performs the >>= operation. Read more
    ","ShrAssign<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&i8> for i8
    Source§
    fn shr_assign(&mut self, other: &i8)
    Performs the >>= operation. Read more
    ","ShrAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&isize> for i8
    Source§
    fn shr_assign(&mut self, other: &isize)
    Performs the >>= operation. Read more
    ","ShrAssign<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&u128> for i8
    Source§
    fn shr_assign(&mut self, other: &u128)
    Performs the >>= operation. Read more
    ","ShrAssign<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&u16> for i8
    Source§
    fn shr_assign(&mut self, other: &u16)
    Performs the >>= operation. Read more
    ","ShrAssign<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&u32> for i8
    Source§
    fn shr_assign(&mut self, other: &u32)
    Performs the >>= operation. Read more
    ","ShrAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&u64> for i8
    Source§
    fn shr_assign(&mut self, other: &u64)
    Performs the >>= operation. Read more
    ","ShrAssign<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&u8> for i8
    Source§
    fn shr_assign(&mut self, other: &u8)
    Performs the >>= operation. Read more
    ","ShrAssign<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&usize> for i8
    Source§
    fn shr_assign(&mut self, other: &usize)
    Performs the >>= operation. Read more
    ","ShrAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<i128> for i8
    Source§
    fn shr_assign(&mut self, other: i128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<i16> for i8
    Source§
    fn shr_assign(&mut self, other: i16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<i32> for i8
    Source§
    fn shr_assign(&mut self, other: i32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<i64> for i8
    Source§
    fn shr_assign(&mut self, other: i64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<isize> for i8
    Source§
    fn shr_assign(&mut self, other: isize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<u128> for i8
    Source§
    fn shr_assign(&mut self, other: u128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<u16> for i8
    Source§
    fn shr_assign(&mut self, other: u16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<u32> for i8
    Source§
    fn shr_assign(&mut self, other: u32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<u64> for i8
    Source§
    fn shr_assign(&mut self, other: u64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<u8> for i8
    Source§
    fn shr_assign(&mut self, other: u8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<usize> for i8
    Source§
    fn shr_assign(&mut self, other: usize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign for i8
    Source§
    fn shr_assign(&mut self, other: i8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl SimdElement for i8
    Source§
    type Mask = i8
    🔬This is a nightly-only experimental API. (portable_simd)
    The mask element type corresponding to this element type.
    ","SimdElement","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl Step for i8
    Source§
    fn forward(start: i8, n: usize) -> i8
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward(start: i8, n: usize) -> i8
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    unsafe fn forward_unchecked(start: i8, n: usize) -> i8
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    unsafe fn backward_unchecked(start: i8, n: usize) -> i8
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    fn steps_between(start: &i8, end: &i8) -> (usize, Option<usize>)
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the bounds on the number of successor steps required to get from start to end\nlike Iterator::size_hint(). Read more
    Source§
    fn forward_checked(start: i8, n: usize) -> Option<i8>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward_checked(start: i8, n: usize) -> Option<i8>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    ","Step","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Sub<&i8> for i8
    Source§
    type Output = <i8 as Sub>::Output
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: &i8) -> <i8 as Sub>::Output
    Performs the - operation. Read more
    ","Sub<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Sub for i8
    Source§
    type Output = i8
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: i8) -> i8
    Performs the - operation. Read more
    ","Sub","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl SubAssign<&i8> for i8
    Source§
    fn sub_assign(&mut self, other: &i8)
    Performs the -= operation. Read more
    ","SubAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl SubAssign for i8
    Source§
    fn sub_assign(&mut self, other: i8)
    Performs the -= operation. Read more
    ","SubAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.12.0 · Source§
    impl<'a> Sum<&'a i8> for i8
    Source§
    fn sum<I>(iter: I) -> i8
    where\n    I: Iterator<Item = &'a i8>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum<&'a i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.12.0 · Source§
    impl Sum for i8
    Source§
    fn sum<I>(iter: I) -> i8
    where\n    I: Iterator<Item = i8>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<i128> for i8
    Source§
    fn try_from(u: i128) -> Result<i8, <i8 as TryFrom<i128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<i16> for i8
    Source§
    fn try_from(u: i16) -> Result<i8, <i8 as TryFrom<i16>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<i32> for i8
    Source§
    fn try_from(u: i32) -> Result<i8, <i8 as TryFrom<i32>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<i64> for i8
    Source§
    fn try_from(u: i64) -> Result<i8, <i8 as TryFrom<i64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<isize> for i8
    Source§
    fn try_from(u: isize) -> Result<i8, <i8 as TryFrom<isize>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<u128> for i8
    Source§
    fn try_from(u: u128) -> Result<i8, <i8 as TryFrom<u128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<u16> for i8
    Source§
    fn try_from(u: u16) -> Result<i8, <i8 as TryFrom<u16>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<u32> for i8
    Source§
    fn try_from(u: u32) -> Result<i8, <i8 as TryFrom<u32>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<u64> for i8
    Source§
    fn try_from(u: u64) -> Result<i8, <i8 as TryFrom<u64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<u8> for i8
    Source§
    fn try_from(u: u8) -> Result<i8, <i8 as TryFrom<u8>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<usize> for i8
    Source§
    fn try_from(u: usize) -> Result<i8, <i8 as TryFrom<usize>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.42.0 · Source§
    impl UpperExp for i8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperExp","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl UpperHex for i8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperHex","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl ConstParamTy_ for i8
    ","ConstParamTy_","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Copy for i8
    ","Copy","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Eq for i8
    ","Eq","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl MaskElement for i8
    ","MaskElement","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl SimdCast for i8
    ","SimdCast","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl StructuralPartialEq for i8
    ","StructuralPartialEq","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl TrustedStep for i8
    ","TrustedStep","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl UnsizedConstParamTy for i8
    ","UnsizedConstParamTy","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl Weight for i8
    ","Weight","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl ZeroablePrimitive for i8
    ","ZeroablePrimitive","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"]]]]);
+    var type_impls = Object.fromEntries([["bdk_chain",[["
    1.0.0 · Source§
    impl Add<&i8> for i8
    Source§
    type Output = <i8 as Add>::Output
    The resulting type after applying the + operator.
    Source§
    fn add(self, other: &i8) -> <i8 as Add>::Output
    Performs the + operation. Read more
    ","Add<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Add for i8
    Source§
    type Output = i8
    The resulting type after applying the + operator.
    Source§
    const fn add(self, other: i8) -> i8
    Performs the + operation. Read more
    ","Add","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl AddAssign<&i8> for i8
    Source§
    fn add_assign(&mut self, other: &i8)
    Performs the += operation. Read more
    ","AddAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl AddAssign for i8
    Source§
    fn add_assign(&mut self, other: i8)
    Performs the += operation. Read more
    ","AddAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Binary for i8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Binary","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl BitAnd<&i8> for i8
    Source§
    type Output = <i8 as BitAnd>::Output
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, other: &i8) -> <i8 as BitAnd>::Output
    Performs the & operation. Read more
    ","BitAnd<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl BitAnd for i8
    Source§
    type Output = i8
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, rhs: i8) -> i8
    Performs the & operation. Read more
    ","BitAnd","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl BitAndAssign<&i8> for i8
    Source§
    fn bitand_assign(&mut self, other: &i8)
    Performs the &= operation. Read more
    ","BitAndAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl BitAndAssign for i8
    Source§
    fn bitand_assign(&mut self, other: i8)
    Performs the &= operation. Read more
    ","BitAndAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl BitOr<&i8> for i8
    Source§
    type Output = <i8 as BitOr>::Output
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, other: &i8) -> <i8 as BitOr>::Output
    Performs the | operation. Read more
    ","BitOr<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl BitOr for i8
    Source§
    type Output = i8
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, rhs: i8) -> i8
    Performs the | operation. Read more
    ","BitOr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl BitOrAssign<&i8> for i8
    Source§
    fn bitor_assign(&mut self, other: &i8)
    Performs the |= operation. Read more
    ","BitOrAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl BitOrAssign for i8
    Source§
    fn bitor_assign(&mut self, other: i8)
    Performs the |= operation. Read more
    ","BitOrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl BitXor<&i8> for i8
    Source§
    type Output = <i8 as BitXor>::Output
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: &i8) -> <i8 as BitXor>::Output
    Performs the ^ operation. Read more
    ","BitXor<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl BitXor for i8
    Source§
    type Output = i8
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: i8) -> i8
    Performs the ^ operation. Read more
    ","BitXor","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl BitXorAssign<&i8> for i8
    Source§
    fn bitxor_assign(&mut self, other: &i8)
    Performs the ^= operation. Read more
    ","BitXorAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl BitXorAssign for i8
    Source§
    fn bitxor_assign(&mut self, other: i8)
    Performs the ^= operation. Read more
    ","BitXorAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl CarryingMulAdd for i8
    Source§
    type Unsigned = u8
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    Source§
    const fn carrying_mul_add(self, a: i8, b: i8, c: i8) -> (u8, i8)
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    ","CarryingMulAdd","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Clone for i8
    Source§
    fn clone(&self) -> i8
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    ","Clone","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Debug for i8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    §
    impl Decodable for i8
    §
    fn consensus_decode<R>(r: &mut R) -> Result<i8, Error>
    where\n    R: Read + ?Sized,
    Decode an object with a well-defined format. Read more
    §
    fn consensus_decode_from_finite_reader<R>(reader: &mut R) -> Result<Self, Error>
    where\n    R: Read + ?Sized,
    Decode Self from a size-limited reader. Read more
    ","Decodable","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Default for i8
    Source§
    fn default() -> i8
    Returns the default value of 0
    \n
    ","Default","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl<'de> Deserialize<'de> for i8
    Source§
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<i8, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Display for i8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Display","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Div<&i8> for i8
    Source§
    type Output = <i8 as Div>::Output
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: &i8) -> <i8 as Div>::Output
    Performs the / operation. Read more
    ","Div<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Div for i8
    This operation rounds towards zero, truncating any\nfractional part of the exact result.
    \n
    §Panics
    \n
    This operation will panic if other == 0 or the division results in overflow.
    \n
    Source§
    type Output = i8
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: i8) -> i8
    Performs the / operation. Read more
    ","Div","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl DivAssign<&i8> for i8
    Source§
    fn div_assign(&mut self, other: &i8)
    Performs the /= operation. Read more
    ","DivAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl DivAssign for i8
    Source§
    fn div_assign(&mut self, other: i8)
    Performs the /= operation. Read more
    ","DivAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    §
    impl Encodable for i8
    §
    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where\n    W: Write + ?Sized,
    Encodes an object with a well-defined format. Read more
    ","Encodable","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.28.0 · Source§
    impl From<bool> for i8
    Source§
    fn from(small: bool) -> i8
    Converts a bool to i8 losslessly.\nThe resulting value is 0 for false and 1 for true values.
    \n
    §Examples
    \n
    assert_eq!(i8::from(true), 1);\nassert_eq!(i8::from(false), 0);
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl FromStr for i8
    Source§
    type Err = ParseIntError
    The associated error which can be returned from parsing.
    Source§
    fn from_str(src: &str) -> Result<i8, ParseIntError>
    Parses a string s to return a value of this type. Read more
    ","FromStr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Hash for i8
    Source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    Source§
    fn hash_slice<H>(data: &[i8], state: &mut H)
    where\n    H: Hasher,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl<'de, E> IntoDeserializer<'de, E> for i8
    where\n    E: Error,
    Source§
    type Deserializer = I8Deserializer<E>
    The type of the deserializer being converted into.
    Source§
    fn into_deserializer(self) -> I8Deserializer<E>
    Convert this value into a deserializer.
    ","IntoDeserializer<'de, E>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.42.0 · Source§
    impl LowerExp for i8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerExp","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl LowerHex for i8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerHex","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Mul<&i8> for i8
    Source§
    type Output = <i8 as Mul>::Output
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: &i8) -> <i8 as Mul>::Output
    Performs the * operation. Read more
    ","Mul<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Mul for i8
    Source§
    type Output = i8
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: i8) -> i8
    Performs the * operation. Read more
    ","Mul","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl MulAssign<&i8> for i8
    Source§
    fn mul_assign(&mut self, other: &i8)
    Performs the *= operation. Read more
    ","MulAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl MulAssign for i8
    Source§
    fn mul_assign(&mut self, other: i8)
    Performs the *= operation. Read more
    ","MulAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Neg for i8
    Source§
    type Output = i8
    The resulting type after applying the - operator.
    Source§
    fn neg(self) -> i8
    Performs the unary - operation. Read more
    ","Neg","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Not for i8
    Source§
    type Output = i8
    The resulting type after applying the ! operator.
    Source§
    fn not(self) -> i8
    Performs the unary ! operation. Read more
    ","Not","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Octal for i8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Octal","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Ord for i8
    Source§
    fn cmp(&self, other: &i8) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl PartialEq for i8
    Source§
    fn eq(&self, other: &i8) -> bool
    Tests for self and other values to be equal, and is used by ==.
    Source§
    fn ne(&self, other: &i8) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl PartialOrd for i8
    Source§
    fn partial_cmp(&self, other: &i8) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    Source§
    fn lt(&self, other: &i8) -> bool
    Tests less than (for self and other) and is used by the < operator. Read more
    Source§
    fn le(&self, other: &i8) -> bool
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    Source§
    fn ge(&self, other: &i8) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    Source§
    fn gt(&self, other: &i8) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    ","PartialOrd","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.12.0 · Source§
    impl<'a> Product<&'a i8> for i8
    Source§
    fn product<I>(iter: I) -> i8
    where\n    I: Iterator<Item = &'a i8>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product<&'a i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.12.0 · Source§
    impl Product for i8
    Source§
    fn product<I>(iter: I) -> i8
    where\n    I: Iterator<Item = i8>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl Random for i8
    Source§
    fn random(source: &mut (impl RandomSource + ?Sized)) -> i8
    🔬This is a nightly-only experimental API. (random)
    Generates a random value.
    \n
    Warning: Be careful when manipulating the resulting value! This\nmethod samples according to a uniform distribution, so a value of 1 is\njust as likely as MAX. By using modulo operations, some\nvalues can become more likely than others. Use audited crates when in\ndoubt.
    \n
    ","Random","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Rem<&i8> for i8
    Source§
    type Output = <i8 as Rem>::Output
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: &i8) -> <i8 as Rem>::Output
    Performs the % operation. Read more
    ","Rem<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Rem for i8
    This operation satisfies n % d == n - (n / d) * d. The\nresult has the same sign as the left operand.
    \n
    §Panics
    \n
    This operation will panic if other == 0 or if self / other results in overflow.
    \n
    Source§
    type Output = i8
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: i8) -> i8
    Performs the % operation. Read more
    ","Rem","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl RemAssign<&i8> for i8
    Source§
    fn rem_assign(&mut self, other: &i8)
    Performs the %= operation. Read more
    ","RemAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl RemAssign for i8
    Source§
    fn rem_assign(&mut self, other: i8)
    Performs the %= operation. Read more
    ","RemAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl SampleUniform for i8
    Source§
    type Sampler = UniformInt<i8>
    The UniformSampler implementation supporting type X.
    ","SampleUniform","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl Serialize for i8
    Source§
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&i128> for i8
    Source§
    type Output = <i8 as Shl<i128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i128) -> <i8 as Shl<i128>>::Output
    Performs the << operation. Read more
    ","Shl<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&i16> for i8
    Source§
    type Output = <i8 as Shl<i16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i16) -> <i8 as Shl<i16>>::Output
    Performs the << operation. Read more
    ","Shl<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&i32> for i8
    Source§
    type Output = <i8 as Shl<i32>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i32) -> <i8 as Shl<i32>>::Output
    Performs the << operation. Read more
    ","Shl<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&i64> for i8
    Source§
    type Output = <i8 as Shl<i64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i64) -> <i8 as Shl<i64>>::Output
    Performs the << operation. Read more
    ","Shl<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&i8> for i8
    Source§
    type Output = <i8 as Shl>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i8) -> <i8 as Shl>::Output
    Performs the << operation. Read more
    ","Shl<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&isize> for i8
    Source§
    type Output = <i8 as Shl<isize>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &isize) -> <i8 as Shl<isize>>::Output
    Performs the << operation. Read more
    ","Shl<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&u128> for i8
    Source§
    type Output = <i8 as Shl<u128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u128) -> <i8 as Shl<u128>>::Output
    Performs the << operation. Read more
    ","Shl<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&u16> for i8
    Source§
    type Output = <i8 as Shl<u16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u16) -> <i8 as Shl<u16>>::Output
    Performs the << operation. Read more
    ","Shl<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&u32> for i8
    Source§
    type Output = <i8 as Shl<u32>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u32) -> <i8 as Shl<u32>>::Output
    Performs the << operation. Read more
    ","Shl<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&u64> for i8
    Source§
    type Output = <i8 as Shl<u64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u64) -> <i8 as Shl<u64>>::Output
    Performs the << operation. Read more
    ","Shl<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&u8> for i8
    Source§
    type Output = <i8 as Shl<u8>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u8) -> <i8 as Shl<u8>>::Output
    Performs the << operation. Read more
    ","Shl<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<&usize> for i8
    Source§
    type Output = <i8 as Shl<usize>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &usize) -> <i8 as Shl<usize>>::Output
    Performs the << operation. Read more
    ","Shl<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<i128> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i128) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<i16> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i16) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<i32> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i32) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<i64> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i64) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<isize> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: isize) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<u128> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u128) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<u16> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u16) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<u32> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u32) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<u64> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u64) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<u8> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u8) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl<usize> for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: usize) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shl for i8
    Source§
    type Output = i8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i8) -> i8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&i128> for i8
    Source§
    fn shl_assign(&mut self, other: &i128)
    Performs the <<= operation. Read more
    ","ShlAssign<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&i16> for i8
    Source§
    fn shl_assign(&mut self, other: &i16)
    Performs the <<= operation. Read more
    ","ShlAssign<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&i32> for i8
    Source§
    fn shl_assign(&mut self, other: &i32)
    Performs the <<= operation. Read more
    ","ShlAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&i64> for i8
    Source§
    fn shl_assign(&mut self, other: &i64)
    Performs the <<= operation. Read more
    ","ShlAssign<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&i8> for i8
    Source§
    fn shl_assign(&mut self, other: &i8)
    Performs the <<= operation. Read more
    ","ShlAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&isize> for i8
    Source§
    fn shl_assign(&mut self, other: &isize)
    Performs the <<= operation. Read more
    ","ShlAssign<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&u128> for i8
    Source§
    fn shl_assign(&mut self, other: &u128)
    Performs the <<= operation. Read more
    ","ShlAssign<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&u16> for i8
    Source§
    fn shl_assign(&mut self, other: &u16)
    Performs the <<= operation. Read more
    ","ShlAssign<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&u32> for i8
    Source§
    fn shl_assign(&mut self, other: &u32)
    Performs the <<= operation. Read more
    ","ShlAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&u64> for i8
    Source§
    fn shl_assign(&mut self, other: &u64)
    Performs the <<= operation. Read more
    ","ShlAssign<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&u8> for i8
    Source§
    fn shl_assign(&mut self, other: &u8)
    Performs the <<= operation. Read more
    ","ShlAssign<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShlAssign<&usize> for i8
    Source§
    fn shl_assign(&mut self, other: &usize)
    Performs the <<= operation. Read more
    ","ShlAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<i128> for i8
    Source§
    fn shl_assign(&mut self, other: i128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<i16> for i8
    Source§
    fn shl_assign(&mut self, other: i16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<i32> for i8
    Source§
    fn shl_assign(&mut self, other: i32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<i64> for i8
    Source§
    fn shl_assign(&mut self, other: i64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<isize> for i8
    Source§
    fn shl_assign(&mut self, other: isize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<u128> for i8
    Source§
    fn shl_assign(&mut self, other: u128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<u16> for i8
    Source§
    fn shl_assign(&mut self, other: u16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<u32> for i8
    Source§
    fn shl_assign(&mut self, other: u32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<u64> for i8
    Source§
    fn shl_assign(&mut self, other: u64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<u8> for i8
    Source§
    fn shl_assign(&mut self, other: u8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign<usize> for i8
    Source§
    fn shl_assign(&mut self, other: usize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShlAssign for i8
    Source§
    fn shl_assign(&mut self, other: i8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&i128> for i8
    Source§
    type Output = <i8 as Shr<i128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i128) -> <i8 as Shr<i128>>::Output
    Performs the >> operation. Read more
    ","Shr<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&i16> for i8
    Source§
    type Output = <i8 as Shr<i16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i16) -> <i8 as Shr<i16>>::Output
    Performs the >> operation. Read more
    ","Shr<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&i32> for i8
    Source§
    type Output = <i8 as Shr<i32>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i32) -> <i8 as Shr<i32>>::Output
    Performs the >> operation. Read more
    ","Shr<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&i64> for i8
    Source§
    type Output = <i8 as Shr<i64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i64) -> <i8 as Shr<i64>>::Output
    Performs the >> operation. Read more
    ","Shr<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&i8> for i8
    Source§
    type Output = <i8 as Shr>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i8) -> <i8 as Shr>::Output
    Performs the >> operation. Read more
    ","Shr<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&isize> for i8
    Source§
    type Output = <i8 as Shr<isize>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &isize) -> <i8 as Shr<isize>>::Output
    Performs the >> operation. Read more
    ","Shr<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&u128> for i8
    Source§
    type Output = <i8 as Shr<u128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u128) -> <i8 as Shr<u128>>::Output
    Performs the >> operation. Read more
    ","Shr<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&u16> for i8
    Source§
    type Output = <i8 as Shr<u16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u16) -> <i8 as Shr<u16>>::Output
    Performs the >> operation. Read more
    ","Shr<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&u32> for i8
    Source§
    type Output = <i8 as Shr<u32>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u32) -> <i8 as Shr<u32>>::Output
    Performs the >> operation. Read more
    ","Shr<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&u64> for i8
    Source§
    type Output = <i8 as Shr<u64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u64) -> <i8 as Shr<u64>>::Output
    Performs the >> operation. Read more
    ","Shr<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&u8> for i8
    Source§
    type Output = <i8 as Shr<u8>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u8) -> <i8 as Shr<u8>>::Output
    Performs the >> operation. Read more
    ","Shr<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<&usize> for i8
    Source§
    type Output = <i8 as Shr<usize>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &usize) -> <i8 as Shr<usize>>::Output
    Performs the >> operation. Read more
    ","Shr<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<i128> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i128) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<i16> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i16) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<i32> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i32) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<i64> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i64) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<isize> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: isize) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<u128> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u128) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<u16> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u16) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<u32> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u32) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<u64> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u64) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<u8> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u8) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr<usize> for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: usize) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Shr for i8
    Source§
    type Output = i8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i8) -> i8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&i128> for i8
    Source§
    fn shr_assign(&mut self, other: &i128)
    Performs the >>= operation. Read more
    ","ShrAssign<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&i16> for i8
    Source§
    fn shr_assign(&mut self, other: &i16)
    Performs the >>= operation. Read more
    ","ShrAssign<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&i32> for i8
    Source§
    fn shr_assign(&mut self, other: &i32)
    Performs the >>= operation. Read more
    ","ShrAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&i64> for i8
    Source§
    fn shr_assign(&mut self, other: &i64)
    Performs the >>= operation. Read more
    ","ShrAssign<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&i8> for i8
    Source§
    fn shr_assign(&mut self, other: &i8)
    Performs the >>= operation. Read more
    ","ShrAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&isize> for i8
    Source§
    fn shr_assign(&mut self, other: &isize)
    Performs the >>= operation. Read more
    ","ShrAssign<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&u128> for i8
    Source§
    fn shr_assign(&mut self, other: &u128)
    Performs the >>= operation. Read more
    ","ShrAssign<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&u16> for i8
    Source§
    fn shr_assign(&mut self, other: &u16)
    Performs the >>= operation. Read more
    ","ShrAssign<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&u32> for i8
    Source§
    fn shr_assign(&mut self, other: &u32)
    Performs the >>= operation. Read more
    ","ShrAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&u64> for i8
    Source§
    fn shr_assign(&mut self, other: &u64)
    Performs the >>= operation. Read more
    ","ShrAssign<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&u8> for i8
    Source§
    fn shr_assign(&mut self, other: &u8)
    Performs the >>= operation. Read more
    ","ShrAssign<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl ShrAssign<&usize> for i8
    Source§
    fn shr_assign(&mut self, other: &usize)
    Performs the >>= operation. Read more
    ","ShrAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<i128> for i8
    Source§
    fn shr_assign(&mut self, other: i128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<i16> for i8
    Source§
    fn shr_assign(&mut self, other: i16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<i32> for i8
    Source§
    fn shr_assign(&mut self, other: i32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<i64> for i8
    Source§
    fn shr_assign(&mut self, other: i64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<isize> for i8
    Source§
    fn shr_assign(&mut self, other: isize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<u128> for i8
    Source§
    fn shr_assign(&mut self, other: u128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<u16> for i8
    Source§
    fn shr_assign(&mut self, other: u16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<u32> for i8
    Source§
    fn shr_assign(&mut self, other: u32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<u64> for i8
    Source§
    fn shr_assign(&mut self, other: u64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<u8> for i8
    Source§
    fn shr_assign(&mut self, other: u8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign<usize> for i8
    Source§
    fn shr_assign(&mut self, other: usize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl ShrAssign for i8
    Source§
    fn shr_assign(&mut self, other: i8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl SimdElement for i8
    Source§
    type Mask = i8
    🔬This is a nightly-only experimental API. (portable_simd)
    The mask element type corresponding to this element type.
    ","SimdElement","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl Step for i8
    Source§
    fn forward(start: i8, n: usize) -> i8
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward(start: i8, n: usize) -> i8
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    unsafe fn forward_unchecked(start: i8, n: usize) -> i8
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    unsafe fn backward_unchecked(start: i8, n: usize) -> i8
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    fn steps_between(start: &i8, end: &i8) -> (usize, Option<usize>)
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the bounds on the number of successor steps required to get from start to end\nlike Iterator::size_hint(). Read more
    Source§
    fn forward_checked(start: i8, n: usize) -> Option<i8>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward_checked(start: i8, n: usize) -> Option<i8>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    ","Step","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Sub<&i8> for i8
    Source§
    type Output = <i8 as Sub>::Output
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: &i8) -> <i8 as Sub>::Output
    Performs the - operation. Read more
    ","Sub<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Sub for i8
    Source§
    type Output = i8
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: i8) -> i8
    Performs the - operation. Read more
    ","Sub","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.22.0 · Source§
    impl SubAssign<&i8> for i8
    Source§
    fn sub_assign(&mut self, other: &i8)
    Performs the -= operation. Read more
    ","SubAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.8.0 · Source§
    impl SubAssign for i8
    Source§
    fn sub_assign(&mut self, other: i8)
    Performs the -= operation. Read more
    ","SubAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.12.0 · Source§
    impl<'a> Sum<&'a i8> for i8
    Source§
    fn sum<I>(iter: I) -> i8
    where\n    I: Iterator<Item = &'a i8>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum<&'a i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.12.0 · Source§
    impl Sum for i8
    Source§
    fn sum<I>(iter: I) -> i8
    where\n    I: Iterator<Item = i8>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<i128> for i8
    Source§
    fn try_from(u: i128) -> Result<i8, <i8 as TryFrom<i128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<i16> for i8
    Source§
    fn try_from(u: i16) -> Result<i8, <i8 as TryFrom<i16>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<i32> for i8
    Source§
    fn try_from(u: i32) -> Result<i8, <i8 as TryFrom<i32>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<i64> for i8
    Source§
    fn try_from(u: i64) -> Result<i8, <i8 as TryFrom<i64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<isize> for i8
    Source§
    fn try_from(u: isize) -> Result<i8, <i8 as TryFrom<isize>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<u128> for i8
    Source§
    fn try_from(u: u128) -> Result<i8, <i8 as TryFrom<u128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<u16> for i8
    Source§
    fn try_from(u: u16) -> Result<i8, <i8 as TryFrom<u16>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<u32> for i8
    Source§
    fn try_from(u: u32) -> Result<i8, <i8 as TryFrom<u32>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<u64> for i8
    Source§
    fn try_from(u: u64) -> Result<i8, <i8 as TryFrom<u64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<u8> for i8
    Source§
    fn try_from(u: u8) -> Result<i8, <i8 as TryFrom<u8>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.34.0 · Source§
    impl TryFrom<usize> for i8
    Source§
    fn try_from(u: usize) -> Result<i8, <i8 as TryFrom<usize>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.42.0 · Source§
    impl UpperExp for i8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperExp","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl UpperHex for i8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperHex","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl ConstParamTy_ for i8
    ","ConstParamTy_","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Copy for i8
    ","Copy","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    1.0.0 · Source§
    impl Eq for i8
    ","Eq","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl MaskElement for i8
    ","MaskElement","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl SimdCast for i8
    ","SimdCast","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl StructuralPartialEq for i8
    ","StructuralPartialEq","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl TrustedStep for i8
    ","TrustedStep","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl UnsizedConstParamTy for i8
    ","UnsizedConstParamTy","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl Weight for i8
    ","Weight","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"],["
    Source§
    impl ZeroablePrimitive for i8
    ","ZeroablePrimitive","bdk_chain::bitcoin::secp256k1::ffi::types::c_char"]]]]);
     if (window.register_type_impls) {
         window.register_type_impls(type_impls);
     } else {
         window.pending_type_impls = type_impls;
     }
 })()
-//{"start":55,"fragment_lengths":[411627]}
\ No newline at end of file
+//{"start":55,"fragment_lengths":[411626]}
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.tuple.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.tuple.js
index 22453aeb62..f1027ec7b4 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.tuple.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.tuple.js
@@ -1,9 +1,9 @@
 (function() {
-    var type_impls = Object.fromEntries([["bdk_chain",[["
    §
    impl<T0, T1> Decodable for (T0, T1)
    where\n    T0: Decodable,\n    T1: Decodable,
    §
    fn consensus_decode<R>(r: &mut R) -> Result<(T0, T1), Error>
    where\n    R: Read + ?Sized,
    Decode an object with a well-defined format. Read more
    §
    fn consensus_decode_from_finite_reader<R>(reader: &mut R) -> Result<Self, Error>
    where\n    R: Read + ?Sized,
    Decode Self from a size-limited reader. Read more
    ","Decodable","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    Source§
    impl<'de, T0, T1> Deserialize<'de> for (T0, T1)
    where\n    T0: Deserialize<'de>,\n    T1: Deserialize<'de>,
    Source§
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<(T0, T1), <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    §
    impl<T0, T1> Encodable for (T0, T1)
    where\n    T0: Encodable,\n    T1: Encodable,
    §
    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where\n    W: Write + ?Sized,
    Encodes an object with a well-defined format. Read more
    ","Encodable","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    Source§
    impl From<BlockId> for (u32, BlockHash)
    Source§
    fn from(block_id: BlockId) -> (u32, BlockHash)
    Converts to this type from the input type.
    ","From","bdk_chain::Indexed"],["
    Source§
    impl<T0, T1> Merge for (T0, T1)
    where\n    T0: Merge,\n    T1: Merge,
    Source§
    fn merge(&mut self, _other: (T0, T1))
    Merge another object of the same type onto self.
    Source§
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    Source§
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    ","Merge","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    Source§
    impl<T0, T1> Serialize for (T0, T1)
    where\n    T0: Serialize,\n    T1: Serialize,
    Source§
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    §
    impl<'a, O, P> TryFrom<&'a Row<'a>> for (O, P)
    where\n    O: FromSql,\n    P: FromSql,
    §
    type Error = Error
    The type returned in the event of a conversion error.
    §
    fn try_from(row: &'a Row<'a>) -> Result<(O, P), Error>
    Performs the conversion.
    ","TryFrom<&'a Row<'a>>","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"]]],["bdk_core",[["
    Source§
    impl From<BlockId> for (u32, BlockHash)
    Source§
    fn from(block_id: BlockId) -> Self
    Converts to this type from the input type.
    ","From","bdk_core::Indexed"],["
    Source§
    impl<T0, T1> Merge for (T0, T1)
    where\n    T0: Merge,\n    T1: Merge,
    Source§
    fn merge(&mut self, _other: Self)
    Merge another object of the same type onto self.
    Source§
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    Source§
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    ","Merge","bdk_core::Indexed","bdk_core::KeychainIndexed"]]],["bdk_wallet",[]],["example_cli",[]]]);
+    var type_impls = Object.fromEntries([["bdk_chain",[["
    §
    impl<T0, T1> Decodable for (T0, T1)
    where\n    T0: Decodable,\n    T1: Decodable,
    §
    fn consensus_decode<R>(r: &mut R) -> Result<(T0, T1), Error>
    where\n    R: Read + ?Sized,
    Decode an object with a well-defined format. Read more
    §
    fn consensus_decode_from_finite_reader<R>(reader: &mut R) -> Result<Self, Error>
    where\n    R: Read + ?Sized,
    Decode Self from a size-limited reader. Read more
    ","Decodable","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    Source§
    impl<'de, T0, T1> Deserialize<'de> for (T0, T1)
    where\n    T0: Deserialize<'de>,\n    T1: Deserialize<'de>,
    Source§
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<(T0, T1), <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    §
    impl<T0, T1> Encodable for (T0, T1)
    where\n    T0: Encodable,\n    T1: Encodable,
    §
    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where\n    W: Write + ?Sized,
    Encodes an object with a well-defined format. Read more
    ","Encodable","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    §
    impl From<BlockId> for (u32, BlockHash)
    §
    fn from(block_id: BlockId) -> (u32, BlockHash)
    Converts to this type from the input type.
    ","From","bdk_chain::Indexed"],["
    §
    impl<T0, T1> Merge for (T0, T1)
    where\n    T0: Merge,\n    T1: Merge,
    §
    fn merge(&mut self, _other: (T0, T1))
    Merge another object of the same type onto self.
    §
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    §
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    ","Merge","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    Source§
    impl<T0, T1> Serialize for (T0, T1)
    where\n    T0: Serialize,\n    T1: Serialize,
    Source§
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    §
    impl<'a, O, P> TryFrom<&'a Row<'a>> for (O, P)
    where\n    O: FromSql,\n    P: FromSql,
    §
    type Error = Error
    The type returned in the event of a conversion error.
    §
    fn try_from(row: &'a Row<'a>) -> Result<(O, P), Error>
    Performs the conversion.
    ","TryFrom<&'a Row<'a>>","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"]]],["bdk_core",[["
    Source§
    impl From<BlockId> for (u32, BlockHash)
    Source§
    fn from(block_id: BlockId) -> Self
    Converts to this type from the input type.
    ","From","bdk_core::Indexed"],["
    Source§
    impl<T0, T1> Merge for (T0, T1)
    where\n    T0: Merge,\n    T1: Merge,
    Source§
    fn merge(&mut self, _other: Self)
    Merge another object of the same type onto self.
    Source§
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    Source§
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    ","Merge","bdk_core::Indexed","bdk_core::KeychainIndexed"]]],["bdk_wallet",[]],["example_cli",[]]]);
     if (window.register_type_impls) {
         window.register_type_impls(type_impls);
     } else {
         window.pending_type_impls = type_impls;
     }
 })()
-//{"start":55,"fragment_lengths":[18153,3990,18,19]}
\ No newline at end of file
+//{"start":55,"fragment_lengths":[17691,3990,18,19]}
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.u32.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.u32.js
index 885aefc788..83be87fcac 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.u32.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.u32.js
@@ -1,9 +1,9 @@
 (function() {
-    var type_impls = Object.fromEntries([["bdk_chain",[["
    1.0.0 · Source§
    impl Add<&u32> for u32
    Source§
    type Output = <u32 as Add>::Output
    The resulting type after applying the + operator.
    Source§
    fn add(self, other: &u32) -> <u32 as Add>::Output
    Performs the + operation. Read more
    ","Add<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Add for u32
    Source§
    type Output = u32
    The resulting type after applying the + operator.
    Source§
    const fn add(self, other: u32) -> u32
    Performs the + operation. Read more
    ","Add","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl AddAssign<&u32> for u32
    Source§
    fn add_assign(&mut self, other: &u32)
    Performs the += operation. Read more
    ","AddAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl AddAssign for u32
    Source§
    fn add_assign(&mut self, other: u32)
    Performs the += operation. Read more
    ","AddAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Binary for u32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Binary","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl BitAnd<&u32> for u32
    Source§
    type Output = <u32 as BitAnd>::Output
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, other: &u32) -> <u32 as BitAnd>::Output
    Performs the & operation. Read more
    ","BitAnd<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl BitAnd for u32
    Source§
    type Output = u32
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, rhs: u32) -> u32
    Performs the & operation. Read more
    ","BitAnd","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl BitAndAssign<&u32> for u32
    Source§
    fn bitand_assign(&mut self, other: &u32)
    Performs the &= operation. Read more
    ","BitAndAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl BitAndAssign for u32
    Source§
    fn bitand_assign(&mut self, other: u32)
    Performs the &= operation. Read more
    ","BitAndAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl BitOr<&u32> for u32
    Source§
    type Output = <u32 as BitOr>::Output
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, other: &u32) -> <u32 as BitOr>::Output
    Performs the | operation. Read more
    ","BitOr<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl BitOr for u32
    Source§
    type Output = u32
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, rhs: u32) -> u32
    Performs the | operation. Read more
    ","BitOr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl BitOrAssign<&u32> for u32
    Source§
    fn bitor_assign(&mut self, other: &u32)
    Performs the |= operation. Read more
    ","BitOrAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl BitOrAssign for u32
    Source§
    fn bitor_assign(&mut self, other: u32)
    Performs the |= operation. Read more
    ","BitOrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl BitXor<&u32> for u32
    Source§
    type Output = <u32 as BitXor>::Output
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: &u32) -> <u32 as BitXor>::Output
    Performs the ^ operation. Read more
    ","BitXor<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl BitXor for u32
    Source§
    type Output = u32
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: u32) -> u32
    Performs the ^ operation. Read more
    ","BitXor","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl BitXorAssign<&u32> for u32
    Source§
    fn bitxor_assign(&mut self, other: &u32)
    Performs the ^= operation. Read more
    ","BitXorAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl BitXorAssign for u32
    Source§
    fn bitxor_assign(&mut self, other: u32)
    Performs the ^= operation. Read more
    ","BitXorAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl CarryingMulAdd for u32
    Source§
    type Unsigned = u32
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    Source§
    const fn carrying_mul_add(self, a: u32, b: u32, c: u32) -> (u32, u32)
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    ","CarryingMulAdd","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Clone for u32
    Source§
    fn clone(&self) -> u32
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    ","Clone","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Debug for u32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    §
    impl Decodable for u32
    §
    fn consensus_decode<R>(r: &mut R) -> Result<u32, Error>
    where\n    R: Read + ?Sized,
    Decode an object with a well-defined format. Read more
    §
    fn consensus_decode_from_finite_reader<R>(reader: &mut R) -> Result<Self, Error>
    where\n    R: Read + ?Sized,
    Decode Self from a size-limited reader. Read more
    ","Decodable","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Default for u32
    Source§
    fn default() -> u32
    Returns the default value of 0
    \n
    ","Default","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl<'de> Deserialize<'de> for u32
    Source§
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<u32, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Display for u32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Display","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Div<&u32> for u32
    Source§
    type Output = <u32 as Div>::Output
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: &u32) -> <u32 as Div>::Output
    Performs the / operation. Read more
    ","Div<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.51.0 · Source§
    impl Div<NonZero<u32>> for u32
    Source§
    fn div(self, other: NonZero<u32>) -> u32
    This operation rounds towards zero, truncating any fractional\npart of the exact result, and cannot panic.
    \n
    Source§
    type Output = u32
    The resulting type after applying the / operator.
    ","Div>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Div for u32
    This operation rounds towards zero, truncating any\nfractional part of the exact result.
    \n
    §Panics
    \n
    This operation will panic if other == 0.
    \n
    Source§
    type Output = u32
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: u32) -> u32
    Performs the / operation. Read more
    ","Div","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl DivAssign<&u32> for u32
    Source§
    fn div_assign(&mut self, other: &u32)
    Performs the /= operation. Read more
    ","DivAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.79.0 · Source§
    impl DivAssign<NonZero<u32>> for u32
    Source§
    fn div_assign(&mut self, other: NonZero<u32>)
    This operation rounds towards zero, truncating any fractional\npart of the exact result, and cannot panic.
    \n
    ","DivAssign>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl DivAssign for u32
    Source§
    fn div_assign(&mut self, other: u32)
    Performs the /= operation. Read more
    ","DivAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    §
    impl Encodable for u32
    §
    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where\n    W: Write + ?Sized,
    Encodes an object with a well-defined format. Read more
    ","Encodable","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl From<AsciiChar> for u32
    Source§
    fn from(chr: AsciiChar) -> u32
    Converts to this type from the input type.
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    §
    impl From<ChildNumber> for u32
    §
    fn from(cnum: ChildNumber) -> u32
    Converts to this type from the input type.
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.1.0 · Source§
    impl From<Ipv4Addr> for u32
    Source§
    fn from(ip: Ipv4Addr) -> u32
    Uses Ipv4Addr::to_bits to convert an IPv4 address to a host byte order u32.
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    §
    impl From<Sequence> for u32
    §
    fn from(sequence: Sequence) -> u32
    Converts to this type from the input type.
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    §
    impl<O> From<U16<O>> for u32
    where\n    O: ByteOrder,
    §
    fn from(x: U16<O>) -> u32
    Converts to this type from the input type.
    ","From>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    §
    impl<O> From<U32<O>> for u32
    where\n    O: ByteOrder,
    §
    fn from(x: U32<O>) -> u32
    Converts to this type from the input type.
    ","From>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.28.0 · Source§
    impl From<bool> for u32
    Source§
    fn from(small: bool) -> u32
    Converts a bool to u32 losslessly.\nThe resulting value is 0 for false and 1 for true values.
    \n
    §Examples
    \n
    assert_eq!(u32::from(true), 1);\nassert_eq!(u32::from(false), 0);
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.13.0 · Source§
    impl From<char> for u32
    Source§
    fn from(c: char) -> u32
    Converts a char into a u32.
    \n
    §Examples
    \n
    use std::mem;\n\nlet c = 'c';\nlet u = u32::from(c);\nassert!(4 == mem::size_of_val(&u))
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.5.0 · Source§
    impl From<u16> for u32
    Source§
    fn from(small: u16) -> u32
    Converts u16 to u32 losslessly.
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.5.0 · Source§
    impl From<u8> for u32
    Source§
    fn from(small: u8) -> u32
    Converts u8 to u32 losslessly.
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl FromStr for u32
    Source§
    type Err = ParseIntError
    The associated error which can be returned from parsing.
    Source§
    fn from_str(src: &str) -> Result<u32, ParseIntError>
    Parses a string s to return a value of this type. Read more
    ","FromStr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Hash for u32
    Source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    Source§
    fn hash_slice<H>(data: &[u32], state: &mut H)
    where\n    H: Hasher,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl<'de, E> IntoDeserializer<'de, E> for u32
    where\n    E: Error,
    Source§
    type Deserializer = U32Deserializer<E>
    The type of the deserializer being converted into.
    Source§
    fn into_deserializer(self) -> U32Deserializer<E>
    Convert this value into a deserializer.
    ","IntoDeserializer<'de, E>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.42.0 · Source§
    impl LowerExp for u32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerExp","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl LowerHex for u32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerHex","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Mul<&u32> for u32
    Source§
    type Output = <u32 as Mul>::Output
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: &u32) -> <u32 as Mul>::Output
    Performs the * operation. Read more
    ","Mul<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.31.0 · Source§
    impl Mul<Duration> for u32
    Source§
    type Output = Duration
    The resulting type after applying the * operator.
    Source§
    fn mul(self, rhs: Duration) -> Duration
    Performs the * operation. Read more
    ","Mul","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Mul for u32
    Source§
    type Output = u32
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: u32) -> u32
    Performs the * operation. Read more
    ","Mul","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl MulAssign<&u32> for u32
    Source§
    fn mul_assign(&mut self, other: &u32)
    Performs the *= operation. Read more
    ","MulAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl MulAssign for u32
    Source§
    fn mul_assign(&mut self, other: u32)
    Performs the *= operation. Read more
    ","MulAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Not for u32
    Source§
    type Output = u32
    The resulting type after applying the ! operator.
    Source§
    fn not(self) -> u32
    Performs the unary ! operation. Read more
    ","Not","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Octal for u32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Octal","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Ord for u32
    Source§
    fn cmp(&self, other: &u32) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    §
    impl PackedFe32 for u32
    §
    const ONE: u32 = 1u32
    The one constant, for which stdlib provides no existing trait.
    §
    fn unpack(&self, n: usize) -> u8
    Extracts the coefficient of the x^n from the packed polynomial.
    §
    fn mul_by_x_then_add(&mut self, degree: usize, add: u8) -> u8
    Multiply the polynomial by x, drop its highest coefficient (and return it), and\nadd a new field element to the now-0 constant coefficient. Read more
    §
    const WIDTH: usize = _
    The number of fe32s that can fit into the type; computed as floor(bitwidth / 5).
    ","PackedFe32","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl PartialEq for u32
    Source§
    fn eq(&self, other: &u32) -> bool
    Tests for self and other values to be equal, and is used by ==.
    Source§
    fn ne(&self, other: &u32) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl PartialOrd for u32
    Source§
    fn partial_cmp(&self, other: &u32) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    Source§
    fn lt(&self, other: &u32) -> bool
    Tests less than (for self and other) and is used by the < operator. Read more
    Source§
    fn le(&self, other: &u32) -> bool
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    Source§
    fn ge(&self, other: &u32) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    Source§
    fn gt(&self, other: &u32) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    ","PartialOrd","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.12.0 · Source§
    impl<'a> Product<&'a u32> for u32
    Source§
    fn product<I>(iter: I) -> u32
    where\n    I: Iterator<Item = &'a u32>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product<&'a u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.12.0 · Source§
    impl Product for u32
    Source§
    fn product<I>(iter: I) -> u32
    where\n    I: Iterator<Item = u32>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl Random for u32
    Source§
    fn random(source: &mut (impl RandomSource + ?Sized)) -> u32
    🔬This is a nightly-only experimental API. (random)
    Generates a random value.
    \n
    Warning: Be careful when manipulating the resulting value! This\nmethod samples according to a uniform distribution, so a value of 1 is\njust as likely as MAX. By using modulo operations, some\nvalues can become more likely than others. Use audited crates when in\ndoubt.
    \n
    ","Random","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Rem<&u32> for u32
    Source§
    type Output = <u32 as Rem>::Output
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: &u32) -> <u32 as Rem>::Output
    Performs the % operation. Read more
    ","Rem<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.51.0 · Source§
    impl Rem<NonZero<u32>> for u32
    Source§
    fn rem(self, other: NonZero<u32>) -> u32
    This operation satisfies n % d == n - (n / d) * d, and cannot panic.
    \n
    Source§
    type Output = u32
    The resulting type after applying the % operator.
    ","Rem>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Rem for u32
    This operation satisfies n % d == n - (n / d) * d. The\nresult has the same sign as the left operand.
    \n
    §Panics
    \n
    This operation will panic if other == 0.
    \n
    Source§
    type Output = u32
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: u32) -> u32
    Performs the % operation. Read more
    ","Rem","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl RemAssign<&u32> for u32
    Source§
    fn rem_assign(&mut self, other: &u32)
    Performs the %= operation. Read more
    ","RemAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.79.0 · Source§
    impl RemAssign<NonZero<u32>> for u32
    Source§
    fn rem_assign(&mut self, other: NonZero<u32>)
    This operation satisfies n % d == n - (n / d) * d, and cannot panic.
    \n
    ","RemAssign>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl RemAssign for u32
    Source§
    fn rem_assign(&mut self, other: u32)
    Performs the %= operation. Read more
    ","RemAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl SampleUniform for u32
    Source§
    type Sampler = UniformInt<u32>
    The UniformSampler implementation supporting type X.
    ","SampleUniform","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl Serialize for u32
    Source§
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&i128> for u32
    Source§
    type Output = <u32 as Shl<i128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i128) -> <u32 as Shl<i128>>::Output
    Performs the << operation. Read more
    ","Shl<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&i16> for u32
    Source§
    type Output = <u32 as Shl<i16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i16) -> <u32 as Shl<i16>>::Output
    Performs the << operation. Read more
    ","Shl<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&i32> for u32
    Source§
    type Output = <u32 as Shl<i32>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i32) -> <u32 as Shl<i32>>::Output
    Performs the << operation. Read more
    ","Shl<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&i64> for u32
    Source§
    type Output = <u32 as Shl<i64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i64) -> <u32 as Shl<i64>>::Output
    Performs the << operation. Read more
    ","Shl<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&i8> for u32
    Source§
    type Output = <u32 as Shl<i8>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i8) -> <u32 as Shl<i8>>::Output
    Performs the << operation. Read more
    ","Shl<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&isize> for u32
    Source§
    type Output = <u32 as Shl<isize>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &isize) -> <u32 as Shl<isize>>::Output
    Performs the << operation. Read more
    ","Shl<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&u128> for u32
    Source§
    type Output = <u32 as Shl<u128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u128) -> <u32 as Shl<u128>>::Output
    Performs the << operation. Read more
    ","Shl<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&u16> for u32
    Source§
    type Output = <u32 as Shl<u16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u16) -> <u32 as Shl<u16>>::Output
    Performs the << operation. Read more
    ","Shl<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&u32> for u32
    Source§
    type Output = <u32 as Shl>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u32) -> <u32 as Shl>::Output
    Performs the << operation. Read more
    ","Shl<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&u64> for u32
    Source§
    type Output = <u32 as Shl<u64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u64) -> <u32 as Shl<u64>>::Output
    Performs the << operation. Read more
    ","Shl<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&u8> for u32
    Source§
    type Output = <u32 as Shl<u8>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u8) -> <u32 as Shl<u8>>::Output
    Performs the << operation. Read more
    ","Shl<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&usize> for u32
    Source§
    type Output = <u32 as Shl<usize>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &usize) -> <u32 as Shl<usize>>::Output
    Performs the << operation. Read more
    ","Shl<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<i128> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i128) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<i16> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i16) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<i32> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i32) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<i64> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i64) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<i8> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i8) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<isize> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: isize) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<u128> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u128) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<u16> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u16) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<u64> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u64) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<u8> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u8) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<usize> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: usize) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u32) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&i128> for u32
    Source§
    fn shl_assign(&mut self, other: &i128)
    Performs the <<= operation. Read more
    ","ShlAssign<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&i16> for u32
    Source§
    fn shl_assign(&mut self, other: &i16)
    Performs the <<= operation. Read more
    ","ShlAssign<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&i32> for u32
    Source§
    fn shl_assign(&mut self, other: &i32)
    Performs the <<= operation. Read more
    ","ShlAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&i64> for u32
    Source§
    fn shl_assign(&mut self, other: &i64)
    Performs the <<= operation. Read more
    ","ShlAssign<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&i8> for u32
    Source§
    fn shl_assign(&mut self, other: &i8)
    Performs the <<= operation. Read more
    ","ShlAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&isize> for u32
    Source§
    fn shl_assign(&mut self, other: &isize)
    Performs the <<= operation. Read more
    ","ShlAssign<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&u128> for u32
    Source§
    fn shl_assign(&mut self, other: &u128)
    Performs the <<= operation. Read more
    ","ShlAssign<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&u16> for u32
    Source§
    fn shl_assign(&mut self, other: &u16)
    Performs the <<= operation. Read more
    ","ShlAssign<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&u32> for u32
    Source§
    fn shl_assign(&mut self, other: &u32)
    Performs the <<= operation. Read more
    ","ShlAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&u64> for u32
    Source§
    fn shl_assign(&mut self, other: &u64)
    Performs the <<= operation. Read more
    ","ShlAssign<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&u8> for u32
    Source§
    fn shl_assign(&mut self, other: &u8)
    Performs the <<= operation. Read more
    ","ShlAssign<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&usize> for u32
    Source§
    fn shl_assign(&mut self, other: &usize)
    Performs the <<= operation. Read more
    ","ShlAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<i128> for u32
    Source§
    fn shl_assign(&mut self, other: i128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<i16> for u32
    Source§
    fn shl_assign(&mut self, other: i16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<i32> for u32
    Source§
    fn shl_assign(&mut self, other: i32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<i64> for u32
    Source§
    fn shl_assign(&mut self, other: i64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<i8> for u32
    Source§
    fn shl_assign(&mut self, other: i8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<isize> for u32
    Source§
    fn shl_assign(&mut self, other: isize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<u128> for u32
    Source§
    fn shl_assign(&mut self, other: u128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<u16> for u32
    Source§
    fn shl_assign(&mut self, other: u16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<u64> for u32
    Source§
    fn shl_assign(&mut self, other: u64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<u8> for u32
    Source§
    fn shl_assign(&mut self, other: u8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<usize> for u32
    Source§
    fn shl_assign(&mut self, other: usize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign for u32
    Source§
    fn shl_assign(&mut self, other: u32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&i128> for u32
    Source§
    type Output = <u32 as Shr<i128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i128) -> <u32 as Shr<i128>>::Output
    Performs the >> operation. Read more
    ","Shr<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&i16> for u32
    Source§
    type Output = <u32 as Shr<i16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i16) -> <u32 as Shr<i16>>::Output
    Performs the >> operation. Read more
    ","Shr<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&i32> for u32
    Source§
    type Output = <u32 as Shr<i32>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i32) -> <u32 as Shr<i32>>::Output
    Performs the >> operation. Read more
    ","Shr<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&i64> for u32
    Source§
    type Output = <u32 as Shr<i64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i64) -> <u32 as Shr<i64>>::Output
    Performs the >> operation. Read more
    ","Shr<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&i8> for u32
    Source§
    type Output = <u32 as Shr<i8>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i8) -> <u32 as Shr<i8>>::Output
    Performs the >> operation. Read more
    ","Shr<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&isize> for u32
    Source§
    type Output = <u32 as Shr<isize>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &isize) -> <u32 as Shr<isize>>::Output
    Performs the >> operation. Read more
    ","Shr<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&u128> for u32
    Source§
    type Output = <u32 as Shr<u128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u128) -> <u32 as Shr<u128>>::Output
    Performs the >> operation. Read more
    ","Shr<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&u16> for u32
    Source§
    type Output = <u32 as Shr<u16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u16) -> <u32 as Shr<u16>>::Output
    Performs the >> operation. Read more
    ","Shr<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&u32> for u32
    Source§
    type Output = <u32 as Shr>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u32) -> <u32 as Shr>::Output
    Performs the >> operation. Read more
    ","Shr<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&u64> for u32
    Source§
    type Output = <u32 as Shr<u64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u64) -> <u32 as Shr<u64>>::Output
    Performs the >> operation. Read more
    ","Shr<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&u8> for u32
    Source§
    type Output = <u32 as Shr<u8>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u8) -> <u32 as Shr<u8>>::Output
    Performs the >> operation. Read more
    ","Shr<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&usize> for u32
    Source§
    type Output = <u32 as Shr<usize>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &usize) -> <u32 as Shr<usize>>::Output
    Performs the >> operation. Read more
    ","Shr<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<i128> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i128) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<i16> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i16) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<i32> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i32) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<i64> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i64) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<i8> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i8) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<isize> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: isize) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<u128> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u128) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<u16> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u16) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<u64> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u64) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<u8> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u8) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<usize> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: usize) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u32) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&i128> for u32
    Source§
    fn shr_assign(&mut self, other: &i128)
    Performs the >>= operation. Read more
    ","ShrAssign<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&i16> for u32
    Source§
    fn shr_assign(&mut self, other: &i16)
    Performs the >>= operation. Read more
    ","ShrAssign<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&i32> for u32
    Source§
    fn shr_assign(&mut self, other: &i32)
    Performs the >>= operation. Read more
    ","ShrAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&i64> for u32
    Source§
    fn shr_assign(&mut self, other: &i64)
    Performs the >>= operation. Read more
    ","ShrAssign<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&i8> for u32
    Source§
    fn shr_assign(&mut self, other: &i8)
    Performs the >>= operation. Read more
    ","ShrAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&isize> for u32
    Source§
    fn shr_assign(&mut self, other: &isize)
    Performs the >>= operation. Read more
    ","ShrAssign<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&u128> for u32
    Source§
    fn shr_assign(&mut self, other: &u128)
    Performs the >>= operation. Read more
    ","ShrAssign<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&u16> for u32
    Source§
    fn shr_assign(&mut self, other: &u16)
    Performs the >>= operation. Read more
    ","ShrAssign<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&u32> for u32
    Source§
    fn shr_assign(&mut self, other: &u32)
    Performs the >>= operation. Read more
    ","ShrAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&u64> for u32
    Source§
    fn shr_assign(&mut self, other: &u64)
    Performs the >>= operation. Read more
    ","ShrAssign<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&u8> for u32
    Source§
    fn shr_assign(&mut self, other: &u8)
    Performs the >>= operation. Read more
    ","ShrAssign<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&usize> for u32
    Source§
    fn shr_assign(&mut self, other: &usize)
    Performs the >>= operation. Read more
    ","ShrAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<i128> for u32
    Source§
    fn shr_assign(&mut self, other: i128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<i16> for u32
    Source§
    fn shr_assign(&mut self, other: i16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<i32> for u32
    Source§
    fn shr_assign(&mut self, other: i32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<i64> for u32
    Source§
    fn shr_assign(&mut self, other: i64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<i8> for u32
    Source§
    fn shr_assign(&mut self, other: i8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<isize> for u32
    Source§
    fn shr_assign(&mut self, other: isize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<u128> for u32
    Source§
    fn shr_assign(&mut self, other: u128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<u16> for u32
    Source§
    fn shr_assign(&mut self, other: u16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<u64> for u32
    Source§
    fn shr_assign(&mut self, other: u64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<u8> for u32
    Source§
    fn shr_assign(&mut self, other: u8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<usize> for u32
    Source§
    fn shr_assign(&mut self, other: usize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign for u32
    Source§
    fn shr_assign(&mut self, other: u32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl SimdElement for u32
    Source§
    type Mask = i32
    🔬This is a nightly-only experimental API. (portable_simd)
    The mask element type corresponding to this element type.
    ","SimdElement","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl Step for u32
    Source§
    fn forward(start: u32, n: usize) -> u32
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward(start: u32, n: usize) -> u32
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    unsafe fn forward_unchecked(start: u32, n: usize) -> u32
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    unsafe fn backward_unchecked(start: u32, n: usize) -> u32
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    fn steps_between(start: &u32, end: &u32) -> (usize, Option<usize>)
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the bounds on the number of successor steps required to get from start to end\nlike Iterator::size_hint(). Read more
    Source§
    fn forward_checked(start: u32, n: usize) -> Option<u32>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward_checked(start: u32, n: usize) -> Option<u32>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    ","Step","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Sub<&u32> for u32
    Source§
    type Output = <u32 as Sub>::Output
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: &u32) -> <u32 as Sub>::Output
    Performs the - operation. Read more
    ","Sub<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Sub for u32
    Source§
    type Output = u32
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: u32) -> u32
    Performs the - operation. Read more
    ","Sub","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl SubAssign<&u32> for u32
    Source§
    fn sub_assign(&mut self, other: &u32)
    Performs the -= operation. Read more
    ","SubAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl SubAssign for u32
    Source§
    fn sub_assign(&mut self, other: u32)
    Performs the -= operation. Read more
    ","SubAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.12.0 · Source§
    impl<'a> Sum<&'a u32> for u32
    Source§
    fn sum<I>(iter: I) -> u32
    where\n    I: Iterator<Item = &'a u32>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum<&'a u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.12.0 · Source§
    impl Sum for u32
    Source§
    fn sum<I>(iter: I) -> u32
    where\n    I: Iterator<Item = u32>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.34.0 · Source§
    impl TryFrom<i128> for u32
    Source§
    fn try_from(u: i128) -> Result<u32, <u32 as TryFrom<i128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.34.0 · Source§
    impl TryFrom<i16> for u32
    Source§
    fn try_from(u: i16) -> Result<u32, <u32 as TryFrom<i16>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.34.0 · Source§
    impl TryFrom<i32> for u32
    Source§
    fn try_from(u: i32) -> Result<u32, <u32 as TryFrom<i32>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.34.0 · Source§
    impl TryFrom<i64> for u32
    Source§
    fn try_from(u: i64) -> Result<u32, <u32 as TryFrom<i64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.34.0 · Source§
    impl TryFrom<i8> for u32
    Source§
    fn try_from(u: i8) -> Result<u32, <u32 as TryFrom<i8>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.34.0 · Source§
    impl TryFrom<isize> for u32
    Source§
    fn try_from(u: isize) -> Result<u32, <u32 as TryFrom<isize>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.34.0 · Source§
    impl TryFrom<u128> for u32
    Source§
    fn try_from(u: u128) -> Result<u32, <u32 as TryFrom<u128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.34.0 · Source§
    impl TryFrom<u64> for u32
    Source§
    fn try_from(u: u64) -> Result<u32, <u32 as TryFrom<u64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.34.0 · Source§
    impl TryFrom<usize> for u32
    Source§
    fn try_from(u: usize) -> Result<u32, <u32 as TryFrom<usize>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.42.0 · Source§
    impl UpperExp for u32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperExp","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl UpperHex for u32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperHex","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl ConstParamTy_ for u32
    ","ConstParamTy_","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Copy for u32
    ","Copy","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Eq for u32
    ","Eq","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl SimdCast for u32
    ","SimdCast","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl StructuralPartialEq for u32
    ","StructuralPartialEq","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl TrustedStep for u32
    ","TrustedStep","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl UnsizedConstParamTy for u32
    ","UnsizedConstParamTy","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl Weight for u32
    ","Weight","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl ZeroablePrimitive for u32
    ","ZeroablePrimitive","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"]]]]);
+    var type_impls = Object.fromEntries([["bdk_chain",[["
    1.0.0 · Source§
    impl Add<&u32> for u32
    Source§
    type Output = <u32 as Add>::Output
    The resulting type after applying the + operator.
    Source§
    fn add(self, other: &u32) -> <u32 as Add>::Output
    Performs the + operation. Read more
    ","Add<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Add for u32
    Source§
    type Output = u32
    The resulting type after applying the + operator.
    Source§
    const fn add(self, other: u32) -> u32
    Performs the + operation. Read more
    ","Add","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl AddAssign<&u32> for u32
    Source§
    fn add_assign(&mut self, other: &u32)
    Performs the += operation. Read more
    ","AddAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl AddAssign for u32
    Source§
    fn add_assign(&mut self, other: u32)
    Performs the += operation. Read more
    ","AddAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Binary for u32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Binary","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl BitAnd<&u32> for u32
    Source§
    type Output = <u32 as BitAnd>::Output
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, other: &u32) -> <u32 as BitAnd>::Output
    Performs the & operation. Read more
    ","BitAnd<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl BitAnd for u32
    Source§
    type Output = u32
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, rhs: u32) -> u32
    Performs the & operation. Read more
    ","BitAnd","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl BitAndAssign<&u32> for u32
    Source§
    fn bitand_assign(&mut self, other: &u32)
    Performs the &= operation. Read more
    ","BitAndAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl BitAndAssign for u32
    Source§
    fn bitand_assign(&mut self, other: u32)
    Performs the &= operation. Read more
    ","BitAndAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl BitOr<&u32> for u32
    Source§
    type Output = <u32 as BitOr>::Output
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, other: &u32) -> <u32 as BitOr>::Output
    Performs the | operation. Read more
    ","BitOr<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl BitOr for u32
    Source§
    type Output = u32
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, rhs: u32) -> u32
    Performs the | operation. Read more
    ","BitOr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl BitOrAssign<&u32> for u32
    Source§
    fn bitor_assign(&mut self, other: &u32)
    Performs the |= operation. Read more
    ","BitOrAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl BitOrAssign for u32
    Source§
    fn bitor_assign(&mut self, other: u32)
    Performs the |= operation. Read more
    ","BitOrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl BitXor<&u32> for u32
    Source§
    type Output = <u32 as BitXor>::Output
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: &u32) -> <u32 as BitXor>::Output
    Performs the ^ operation. Read more
    ","BitXor<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl BitXor for u32
    Source§
    type Output = u32
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: u32) -> u32
    Performs the ^ operation. Read more
    ","BitXor","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl BitXorAssign<&u32> for u32
    Source§
    fn bitxor_assign(&mut self, other: &u32)
    Performs the ^= operation. Read more
    ","BitXorAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl BitXorAssign for u32
    Source§
    fn bitxor_assign(&mut self, other: u32)
    Performs the ^= operation. Read more
    ","BitXorAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl CarryingMulAdd for u32
    Source§
    type Unsigned = u32
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    Source§
    const fn carrying_mul_add(self, a: u32, b: u32, c: u32) -> (u32, u32)
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    ","CarryingMulAdd","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Clone for u32
    Source§
    fn clone(&self) -> u32
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    ","Clone","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Debug for u32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    §
    impl Decodable for u32
    §
    fn consensus_decode<R>(r: &mut R) -> Result<u32, Error>
    where\n    R: Read + ?Sized,
    Decode an object with a well-defined format. Read more
    §
    fn consensus_decode_from_finite_reader<R>(reader: &mut R) -> Result<Self, Error>
    where\n    R: Read + ?Sized,
    Decode Self from a size-limited reader. Read more
    ","Decodable","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Default for u32
    Source§
    fn default() -> u32
    Returns the default value of 0
    \n
    ","Default","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl<'de> Deserialize<'de> for u32
    Source§
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<u32, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Display for u32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Display","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Div<&u32> for u32
    Source§
    type Output = <u32 as Div>::Output
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: &u32) -> <u32 as Div>::Output
    Performs the / operation. Read more
    ","Div<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.51.0 · Source§
    impl Div<NonZero<u32>> for u32
    Source§
    fn div(self, other: NonZero<u32>) -> u32
    This operation rounds towards zero, truncating any fractional\npart of the exact result, and cannot panic.
    \n
    Source§
    type Output = u32
    The resulting type after applying the / operator.
    ","Div>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Div for u32
    This operation rounds towards zero, truncating any\nfractional part of the exact result.
    \n
    §Panics
    \n
    This operation will panic if other == 0.
    \n
    Source§
    type Output = u32
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: u32) -> u32
    Performs the / operation. Read more
    ","Div","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl DivAssign<&u32> for u32
    Source§
    fn div_assign(&mut self, other: &u32)
    Performs the /= operation. Read more
    ","DivAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.79.0 · Source§
    impl DivAssign<NonZero<u32>> for u32
    Source§
    fn div_assign(&mut self, other: NonZero<u32>)
    This operation rounds towards zero, truncating any fractional\npart of the exact result, and cannot panic.
    \n
    ","DivAssign>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl DivAssign for u32
    Source§
    fn div_assign(&mut self, other: u32)
    Performs the /= operation. Read more
    ","DivAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    §
    impl Encodable for u32
    §
    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where\n    W: Write + ?Sized,
    Encodes an object with a well-defined format. Read more
    ","Encodable","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl From<AsciiChar> for u32
    Source§
    fn from(chr: AsciiChar) -> u32
    Converts to this type from the input type.
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    §
    impl From<ChildNumber> for u32
    §
    fn from(cnum: ChildNumber) -> u32
    Converts to this type from the input type.
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.1.0 · Source§
    impl From<Ipv4Addr> for u32
    Source§
    fn from(ip: Ipv4Addr) -> u32
    Uses Ipv4Addr::to_bits to convert an IPv4 address to a host byte order u32.
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    §
    impl From<Sequence> for u32
    §
    fn from(sequence: Sequence) -> u32
    Converts to this type from the input type.
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    §
    impl<O> From<U16<O>> for u32
    where\n    O: ByteOrder,
    §
    fn from(x: U16<O>) -> u32
    Converts to this type from the input type.
    ","From>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    §
    impl<O> From<U32<O>> for u32
    where\n    O: ByteOrder,
    §
    fn from(x: U32<O>) -> u32
    Converts to this type from the input type.
    ","From>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.28.0 · Source§
    impl From<bool> for u32
    Source§
    fn from(small: bool) -> u32
    Converts a bool to u32 losslessly.\nThe resulting value is 0 for false and 1 for true values.
    \n
    §Examples
    \n
    assert_eq!(u32::from(true), 1);\nassert_eq!(u32::from(false), 0);
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.13.0 · Source§
    impl From<char> for u32
    Source§
    fn from(c: char) -> u32
    Converts a char into a u32.
    \n
    §Examples
    \n
    use std::mem;\n\nlet c = 'c';\nlet u = u32::from(c);\nassert!(4 == mem::size_of_val(&u))
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.5.0 · Source§
    impl From<u16> for u32
    Source§
    fn from(small: u16) -> u32
    Converts u16 to u32 losslessly.
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.5.0 · Source§
    impl From<u8> for u32
    Source§
    fn from(small: u8) -> u32
    Converts u8 to u32 losslessly.
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl FromStr for u32
    Source§
    type Err = ParseIntError
    The associated error which can be returned from parsing.
    Source§
    fn from_str(src: &str) -> Result<u32, ParseIntError>
    Parses a string s to return a value of this type. Read more
    ","FromStr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Hash for u32
    Source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    Source§
    fn hash_slice<H>(data: &[u32], state: &mut H)
    where\n    H: Hasher,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl<'de, E> IntoDeserializer<'de, E> for u32
    where\n    E: Error,
    Source§
    type Deserializer = U32Deserializer<E>
    The type of the deserializer being converted into.
    Source§
    fn into_deserializer(self) -> U32Deserializer<E>
    Convert this value into a deserializer.
    ","IntoDeserializer<'de, E>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.42.0 · Source§
    impl LowerExp for u32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerExp","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl LowerHex for u32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerHex","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Mul<&u32> for u32
    Source§
    type Output = <u32 as Mul>::Output
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: &u32) -> <u32 as Mul>::Output
    Performs the * operation. Read more
    ","Mul<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.31.0 · Source§
    impl Mul<Duration> for u32
    Source§
    type Output = Duration
    The resulting type after applying the * operator.
    Source§
    fn mul(self, rhs: Duration) -> Duration
    Performs the * operation. Read more
    ","Mul","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Mul for u32
    Source§
    type Output = u32
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: u32) -> u32
    Performs the * operation. Read more
    ","Mul","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl MulAssign<&u32> for u32
    Source§
    fn mul_assign(&mut self, other: &u32)
    Performs the *= operation. Read more
    ","MulAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl MulAssign for u32
    Source§
    fn mul_assign(&mut self, other: u32)
    Performs the *= operation. Read more
    ","MulAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Not for u32
    Source§
    type Output = u32
    The resulting type after applying the ! operator.
    Source§
    fn not(self) -> u32
    Performs the unary ! operation. Read more
    ","Not","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Octal for u32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Octal","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Ord for u32
    Source§
    fn cmp(&self, other: &u32) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    §
    impl PackedFe32 for u32
    §
    const ONE: u32 = 1u32
    The one constant, for which stdlib provides no existing trait.
    §
    fn unpack(&self, n: usize) -> u8
    Extracts the coefficient of the x^n from the packed polynomial.
    §
    fn mul_by_x_then_add(&mut self, degree: usize, add: u8) -> u8
    Multiply the polynomial by x, drop its highest coefficient (and return it), and\nadd a new field element to the now-0 constant coefficient. Read more
    §
    const WIDTH: usize = _
    The number of fe32s that can fit into the type; computed as floor(bitwidth / 5).
    ","PackedFe32","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl PartialEq for u32
    Source§
    fn eq(&self, other: &u32) -> bool
    Tests for self and other values to be equal, and is used by ==.
    Source§
    fn ne(&self, other: &u32) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl PartialOrd for u32
    Source§
    fn partial_cmp(&self, other: &u32) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    Source§
    fn lt(&self, other: &u32) -> bool
    Tests less than (for self and other) and is used by the < operator. Read more
    Source§
    fn le(&self, other: &u32) -> bool
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    Source§
    fn ge(&self, other: &u32) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    Source§
    fn gt(&self, other: &u32) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    ","PartialOrd","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.12.0 · Source§
    impl<'a> Product<&'a u32> for u32
    Source§
    fn product<I>(iter: I) -> u32
    where\n    I: Iterator<Item = &'a u32>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product<&'a u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.12.0 · Source§
    impl Product for u32
    Source§
    fn product<I>(iter: I) -> u32
    where\n    I: Iterator<Item = u32>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl Random for u32
    Source§
    fn random(source: &mut (impl RandomSource + ?Sized)) -> u32
    🔬This is a nightly-only experimental API. (random)
    Generates a random value.
    \n
    Warning: Be careful when manipulating the resulting value! This\nmethod samples according to a uniform distribution, so a value of 1 is\njust as likely as MAX. By using modulo operations, some\nvalues can become more likely than others. Use audited crates when in\ndoubt.
    \n
    ","Random","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Rem<&u32> for u32
    Source§
    type Output = <u32 as Rem>::Output
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: &u32) -> <u32 as Rem>::Output
    Performs the % operation. Read more
    ","Rem<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.51.0 · Source§
    impl Rem<NonZero<u32>> for u32
    Source§
    fn rem(self, other: NonZero<u32>) -> u32
    This operation satisfies n % d == n - (n / d) * d, and cannot panic.
    \n
    Source§
    type Output = u32
    The resulting type after applying the % operator.
    ","Rem>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Rem for u32
    This operation satisfies n % d == n - (n / d) * d. The\nresult has the same sign as the left operand.
    \n
    §Panics
    \n
    This operation will panic if other == 0.
    \n
    Source§
    type Output = u32
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: u32) -> u32
    Performs the % operation. Read more
    ","Rem","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl RemAssign<&u32> for u32
    Source§
    fn rem_assign(&mut self, other: &u32)
    Performs the %= operation. Read more
    ","RemAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.79.0 · Source§
    impl RemAssign<NonZero<u32>> for u32
    Source§
    fn rem_assign(&mut self, other: NonZero<u32>)
    This operation satisfies n % d == n - (n / d) * d, and cannot panic.
    \n
    ","RemAssign>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl RemAssign for u32
    Source§
    fn rem_assign(&mut self, other: u32)
    Performs the %= operation. Read more
    ","RemAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl SampleUniform for u32
    Source§
    type Sampler = UniformInt<u32>
    The UniformSampler implementation supporting type X.
    ","SampleUniform","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl Serialize for u32
    Source§
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&i128> for u32
    Source§
    type Output = <u32 as Shl<i128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i128) -> <u32 as Shl<i128>>::Output
    Performs the << operation. Read more
    ","Shl<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&i16> for u32
    Source§
    type Output = <u32 as Shl<i16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i16) -> <u32 as Shl<i16>>::Output
    Performs the << operation. Read more
    ","Shl<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&i32> for u32
    Source§
    type Output = <u32 as Shl<i32>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i32) -> <u32 as Shl<i32>>::Output
    Performs the << operation. Read more
    ","Shl<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&i64> for u32
    Source§
    type Output = <u32 as Shl<i64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i64) -> <u32 as Shl<i64>>::Output
    Performs the << operation. Read more
    ","Shl<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&i8> for u32
    Source§
    type Output = <u32 as Shl<i8>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i8) -> <u32 as Shl<i8>>::Output
    Performs the << operation. Read more
    ","Shl<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&isize> for u32
    Source§
    type Output = <u32 as Shl<isize>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &isize) -> <u32 as Shl<isize>>::Output
    Performs the << operation. Read more
    ","Shl<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&u128> for u32
    Source§
    type Output = <u32 as Shl<u128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u128) -> <u32 as Shl<u128>>::Output
    Performs the << operation. Read more
    ","Shl<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&u16> for u32
    Source§
    type Output = <u32 as Shl<u16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u16) -> <u32 as Shl<u16>>::Output
    Performs the << operation. Read more
    ","Shl<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&u32> for u32
    Source§
    type Output = <u32 as Shl>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u32) -> <u32 as Shl>::Output
    Performs the << operation. Read more
    ","Shl<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&u64> for u32
    Source§
    type Output = <u32 as Shl<u64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u64) -> <u32 as Shl<u64>>::Output
    Performs the << operation. Read more
    ","Shl<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&u8> for u32
    Source§
    type Output = <u32 as Shl<u8>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u8) -> <u32 as Shl<u8>>::Output
    Performs the << operation. Read more
    ","Shl<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<&usize> for u32
    Source§
    type Output = <u32 as Shl<usize>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &usize) -> <u32 as Shl<usize>>::Output
    Performs the << operation. Read more
    ","Shl<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<i128> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i128) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<i16> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i16) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<i32> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i32) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<i64> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i64) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<i8> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i8) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<isize> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: isize) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<u128> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u128) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<u16> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u16) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<u64> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u64) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<u8> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u8) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl<usize> for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: usize) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shl for u32
    Source§
    type Output = u32
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u32) -> u32
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&i128> for u32
    Source§
    fn shl_assign(&mut self, other: &i128)
    Performs the <<= operation. Read more
    ","ShlAssign<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&i16> for u32
    Source§
    fn shl_assign(&mut self, other: &i16)
    Performs the <<= operation. Read more
    ","ShlAssign<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&i32> for u32
    Source§
    fn shl_assign(&mut self, other: &i32)
    Performs the <<= operation. Read more
    ","ShlAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&i64> for u32
    Source§
    fn shl_assign(&mut self, other: &i64)
    Performs the <<= operation. Read more
    ","ShlAssign<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&i8> for u32
    Source§
    fn shl_assign(&mut self, other: &i8)
    Performs the <<= operation. Read more
    ","ShlAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&isize> for u32
    Source§
    fn shl_assign(&mut self, other: &isize)
    Performs the <<= operation. Read more
    ","ShlAssign<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&u128> for u32
    Source§
    fn shl_assign(&mut self, other: &u128)
    Performs the <<= operation. Read more
    ","ShlAssign<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&u16> for u32
    Source§
    fn shl_assign(&mut self, other: &u16)
    Performs the <<= operation. Read more
    ","ShlAssign<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&u32> for u32
    Source§
    fn shl_assign(&mut self, other: &u32)
    Performs the <<= operation. Read more
    ","ShlAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&u64> for u32
    Source§
    fn shl_assign(&mut self, other: &u64)
    Performs the <<= operation. Read more
    ","ShlAssign<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&u8> for u32
    Source§
    fn shl_assign(&mut self, other: &u8)
    Performs the <<= operation. Read more
    ","ShlAssign<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShlAssign<&usize> for u32
    Source§
    fn shl_assign(&mut self, other: &usize)
    Performs the <<= operation. Read more
    ","ShlAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<i128> for u32
    Source§
    fn shl_assign(&mut self, other: i128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<i16> for u32
    Source§
    fn shl_assign(&mut self, other: i16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<i32> for u32
    Source§
    fn shl_assign(&mut self, other: i32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<i64> for u32
    Source§
    fn shl_assign(&mut self, other: i64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<i8> for u32
    Source§
    fn shl_assign(&mut self, other: i8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<isize> for u32
    Source§
    fn shl_assign(&mut self, other: isize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<u128> for u32
    Source§
    fn shl_assign(&mut self, other: u128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<u16> for u32
    Source§
    fn shl_assign(&mut self, other: u16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<u64> for u32
    Source§
    fn shl_assign(&mut self, other: u64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<u8> for u32
    Source§
    fn shl_assign(&mut self, other: u8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign<usize> for u32
    Source§
    fn shl_assign(&mut self, other: usize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShlAssign for u32
    Source§
    fn shl_assign(&mut self, other: u32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&i128> for u32
    Source§
    type Output = <u32 as Shr<i128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i128) -> <u32 as Shr<i128>>::Output
    Performs the >> operation. Read more
    ","Shr<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&i16> for u32
    Source§
    type Output = <u32 as Shr<i16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i16) -> <u32 as Shr<i16>>::Output
    Performs the >> operation. Read more
    ","Shr<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&i32> for u32
    Source§
    type Output = <u32 as Shr<i32>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i32) -> <u32 as Shr<i32>>::Output
    Performs the >> operation. Read more
    ","Shr<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&i64> for u32
    Source§
    type Output = <u32 as Shr<i64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i64) -> <u32 as Shr<i64>>::Output
    Performs the >> operation. Read more
    ","Shr<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&i8> for u32
    Source§
    type Output = <u32 as Shr<i8>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i8) -> <u32 as Shr<i8>>::Output
    Performs the >> operation. Read more
    ","Shr<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&isize> for u32
    Source§
    type Output = <u32 as Shr<isize>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &isize) -> <u32 as Shr<isize>>::Output
    Performs the >> operation. Read more
    ","Shr<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&u128> for u32
    Source§
    type Output = <u32 as Shr<u128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u128) -> <u32 as Shr<u128>>::Output
    Performs the >> operation. Read more
    ","Shr<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&u16> for u32
    Source§
    type Output = <u32 as Shr<u16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u16) -> <u32 as Shr<u16>>::Output
    Performs the >> operation. Read more
    ","Shr<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&u32> for u32
    Source§
    type Output = <u32 as Shr>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u32) -> <u32 as Shr>::Output
    Performs the >> operation. Read more
    ","Shr<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&u64> for u32
    Source§
    type Output = <u32 as Shr<u64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u64) -> <u32 as Shr<u64>>::Output
    Performs the >> operation. Read more
    ","Shr<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&u8> for u32
    Source§
    type Output = <u32 as Shr<u8>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u8) -> <u32 as Shr<u8>>::Output
    Performs the >> operation. Read more
    ","Shr<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<&usize> for u32
    Source§
    type Output = <u32 as Shr<usize>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &usize) -> <u32 as Shr<usize>>::Output
    Performs the >> operation. Read more
    ","Shr<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<i128> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i128) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<i16> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i16) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<i32> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i32) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<i64> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i64) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<i8> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i8) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<isize> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: isize) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<u128> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u128) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<u16> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u16) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<u64> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u64) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<u8> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u8) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr<usize> for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: usize) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Shr for u32
    Source§
    type Output = u32
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u32) -> u32
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&i128> for u32
    Source§
    fn shr_assign(&mut self, other: &i128)
    Performs the >>= operation. Read more
    ","ShrAssign<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&i16> for u32
    Source§
    fn shr_assign(&mut self, other: &i16)
    Performs the >>= operation. Read more
    ","ShrAssign<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&i32> for u32
    Source§
    fn shr_assign(&mut self, other: &i32)
    Performs the >>= operation. Read more
    ","ShrAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&i64> for u32
    Source§
    fn shr_assign(&mut self, other: &i64)
    Performs the >>= operation. Read more
    ","ShrAssign<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&i8> for u32
    Source§
    fn shr_assign(&mut self, other: &i8)
    Performs the >>= operation. Read more
    ","ShrAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&isize> for u32
    Source§
    fn shr_assign(&mut self, other: &isize)
    Performs the >>= operation. Read more
    ","ShrAssign<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&u128> for u32
    Source§
    fn shr_assign(&mut self, other: &u128)
    Performs the >>= operation. Read more
    ","ShrAssign<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&u16> for u32
    Source§
    fn shr_assign(&mut self, other: &u16)
    Performs the >>= operation. Read more
    ","ShrAssign<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&u32> for u32
    Source§
    fn shr_assign(&mut self, other: &u32)
    Performs the >>= operation. Read more
    ","ShrAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&u64> for u32
    Source§
    fn shr_assign(&mut self, other: &u64)
    Performs the >>= operation. Read more
    ","ShrAssign<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&u8> for u32
    Source§
    fn shr_assign(&mut self, other: &u8)
    Performs the >>= operation. Read more
    ","ShrAssign<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl ShrAssign<&usize> for u32
    Source§
    fn shr_assign(&mut self, other: &usize)
    Performs the >>= operation. Read more
    ","ShrAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<i128> for u32
    Source§
    fn shr_assign(&mut self, other: i128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<i16> for u32
    Source§
    fn shr_assign(&mut self, other: i16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<i32> for u32
    Source§
    fn shr_assign(&mut self, other: i32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<i64> for u32
    Source§
    fn shr_assign(&mut self, other: i64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<i8> for u32
    Source§
    fn shr_assign(&mut self, other: i8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<isize> for u32
    Source§
    fn shr_assign(&mut self, other: isize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<u128> for u32
    Source§
    fn shr_assign(&mut self, other: u128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<u16> for u32
    Source§
    fn shr_assign(&mut self, other: u16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<u64> for u32
    Source§
    fn shr_assign(&mut self, other: u64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<u8> for u32
    Source§
    fn shr_assign(&mut self, other: u8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign<usize> for u32
    Source§
    fn shr_assign(&mut self, other: usize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl ShrAssign for u32
    Source§
    fn shr_assign(&mut self, other: u32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl SimdElement for u32
    Source§
    type Mask = i32
    🔬This is a nightly-only experimental API. (portable_simd)
    The mask element type corresponding to this element type.
    ","SimdElement","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl Step for u32
    Source§
    fn forward(start: u32, n: usize) -> u32
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward(start: u32, n: usize) -> u32
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    unsafe fn forward_unchecked(start: u32, n: usize) -> u32
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    unsafe fn backward_unchecked(start: u32, n: usize) -> u32
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    fn steps_between(start: &u32, end: &u32) -> (usize, Option<usize>)
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the bounds on the number of successor steps required to get from start to end\nlike Iterator::size_hint(). Read more
    Source§
    fn forward_checked(start: u32, n: usize) -> Option<u32>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward_checked(start: u32, n: usize) -> Option<u32>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    ","Step","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Sub<&u32> for u32
    Source§
    type Output = <u32 as Sub>::Output
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: &u32) -> <u32 as Sub>::Output
    Performs the - operation. Read more
    ","Sub<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Sub for u32
    Source§
    type Output = u32
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: u32) -> u32
    Performs the - operation. Read more
    ","Sub","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.22.0 · Source§
    impl SubAssign<&u32> for u32
    Source§
    fn sub_assign(&mut self, other: &u32)
    Performs the -= operation. Read more
    ","SubAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.8.0 · Source§
    impl SubAssign for u32
    Source§
    fn sub_assign(&mut self, other: u32)
    Performs the -= operation. Read more
    ","SubAssign","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.12.0 · Source§
    impl<'a> Sum<&'a u32> for u32
    Source§
    fn sum<I>(iter: I) -> u32
    where\n    I: Iterator<Item = &'a u32>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum<&'a u32>","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.12.0 · Source§
    impl Sum for u32
    Source§
    fn sum<I>(iter: I) -> u32
    where\n    I: Iterator<Item = u32>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.34.0 · Source§
    impl TryFrom<i128> for u32
    Source§
    fn try_from(u: i128) -> Result<u32, <u32 as TryFrom<i128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.34.0 · Source§
    impl TryFrom<i16> for u32
    Source§
    fn try_from(u: i16) -> Result<u32, <u32 as TryFrom<i16>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.34.0 · Source§
    impl TryFrom<i32> for u32
    Source§
    fn try_from(u: i32) -> Result<u32, <u32 as TryFrom<i32>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.34.0 · Source§
    impl TryFrom<i64> for u32
    Source§
    fn try_from(u: i64) -> Result<u32, <u32 as TryFrom<i64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.34.0 · Source§
    impl TryFrom<i8> for u32
    Source§
    fn try_from(u: i8) -> Result<u32, <u32 as TryFrom<i8>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.34.0 · Source§
    impl TryFrom<isize> for u32
    Source§
    fn try_from(u: isize) -> Result<u32, <u32 as TryFrom<isize>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.34.0 · Source§
    impl TryFrom<u128> for u32
    Source§
    fn try_from(u: u128) -> Result<u32, <u32 as TryFrom<u128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.34.0 · Source§
    impl TryFrom<u64> for u32
    Source§
    fn try_from(u: u64) -> Result<u32, <u32 as TryFrom<u64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.34.0 · Source§
    impl TryFrom<usize> for u32
    Source§
    fn try_from(u: usize) -> Result<u32, <u32 as TryFrom<usize>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.42.0 · Source§
    impl UpperExp for u32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperExp","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl UpperHex for u32
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperHex","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl ConstParamTy_ for u32
    ","ConstParamTy_","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Copy for u32
    ","Copy","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    1.0.0 · Source§
    impl Eq for u32
    ","Eq","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl SimdCast for u32
    ","SimdCast","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl StructuralPartialEq for u32
    ","StructuralPartialEq","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl TrustedStep for u32
    ","TrustedStep","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl UnsizedConstParamTy for u32
    ","UnsizedConstParamTy","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl Weight for u32
    ","Weight","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"],["
    Source§
    impl ZeroablePrimitive for u32
    ","ZeroablePrimitive","bdk_chain::bitcoin::secp256k1::ffi::types::c_uint"]]]]);
     if (window.register_type_impls) {
         window.register_type_impls(type_impls);
     } else {
         window.pending_type_impls = type_impls;
     }
 })()
-//{"start":55,"fragment_lengths":[434065]}
\ No newline at end of file
+//{"start":55,"fragment_lengths":[434064]}
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.u8.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.u8.js
index 9e8d5fa5d3..28ea0ed32f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.u8.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.u8.js
@@ -1,9 +1,9 @@
 (function() {
-    var type_impls = Object.fromEntries([["bdk_chain",[["
    1.0.0 · Source§
    impl Add<&u8> for u8
    Source§
    type Output = <u8 as Add>::Output
    The resulting type after applying the + operator.
    Source§
    fn add(self, other: &u8) -> <u8 as Add>::Output
    Performs the + operation. Read more
    ","Add<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Add for u8
    Source§
    type Output = u8
    The resulting type after applying the + operator.
    Source§
    const fn add(self, other: u8) -> u8
    Performs the + operation. Read more
    ","Add","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl AddAssign<&u8> for u8
    Source§
    fn add_assign(&mut self, other: &u8)
    Performs the += operation. Read more
    ","AddAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl AddAssign for u8
    Source§
    fn add_assign(&mut self, other: u8)
    Performs the += operation. Read more
    ","AddAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Binary for u8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Binary","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl BitAnd<&u8> for u8
    Source§
    type Output = <u8 as BitAnd>::Output
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, other: &u8) -> <u8 as BitAnd>::Output
    Performs the & operation. Read more
    ","BitAnd<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl BitAnd for u8
    Source§
    type Output = u8
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, rhs: u8) -> u8
    Performs the & operation. Read more
    ","BitAnd","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl BitAndAssign<&u8> for u8
    Source§
    fn bitand_assign(&mut self, other: &u8)
    Performs the &= operation. Read more
    ","BitAndAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl BitAndAssign for u8
    Source§
    fn bitand_assign(&mut self, other: u8)
    Performs the &= operation. Read more
    ","BitAndAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl BitOr<&u8> for u8
    Source§
    type Output = <u8 as BitOr>::Output
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, other: &u8) -> <u8 as BitOr>::Output
    Performs the | operation. Read more
    ","BitOr<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl BitOr for u8
    Source§
    type Output = u8
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, rhs: u8) -> u8
    Performs the | operation. Read more
    ","BitOr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl BitOrAssign<&u8> for u8
    Source§
    fn bitor_assign(&mut self, other: &u8)
    Performs the |= operation. Read more
    ","BitOrAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl BitOrAssign for u8
    Source§
    fn bitor_assign(&mut self, other: u8)
    Performs the |= operation. Read more
    ","BitOrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl BitXor<&u8> for u8
    Source§
    type Output = <u8 as BitXor>::Output
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: &u8) -> <u8 as BitXor>::Output
    Performs the ^ operation. Read more
    ","BitXor<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl BitXor for u8
    Source§
    type Output = u8
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: u8) -> u8
    Performs the ^ operation. Read more
    ","BitXor","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl BitXorAssign<&u8> for u8
    Source§
    fn bitxor_assign(&mut self, other: &u8)
    Performs the ^= operation. Read more
    ","BitXorAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl BitXorAssign for u8
    Source§
    fn bitxor_assign(&mut self, other: u8)
    Performs the ^= operation. Read more
    ","BitXorAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl CarryingMulAdd for u8
    Source§
    type Unsigned = u8
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    Source§
    const fn carrying_mul_add(self, a: u8, b: u8, c: u8) -> (u8, u8)
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    ","CarryingMulAdd","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Clone for u8
    Source§
    fn clone(&self) -> u8
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    ","Clone","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Debug for u8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    §
    impl Decodable for u8
    §
    fn consensus_decode<R>(r: &mut R) -> Result<u8, Error>
    where\n    R: Read + ?Sized,
    Decode an object with a well-defined format. Read more
    §
    fn consensus_decode_from_finite_reader<R>(reader: &mut R) -> Result<Self, Error>
    where\n    R: Read + ?Sized,
    Decode Self from a size-limited reader. Read more
    ","Decodable","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Default for u8
    Source§
    fn default() -> u8
    Returns the default value of 0
    \n
    ","Default","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl<'de> Deserialize<'de> for u8
    Source§
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<u8, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Display for u8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Display","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Div<&u8> for u8
    Source§
    type Output = <u8 as Div>::Output
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: &u8) -> <u8 as Div>::Output
    Performs the / operation. Read more
    ","Div<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.51.0 · Source§
    impl Div<NonZero<u8>> for u8
    Source§
    fn div(self, other: NonZero<u8>) -> u8
    This operation rounds towards zero, truncating any fractional\npart of the exact result, and cannot panic.
    \n
    Source§
    type Output = u8
    The resulting type after applying the / operator.
    ","Div>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Div for u8
    This operation rounds towards zero, truncating any\nfractional part of the exact result.
    \n
    §Panics
    \n
    This operation will panic if other == 0.
    \n
    Source§
    type Output = u8
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: u8) -> u8
    Performs the / operation. Read more
    ","Div","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl DivAssign<&u8> for u8
    Source§
    fn div_assign(&mut self, other: &u8)
    Performs the /= operation. Read more
    ","DivAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.79.0 · Source§
    impl DivAssign<NonZero<u8>> for u8
    Source§
    fn div_assign(&mut self, other: NonZero<u8>)
    This operation rounds towards zero, truncating any fractional\npart of the exact result, and cannot panic.
    \n
    ","DivAssign>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl DivAssign for u8
    Source§
    fn div_assign(&mut self, other: u8)
    Performs the /= operation. Read more
    ","DivAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    §
    impl Encodable for u8
    §
    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where\n    W: Write + ?Sized,
    Encodes an object with a well-defined format. Read more
    ","Encodable","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl From<AsciiChar> for u8
    Source§
    fn from(chr: AsciiChar) -> u8
    Converts to this type from the input type.
    ","From","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    §
    impl From<Fe32> for u8
    §
    fn from(v: Fe32) -> u8
    Converts to this type from the input type.
    ","From","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    §
    impl From<Parity> for u8
    The conversion returns 0 for even parity and 1 for odd.
    \n
    §
    fn from(parity: Parity) -> u8
    Converts to this type from the input type.
    ","From","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.28.0 · Source§
    impl From<bool> for u8
    Source§
    fn from(small: bool) -> u8
    Converts a bool to u8 losslessly.\nThe resulting value is 0 for false and 1 for true values.
    \n
    §Examples
    \n
    assert_eq!(u8::from(true), 1);\nassert_eq!(u8::from(false), 0);
    \n
    ","From","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl FromStr for u8
    Source§
    type Err = ParseIntError
    The associated error which can be returned from parsing.
    Source§
    fn from_str(src: &str) -> Result<u8, ParseIntError>
    Parses a string s to return a value of this type. Read more
    ","FromStr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Hash for u8
    Source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    Source§
    fn hash_slice<H>(data: &[u8], state: &mut H)
    where\n    H: Hasher,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl<'de, E> IntoDeserializer<'de, E> for u8
    where\n    E: Error,
    Source§
    type Deserializer = U8Deserializer<E>
    The type of the deserializer being converted into.
    Source§
    fn into_deserializer(self) -> U8Deserializer<E>
    Convert this value into a deserializer.
    ","IntoDeserializer<'de, E>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.42.0 · Source§
    impl LowerExp for u8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerExp","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl LowerHex for u8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerHex","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Mul<&u8> for u8
    Source§
    type Output = <u8 as Mul>::Output
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: &u8) -> <u8 as Mul>::Output
    Performs the * operation. Read more
    ","Mul<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Mul for u8
    Source§
    type Output = u8
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: u8) -> u8
    Performs the * operation. Read more
    ","Mul","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl MulAssign<&u8> for u8
    Source§
    fn mul_assign(&mut self, other: &u8)
    Performs the *= operation. Read more
    ","MulAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl MulAssign for u8
    Source§
    fn mul_assign(&mut self, other: u8)
    Performs the *= operation. Read more
    ","MulAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Not for u8
    Source§
    type Output = u8
    The resulting type after applying the ! operator.
    Source§
    fn not(self) -> u8
    Performs the unary ! operation. Read more
    ","Not","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Octal for u8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Octal","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Ord for u8
    Source§
    fn cmp(&self, other: &u8) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl PartialEq for u8
    Source§
    fn eq(&self, other: &u8) -> bool
    Tests for self and other values to be equal, and is used by ==.
    Source§
    fn ne(&self, other: &u8) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl PartialOrd for u8
    Source§
    fn partial_cmp(&self, other: &u8) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    Source§
    fn lt(&self, other: &u8) -> bool
    Tests less than (for self and other) and is used by the < operator. Read more
    Source§
    fn le(&self, other: &u8) -> bool
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    Source§
    fn ge(&self, other: &u8) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    Source§
    fn gt(&self, other: &u8) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    ","PartialOrd","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.12.0 · Source§
    impl<'a> Product<&'a u8> for u8
    Source§
    fn product<I>(iter: I) -> u8
    where\n    I: Iterator<Item = &'a u8>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product<&'a u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.12.0 · Source§
    impl Product for u8
    Source§
    fn product<I>(iter: I) -> u8
    where\n    I: Iterator<Item = u8>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl Random for u8
    Source§
    fn random(source: &mut (impl RandomSource + ?Sized)) -> u8
    🔬This is a nightly-only experimental API. (random)
    Generates a random value.
    \n
    Warning: Be careful when manipulating the resulting value! This\nmethod samples according to a uniform distribution, so a value of 1 is\njust as likely as MAX. By using modulo operations, some\nvalues can become more likely than others. Use audited crates when in\ndoubt.
    \n
    ","Random","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Rem<&u8> for u8
    Source§
    type Output = <u8 as Rem>::Output
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: &u8) -> <u8 as Rem>::Output
    Performs the % operation. Read more
    ","Rem<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.51.0 · Source§
    impl Rem<NonZero<u8>> for u8
    Source§
    fn rem(self, other: NonZero<u8>) -> u8
    This operation satisfies n % d == n - (n / d) * d, and cannot panic.
    \n
    Source§
    type Output = u8
    The resulting type after applying the % operator.
    ","Rem>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Rem for u8
    This operation satisfies n % d == n - (n / d) * d. The\nresult has the same sign as the left operand.
    \n
    §Panics
    \n
    This operation will panic if other == 0.
    \n
    Source§
    type Output = u8
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: u8) -> u8
    Performs the % operation. Read more
    ","Rem","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl RemAssign<&u8> for u8
    Source§
    fn rem_assign(&mut self, other: &u8)
    Performs the %= operation. Read more
    ","RemAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.79.0 · Source§
    impl RemAssign<NonZero<u8>> for u8
    Source§
    fn rem_assign(&mut self, other: NonZero<u8>)
    This operation satisfies n % d == n - (n / d) * d, and cannot panic.
    \n
    ","RemAssign>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl RemAssign for u8
    Source§
    fn rem_assign(&mut self, other: u8)
    Performs the %= operation. Read more
    ","RemAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl SampleUniform for u8
    Source§
    type Sampler = UniformInt<u8>
    The UniformSampler implementation supporting type X.
    ","SampleUniform","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl Serialize for u8
    Source§
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&i128> for u8
    Source§
    type Output = <u8 as Shl<i128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i128) -> <u8 as Shl<i128>>::Output
    Performs the << operation. Read more
    ","Shl<&i128>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&i16> for u8
    Source§
    type Output = <u8 as Shl<i16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i16) -> <u8 as Shl<i16>>::Output
    Performs the << operation. Read more
    ","Shl<&i16>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&i32> for u8
    Source§
    type Output = <u8 as Shl<i32>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i32) -> <u8 as Shl<i32>>::Output
    Performs the << operation. Read more
    ","Shl<&i32>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&i64> for u8
    Source§
    type Output = <u8 as Shl<i64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i64) -> <u8 as Shl<i64>>::Output
    Performs the << operation. Read more
    ","Shl<&i64>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&i8> for u8
    Source§
    type Output = <u8 as Shl<i8>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i8) -> <u8 as Shl<i8>>::Output
    Performs the << operation. Read more
    ","Shl<&i8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&isize> for u8
    Source§
    type Output = <u8 as Shl<isize>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &isize) -> <u8 as Shl<isize>>::Output
    Performs the << operation. Read more
    ","Shl<&isize>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&u128> for u8
    Source§
    type Output = <u8 as Shl<u128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u128) -> <u8 as Shl<u128>>::Output
    Performs the << operation. Read more
    ","Shl<&u128>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&u16> for u8
    Source§
    type Output = <u8 as Shl<u16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u16) -> <u8 as Shl<u16>>::Output
    Performs the << operation. Read more
    ","Shl<&u16>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&u32> for u8
    Source§
    type Output = <u8 as Shl<u32>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u32) -> <u8 as Shl<u32>>::Output
    Performs the << operation. Read more
    ","Shl<&u32>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&u64> for u8
    Source§
    type Output = <u8 as Shl<u64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u64) -> <u8 as Shl<u64>>::Output
    Performs the << operation. Read more
    ","Shl<&u64>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&u8> for u8
    Source§
    type Output = <u8 as Shl>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u8) -> <u8 as Shl>::Output
    Performs the << operation. Read more
    ","Shl<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&usize> for u8
    Source§
    type Output = <u8 as Shl<usize>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &usize) -> <u8 as Shl<usize>>::Output
    Performs the << operation. Read more
    ","Shl<&usize>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<i128> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i128) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<i16> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i16) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<i32> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i32) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<i64> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i64) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<i8> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i8) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<isize> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: isize) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<u128> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u128) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<u16> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u16) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<u32> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u32) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<u64> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u64) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<usize> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: usize) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u8) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&i128> for u8
    Source§
    fn shl_assign(&mut self, other: &i128)
    Performs the <<= operation. Read more
    ","ShlAssign<&i128>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&i16> for u8
    Source§
    fn shl_assign(&mut self, other: &i16)
    Performs the <<= operation. Read more
    ","ShlAssign<&i16>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&i32> for u8
    Source§
    fn shl_assign(&mut self, other: &i32)
    Performs the <<= operation. Read more
    ","ShlAssign<&i32>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&i64> for u8
    Source§
    fn shl_assign(&mut self, other: &i64)
    Performs the <<= operation. Read more
    ","ShlAssign<&i64>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&i8> for u8
    Source§
    fn shl_assign(&mut self, other: &i8)
    Performs the <<= operation. Read more
    ","ShlAssign<&i8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&isize> for u8
    Source§
    fn shl_assign(&mut self, other: &isize)
    Performs the <<= operation. Read more
    ","ShlAssign<&isize>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&u128> for u8
    Source§
    fn shl_assign(&mut self, other: &u128)
    Performs the <<= operation. Read more
    ","ShlAssign<&u128>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&u16> for u8
    Source§
    fn shl_assign(&mut self, other: &u16)
    Performs the <<= operation. Read more
    ","ShlAssign<&u16>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&u32> for u8
    Source§
    fn shl_assign(&mut self, other: &u32)
    Performs the <<= operation. Read more
    ","ShlAssign<&u32>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&u64> for u8
    Source§
    fn shl_assign(&mut self, other: &u64)
    Performs the <<= operation. Read more
    ","ShlAssign<&u64>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&u8> for u8
    Source§
    fn shl_assign(&mut self, other: &u8)
    Performs the <<= operation. Read more
    ","ShlAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&usize> for u8
    Source§
    fn shl_assign(&mut self, other: &usize)
    Performs the <<= operation. Read more
    ","ShlAssign<&usize>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<i128> for u8
    Source§
    fn shl_assign(&mut self, other: i128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<i16> for u8
    Source§
    fn shl_assign(&mut self, other: i16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<i32> for u8
    Source§
    fn shl_assign(&mut self, other: i32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<i64> for u8
    Source§
    fn shl_assign(&mut self, other: i64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<i8> for u8
    Source§
    fn shl_assign(&mut self, other: i8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<isize> for u8
    Source§
    fn shl_assign(&mut self, other: isize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<u128> for u8
    Source§
    fn shl_assign(&mut self, other: u128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<u16> for u8
    Source§
    fn shl_assign(&mut self, other: u16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<u32> for u8
    Source§
    fn shl_assign(&mut self, other: u32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<u64> for u8
    Source§
    fn shl_assign(&mut self, other: u64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<usize> for u8
    Source§
    fn shl_assign(&mut self, other: usize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign for u8
    Source§
    fn shl_assign(&mut self, other: u8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&i128> for u8
    Source§
    type Output = <u8 as Shr<i128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i128) -> <u8 as Shr<i128>>::Output
    Performs the >> operation. Read more
    ","Shr<&i128>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&i16> for u8
    Source§
    type Output = <u8 as Shr<i16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i16) -> <u8 as Shr<i16>>::Output
    Performs the >> operation. Read more
    ","Shr<&i16>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&i32> for u8
    Source§
    type Output = <u8 as Shr<i32>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i32) -> <u8 as Shr<i32>>::Output
    Performs the >> operation. Read more
    ","Shr<&i32>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&i64> for u8
    Source§
    type Output = <u8 as Shr<i64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i64) -> <u8 as Shr<i64>>::Output
    Performs the >> operation. Read more
    ","Shr<&i64>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&i8> for u8
    Source§
    type Output = <u8 as Shr<i8>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i8) -> <u8 as Shr<i8>>::Output
    Performs the >> operation. Read more
    ","Shr<&i8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&isize> for u8
    Source§
    type Output = <u8 as Shr<isize>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &isize) -> <u8 as Shr<isize>>::Output
    Performs the >> operation. Read more
    ","Shr<&isize>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&u128> for u8
    Source§
    type Output = <u8 as Shr<u128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u128) -> <u8 as Shr<u128>>::Output
    Performs the >> operation. Read more
    ","Shr<&u128>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&u16> for u8
    Source§
    type Output = <u8 as Shr<u16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u16) -> <u8 as Shr<u16>>::Output
    Performs the >> operation. Read more
    ","Shr<&u16>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&u32> for u8
    Source§
    type Output = <u8 as Shr<u32>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u32) -> <u8 as Shr<u32>>::Output
    Performs the >> operation. Read more
    ","Shr<&u32>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&u64> for u8
    Source§
    type Output = <u8 as Shr<u64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u64) -> <u8 as Shr<u64>>::Output
    Performs the >> operation. Read more
    ","Shr<&u64>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&u8> for u8
    Source§
    type Output = <u8 as Shr>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u8) -> <u8 as Shr>::Output
    Performs the >> operation. Read more
    ","Shr<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&usize> for u8
    Source§
    type Output = <u8 as Shr<usize>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &usize) -> <u8 as Shr<usize>>::Output
    Performs the >> operation. Read more
    ","Shr<&usize>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<i128> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i128) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<i16> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i16) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<i32> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i32) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<i64> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i64) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<i8> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i8) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<isize> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: isize) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<u128> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u128) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<u16> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u16) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<u32> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u32) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<u64> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u64) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<usize> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: usize) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u8) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&i128> for u8
    Source§
    fn shr_assign(&mut self, other: &i128)
    Performs the >>= operation. Read more
    ","ShrAssign<&i128>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&i16> for u8
    Source§
    fn shr_assign(&mut self, other: &i16)
    Performs the >>= operation. Read more
    ","ShrAssign<&i16>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&i32> for u8
    Source§
    fn shr_assign(&mut self, other: &i32)
    Performs the >>= operation. Read more
    ","ShrAssign<&i32>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&i64> for u8
    Source§
    fn shr_assign(&mut self, other: &i64)
    Performs the >>= operation. Read more
    ","ShrAssign<&i64>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&i8> for u8
    Source§
    fn shr_assign(&mut self, other: &i8)
    Performs the >>= operation. Read more
    ","ShrAssign<&i8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&isize> for u8
    Source§
    fn shr_assign(&mut self, other: &isize)
    Performs the >>= operation. Read more
    ","ShrAssign<&isize>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&u128> for u8
    Source§
    fn shr_assign(&mut self, other: &u128)
    Performs the >>= operation. Read more
    ","ShrAssign<&u128>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&u16> for u8
    Source§
    fn shr_assign(&mut self, other: &u16)
    Performs the >>= operation. Read more
    ","ShrAssign<&u16>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&u32> for u8
    Source§
    fn shr_assign(&mut self, other: &u32)
    Performs the >>= operation. Read more
    ","ShrAssign<&u32>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&u64> for u8
    Source§
    fn shr_assign(&mut self, other: &u64)
    Performs the >>= operation. Read more
    ","ShrAssign<&u64>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&u8> for u8
    Source§
    fn shr_assign(&mut self, other: &u8)
    Performs the >>= operation. Read more
    ","ShrAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&usize> for u8
    Source§
    fn shr_assign(&mut self, other: &usize)
    Performs the >>= operation. Read more
    ","ShrAssign<&usize>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<i128> for u8
    Source§
    fn shr_assign(&mut self, other: i128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<i16> for u8
    Source§
    fn shr_assign(&mut self, other: i16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<i32> for u8
    Source§
    fn shr_assign(&mut self, other: i32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<i64> for u8
    Source§
    fn shr_assign(&mut self, other: i64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<i8> for u8
    Source§
    fn shr_assign(&mut self, other: i8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<isize> for u8
    Source§
    fn shr_assign(&mut self, other: isize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<u128> for u8
    Source§
    fn shr_assign(&mut self, other: u128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<u16> for u8
    Source§
    fn shr_assign(&mut self, other: u16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<u32> for u8
    Source§
    fn shr_assign(&mut self, other: u32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<u64> for u8
    Source§
    fn shr_assign(&mut self, other: u64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<usize> for u8
    Source§
    fn shr_assign(&mut self, other: usize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign for u8
    Source§
    fn shr_assign(&mut self, other: u8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl SimdElement for u8
    Source§
    type Mask = i8
    🔬This is a nightly-only experimental API. (portable_simd)
    The mask element type corresponding to this element type.
    ","SimdElement","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl Step for u8
    Source§
    fn forward(start: u8, n: usize) -> u8
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward(start: u8, n: usize) -> u8
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    unsafe fn forward_unchecked(start: u8, n: usize) -> u8
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    unsafe fn backward_unchecked(start: u8, n: usize) -> u8
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    fn steps_between(start: &u8, end: &u8) -> (usize, Option<usize>)
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the bounds on the number of successor steps required to get from start to end\nlike Iterator::size_hint(). Read more
    Source§
    fn forward_checked(start: u8, n: usize) -> Option<u8>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward_checked(start: u8, n: usize) -> Option<u8>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    ","Step","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Sub<&u8> for u8
    Source§
    type Output = <u8 as Sub>::Output
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: &u8) -> <u8 as Sub>::Output
    Performs the - operation. Read more
    ","Sub<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Sub for u8
    Source§
    type Output = u8
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: u8) -> u8
    Performs the - operation. Read more
    ","Sub","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl SubAssign<&u8> for u8
    Source§
    fn sub_assign(&mut self, other: &u8)
    Performs the -= operation. Read more
    ","SubAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl SubAssign for u8
    Source§
    fn sub_assign(&mut self, other: u8)
    Performs the -= operation. Read more
    ","SubAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.12.0 · Source§
    impl<'a> Sum<&'a u8> for u8
    Source§
    fn sum<I>(iter: I) -> u8
    where\n    I: Iterator<Item = &'a u8>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum<&'a u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.12.0 · Source§
    impl Sum for u8
    Source§
    fn sum<I>(iter: I) -> u8
    where\n    I: Iterator<Item = u8>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.59.0 · Source§
    impl TryFrom<char> for u8
    Maps a char with code point in U+0000..=U+00FF to a byte in 0x00..=0xFF with same value,\nfailing if the code point is greater than U+00FF.
    \n
    See impl From<u8> for char for details on the encoding.
    \n
    Source§
    fn try_from(c: char) -> Result<u8, <u8 as TryFrom<char>>::Error>
    Tries to convert a char into a u8.
    \n
    §Examples
    \n
    let a = 'ÿ'; // U+00FF\nlet b = 'Ā'; // U+0100\nassert_eq!(u8::try_from(a), Ok(0xFF_u8));\nassert!(u8::try_from(b).is_err());
    \n
    Source§
    type Error = TryFromCharError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<i128> for u8
    Source§
    fn try_from(u: i128) -> Result<u8, <u8 as TryFrom<i128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<i16> for u8
    Source§
    fn try_from(u: i16) -> Result<u8, <u8 as TryFrom<i16>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<i32> for u8
    Source§
    fn try_from(u: i32) -> Result<u8, <u8 as TryFrom<i32>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<i64> for u8
    Source§
    fn try_from(u: i64) -> Result<u8, <u8 as TryFrom<i64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<i8> for u8
    Source§
    fn try_from(u: i8) -> Result<u8, <u8 as TryFrom<i8>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<isize> for u8
    Source§
    fn try_from(u: isize) -> Result<u8, <u8 as TryFrom<isize>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<u128> for u8
    Source§
    fn try_from(u: u128) -> Result<u8, <u8 as TryFrom<u128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<u16> for u8
    Source§
    fn try_from(u: u16) -> Result<u8, <u8 as TryFrom<u16>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<u32> for u8
    Source§
    fn try_from(u: u32) -> Result<u8, <u8 as TryFrom<u32>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<u64> for u8
    Source§
    fn try_from(u: u64) -> Result<u8, <u8 as TryFrom<u64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<usize> for u8
    Source§
    fn try_from(u: usize) -> Result<u8, <u8 as TryFrom<usize>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.42.0 · Source§
    impl UpperExp for u8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperExp","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl UpperHex for u8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperHex","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl ConstParamTy_ for u8
    ","ConstParamTy_","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Copy for u8
    ","Copy","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Eq for u8
    ","Eq","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl SimdCast for u8
    ","SimdCast","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl StructuralPartialEq for u8
    ","StructuralPartialEq","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl TrustedStep for u8
    ","TrustedStep","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl UnsizedConstParamTy for u8
    ","UnsizedConstParamTy","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl Weight for u8
    ","Weight","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl ZeroablePrimitive for u8
    ","ZeroablePrimitive","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"]]]]);
+    var type_impls = Object.fromEntries([["bdk_chain",[["
    1.0.0 · Source§
    impl Add<&u8> for u8
    Source§
    type Output = <u8 as Add>::Output
    The resulting type after applying the + operator.
    Source§
    fn add(self, other: &u8) -> <u8 as Add>::Output
    Performs the + operation. Read more
    ","Add<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Add for u8
    Source§
    type Output = u8
    The resulting type after applying the + operator.
    Source§
    const fn add(self, other: u8) -> u8
    Performs the + operation. Read more
    ","Add","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl AddAssign<&u8> for u8
    Source§
    fn add_assign(&mut self, other: &u8)
    Performs the += operation. Read more
    ","AddAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl AddAssign for u8
    Source§
    fn add_assign(&mut self, other: u8)
    Performs the += operation. Read more
    ","AddAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Binary for u8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Binary","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl BitAnd<&u8> for u8
    Source§
    type Output = <u8 as BitAnd>::Output
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, other: &u8) -> <u8 as BitAnd>::Output
    Performs the & operation. Read more
    ","BitAnd<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl BitAnd for u8
    Source§
    type Output = u8
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, rhs: u8) -> u8
    Performs the & operation. Read more
    ","BitAnd","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl BitAndAssign<&u8> for u8
    Source§
    fn bitand_assign(&mut self, other: &u8)
    Performs the &= operation. Read more
    ","BitAndAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl BitAndAssign for u8
    Source§
    fn bitand_assign(&mut self, other: u8)
    Performs the &= operation. Read more
    ","BitAndAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl BitOr<&u8> for u8
    Source§
    type Output = <u8 as BitOr>::Output
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, other: &u8) -> <u8 as BitOr>::Output
    Performs the | operation. Read more
    ","BitOr<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl BitOr for u8
    Source§
    type Output = u8
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, rhs: u8) -> u8
    Performs the | operation. Read more
    ","BitOr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl BitOrAssign<&u8> for u8
    Source§
    fn bitor_assign(&mut self, other: &u8)
    Performs the |= operation. Read more
    ","BitOrAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl BitOrAssign for u8
    Source§
    fn bitor_assign(&mut self, other: u8)
    Performs the |= operation. Read more
    ","BitOrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl BitXor<&u8> for u8
    Source§
    type Output = <u8 as BitXor>::Output
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: &u8) -> <u8 as BitXor>::Output
    Performs the ^ operation. Read more
    ","BitXor<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl BitXor for u8
    Source§
    type Output = u8
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: u8) -> u8
    Performs the ^ operation. Read more
    ","BitXor","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl BitXorAssign<&u8> for u8
    Source§
    fn bitxor_assign(&mut self, other: &u8)
    Performs the ^= operation. Read more
    ","BitXorAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl BitXorAssign for u8
    Source§
    fn bitxor_assign(&mut self, other: u8)
    Performs the ^= operation. Read more
    ","BitXorAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl CarryingMulAdd for u8
    Source§
    type Unsigned = u8
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    Source§
    const fn carrying_mul_add(self, a: u8, b: u8, c: u8) -> (u8, u8)
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    ","CarryingMulAdd","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Clone for u8
    Source§
    fn clone(&self) -> u8
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    ","Clone","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Debug for u8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    §
    impl Decodable for u8
    §
    fn consensus_decode<R>(r: &mut R) -> Result<u8, Error>
    where\n    R: Read + ?Sized,
    Decode an object with a well-defined format. Read more
    §
    fn consensus_decode_from_finite_reader<R>(reader: &mut R) -> Result<Self, Error>
    where\n    R: Read + ?Sized,
    Decode Self from a size-limited reader. Read more
    ","Decodable","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Default for u8
    Source§
    fn default() -> u8
    Returns the default value of 0
    \n
    ","Default","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl<'de> Deserialize<'de> for u8
    Source§
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<u8, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Display for u8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Display","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Div<&u8> for u8
    Source§
    type Output = <u8 as Div>::Output
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: &u8) -> <u8 as Div>::Output
    Performs the / operation. Read more
    ","Div<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.51.0 · Source§
    impl Div<NonZero<u8>> for u8
    Source§
    fn div(self, other: NonZero<u8>) -> u8
    This operation rounds towards zero, truncating any fractional\npart of the exact result, and cannot panic.
    \n
    Source§
    type Output = u8
    The resulting type after applying the / operator.
    ","Div>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Div for u8
    This operation rounds towards zero, truncating any\nfractional part of the exact result.
    \n
    §Panics
    \n
    This operation will panic if other == 0.
    \n
    Source§
    type Output = u8
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: u8) -> u8
    Performs the / operation. Read more
    ","Div","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl DivAssign<&u8> for u8
    Source§
    fn div_assign(&mut self, other: &u8)
    Performs the /= operation. Read more
    ","DivAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.79.0 · Source§
    impl DivAssign<NonZero<u8>> for u8
    Source§
    fn div_assign(&mut self, other: NonZero<u8>)
    This operation rounds towards zero, truncating any fractional\npart of the exact result, and cannot panic.
    \n
    ","DivAssign>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl DivAssign for u8
    Source§
    fn div_assign(&mut self, other: u8)
    Performs the /= operation. Read more
    ","DivAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    §
    impl Encodable for u8
    §
    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where\n    W: Write + ?Sized,
    Encodes an object with a well-defined format. Read more
    ","Encodable","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl From<AsciiChar> for u8
    Source§
    fn from(chr: AsciiChar) -> u8
    Converts to this type from the input type.
    ","From","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    §
    impl From<Fe32> for u8
    §
    fn from(v: Fe32) -> u8
    Converts to this type from the input type.
    ","From","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    §
    impl From<Parity> for u8
    The conversion returns 0 for even parity and 1 for odd.
    \n
    §
    fn from(parity: Parity) -> u8
    Converts to this type from the input type.
    ","From","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.28.0 · Source§
    impl From<bool> for u8
    Source§
    fn from(small: bool) -> u8
    Converts a bool to u8 losslessly.\nThe resulting value is 0 for false and 1 for true values.
    \n
    §Examples
    \n
    assert_eq!(u8::from(true), 1);\nassert_eq!(u8::from(false), 0);
    \n
    ","From","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl FromStr for u8
    Source§
    type Err = ParseIntError
    The associated error which can be returned from parsing.
    Source§
    fn from_str(src: &str) -> Result<u8, ParseIntError>
    Parses a string s to return a value of this type. Read more
    ","FromStr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Hash for u8
    Source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    Source§
    fn hash_slice<H>(data: &[u8], state: &mut H)
    where\n    H: Hasher,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl<'de, E> IntoDeserializer<'de, E> for u8
    where\n    E: Error,
    Source§
    type Deserializer = U8Deserializer<E>
    The type of the deserializer being converted into.
    Source§
    fn into_deserializer(self) -> U8Deserializer<E>
    Convert this value into a deserializer.
    ","IntoDeserializer<'de, E>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.42.0 · Source§
    impl LowerExp for u8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerExp","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl LowerHex for u8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerHex","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Mul<&u8> for u8
    Source§
    type Output = <u8 as Mul>::Output
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: &u8) -> <u8 as Mul>::Output
    Performs the * operation. Read more
    ","Mul<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Mul for u8
    Source§
    type Output = u8
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: u8) -> u8
    Performs the * operation. Read more
    ","Mul","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl MulAssign<&u8> for u8
    Source§
    fn mul_assign(&mut self, other: &u8)
    Performs the *= operation. Read more
    ","MulAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl MulAssign for u8
    Source§
    fn mul_assign(&mut self, other: u8)
    Performs the *= operation. Read more
    ","MulAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Not for u8
    Source§
    type Output = u8
    The resulting type after applying the ! operator.
    Source§
    fn not(self) -> u8
    Performs the unary ! operation. Read more
    ","Not","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Octal for u8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Octal","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Ord for u8
    Source§
    fn cmp(&self, other: &u8) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl PartialEq for u8
    Source§
    fn eq(&self, other: &u8) -> bool
    Tests for self and other values to be equal, and is used by ==.
    Source§
    fn ne(&self, other: &u8) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl PartialOrd for u8
    Source§
    fn partial_cmp(&self, other: &u8) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    Source§
    fn lt(&self, other: &u8) -> bool
    Tests less than (for self and other) and is used by the < operator. Read more
    Source§
    fn le(&self, other: &u8) -> bool
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    Source§
    fn ge(&self, other: &u8) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    Source§
    fn gt(&self, other: &u8) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    ","PartialOrd","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.12.0 · Source§
    impl<'a> Product<&'a u8> for u8
    Source§
    fn product<I>(iter: I) -> u8
    where\n    I: Iterator<Item = &'a u8>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product<&'a u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.12.0 · Source§
    impl Product for u8
    Source§
    fn product<I>(iter: I) -> u8
    where\n    I: Iterator<Item = u8>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl Random for u8
    Source§
    fn random(source: &mut (impl RandomSource + ?Sized)) -> u8
    🔬This is a nightly-only experimental API. (random)
    Generates a random value.
    \n
    Warning: Be careful when manipulating the resulting value! This\nmethod samples according to a uniform distribution, so a value of 1 is\njust as likely as MAX. By using modulo operations, some\nvalues can become more likely than others. Use audited crates when in\ndoubt.
    \n
    ","Random","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Rem<&u8> for u8
    Source§
    type Output = <u8 as Rem>::Output
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: &u8) -> <u8 as Rem>::Output
    Performs the % operation. Read more
    ","Rem<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.51.0 · Source§
    impl Rem<NonZero<u8>> for u8
    Source§
    fn rem(self, other: NonZero<u8>) -> u8
    This operation satisfies n % d == n - (n / d) * d, and cannot panic.
    \n
    Source§
    type Output = u8
    The resulting type after applying the % operator.
    ","Rem>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Rem for u8
    This operation satisfies n % d == n - (n / d) * d. The\nresult has the same sign as the left operand.
    \n
    §Panics
    \n
    This operation will panic if other == 0.
    \n
    Source§
    type Output = u8
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: u8) -> u8
    Performs the % operation. Read more
    ","Rem","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl RemAssign<&u8> for u8
    Source§
    fn rem_assign(&mut self, other: &u8)
    Performs the %= operation. Read more
    ","RemAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.79.0 · Source§
    impl RemAssign<NonZero<u8>> for u8
    Source§
    fn rem_assign(&mut self, other: NonZero<u8>)
    This operation satisfies n % d == n - (n / d) * d, and cannot panic.
    \n
    ","RemAssign>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl RemAssign for u8
    Source§
    fn rem_assign(&mut self, other: u8)
    Performs the %= operation. Read more
    ","RemAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl SampleUniform for u8
    Source§
    type Sampler = UniformInt<u8>
    The UniformSampler implementation supporting type X.
    ","SampleUniform","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl Serialize for u8
    Source§
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&i128> for u8
    Source§
    type Output = <u8 as Shl<i128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i128) -> <u8 as Shl<i128>>::Output
    Performs the << operation. Read more
    ","Shl<&i128>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&i16> for u8
    Source§
    type Output = <u8 as Shl<i16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i16) -> <u8 as Shl<i16>>::Output
    Performs the << operation. Read more
    ","Shl<&i16>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&i32> for u8
    Source§
    type Output = <u8 as Shl<i32>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i32) -> <u8 as Shl<i32>>::Output
    Performs the << operation. Read more
    ","Shl<&i32>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&i64> for u8
    Source§
    type Output = <u8 as Shl<i64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i64) -> <u8 as Shl<i64>>::Output
    Performs the << operation. Read more
    ","Shl<&i64>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&i8> for u8
    Source§
    type Output = <u8 as Shl<i8>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i8) -> <u8 as Shl<i8>>::Output
    Performs the << operation. Read more
    ","Shl<&i8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&isize> for u8
    Source§
    type Output = <u8 as Shl<isize>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &isize) -> <u8 as Shl<isize>>::Output
    Performs the << operation. Read more
    ","Shl<&isize>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&u128> for u8
    Source§
    type Output = <u8 as Shl<u128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u128) -> <u8 as Shl<u128>>::Output
    Performs the << operation. Read more
    ","Shl<&u128>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&u16> for u8
    Source§
    type Output = <u8 as Shl<u16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u16) -> <u8 as Shl<u16>>::Output
    Performs the << operation. Read more
    ","Shl<&u16>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&u32> for u8
    Source§
    type Output = <u8 as Shl<u32>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u32) -> <u8 as Shl<u32>>::Output
    Performs the << operation. Read more
    ","Shl<&u32>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&u64> for u8
    Source§
    type Output = <u8 as Shl<u64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u64) -> <u8 as Shl<u64>>::Output
    Performs the << operation. Read more
    ","Shl<&u64>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&u8> for u8
    Source§
    type Output = <u8 as Shl>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u8) -> <u8 as Shl>::Output
    Performs the << operation. Read more
    ","Shl<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<&usize> for u8
    Source§
    type Output = <u8 as Shl<usize>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &usize) -> <u8 as Shl<usize>>::Output
    Performs the << operation. Read more
    ","Shl<&usize>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<i128> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i128) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<i16> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i16) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<i32> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i32) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<i64> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i64) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<i8> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i8) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<isize> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: isize) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<u128> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u128) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<u16> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u16) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<u32> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u32) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<u64> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u64) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl<usize> for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: usize) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shl for u8
    Source§
    type Output = u8
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u8) -> u8
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&i128> for u8
    Source§
    fn shl_assign(&mut self, other: &i128)
    Performs the <<= operation. Read more
    ","ShlAssign<&i128>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&i16> for u8
    Source§
    fn shl_assign(&mut self, other: &i16)
    Performs the <<= operation. Read more
    ","ShlAssign<&i16>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&i32> for u8
    Source§
    fn shl_assign(&mut self, other: &i32)
    Performs the <<= operation. Read more
    ","ShlAssign<&i32>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&i64> for u8
    Source§
    fn shl_assign(&mut self, other: &i64)
    Performs the <<= operation. Read more
    ","ShlAssign<&i64>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&i8> for u8
    Source§
    fn shl_assign(&mut self, other: &i8)
    Performs the <<= operation. Read more
    ","ShlAssign<&i8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&isize> for u8
    Source§
    fn shl_assign(&mut self, other: &isize)
    Performs the <<= operation. Read more
    ","ShlAssign<&isize>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&u128> for u8
    Source§
    fn shl_assign(&mut self, other: &u128)
    Performs the <<= operation. Read more
    ","ShlAssign<&u128>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&u16> for u8
    Source§
    fn shl_assign(&mut self, other: &u16)
    Performs the <<= operation. Read more
    ","ShlAssign<&u16>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&u32> for u8
    Source§
    fn shl_assign(&mut self, other: &u32)
    Performs the <<= operation. Read more
    ","ShlAssign<&u32>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&u64> for u8
    Source§
    fn shl_assign(&mut self, other: &u64)
    Performs the <<= operation. Read more
    ","ShlAssign<&u64>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&u8> for u8
    Source§
    fn shl_assign(&mut self, other: &u8)
    Performs the <<= operation. Read more
    ","ShlAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShlAssign<&usize> for u8
    Source§
    fn shl_assign(&mut self, other: &usize)
    Performs the <<= operation. Read more
    ","ShlAssign<&usize>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<i128> for u8
    Source§
    fn shl_assign(&mut self, other: i128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<i16> for u8
    Source§
    fn shl_assign(&mut self, other: i16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<i32> for u8
    Source§
    fn shl_assign(&mut self, other: i32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<i64> for u8
    Source§
    fn shl_assign(&mut self, other: i64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<i8> for u8
    Source§
    fn shl_assign(&mut self, other: i8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<isize> for u8
    Source§
    fn shl_assign(&mut self, other: isize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<u128> for u8
    Source§
    fn shl_assign(&mut self, other: u128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<u16> for u8
    Source§
    fn shl_assign(&mut self, other: u16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<u32> for u8
    Source§
    fn shl_assign(&mut self, other: u32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<u64> for u8
    Source§
    fn shl_assign(&mut self, other: u64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign<usize> for u8
    Source§
    fn shl_assign(&mut self, other: usize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShlAssign for u8
    Source§
    fn shl_assign(&mut self, other: u8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&i128> for u8
    Source§
    type Output = <u8 as Shr<i128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i128) -> <u8 as Shr<i128>>::Output
    Performs the >> operation. Read more
    ","Shr<&i128>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&i16> for u8
    Source§
    type Output = <u8 as Shr<i16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i16) -> <u8 as Shr<i16>>::Output
    Performs the >> operation. Read more
    ","Shr<&i16>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&i32> for u8
    Source§
    type Output = <u8 as Shr<i32>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i32) -> <u8 as Shr<i32>>::Output
    Performs the >> operation. Read more
    ","Shr<&i32>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&i64> for u8
    Source§
    type Output = <u8 as Shr<i64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i64) -> <u8 as Shr<i64>>::Output
    Performs the >> operation. Read more
    ","Shr<&i64>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&i8> for u8
    Source§
    type Output = <u8 as Shr<i8>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i8) -> <u8 as Shr<i8>>::Output
    Performs the >> operation. Read more
    ","Shr<&i8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&isize> for u8
    Source§
    type Output = <u8 as Shr<isize>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &isize) -> <u8 as Shr<isize>>::Output
    Performs the >> operation. Read more
    ","Shr<&isize>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&u128> for u8
    Source§
    type Output = <u8 as Shr<u128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u128) -> <u8 as Shr<u128>>::Output
    Performs the >> operation. Read more
    ","Shr<&u128>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&u16> for u8
    Source§
    type Output = <u8 as Shr<u16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u16) -> <u8 as Shr<u16>>::Output
    Performs the >> operation. Read more
    ","Shr<&u16>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&u32> for u8
    Source§
    type Output = <u8 as Shr<u32>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u32) -> <u8 as Shr<u32>>::Output
    Performs the >> operation. Read more
    ","Shr<&u32>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&u64> for u8
    Source§
    type Output = <u8 as Shr<u64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u64) -> <u8 as Shr<u64>>::Output
    Performs the >> operation. Read more
    ","Shr<&u64>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&u8> for u8
    Source§
    type Output = <u8 as Shr>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u8) -> <u8 as Shr>::Output
    Performs the >> operation. Read more
    ","Shr<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<&usize> for u8
    Source§
    type Output = <u8 as Shr<usize>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &usize) -> <u8 as Shr<usize>>::Output
    Performs the >> operation. Read more
    ","Shr<&usize>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<i128> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i128) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<i16> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i16) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<i32> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i32) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<i64> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i64) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<i8> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i8) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<isize> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: isize) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<u128> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u128) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<u16> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u16) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<u32> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u32) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<u64> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u64) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr<usize> for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: usize) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Shr for u8
    Source§
    type Output = u8
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u8) -> u8
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&i128> for u8
    Source§
    fn shr_assign(&mut self, other: &i128)
    Performs the >>= operation. Read more
    ","ShrAssign<&i128>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&i16> for u8
    Source§
    fn shr_assign(&mut self, other: &i16)
    Performs the >>= operation. Read more
    ","ShrAssign<&i16>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&i32> for u8
    Source§
    fn shr_assign(&mut self, other: &i32)
    Performs the >>= operation. Read more
    ","ShrAssign<&i32>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&i64> for u8
    Source§
    fn shr_assign(&mut self, other: &i64)
    Performs the >>= operation. Read more
    ","ShrAssign<&i64>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&i8> for u8
    Source§
    fn shr_assign(&mut self, other: &i8)
    Performs the >>= operation. Read more
    ","ShrAssign<&i8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&isize> for u8
    Source§
    fn shr_assign(&mut self, other: &isize)
    Performs the >>= operation. Read more
    ","ShrAssign<&isize>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&u128> for u8
    Source§
    fn shr_assign(&mut self, other: &u128)
    Performs the >>= operation. Read more
    ","ShrAssign<&u128>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&u16> for u8
    Source§
    fn shr_assign(&mut self, other: &u16)
    Performs the >>= operation. Read more
    ","ShrAssign<&u16>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&u32> for u8
    Source§
    fn shr_assign(&mut self, other: &u32)
    Performs the >>= operation. Read more
    ","ShrAssign<&u32>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&u64> for u8
    Source§
    fn shr_assign(&mut self, other: &u64)
    Performs the >>= operation. Read more
    ","ShrAssign<&u64>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&u8> for u8
    Source§
    fn shr_assign(&mut self, other: &u8)
    Performs the >>= operation. Read more
    ","ShrAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl ShrAssign<&usize> for u8
    Source§
    fn shr_assign(&mut self, other: &usize)
    Performs the >>= operation. Read more
    ","ShrAssign<&usize>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<i128> for u8
    Source§
    fn shr_assign(&mut self, other: i128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<i16> for u8
    Source§
    fn shr_assign(&mut self, other: i16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<i32> for u8
    Source§
    fn shr_assign(&mut self, other: i32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<i64> for u8
    Source§
    fn shr_assign(&mut self, other: i64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<i8> for u8
    Source§
    fn shr_assign(&mut self, other: i8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<isize> for u8
    Source§
    fn shr_assign(&mut self, other: isize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<u128> for u8
    Source§
    fn shr_assign(&mut self, other: u128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<u16> for u8
    Source§
    fn shr_assign(&mut self, other: u16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<u32> for u8
    Source§
    fn shr_assign(&mut self, other: u32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<u64> for u8
    Source§
    fn shr_assign(&mut self, other: u64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign<usize> for u8
    Source§
    fn shr_assign(&mut self, other: usize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl ShrAssign for u8
    Source§
    fn shr_assign(&mut self, other: u8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl SimdElement for u8
    Source§
    type Mask = i8
    🔬This is a nightly-only experimental API. (portable_simd)
    The mask element type corresponding to this element type.
    ","SimdElement","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl Step for u8
    Source§
    fn forward(start: u8, n: usize) -> u8
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward(start: u8, n: usize) -> u8
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    unsafe fn forward_unchecked(start: u8, n: usize) -> u8
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    unsafe fn backward_unchecked(start: u8, n: usize) -> u8
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    fn steps_between(start: &u8, end: &u8) -> (usize, Option<usize>)
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the bounds on the number of successor steps required to get from start to end\nlike Iterator::size_hint(). Read more
    Source§
    fn forward_checked(start: u8, n: usize) -> Option<u8>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward_checked(start: u8, n: usize) -> Option<u8>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    ","Step","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Sub<&u8> for u8
    Source§
    type Output = <u8 as Sub>::Output
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: &u8) -> <u8 as Sub>::Output
    Performs the - operation. Read more
    ","Sub<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Sub for u8
    Source§
    type Output = u8
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: u8) -> u8
    Performs the - operation. Read more
    ","Sub","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.22.0 · Source§
    impl SubAssign<&u8> for u8
    Source§
    fn sub_assign(&mut self, other: &u8)
    Performs the -= operation. Read more
    ","SubAssign<&u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.8.0 · Source§
    impl SubAssign for u8
    Source§
    fn sub_assign(&mut self, other: u8)
    Performs the -= operation. Read more
    ","SubAssign","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.12.0 · Source§
    impl<'a> Sum<&'a u8> for u8
    Source§
    fn sum<I>(iter: I) -> u8
    where\n    I: Iterator<Item = &'a u8>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum<&'a u8>","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.12.0 · Source§
    impl Sum for u8
    Source§
    fn sum<I>(iter: I) -> u8
    where\n    I: Iterator<Item = u8>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.59.0 · Source§
    impl TryFrom<char> for u8
    Maps a char with code point in U+0000..=U+00FF to a byte in 0x00..=0xFF with same value,\nfailing if the code point is greater than U+00FF.
    \n
    See impl From<u8> for char for details on the encoding.
    \n
    Source§
    fn try_from(c: char) -> Result<u8, <u8 as TryFrom<char>>::Error>
    Tries to convert a char into a u8.
    \n
    §Examples
    \n
    let a = 'ÿ'; // U+00FF\nlet b = 'Ā'; // U+0100\nassert_eq!(u8::try_from(a), Ok(0xFF_u8));\nassert!(u8::try_from(b).is_err());
    \n
    Source§
    type Error = TryFromCharError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<i128> for u8
    Source§
    fn try_from(u: i128) -> Result<u8, <u8 as TryFrom<i128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<i16> for u8
    Source§
    fn try_from(u: i16) -> Result<u8, <u8 as TryFrom<i16>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<i32> for u8
    Source§
    fn try_from(u: i32) -> Result<u8, <u8 as TryFrom<i32>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<i64> for u8
    Source§
    fn try_from(u: i64) -> Result<u8, <u8 as TryFrom<i64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<i8> for u8
    Source§
    fn try_from(u: i8) -> Result<u8, <u8 as TryFrom<i8>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<isize> for u8
    Source§
    fn try_from(u: isize) -> Result<u8, <u8 as TryFrom<isize>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<u128> for u8
    Source§
    fn try_from(u: u128) -> Result<u8, <u8 as TryFrom<u128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<u16> for u8
    Source§
    fn try_from(u: u16) -> Result<u8, <u8 as TryFrom<u16>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<u32> for u8
    Source§
    fn try_from(u: u32) -> Result<u8, <u8 as TryFrom<u32>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<u64> for u8
    Source§
    fn try_from(u: u64) -> Result<u8, <u8 as TryFrom<u64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.34.0 · Source§
    impl TryFrom<usize> for u8
    Source§
    fn try_from(u: usize) -> Result<u8, <u8 as TryFrom<usize>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.42.0 · Source§
    impl UpperExp for u8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperExp","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl UpperHex for u8
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperHex","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl ConstParamTy_ for u8
    ","ConstParamTy_","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Copy for u8
    ","Copy","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    1.0.0 · Source§
    impl Eq for u8
    ","Eq","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl SimdCast for u8
    ","SimdCast","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl StructuralPartialEq for u8
    ","StructuralPartialEq","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl TrustedStep for u8
    ","TrustedStep","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl UnsizedConstParamTy for u8
    ","UnsizedConstParamTy","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl Weight for u8
    ","Weight","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"],["
    Source§
    impl ZeroablePrimitive for u8
    ","ZeroablePrimitive","bdk_chain::bitcoin::psbt::raw::ProprietaryType","bdk_chain::bitcoin::secp256k1::ffi::types::c_uchar"]]]]);
     if (window.register_type_impls) {
         window.register_type_impls(type_impls);
     } else {
         window.pending_type_impls = type_impls;
     }
 })()
-//{"start":55,"fragment_lengths":[436486]}
\ No newline at end of file
+//{"start":55,"fragment_lengths":[436485]}
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.usize.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.usize.js
index 21ce703626..ce6e2a55bf 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.usize.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.usize.js
@@ -1,9 +1,9 @@
 (function() {
-    var type_impls = Object.fromEntries([["bdk_chain",[["
    1.0.0 · Source§
    impl Add<&usize> for usize
    Source§
    type Output = <usize as Add>::Output
    The resulting type after applying the + operator.
    Source§
    fn add(self, other: &usize) -> <usize as Add>::Output
    Performs the + operation. Read more
    ","Add<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Add for usize
    Source§
    type Output = usize
    The resulting type after applying the + operator.
    Source§
    const fn add(self, other: usize) -> usize
    Performs the + operation. Read more
    ","Add","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl AddAssign<&usize> for usize
    Source§
    fn add_assign(&mut self, other: &usize)
    Performs the += operation. Read more
    ","AddAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl AddAssign for usize
    Source§
    fn add_assign(&mut self, other: usize)
    Performs the += operation. Read more
    ","AddAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Binary for usize
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Binary","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl BitAnd<&usize> for usize
    Source§
    type Output = <usize as BitAnd>::Output
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, other: &usize) -> <usize as BitAnd>::Output
    Performs the & operation. Read more
    ","BitAnd<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl BitAnd for usize
    Source§
    type Output = usize
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, rhs: usize) -> usize
    Performs the & operation. Read more
    ","BitAnd","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl BitAndAssign<&usize> for usize
    Source§
    fn bitand_assign(&mut self, other: &usize)
    Performs the &= operation. Read more
    ","BitAndAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl BitAndAssign for usize
    Source§
    fn bitand_assign(&mut self, other: usize)
    Performs the &= operation. Read more
    ","BitAndAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl BitOr<&usize> for usize
    Source§
    type Output = <usize as BitOr>::Output
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, other: &usize) -> <usize as BitOr>::Output
    Performs the | operation. Read more
    ","BitOr<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl BitOr for usize
    Source§
    type Output = usize
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, rhs: usize) -> usize
    Performs the | operation. Read more
    ","BitOr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl BitOrAssign<&usize> for usize
    Source§
    fn bitor_assign(&mut self, other: &usize)
    Performs the |= operation. Read more
    ","BitOrAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl BitOrAssign for usize
    Source§
    fn bitor_assign(&mut self, other: usize)
    Performs the |= operation. Read more
    ","BitOrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl BitXor<&usize> for usize
    Source§
    type Output = <usize as BitXor>::Output
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: &usize) -> <usize as BitXor>::Output
    Performs the ^ operation. Read more
    ","BitXor<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl BitXor for usize
    Source§
    type Output = usize
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: usize) -> usize
    Performs the ^ operation. Read more
    ","BitXor","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl BitXorAssign<&usize> for usize
    Source§
    fn bitxor_assign(&mut self, other: &usize)
    Performs the ^= operation. Read more
    ","BitXorAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl BitXorAssign for usize
    Source§
    fn bitxor_assign(&mut self, other: usize)
    Performs the ^= operation. Read more
    ","BitXorAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl CarryingMulAdd for usize
    Source§
    type Unsigned = usize
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    Source§
    const fn carrying_mul_add(self, a: usize, b: usize, c: usize) -> (usize, usize)
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    ","CarryingMulAdd","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Clone for usize
    Source§
    fn clone(&self) -> usize
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    ","Clone","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Debug for usize
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Default for usize
    Source§
    fn default() -> usize
    Returns the default value of 0
    \n
    ","Default","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl<'de> Deserialize<'de> for usize
    Source§
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<usize, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Display for usize
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Display","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Div<&usize> for usize
    Source§
    type Output = <usize as Div>::Output
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: &usize) -> <usize as Div>::Output
    Performs the / operation. Read more
    ","Div<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.51.0 · Source§
    impl Div<NonZero<usize>> for usize
    Source§
    fn div(self, other: NonZero<usize>) -> usize
    This operation rounds towards zero, truncating any fractional\npart of the exact result, and cannot panic.
    \n
    Source§
    type Output = usize
    The resulting type after applying the / operator.
    ","Div>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Div for usize
    This operation rounds towards zero, truncating any\nfractional part of the exact result.
    \n
    §Panics
    \n
    This operation will panic if other == 0.
    \n
    Source§
    type Output = usize
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: usize) -> usize
    Performs the / operation. Read more
    ","Div","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl DivAssign<&usize> for usize
    Source§
    fn div_assign(&mut self, other: &usize)
    Performs the /= operation. Read more
    ","DivAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.79.0 · Source§
    impl DivAssign<NonZero<usize>> for usize
    Source§
    fn div_assign(&mut self, other: NonZero<usize>)
    This operation rounds towards zero, truncating any fractional\npart of the exact result, and cannot panic.
    \n
    ","DivAssign>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl DivAssign for usize
    Source§
    fn div_assign(&mut self, other: usize)
    Performs the /= operation. Read more
    ","DivAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl From<Alignment> for usize
    Source§
    fn from(align: Alignment) -> usize
    Converts to this type from the input type.
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    §
    impl<O> From<U16<O>> for usize
    where\n    O: ByteOrder,
    §
    fn from(x: U16<O>) -> usize
    Converts to this type from the input type.
    ","From>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.28.0 · Source§
    impl From<bool> for usize
    Source§
    fn from(small: bool) -> usize
    Converts a bool to usize losslessly.\nThe resulting value is 0 for false and 1 for true values.
    \n
    §Examples
    \n
    assert_eq!(usize::from(true), 1);\nassert_eq!(usize::from(false), 0);
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.26.0 · Source§
    impl From<u16> for usize
    Source§
    fn from(small: u16) -> usize
    Converts u16 to usize losslessly.
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.5.0 · Source§
    impl From<u8> for usize
    Source§
    fn from(small: u8) -> usize
    Converts u8 to usize losslessly.
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl FromStr for usize
    Source§
    type Err = ParseIntError
    The associated error which can be returned from parsing.
    Source§
    fn from_str(src: &str) -> Result<usize, ParseIntError>
    Parses a string s to return a value of this type. Read more
    ","FromStr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl GetManyMutIndex for usize
    Source§
    fn is_in_bounds(&self, len: usize) -> bool
    🔬This is a nightly-only experimental API. (get_many_mut_helpers)
    Returns true if self is in bounds for len slice elements.
    Source§
    fn is_overlapping(&self, other: &usize) -> bool
    🔬This is a nightly-only experimental API. (get_many_mut_helpers)
    Returns true if self overlaps with other. Read more
    ","GetManyMutIndex","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Hash for usize
    Source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    Source§
    fn hash_slice<H>(data: &[usize], state: &mut H)
    where\n    H: Hasher,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl<'de, E> IntoDeserializer<'de, E> for usize
    where\n    E: Error,
    Source§
    type Deserializer = UsizeDeserializer<E>
    The type of the deserializer being converted into.
    Source§
    fn into_deserializer(self) -> UsizeDeserializer<E>
    Convert this value into a deserializer.
    ","IntoDeserializer<'de, E>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.42.0 · Source§
    impl LowerExp for usize
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerExp","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl LowerHex for usize
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerHex","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Mul<&usize> for usize
    Source§
    type Output = <usize as Mul>::Output
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: &usize) -> <usize as Mul>::Output
    Performs the * operation. Read more
    ","Mul<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Mul for usize
    Source§
    type Output = usize
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: usize) -> usize
    Performs the * operation. Read more
    ","Mul","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl MulAssign<&usize> for usize
    Source§
    fn mul_assign(&mut self, other: &usize)
    Performs the *= operation. Read more
    ","MulAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl MulAssign for usize
    Source§
    fn mul_assign(&mut self, other: usize)
    Performs the *= operation. Read more
    ","MulAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Not for usize
    Source§
    type Output = usize
    The resulting type after applying the ! operator.
    Source§
    fn not(self) -> usize
    Performs the unary ! operation. Read more
    ","Not","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Octal for usize
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Octal","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Ord for usize
    Source§
    fn cmp(&self, other: &usize) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl PartialEq for usize
    Source§
    fn eq(&self, other: &usize) -> bool
    Tests for self and other values to be equal, and is used by ==.
    Source§
    fn ne(&self, other: &usize) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl PartialOrd for usize
    Source§
    fn partial_cmp(&self, other: &usize) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    Source§
    fn lt(&self, other: &usize) -> bool
    Tests less than (for self and other) and is used by the < operator. Read more
    Source§
    fn le(&self, other: &usize) -> bool
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    Source§
    fn ge(&self, other: &usize) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    Source§
    fn gt(&self, other: &usize) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    ","PartialOrd","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.12.0 · Source§
    impl<'a> Product<&'a usize> for usize
    Source§
    fn product<I>(iter: I) -> usize
    where\n    I: Iterator<Item = &'a usize>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product<&'a usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.12.0 · Source§
    impl Product for usize
    Source§
    fn product<I>(iter: I) -> usize
    where\n    I: Iterator<Item = usize>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl Random for usize
    Source§
    fn random(source: &mut (impl RandomSource + ?Sized)) -> usize
    🔬This is a nightly-only experimental API. (random)
    Generates a random value.
    \n
    Warning: Be careful when manipulating the resulting value! This\nmethod samples according to a uniform distribution, so a value of 1 is\njust as likely as MAX. By using modulo operations, some\nvalues can become more likely than others. Use audited crates when in\ndoubt.
    \n
    ","Random","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Rem<&usize> for usize
    Source§
    type Output = <usize as Rem>::Output
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: &usize) -> <usize as Rem>::Output
    Performs the % operation. Read more
    ","Rem<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.51.0 · Source§
    impl Rem<NonZero<usize>> for usize
    Source§
    fn rem(self, other: NonZero<usize>) -> usize
    This operation satisfies n % d == n - (n / d) * d, and cannot panic.
    \n
    Source§
    type Output = usize
    The resulting type after applying the % operator.
    ","Rem>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Rem for usize
    This operation satisfies n % d == n - (n / d) * d. The\nresult has the same sign as the left operand.
    \n
    §Panics
    \n
    This operation will panic if other == 0.
    \n
    Source§
    type Output = usize
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: usize) -> usize
    Performs the % operation. Read more
    ","Rem","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl RemAssign<&usize> for usize
    Source§
    fn rem_assign(&mut self, other: &usize)
    Performs the %= operation. Read more
    ","RemAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.79.0 · Source§
    impl RemAssign<NonZero<usize>> for usize
    Source§
    fn rem_assign(&mut self, other: NonZero<usize>)
    This operation satisfies n % d == n - (n / d) * d, and cannot panic.
    \n
    ","RemAssign>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl RemAssign for usize
    Source§
    fn rem_assign(&mut self, other: usize)
    Performs the %= operation. Read more
    ","RemAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl SampleUniform for usize
    Source§
    type Sampler = UniformInt<usize>
    The UniformSampler implementation supporting type X.
    ","SampleUniform","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl Serialize for usize
    Source§
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&i128> for usize
    Source§
    type Output = <usize as Shl<i128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i128) -> <usize as Shl<i128>>::Output
    Performs the << operation. Read more
    ","Shl<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&i16> for usize
    Source§
    type Output = <usize as Shl<i16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i16) -> <usize as Shl<i16>>::Output
    Performs the << operation. Read more
    ","Shl<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&i32> for usize
    Source§
    type Output = <usize as Shl<i32>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i32) -> <usize as Shl<i32>>::Output
    Performs the << operation. Read more
    ","Shl<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&i64> for usize
    Source§
    type Output = <usize as Shl<i64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i64) -> <usize as Shl<i64>>::Output
    Performs the << operation. Read more
    ","Shl<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&i8> for usize
    Source§
    type Output = <usize as Shl<i8>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i8) -> <usize as Shl<i8>>::Output
    Performs the << operation. Read more
    ","Shl<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&isize> for usize
    Source§
    type Output = <usize as Shl<isize>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &isize) -> <usize as Shl<isize>>::Output
    Performs the << operation. Read more
    ","Shl<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&u128> for usize
    Source§
    type Output = <usize as Shl<u128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u128) -> <usize as Shl<u128>>::Output
    Performs the << operation. Read more
    ","Shl<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&u16> for usize
    Source§
    type Output = <usize as Shl<u16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u16) -> <usize as Shl<u16>>::Output
    Performs the << operation. Read more
    ","Shl<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&u32> for usize
    Source§
    type Output = <usize as Shl<u32>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u32) -> <usize as Shl<u32>>::Output
    Performs the << operation. Read more
    ","Shl<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&u64> for usize
    Source§
    type Output = <usize as Shl<u64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u64) -> <usize as Shl<u64>>::Output
    Performs the << operation. Read more
    ","Shl<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&u8> for usize
    Source§
    type Output = <usize as Shl<u8>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u8) -> <usize as Shl<u8>>::Output
    Performs the << operation. Read more
    ","Shl<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&usize> for usize
    Source§
    type Output = <usize as Shl>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &usize) -> <usize as Shl>::Output
    Performs the << operation. Read more
    ","Shl<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<i128> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i128) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<i16> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i16) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<i32> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i32) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<i64> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i64) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<i8> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i8) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<isize> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: isize) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<u128> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u128) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<u16> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u16) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<u32> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u32) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<u64> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u64) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<u8> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u8) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: usize) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&i128> for usize
    Source§
    fn shl_assign(&mut self, other: &i128)
    Performs the <<= operation. Read more
    ","ShlAssign<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&i16> for usize
    Source§
    fn shl_assign(&mut self, other: &i16)
    Performs the <<= operation. Read more
    ","ShlAssign<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&i32> for usize
    Source§
    fn shl_assign(&mut self, other: &i32)
    Performs the <<= operation. Read more
    ","ShlAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&i64> for usize
    Source§
    fn shl_assign(&mut self, other: &i64)
    Performs the <<= operation. Read more
    ","ShlAssign<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&i8> for usize
    Source§
    fn shl_assign(&mut self, other: &i8)
    Performs the <<= operation. Read more
    ","ShlAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&isize> for usize
    Source§
    fn shl_assign(&mut self, other: &isize)
    Performs the <<= operation. Read more
    ","ShlAssign<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&u128> for usize
    Source§
    fn shl_assign(&mut self, other: &u128)
    Performs the <<= operation. Read more
    ","ShlAssign<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&u16> for usize
    Source§
    fn shl_assign(&mut self, other: &u16)
    Performs the <<= operation. Read more
    ","ShlAssign<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&u32> for usize
    Source§
    fn shl_assign(&mut self, other: &u32)
    Performs the <<= operation. Read more
    ","ShlAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&u64> for usize
    Source§
    fn shl_assign(&mut self, other: &u64)
    Performs the <<= operation. Read more
    ","ShlAssign<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&u8> for usize
    Source§
    fn shl_assign(&mut self, other: &u8)
    Performs the <<= operation. Read more
    ","ShlAssign<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&usize> for usize
    Source§
    fn shl_assign(&mut self, other: &usize)
    Performs the <<= operation. Read more
    ","ShlAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<i128> for usize
    Source§
    fn shl_assign(&mut self, other: i128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<i16> for usize
    Source§
    fn shl_assign(&mut self, other: i16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<i32> for usize
    Source§
    fn shl_assign(&mut self, other: i32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<i64> for usize
    Source§
    fn shl_assign(&mut self, other: i64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<i8> for usize
    Source§
    fn shl_assign(&mut self, other: i8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<isize> for usize
    Source§
    fn shl_assign(&mut self, other: isize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<u128> for usize
    Source§
    fn shl_assign(&mut self, other: u128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<u16> for usize
    Source§
    fn shl_assign(&mut self, other: u16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<u32> for usize
    Source§
    fn shl_assign(&mut self, other: u32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<u64> for usize
    Source§
    fn shl_assign(&mut self, other: u64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<u8> for usize
    Source§
    fn shl_assign(&mut self, other: u8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign for usize
    Source§
    fn shl_assign(&mut self, other: usize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&i128> for usize
    Source§
    type Output = <usize as Shr<i128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i128) -> <usize as Shr<i128>>::Output
    Performs the >> operation. Read more
    ","Shr<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&i16> for usize
    Source§
    type Output = <usize as Shr<i16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i16) -> <usize as Shr<i16>>::Output
    Performs the >> operation. Read more
    ","Shr<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&i32> for usize
    Source§
    type Output = <usize as Shr<i32>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i32) -> <usize as Shr<i32>>::Output
    Performs the >> operation. Read more
    ","Shr<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&i64> for usize
    Source§
    type Output = <usize as Shr<i64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i64) -> <usize as Shr<i64>>::Output
    Performs the >> operation. Read more
    ","Shr<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&i8> for usize
    Source§
    type Output = <usize as Shr<i8>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i8) -> <usize as Shr<i8>>::Output
    Performs the >> operation. Read more
    ","Shr<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&isize> for usize
    Source§
    type Output = <usize as Shr<isize>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &isize) -> <usize as Shr<isize>>::Output
    Performs the >> operation. Read more
    ","Shr<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&u128> for usize
    Source§
    type Output = <usize as Shr<u128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u128) -> <usize as Shr<u128>>::Output
    Performs the >> operation. Read more
    ","Shr<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&u16> for usize
    Source§
    type Output = <usize as Shr<u16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u16) -> <usize as Shr<u16>>::Output
    Performs the >> operation. Read more
    ","Shr<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&u32> for usize
    Source§
    type Output = <usize as Shr<u32>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u32) -> <usize as Shr<u32>>::Output
    Performs the >> operation. Read more
    ","Shr<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&u64> for usize
    Source§
    type Output = <usize as Shr<u64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u64) -> <usize as Shr<u64>>::Output
    Performs the >> operation. Read more
    ","Shr<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&u8> for usize
    Source§
    type Output = <usize as Shr<u8>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u8) -> <usize as Shr<u8>>::Output
    Performs the >> operation. Read more
    ","Shr<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&usize> for usize
    Source§
    type Output = <usize as Shr>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &usize) -> <usize as Shr>::Output
    Performs the >> operation. Read more
    ","Shr<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<i128> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i128) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<i16> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i16) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<i32> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i32) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<i64> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i64) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<i8> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i8) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<isize> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: isize) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<u128> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u128) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<u16> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u16) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<u32> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u32) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<u64> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u64) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<u8> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u8) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: usize) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&i128> for usize
    Source§
    fn shr_assign(&mut self, other: &i128)
    Performs the >>= operation. Read more
    ","ShrAssign<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&i16> for usize
    Source§
    fn shr_assign(&mut self, other: &i16)
    Performs the >>= operation. Read more
    ","ShrAssign<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&i32> for usize
    Source§
    fn shr_assign(&mut self, other: &i32)
    Performs the >>= operation. Read more
    ","ShrAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&i64> for usize
    Source§
    fn shr_assign(&mut self, other: &i64)
    Performs the >>= operation. Read more
    ","ShrAssign<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&i8> for usize
    Source§
    fn shr_assign(&mut self, other: &i8)
    Performs the >>= operation. Read more
    ","ShrAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&isize> for usize
    Source§
    fn shr_assign(&mut self, other: &isize)
    Performs the >>= operation. Read more
    ","ShrAssign<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&u128> for usize
    Source§
    fn shr_assign(&mut self, other: &u128)
    Performs the >>= operation. Read more
    ","ShrAssign<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&u16> for usize
    Source§
    fn shr_assign(&mut self, other: &u16)
    Performs the >>= operation. Read more
    ","ShrAssign<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&u32> for usize
    Source§
    fn shr_assign(&mut self, other: &u32)
    Performs the >>= operation. Read more
    ","ShrAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&u64> for usize
    Source§
    fn shr_assign(&mut self, other: &u64)
    Performs the >>= operation. Read more
    ","ShrAssign<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&u8> for usize
    Source§
    fn shr_assign(&mut self, other: &u8)
    Performs the >>= operation. Read more
    ","ShrAssign<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&usize> for usize
    Source§
    fn shr_assign(&mut self, other: &usize)
    Performs the >>= operation. Read more
    ","ShrAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<i128> for usize
    Source§
    fn shr_assign(&mut self, other: i128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<i16> for usize
    Source§
    fn shr_assign(&mut self, other: i16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<i32> for usize
    Source§
    fn shr_assign(&mut self, other: i32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<i64> for usize
    Source§
    fn shr_assign(&mut self, other: i64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<i8> for usize
    Source§
    fn shr_assign(&mut self, other: i8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<isize> for usize
    Source§
    fn shr_assign(&mut self, other: isize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<u128> for usize
    Source§
    fn shr_assign(&mut self, other: u128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<u16> for usize
    Source§
    fn shr_assign(&mut self, other: u16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<u32> for usize
    Source§
    fn shr_assign(&mut self, other: u32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<u64> for usize
    Source§
    fn shr_assign(&mut self, other: u64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<u8> for usize
    Source§
    fn shr_assign(&mut self, other: u8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign for usize
    Source§
    fn shr_assign(&mut self, other: usize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl SimdElement for usize
    Source§
    type Mask = isize
    🔬This is a nightly-only experimental API. (portable_simd)
    The mask element type corresponding to this element type.
    ","SimdElement","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.15.0 · Source§
    impl<T> SliceIndex<[T]> for usize
    The methods index and index_mut panic if the index is out of bounds.
    \n
    Source§
    type Output = T
    The output type returned by methods.
    Source§
    fn get(self, slice: &[T]) -> Option<&T>
    🔬This is a nightly-only experimental API. (slice_index_methods)
    Returns a shared reference to the output at this location, if in\nbounds.
    Source§
    fn get_mut(self, slice: &mut [T]) -> Option<&mut T>
    🔬This is a nightly-only experimental API. (slice_index_methods)
    Returns a mutable reference to the output at this location, if in\nbounds.
    Source§
    unsafe fn get_unchecked(self, slice: *const [T]) -> *const T
    🔬This is a nightly-only experimental API. (slice_index_methods)
    Returns a pointer to the output at this location, without\nperforming any bounds checking. Read more
    Source§
    unsafe fn get_unchecked_mut(self, slice: *mut [T]) -> *mut T
    🔬This is a nightly-only experimental API. (slice_index_methods)
    Returns a mutable pointer to the output at this location, without\nperforming any bounds checking. Read more
    Source§
    fn index(self, slice: &[T]) -> &T
    🔬This is a nightly-only experimental API. (slice_index_methods)
    Returns a shared reference to the output at this location, panicking\nif out of bounds.
    Source§
    fn index_mut(self, slice: &mut [T]) -> &mut T
    🔬This is a nightly-only experimental API. (slice_index_methods)
    Returns a mutable reference to the output at this location, panicking\nif out of bounds.
    ","SliceIndex<[T]>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl Step for usize
    Source§
    fn forward(start: usize, n: usize) -> usize
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward(start: usize, n: usize) -> usize
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    unsafe fn forward_unchecked(start: usize, n: usize) -> usize
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    unsafe fn backward_unchecked(start: usize, n: usize) -> usize
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    fn steps_between(start: &usize, end: &usize) -> (usize, Option<usize>)
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the bounds on the number of successor steps required to get from start to end\nlike Iterator::size_hint(). Read more
    Source§
    fn forward_checked(start: usize, n: usize) -> Option<usize>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward_checked(start: usize, n: usize) -> Option<usize>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    ","Step","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Sub<&usize> for usize
    Source§
    type Output = <usize as Sub>::Output
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: &usize) -> <usize as Sub>::Output
    Performs the - operation. Read more
    ","Sub<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Sub for usize
    Source§
    type Output = usize
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: usize) -> usize
    Performs the - operation. Read more
    ","Sub","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl SubAssign<&usize> for usize
    Source§
    fn sub_assign(&mut self, other: &usize)
    Performs the -= operation. Read more
    ","SubAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl SubAssign for usize
    Source§
    fn sub_assign(&mut self, other: usize)
    Performs the -= operation. Read more
    ","SubAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.12.0 · Source§
    impl<'a> Sum<&'a usize> for usize
    Source§
    fn sum<I>(iter: I) -> usize
    where\n    I: Iterator<Item = &'a usize>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum<&'a usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.12.0 · Source§
    impl Sum for usize
    Source§
    fn sum<I>(iter: I) -> usize
    where\n    I: Iterator<Item = usize>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.34.0 · Source§
    impl TryFrom<i128> for usize
    Source§
    fn try_from(u: i128) -> Result<usize, <usize as TryFrom<i128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.34.0 · Source§
    impl TryFrom<i16> for usize
    Source§
    fn try_from(u: i16) -> Result<usize, <usize as TryFrom<i16>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.34.0 · Source§
    impl TryFrom<i32> for usize
    Source§
    fn try_from(u: i32) -> Result<usize, <usize as TryFrom<i32>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.34.0 · Source§
    impl TryFrom<i64> for usize
    Source§
    fn try_from(u: i64) -> Result<usize, <usize as TryFrom<i64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.34.0 · Source§
    impl TryFrom<i8> for usize
    Source§
    fn try_from(u: i8) -> Result<usize, <usize as TryFrom<i8>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.34.0 · Source§
    impl TryFrom<isize> for usize
    Source§
    fn try_from(u: isize) -> Result<usize, <usize as TryFrom<isize>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.34.0 · Source§
    impl TryFrom<u128> for usize
    Source§
    fn try_from(u: u128) -> Result<usize, <usize as TryFrom<u128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.34.0 · Source§
    impl TryFrom<u32> for usize
    Source§
    fn try_from(value: u32) -> Result<usize, <usize as TryFrom<u32>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.34.0 · Source§
    impl TryFrom<u64> for usize
    Source§
    fn try_from(value: u64) -> Result<usize, <usize as TryFrom<u64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.42.0 · Source§
    impl UpperExp for usize
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperExp","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl UpperHex for usize
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperHex","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl ConstParamTy_ for usize
    ","ConstParamTy_","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Copy for usize
    ","Copy","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Eq for usize
    ","Eq","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl PointerLike for usize
    ","PointerLike","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl SimdCast for usize
    ","SimdCast","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl StructuralPartialEq for usize
    ","StructuralPartialEq","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl TrustedStep for usize
    ","TrustedStep","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl UnsizedConstParamTy for usize
    ","UnsizedConstParamTy","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl Weight for usize
    ","Weight","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl ZeroablePrimitive for usize
    ","ZeroablePrimitive","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"]]]]);
+    var type_impls = Object.fromEntries([["bdk_chain",[["
    1.0.0 · Source§
    impl Add<&usize> for usize
    Source§
    type Output = <usize as Add>::Output
    The resulting type after applying the + operator.
    Source§
    fn add(self, other: &usize) -> <usize as Add>::Output
    Performs the + operation. Read more
    ","Add<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Add for usize
    Source§
    type Output = usize
    The resulting type after applying the + operator.
    Source§
    const fn add(self, other: usize) -> usize
    Performs the + operation. Read more
    ","Add","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl AddAssign<&usize> for usize
    Source§
    fn add_assign(&mut self, other: &usize)
    Performs the += operation. Read more
    ","AddAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl AddAssign for usize
    Source§
    fn add_assign(&mut self, other: usize)
    Performs the += operation. Read more
    ","AddAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Binary for usize
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Binary","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl BitAnd<&usize> for usize
    Source§
    type Output = <usize as BitAnd>::Output
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, other: &usize) -> <usize as BitAnd>::Output
    Performs the & operation. Read more
    ","BitAnd<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl BitAnd for usize
    Source§
    type Output = usize
    The resulting type after applying the & operator.
    Source§
    fn bitand(self, rhs: usize) -> usize
    Performs the & operation. Read more
    ","BitAnd","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl BitAndAssign<&usize> for usize
    Source§
    fn bitand_assign(&mut self, other: &usize)
    Performs the &= operation. Read more
    ","BitAndAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl BitAndAssign for usize
    Source§
    fn bitand_assign(&mut self, other: usize)
    Performs the &= operation. Read more
    ","BitAndAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl BitOr<&usize> for usize
    Source§
    type Output = <usize as BitOr>::Output
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, other: &usize) -> <usize as BitOr>::Output
    Performs the | operation. Read more
    ","BitOr<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl BitOr for usize
    Source§
    type Output = usize
    The resulting type after applying the | operator.
    Source§
    fn bitor(self, rhs: usize) -> usize
    Performs the | operation. Read more
    ","BitOr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl BitOrAssign<&usize> for usize
    Source§
    fn bitor_assign(&mut self, other: &usize)
    Performs the |= operation. Read more
    ","BitOrAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl BitOrAssign for usize
    Source§
    fn bitor_assign(&mut self, other: usize)
    Performs the |= operation. Read more
    ","BitOrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl BitXor<&usize> for usize
    Source§
    type Output = <usize as BitXor>::Output
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: &usize) -> <usize as BitXor>::Output
    Performs the ^ operation. Read more
    ","BitXor<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl BitXor for usize
    Source§
    type Output = usize
    The resulting type after applying the ^ operator.
    Source§
    fn bitxor(self, other: usize) -> usize
    Performs the ^ operation. Read more
    ","BitXor","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl BitXorAssign<&usize> for usize
    Source§
    fn bitxor_assign(&mut self, other: &usize)
    Performs the ^= operation. Read more
    ","BitXorAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl BitXorAssign for usize
    Source§
    fn bitxor_assign(&mut self, other: usize)
    Performs the ^= operation. Read more
    ","BitXorAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl CarryingMulAdd for usize
    Source§
    type Unsigned = usize
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    Source§
    const fn carrying_mul_add(self, a: usize, b: usize, c: usize) -> (usize, usize)
    🔬This is a nightly-only experimental API. (core_intrinsics_fallbacks)
    ","CarryingMulAdd","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Clone for usize
    Source§
    fn clone(&self) -> usize
    Returns a copy of the value. Read more
    1.0.0 · Source§
    fn clone_from(&mut self, source: &Self)
    Performs copy-assignment from source. Read more
    ","Clone","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Debug for usize
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Default for usize
    Source§
    fn default() -> usize
    Returns the default value of 0
    \n
    ","Default","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl<'de> Deserialize<'de> for usize
    Source§
    fn deserialize<D>(\n    deserializer: D,\n) -> Result<usize, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Display for usize
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Display","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Div<&usize> for usize
    Source§
    type Output = <usize as Div>::Output
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: &usize) -> <usize as Div>::Output
    Performs the / operation. Read more
    ","Div<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.51.0 · Source§
    impl Div<NonZero<usize>> for usize
    Source§
    fn div(self, other: NonZero<usize>) -> usize
    This operation rounds towards zero, truncating any fractional\npart of the exact result, and cannot panic.
    \n
    Source§
    type Output = usize
    The resulting type after applying the / operator.
    ","Div>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Div for usize
    This operation rounds towards zero, truncating any\nfractional part of the exact result.
    \n
    §Panics
    \n
    This operation will panic if other == 0.
    \n
    Source§
    type Output = usize
    The resulting type after applying the / operator.
    Source§
    fn div(self, other: usize) -> usize
    Performs the / operation. Read more
    ","Div","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl DivAssign<&usize> for usize
    Source§
    fn div_assign(&mut self, other: &usize)
    Performs the /= operation. Read more
    ","DivAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.79.0 · Source§
    impl DivAssign<NonZero<usize>> for usize
    Source§
    fn div_assign(&mut self, other: NonZero<usize>)
    This operation rounds towards zero, truncating any fractional\npart of the exact result, and cannot panic.
    \n
    ","DivAssign>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl DivAssign for usize
    Source§
    fn div_assign(&mut self, other: usize)
    Performs the /= operation. Read more
    ","DivAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl From<Alignment> for usize
    Source§
    fn from(align: Alignment) -> usize
    Converts to this type from the input type.
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    §
    impl<O> From<U16<O>> for usize
    where\n    O: ByteOrder,
    §
    fn from(x: U16<O>) -> usize
    Converts to this type from the input type.
    ","From>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.28.0 · Source§
    impl From<bool> for usize
    Source§
    fn from(small: bool) -> usize
    Converts a bool to usize losslessly.\nThe resulting value is 0 for false and 1 for true values.
    \n
    §Examples
    \n
    assert_eq!(usize::from(true), 1);\nassert_eq!(usize::from(false), 0);
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.26.0 · Source§
    impl From<u16> for usize
    Source§
    fn from(small: u16) -> usize
    Converts u16 to usize losslessly.
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.5.0 · Source§
    impl From<u8> for usize
    Source§
    fn from(small: u8) -> usize
    Converts u8 to usize losslessly.
    \n
    ","From","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl FromStr for usize
    Source§
    type Err = ParseIntError
    The associated error which can be returned from parsing.
    Source§
    fn from_str(src: &str) -> Result<usize, ParseIntError>
    Parses a string s to return a value of this type. Read more
    ","FromStr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl GetManyMutIndex for usize
    Source§
    fn is_in_bounds(&self, len: usize) -> bool
    🔬This is a nightly-only experimental API. (get_many_mut_helpers)
    Returns true if self is in bounds for len slice elements.
    Source§
    fn is_overlapping(&self, other: &usize) -> bool
    🔬This is a nightly-only experimental API. (get_many_mut_helpers)
    Returns true if self overlaps with other. Read more
    ","GetManyMutIndex","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Hash for usize
    Source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    Source§
    fn hash_slice<H>(data: &[usize], state: &mut H)
    where\n    H: Hasher,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl<'de, E> IntoDeserializer<'de, E> for usize
    where\n    E: Error,
    Source§
    type Deserializer = UsizeDeserializer<E>
    The type of the deserializer being converted into.
    Source§
    fn into_deserializer(self) -> UsizeDeserializer<E>
    Convert this value into a deserializer.
    ","IntoDeserializer<'de, E>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.42.0 · Source§
    impl LowerExp for usize
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerExp","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl LowerHex for usize
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","LowerHex","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Mul<&usize> for usize
    Source§
    type Output = <usize as Mul>::Output
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: &usize) -> <usize as Mul>::Output
    Performs the * operation. Read more
    ","Mul<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Mul for usize
    Source§
    type Output = usize
    The resulting type after applying the * operator.
    Source§
    fn mul(self, other: usize) -> usize
    Performs the * operation. Read more
    ","Mul","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl MulAssign<&usize> for usize
    Source§
    fn mul_assign(&mut self, other: &usize)
    Performs the *= operation. Read more
    ","MulAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl MulAssign for usize
    Source§
    fn mul_assign(&mut self, other: usize)
    Performs the *= operation. Read more
    ","MulAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Not for usize
    Source§
    type Output = usize
    The resulting type after applying the ! operator.
    Source§
    fn not(self) -> usize
    Performs the unary ! operation. Read more
    ","Not","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Octal for usize
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Octal","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Ord for usize
    Source§
    fn cmp(&self, other: &usize) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · Source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · Source§
    fn min(self, other: Self) -> Self
    where\n    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\n    Self: Sized,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl PartialEq for usize
    Source§
    fn eq(&self, other: &usize) -> bool
    Tests for self and other values to be equal, and is used by ==.
    Source§
    fn ne(&self, other: &usize) -> bool
    Tests for !=. The default implementation is almost always sufficient,\nand should not be overridden without very good reason.
    ","PartialEq","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl PartialOrd for usize
    Source§
    fn partial_cmp(&self, other: &usize) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    Source§
    fn lt(&self, other: &usize) -> bool
    Tests less than (for self and other) and is used by the < operator. Read more
    Source§
    fn le(&self, other: &usize) -> bool
    Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
    Source§
    fn ge(&self, other: &usize) -> bool
    Tests greater than or equal to (for self and other) and is used by\nthe >= operator. Read more
    Source§
    fn gt(&self, other: &usize) -> bool
    Tests greater than (for self and other) and is used by the >\noperator. Read more
    ","PartialOrd","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.12.0 · Source§
    impl<'a> Product<&'a usize> for usize
    Source§
    fn product<I>(iter: I) -> usize
    where\n    I: Iterator<Item = &'a usize>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product<&'a usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.12.0 · Source§
    impl Product for usize
    Source§
    fn product<I>(iter: I) -> usize
    where\n    I: Iterator<Item = usize>,
    Takes an iterator and generates Self from the elements by multiplying\nthe items.
    ","Product","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl Random for usize
    Source§
    fn random(source: &mut (impl RandomSource + ?Sized)) -> usize
    🔬This is a nightly-only experimental API. (random)
    Generates a random value.
    \n
    Warning: Be careful when manipulating the resulting value! This\nmethod samples according to a uniform distribution, so a value of 1 is\njust as likely as MAX. By using modulo operations, some\nvalues can become more likely than others. Use audited crates when in\ndoubt.
    \n
    ","Random","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Rem<&usize> for usize
    Source§
    type Output = <usize as Rem>::Output
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: &usize) -> <usize as Rem>::Output
    Performs the % operation. Read more
    ","Rem<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.51.0 · Source§
    impl Rem<NonZero<usize>> for usize
    Source§
    fn rem(self, other: NonZero<usize>) -> usize
    This operation satisfies n % d == n - (n / d) * d, and cannot panic.
    \n
    Source§
    type Output = usize
    The resulting type after applying the % operator.
    ","Rem>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Rem for usize
    This operation satisfies n % d == n - (n / d) * d. The\nresult has the same sign as the left operand.
    \n
    §Panics
    \n
    This operation will panic if other == 0.
    \n
    Source§
    type Output = usize
    The resulting type after applying the % operator.
    Source§
    fn rem(self, other: usize) -> usize
    Performs the % operation. Read more
    ","Rem","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl RemAssign<&usize> for usize
    Source§
    fn rem_assign(&mut self, other: &usize)
    Performs the %= operation. Read more
    ","RemAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.79.0 · Source§
    impl RemAssign<NonZero<usize>> for usize
    Source§
    fn rem_assign(&mut self, other: NonZero<usize>)
    This operation satisfies n % d == n - (n / d) * d, and cannot panic.
    \n
    ","RemAssign>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl RemAssign for usize
    Source§
    fn rem_assign(&mut self, other: usize)
    Performs the %= operation. Read more
    ","RemAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl SampleUniform for usize
    Source§
    type Sampler = UniformInt<usize>
    The UniformSampler implementation supporting type X.
    ","SampleUniform","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl Serialize for usize
    Source§
    fn serialize<S>(\n    &self,\n    serializer: S,\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&i128> for usize
    Source§
    type Output = <usize as Shl<i128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i128) -> <usize as Shl<i128>>::Output
    Performs the << operation. Read more
    ","Shl<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&i16> for usize
    Source§
    type Output = <usize as Shl<i16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i16) -> <usize as Shl<i16>>::Output
    Performs the << operation. Read more
    ","Shl<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&i32> for usize
    Source§
    type Output = <usize as Shl<i32>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i32) -> <usize as Shl<i32>>::Output
    Performs the << operation. Read more
    ","Shl<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&i64> for usize
    Source§
    type Output = <usize as Shl<i64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i64) -> <usize as Shl<i64>>::Output
    Performs the << operation. Read more
    ","Shl<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&i8> for usize
    Source§
    type Output = <usize as Shl<i8>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &i8) -> <usize as Shl<i8>>::Output
    Performs the << operation. Read more
    ","Shl<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&isize> for usize
    Source§
    type Output = <usize as Shl<isize>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &isize) -> <usize as Shl<isize>>::Output
    Performs the << operation. Read more
    ","Shl<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&u128> for usize
    Source§
    type Output = <usize as Shl<u128>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u128) -> <usize as Shl<u128>>::Output
    Performs the << operation. Read more
    ","Shl<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&u16> for usize
    Source§
    type Output = <usize as Shl<u16>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u16) -> <usize as Shl<u16>>::Output
    Performs the << operation. Read more
    ","Shl<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&u32> for usize
    Source§
    type Output = <usize as Shl<u32>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u32) -> <usize as Shl<u32>>::Output
    Performs the << operation. Read more
    ","Shl<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&u64> for usize
    Source§
    type Output = <usize as Shl<u64>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u64) -> <usize as Shl<u64>>::Output
    Performs the << operation. Read more
    ","Shl<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&u8> for usize
    Source§
    type Output = <usize as Shl<u8>>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &u8) -> <usize as Shl<u8>>::Output
    Performs the << operation. Read more
    ","Shl<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<&usize> for usize
    Source§
    type Output = <usize as Shl>::Output
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: &usize) -> <usize as Shl>::Output
    Performs the << operation. Read more
    ","Shl<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<i128> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i128) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<i16> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i16) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<i32> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i32) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<i64> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i64) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<i8> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: i8) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<isize> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: isize) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<u128> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u128) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<u16> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u16) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<u32> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u32) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<u64> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u64) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl<u8> for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: u8) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shl for usize
    Source§
    type Output = usize
    The resulting type after applying the << operator.
    Source§
    fn shl(self, other: usize) -> usize
    Performs the << operation. Read more
    ","Shl","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&i128> for usize
    Source§
    fn shl_assign(&mut self, other: &i128)
    Performs the <<= operation. Read more
    ","ShlAssign<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&i16> for usize
    Source§
    fn shl_assign(&mut self, other: &i16)
    Performs the <<= operation. Read more
    ","ShlAssign<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&i32> for usize
    Source§
    fn shl_assign(&mut self, other: &i32)
    Performs the <<= operation. Read more
    ","ShlAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&i64> for usize
    Source§
    fn shl_assign(&mut self, other: &i64)
    Performs the <<= operation. Read more
    ","ShlAssign<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&i8> for usize
    Source§
    fn shl_assign(&mut self, other: &i8)
    Performs the <<= operation. Read more
    ","ShlAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&isize> for usize
    Source§
    fn shl_assign(&mut self, other: &isize)
    Performs the <<= operation. Read more
    ","ShlAssign<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&u128> for usize
    Source§
    fn shl_assign(&mut self, other: &u128)
    Performs the <<= operation. Read more
    ","ShlAssign<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&u16> for usize
    Source§
    fn shl_assign(&mut self, other: &u16)
    Performs the <<= operation. Read more
    ","ShlAssign<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&u32> for usize
    Source§
    fn shl_assign(&mut self, other: &u32)
    Performs the <<= operation. Read more
    ","ShlAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&u64> for usize
    Source§
    fn shl_assign(&mut self, other: &u64)
    Performs the <<= operation. Read more
    ","ShlAssign<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&u8> for usize
    Source§
    fn shl_assign(&mut self, other: &u8)
    Performs the <<= operation. Read more
    ","ShlAssign<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShlAssign<&usize> for usize
    Source§
    fn shl_assign(&mut self, other: &usize)
    Performs the <<= operation. Read more
    ","ShlAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<i128> for usize
    Source§
    fn shl_assign(&mut self, other: i128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<i16> for usize
    Source§
    fn shl_assign(&mut self, other: i16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<i32> for usize
    Source§
    fn shl_assign(&mut self, other: i32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<i64> for usize
    Source§
    fn shl_assign(&mut self, other: i64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<i8> for usize
    Source§
    fn shl_assign(&mut self, other: i8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<isize> for usize
    Source§
    fn shl_assign(&mut self, other: isize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<u128> for usize
    Source§
    fn shl_assign(&mut self, other: u128)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<u16> for usize
    Source§
    fn shl_assign(&mut self, other: u16)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<u32> for usize
    Source§
    fn shl_assign(&mut self, other: u32)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<u64> for usize
    Source§
    fn shl_assign(&mut self, other: u64)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign<u8> for usize
    Source§
    fn shl_assign(&mut self, other: u8)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShlAssign for usize
    Source§
    fn shl_assign(&mut self, other: usize)
    Performs the <<= operation. Read more
    ","ShlAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&i128> for usize
    Source§
    type Output = <usize as Shr<i128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i128) -> <usize as Shr<i128>>::Output
    Performs the >> operation. Read more
    ","Shr<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&i16> for usize
    Source§
    type Output = <usize as Shr<i16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i16) -> <usize as Shr<i16>>::Output
    Performs the >> operation. Read more
    ","Shr<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&i32> for usize
    Source§
    type Output = <usize as Shr<i32>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i32) -> <usize as Shr<i32>>::Output
    Performs the >> operation. Read more
    ","Shr<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&i64> for usize
    Source§
    type Output = <usize as Shr<i64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i64) -> <usize as Shr<i64>>::Output
    Performs the >> operation. Read more
    ","Shr<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&i8> for usize
    Source§
    type Output = <usize as Shr<i8>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &i8) -> <usize as Shr<i8>>::Output
    Performs the >> operation. Read more
    ","Shr<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&isize> for usize
    Source§
    type Output = <usize as Shr<isize>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &isize) -> <usize as Shr<isize>>::Output
    Performs the >> operation. Read more
    ","Shr<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&u128> for usize
    Source§
    type Output = <usize as Shr<u128>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u128) -> <usize as Shr<u128>>::Output
    Performs the >> operation. Read more
    ","Shr<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&u16> for usize
    Source§
    type Output = <usize as Shr<u16>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u16) -> <usize as Shr<u16>>::Output
    Performs the >> operation. Read more
    ","Shr<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&u32> for usize
    Source§
    type Output = <usize as Shr<u32>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u32) -> <usize as Shr<u32>>::Output
    Performs the >> operation. Read more
    ","Shr<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&u64> for usize
    Source§
    type Output = <usize as Shr<u64>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u64) -> <usize as Shr<u64>>::Output
    Performs the >> operation. Read more
    ","Shr<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&u8> for usize
    Source§
    type Output = <usize as Shr<u8>>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &u8) -> <usize as Shr<u8>>::Output
    Performs the >> operation. Read more
    ","Shr<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<&usize> for usize
    Source§
    type Output = <usize as Shr>::Output
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: &usize) -> <usize as Shr>::Output
    Performs the >> operation. Read more
    ","Shr<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<i128> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i128) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<i16> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i16) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<i32> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i32) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<i64> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i64) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<i8> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: i8) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<isize> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: isize) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<u128> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u128) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<u16> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u16) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<u32> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u32) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<u64> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u64) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr<u8> for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: u8) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Shr for usize
    Source§
    type Output = usize
    The resulting type after applying the >> operator.
    Source§
    fn shr(self, other: usize) -> usize
    Performs the >> operation. Read more
    ","Shr","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&i128> for usize
    Source§
    fn shr_assign(&mut self, other: &i128)
    Performs the >>= operation. Read more
    ","ShrAssign<&i128>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&i16> for usize
    Source§
    fn shr_assign(&mut self, other: &i16)
    Performs the >>= operation. Read more
    ","ShrAssign<&i16>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&i32> for usize
    Source§
    fn shr_assign(&mut self, other: &i32)
    Performs the >>= operation. Read more
    ","ShrAssign<&i32>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&i64> for usize
    Source§
    fn shr_assign(&mut self, other: &i64)
    Performs the >>= operation. Read more
    ","ShrAssign<&i64>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&i8> for usize
    Source§
    fn shr_assign(&mut self, other: &i8)
    Performs the >>= operation. Read more
    ","ShrAssign<&i8>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&isize> for usize
    Source§
    fn shr_assign(&mut self, other: &isize)
    Performs the >>= operation. Read more
    ","ShrAssign<&isize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&u128> for usize
    Source§
    fn shr_assign(&mut self, other: &u128)
    Performs the >>= operation. Read more
    ","ShrAssign<&u128>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&u16> for usize
    Source§
    fn shr_assign(&mut self, other: &u16)
    Performs the >>= operation. Read more
    ","ShrAssign<&u16>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&u32> for usize
    Source§
    fn shr_assign(&mut self, other: &u32)
    Performs the >>= operation. Read more
    ","ShrAssign<&u32>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&u64> for usize
    Source§
    fn shr_assign(&mut self, other: &u64)
    Performs the >>= operation. Read more
    ","ShrAssign<&u64>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&u8> for usize
    Source§
    fn shr_assign(&mut self, other: &u8)
    Performs the >>= operation. Read more
    ","ShrAssign<&u8>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl ShrAssign<&usize> for usize
    Source§
    fn shr_assign(&mut self, other: &usize)
    Performs the >>= operation. Read more
    ","ShrAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<i128> for usize
    Source§
    fn shr_assign(&mut self, other: i128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<i16> for usize
    Source§
    fn shr_assign(&mut self, other: i16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<i32> for usize
    Source§
    fn shr_assign(&mut self, other: i32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<i64> for usize
    Source§
    fn shr_assign(&mut self, other: i64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<i8> for usize
    Source§
    fn shr_assign(&mut self, other: i8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<isize> for usize
    Source§
    fn shr_assign(&mut self, other: isize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<u128> for usize
    Source§
    fn shr_assign(&mut self, other: u128)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<u16> for usize
    Source§
    fn shr_assign(&mut self, other: u16)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<u32> for usize
    Source§
    fn shr_assign(&mut self, other: u32)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<u64> for usize
    Source§
    fn shr_assign(&mut self, other: u64)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign<u8> for usize
    Source§
    fn shr_assign(&mut self, other: u8)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl ShrAssign for usize
    Source§
    fn shr_assign(&mut self, other: usize)
    Performs the >>= operation. Read more
    ","ShrAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl SimdElement for usize
    Source§
    type Mask = isize
    🔬This is a nightly-only experimental API. (portable_simd)
    The mask element type corresponding to this element type.
    ","SimdElement","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.15.0 · Source§
    impl<T> SliceIndex<[T]> for usize
    The methods index and index_mut panic if the index is out of bounds.
    \n
    Source§
    type Output = T
    The output type returned by methods.
    Source§
    fn get(self, slice: &[T]) -> Option<&T>
    🔬This is a nightly-only experimental API. (slice_index_methods)
    Returns a shared reference to the output at this location, if in\nbounds.
    Source§
    fn get_mut(self, slice: &mut [T]) -> Option<&mut T>
    🔬This is a nightly-only experimental API. (slice_index_methods)
    Returns a mutable reference to the output at this location, if in\nbounds.
    Source§
    unsafe fn get_unchecked(self, slice: *const [T]) -> *const T
    🔬This is a nightly-only experimental API. (slice_index_methods)
    Returns a pointer to the output at this location, without\nperforming any bounds checking. Read more
    Source§
    unsafe fn get_unchecked_mut(self, slice: *mut [T]) -> *mut T
    🔬This is a nightly-only experimental API. (slice_index_methods)
    Returns a mutable pointer to the output at this location, without\nperforming any bounds checking. Read more
    Source§
    fn index(self, slice: &[T]) -> &T
    🔬This is a nightly-only experimental API. (slice_index_methods)
    Returns a shared reference to the output at this location, panicking\nif out of bounds.
    Source§
    fn index_mut(self, slice: &mut [T]) -> &mut T
    🔬This is a nightly-only experimental API. (slice_index_methods)
    Returns a mutable reference to the output at this location, panicking\nif out of bounds.
    ","SliceIndex<[T]>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl Step for usize
    Source§
    fn forward(start: usize, n: usize) -> usize
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward(start: usize, n: usize) -> usize
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    unsafe fn forward_unchecked(start: usize, n: usize) -> usize
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    unsafe fn backward_unchecked(start: usize, n: usize) -> usize
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    Source§
    fn steps_between(start: &usize, end: &usize) -> (usize, Option<usize>)
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the bounds on the number of successor steps required to get from start to end\nlike Iterator::size_hint(). Read more
    Source§
    fn forward_checked(start: usize, n: usize) -> Option<usize>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the successor\nof self count times. Read more
    Source§
    fn backward_checked(start: usize, n: usize) -> Option<usize>
    🔬This is a nightly-only experimental API. (step_trait)
    Returns the value that would be obtained by taking the predecessor\nof self count times. Read more
    ","Step","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Sub<&usize> for usize
    Source§
    type Output = <usize as Sub>::Output
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: &usize) -> <usize as Sub>::Output
    Performs the - operation. Read more
    ","Sub<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Sub for usize
    Source§
    type Output = usize
    The resulting type after applying the - operator.
    Source§
    fn sub(self, other: usize) -> usize
    Performs the - operation. Read more
    ","Sub","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.22.0 · Source§
    impl SubAssign<&usize> for usize
    Source§
    fn sub_assign(&mut self, other: &usize)
    Performs the -= operation. Read more
    ","SubAssign<&usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.8.0 · Source§
    impl SubAssign for usize
    Source§
    fn sub_assign(&mut self, other: usize)
    Performs the -= operation. Read more
    ","SubAssign","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.12.0 · Source§
    impl<'a> Sum<&'a usize> for usize
    Source§
    fn sum<I>(iter: I) -> usize
    where\n    I: Iterator<Item = &'a usize>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum<&'a usize>","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.12.0 · Source§
    impl Sum for usize
    Source§
    fn sum<I>(iter: I) -> usize
    where\n    I: Iterator<Item = usize>,
    Takes an iterator and generates Self from the elements by “summing up”\nthe items.
    ","Sum","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.34.0 · Source§
    impl TryFrom<i128> for usize
    Source§
    fn try_from(u: i128) -> Result<usize, <usize as TryFrom<i128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.34.0 · Source§
    impl TryFrom<i16> for usize
    Source§
    fn try_from(u: i16) -> Result<usize, <usize as TryFrom<i16>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.34.0 · Source§
    impl TryFrom<i32> for usize
    Source§
    fn try_from(u: i32) -> Result<usize, <usize as TryFrom<i32>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.34.0 · Source§
    impl TryFrom<i64> for usize
    Source§
    fn try_from(u: i64) -> Result<usize, <usize as TryFrom<i64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.34.0 · Source§
    impl TryFrom<i8> for usize
    Source§
    fn try_from(u: i8) -> Result<usize, <usize as TryFrom<i8>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.34.0 · Source§
    impl TryFrom<isize> for usize
    Source§
    fn try_from(u: isize) -> Result<usize, <usize as TryFrom<isize>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.34.0 · Source§
    impl TryFrom<u128> for usize
    Source§
    fn try_from(u: u128) -> Result<usize, <usize as TryFrom<u128>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.34.0 · Source§
    impl TryFrom<u32> for usize
    Source§
    fn try_from(value: u32) -> Result<usize, <usize as TryFrom<u32>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.34.0 · Source§
    impl TryFrom<u64> for usize
    Source§
    fn try_from(value: u64) -> Result<usize, <usize as TryFrom<u64>>::Error>
    Tries to create the target number type from a source\nnumber type. This returns an error if the source value\nis outside of the range of the target type.
    \n
    Source§
    type Error = TryFromIntError
    The type returned in the event of a conversion error.
    ","TryFrom","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.42.0 · Source§
    impl UpperExp for usize
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperExp","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl UpperHex for usize
    Source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","UpperHex","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl ConstParamTy_ for usize
    ","ConstParamTy_","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Copy for usize
    ","Copy","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    1.0.0 · Source§
    impl Eq for usize
    ","Eq","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl PointerLike for usize
    ","PointerLike","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl SimdCast for usize
    ","SimdCast","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl StructuralPartialEq for usize
    ","StructuralPartialEq","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl TrustedStep for usize
    ","TrustedStep","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl UnsizedConstParamTy for usize
    ","UnsizedConstParamTy","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl Weight for usize
    ","Weight","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"],["
    Source§
    impl ZeroablePrimitive for usize
    ","ZeroablePrimitive","bdk_chain::bitcoin::secp256k1::ffi::types::size_t"]]]]);
     if (window.register_type_impls) {
         window.register_type_impls(type_impls);
     } else {
         window.pending_type_impls = type_impls;
     }
 })()
-//{"start":55,"fragment_lengths":[429069]}
\ No newline at end of file
+//{"start":55,"fragment_lengths":[429068]}
\ No newline at end of file
-- 
2.49.0