Struct pallet_preimage::pallet::Pallet

pub struct Pallet<T>(_);

The Pallet struct, the main type that implements traits and standalone functions within the pallet.

Implementations

impl<T: Config> Pallet<T>

pub fn note_preimage( origin: OriginFor<T>, bytes: Vec<u8> ) -> DispatchResultWithPostInfo

Register a preimage on-chain.

If the preimage was previously requested, no fees or deposits are taken for providing the preimage. Otherwise, a deposit is taken proportional to the size of the preimage.

pub fn unnote_preimage(origin: OriginFor<T>, hash: T::Hash) -> DispatchResult

Clear an unrequested preimage from the runtime storage.

If len is provided, then it will be a much cheaper operation.

• hash: The hash of the preimage to be removed from the store.
• len: The length of the preimage of hash.

pub fn request_preimage(origin: OriginFor<T>, hash: T::Hash) -> DispatchResult

Request a preimage be uploaded to the chain without paying any fees or deposits.

If the preimage requests has already been provided on-chain, we unreserve any deposit a user may have paid, and take the control of the preimage out of their hands.

pub fn unrequest_preimage(origin: OriginFor<T>, hash: T::Hash) -> DispatchResult

Clear a previously made request for a preimage.

NOTE: THIS MUST NOT BE CALLED ON hash MORE TIMES THAN request_preimage.

Trait Implementations

impl<T> Benchmarking for Pallet<T>where T: Config + Config,

fn benchmarks(extra: bool) -> Vec<BenchmarkMetadata>

Get the benchmarks available for this pallet. Generally there is one benchmark per extrinsic, so these are sometimes just called “extrinsics”.

fn run_benchmark( extrinsic: &[u8], c: &[(BenchmarkParameter, u32)], whitelist: &[TrackedStorageKey], verify: bool, internal_repeats: u32 ) -> Result<Vec<BenchmarkResult>, BenchmarkError>

Run the benchmarks for this pallet.

impl<T: Config> Callable<T> for Pallet<T>

type RuntimeCall = Call<T>

impl<T> Clone for Pallet<T>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Debug for Pallet<T>

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

Formats the value using the given formatter.

impl<T: Config> GetStorageVersion for Pallet<T>

type CurrentStorageVersion = StorageVersion

This will be filled out by the pallet macro.

fn current_storage_version() -> Self::CurrentStorageVersion

Returns the current storage version as supported by the pallet.

fn on_chain_storage_version() -> StorageVersion

Returns the on-chain storage version of the pallet as stored in the storage.

impl<T: Config> Hooks<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>

fn on_initialize(_n: BlockNumber) -> Weight

Block initialization hook. This is called at the very beginning of block execution.

fn on_finalize(_n: BlockNumber)

Block finalization hook. This is called at the very end of block execution.

fn on_idle(_n: BlockNumber, _remaining_weight: Weight) -> Weight

Hook to consume a block’s idle time. This will run when the block is being finalized (before Hooks::on_finalize).

fn on_runtime_upgrade() -> Weight

Hook executed when a code change (aka. a “runtime upgrade”) is detected by FRAME.

fn try_state(_n: BlockNumber) -> Result<(), DispatchError>

Execute the sanity checks of this pallet, per block.

fn pre_upgrade() -> Result<Vec<u8, Global>, DispatchError>

Execute some pre-checks prior to a runtime upgrade.

fn post_upgrade(_state: Vec<u8, Global>) -> Result<(), DispatchError>

Execute some post-checks after a runtime upgrade.

fn offchain_worker(_n: BlockNumber)

Implementing this function on a pallet allows you to perform long-running tasks that are dispatched as separate threads, and entirely independent of the main wasm runtime.

fn integrity_test()

Check the integrity of this pallet’s configuration.

impl<T: Config> IntegrityTest for Pallet<T>

fn integrity_test()

See Hooks::integrity_test.

impl<T: Config> OffchainWorker<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>

fn offchain_worker(n: BlockNumberFor<T>)

This function is being called after every block import (when fully synced).

impl<T: Config> OnFinalize<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>

fn on_finalize(n: BlockNumberFor<T>)

See Hooks::on_finalize.

impl<T: Config> OnGenesis for Pallet<T>

fn on_genesis()

Something that should happen at genesis.

impl<T: Config> OnIdle<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>

fn on_idle(n: BlockNumberFor<T>, remaining_weight: Weight) -> Weight

See Hooks::on_idle.

impl<T: Config> OnInitialize<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>

fn on_initialize(n: BlockNumberFor<T>) -> Weight

See Hooks::on_initialize.

impl<T: Config> OnRuntimeUpgrade for Pallet<T>

fn on_runtime_upgrade() -> Weight

See Hooks::on_runtime_upgrade.

fn pre_upgrade() -> Result<Vec<u8>, TryRuntimeError>

See Hooks::pre_upgrade.

fn post_upgrade(state: Vec<u8>) -> Result<(), TryRuntimeError>

See Hooks::post_upgrade.

fn try_on_runtime_upgrade(checks: bool) -> Result<Weight, DispatchError>

The expected and default behavior of this method is to handle executing pre_upgrade -> on_runtime_upgrade -> post_upgrade hooks for a migration.

impl<T: Config> PalletInfoAccess for Pallet<T>

fn index() -> usize

Index of the pallet as configured in the runtime.

fn name() -> &'static str

Name of the pallet as configured in the runtime.

fn module_name() -> &'static str

Name of the Rust module containing the pallet.

fn crate_version() -> CrateVersion

Version of the crate containing the pallet.

impl<T: Config> PalletsInfoAccess for Pallet<T>

fn count() -> usize

The number of pallets’ information that this type represents.

fn infos() -> Vec<PalletInfoData>

All of the pallets’ information that this type represents.

impl<T> PartialEq<Pallet<T>> for Pallet<T>

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

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

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

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

impl<T: Config> PreimageProvider<<T as Config>::Hash> for Pallet<T>

fn have_preimage(hash: &T::Hash) -> bool

Returns whether a preimage exists for a given hash.

fn preimage_requested(hash: &T::Hash) -> bool

Returns whether a preimage request exists for a given hash.

fn get_preimage(hash: &T::Hash) -> Option<Vec<u8>>

Returns the preimage for a given hash.

fn request_preimage(hash: &T::Hash)

Request that someone report a preimage. Providers use this to optimise the economics for preimage reporting.

fn unrequest_preimage(hash: &T::Hash)

Cancel a previous preimage request.

impl<T: Config> PreimageRecipient<<T as Config>::Hash> for Pallet<T>

type MaxSize = ConstU32<MAX_SIZE>

Maximum size of a preimage.

fn note_preimage(bytes: BoundedVec<u8, Self::MaxSize>)

Store the bytes of a preimage on chain infallible due to the bounded type.

fn unnote_preimage(hash: &T::Hash)

Clear a previously noted preimage. This is infallible and should be treated more like a hint - if it was not previously noted or if it is now requested, then this will not do anything.

impl<T: Config<Hash = PreimageHash>> QueryPreimage for Pallet<T>

fn len(hash: &T::Hash) -> Option<u32>

Returns whether a preimage exists for a given hash and if so its length.

fn fetch(hash: &T::Hash, len: Option<u32>) -> FetchResult

Returns the preimage for a given hash. If given, len must be the size of the preimage.

fn is_requested(hash: &T::Hash) -> bool

Returns whether a preimage request exists for a given hash.

fn request(hash: &T::Hash)

Request that someone report a preimage. Providers use this to optimise the economics for preimage reporting.

fn unrequest(hash: &T::Hash)

Cancel a previous preimage request.

fn hold<T>(bounded: &Bounded<T>)

Request that the data required for decoding the given bounded value is made available.

fn drop<T>(bounded: &Bounded<T>)

No longer request that the data required for decoding the given bounded value is made available.

fn have<T>(bounded: &Bounded<T>) -> bool

Check to see if all data required for the given bounded value is available for its decoding.

fn pick<T>(hash: H256, len: u32) -> Bounded<T>

Create a Bounded instance based on the hash and len of the encoded value.

fn peek<T>(bounded: &Bounded<T>) -> Result<(T, Option<u32>), DispatchError>where T: Decode,

Convert the given bounded instance back into its original instance, also returning the exact size of its encoded form if it needed to be looked-up from a stored preimage).

fn realize<T>(bounded: &Bounded<T>) -> Result<(T, Option<u32>), DispatchError>where T: Decode,

Convert the given bounded value back into its original instance. If successful, drop any data backing it. This will not break the realisability of independently created instances of Bounded which happen to have identical data.

impl<T: Config> StorageInfoTrait for Pallet<T>

fn storage_info() -> Vec<StorageInfo>

impl<T: Config<Hash = PreimageHash>> StorePreimage for Pallet<T>

const MAX_LENGTH: usize = 4_194_304usize

The maximum length of preimage we can store.

fn note(bytes: Cow<'_, [u8]>) -> Result<T::Hash, DispatchError>

Request and attempt to store the bytes of a preimage on chain.

fn unnote(hash: &T::Hash)

Attempt to clear a previously noted preimage. Exactly the same as unrequest but is provided for symmetry.

fn bound<T>(t: T) -> Result<Bounded<T>, DispatchError>where T: Encode,

Convert an otherwise unbounded or large value into a type ready for placing in storage.

impl<T: Config> TryState<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>

fn try_state( n: BlockNumberFor<T>, _s: TryStateSelect ) -> Result<(), TryRuntimeError>

Execute the state checks.

impl<T: Config> WhitelistedStorageKeys for Pallet<T>

fn whitelisted_storage_keys() -> Vec<TrackedStorageKey>

Returns a Vec<TrackedStorageKey> indicating the storage keys that should be whitelisted during benchmarking. This means that those keys will be excluded from the benchmarking performance calculation.

impl<T> Eq for Pallet<T>