pub struct PipsQueryApi<'api> { /* private fields */ }Implementations§
Source§impl<'api> PipsQueryApi<'api>
impl<'api> PipsQueryApi<'api>
Sourcepub async fn prune_historical_pips(&self) -> Result<bool>
pub async fn prune_historical_pips(&self) -> Result<bool>
Set to true if historical PIPs data must be removed.
Sourcepub async fn minimum_proposal_deposit(&self) -> Result<u128>
pub async fn minimum_proposal_deposit(&self) -> Result<u128>
The minimum amount to be used as a deposit for community PIP creation.
Sourcepub async fn default_enactment_period(&self) -> Result<u32>
pub async fn default_enactment_period(&self) -> Result<u32>
Default enactment period that will be use after a proposal is accepted by GC.
Sourcepub async fn pending_pip_expiry(&self) -> Result<MaybeBlock<u32>>
pub async fn pending_pip_expiry(&self) -> Result<MaybeBlock<u32>>
Number of blocks it will take, after a Pending PIP expires, assuming it has not transitioned to another ProposalState.
Sourcepub async fn max_pip_skip_count(&self) -> Result<u8>
pub async fn max_pip_skip_count(&self) -> Result<u8>
Maximum times a PIP can be skipped before triggering CannotSkipPip in enact_snapshot_results.
Sourcepub async fn active_pip_limit(&self) -> Result<u32>
pub async fn active_pip_limit(&self) -> Result<u32>
The maximum allowed number for active PIPs. Once reached, new PIPs cannot be proposed by community members.
Sourcepub async fn pip_id_sequence(&self) -> Result<PipId>
pub async fn pip_id_sequence(&self) -> Result<PipId>
Proposal’s identifier.
Sourcepub async fn snapshot_id_sequence(&self) -> Result<SnapshotId>
pub async fn snapshot_id_sequence(&self) -> Result<SnapshotId>
Snaphot’s identifier.
Sourcepub async fn active_pip_count(&self) -> Result<u32>
pub async fn active_pip_count(&self) -> Result<u32>
Total count of pending or scheduled PIPs.
Sourcepub async fn proposal_metadata(
&self,
key_0: PipId,
) -> Result<Option<PipsMetadata<u32>>>
pub async fn proposal_metadata( &self, key_0: PipId, ) -> Result<Option<PipsMetadata<u32>>>
The [PipsMetadata] for each proposal ([PipId]).
Sourcepub async fn deposits(
&self,
key_0: PipId,
key_1: AccountId,
) -> Result<Option<DepositInfo<AccountId>>>
pub async fn deposits( &self, key_0: PipId, key_1: AccountId, ) -> Result<Option<DepositInfo<AccountId>>>
All locked [DepositInfo] per [PipId] for each account.
Sourcepub async fn proposals(
&self,
key_0: PipId,
) -> Result<Option<Pip<RuntimeCall, AccountId>>>
pub async fn proposals( &self, key_0: PipId, ) -> Result<Option<Pip<RuntimeCall, AccountId>>>
The [Pip] for each proposal ([PipId]).
Sourcepub async fn proposal_result(&self, key_0: PipId) -> Result<VotingResult>
pub async fn proposal_result(&self, key_0: PipId) -> Result<VotingResult>
The [VotingResult] for each proposal ([PipId]).
Sourcepub async fn proposal_votes(
&self,
key_0: PipId,
key_1: AccountId,
) -> Result<Option<Vote>>
pub async fn proposal_votes( &self, key_0: PipId, key_1: AccountId, ) -> Result<Option<Vote>>
The Votes ([Vote]) for each proposal ([PipId]) per account.
Sourcepub async fn pip_to_schedule(&self, key_0: PipId) -> Result<Option<u32>>
pub async fn pip_to_schedule(&self, key_0: PipId) -> Result<Option<u32>>
Maps PIPs to the block at which they will be executed.
Sourcepub async fn live_queue(&self) -> Result<Vec<SnapshottedPip>>
pub async fn live_queue(&self) -> Result<Vec<SnapshottedPip>>
A live priority queue (lowest priority at index 0)
of pending PIPs up to the active limit.
Priority is defined by the weight in the SnapshottedPip.
Unlike SnapshotQueue, this queue is live, getting updated with each vote cast.
The snapshot is therefore essentially a point-in-time clone of this queue.
Sourcepub async fn snapshot_queue(&self) -> Result<Vec<SnapshottedPip>>
pub async fn snapshot_queue(&self) -> Result<Vec<SnapshottedPip>>
The priority queue (lowest priority at index 0) of PIPs at the point of snapshotting.
Priority is defined by the weight in the SnapshottedPip.
A queued PIP can be skipped. Doing so bumps the pip_skip_count.
Once a (configurable) threshhold is exceeded, a PIP cannot be skipped again.
Sourcepub async fn snapshot_meta(
&self,
) -> Result<Option<SnapshotMetadata<u32, AccountId>>>
pub async fn snapshot_meta( &self, ) -> Result<Option<SnapshotMetadata<u32, AccountId>>>
The [SnapshotMetadata].
Sourcepub async fn pip_skip_count(&self, key_0: PipId) -> Result<u8>
pub async fn pip_skip_count(&self, key_0: PipId) -> Result<u8>
The number of times a certain PIP has been skipped. Once a (configurable) threshhold is exceeded, a PIP cannot be skipped again.
Sourcepub async fn committee_pips(&self) -> Result<Vec<PipId>>
pub async fn committee_pips(&self) -> Result<Vec<PipId>>
All existing PIPs where the proposer is a committee.
This list is a cache of all ids in Proposals with Proposer::Committee(_).
Sourcepub async fn proposal_states(
&self,
key_0: PipId,
) -> Result<Option<ProposalState>>
pub async fn proposal_states( &self, key_0: PipId, ) -> Result<Option<ProposalState>>
The ([ProposalState]) of a given PIP ([PipId]).
Sourcepub async fn pending_refunds(&self, key_0: PipId) -> Result<Option<bool>>
pub async fn pending_refunds(&self, key_0: PipId) -> Result<Option<bool>>
All PIPs that still require refunds.
Sourcepub async fn votes_to_be_pruned(&self, key_0: PipId) -> Result<Option<bool>>
pub async fn votes_to_be_pruned(&self, key_0: PipId) -> Result<Option<bool>>
All PIPs that still require votes to be pruned.
Sourcepub async fn storage_version(&self) -> Result<Version>
pub async fn storage_version(&self) -> Result<Version>
Storage version.
Trait Implementations§
Source§impl<'api> Clone for PipsQueryApi<'api>
impl<'api> Clone for PipsQueryApi<'api>
Source§fn clone(&self) -> PipsQueryApi<'api>
fn clone(&self) -> PipsQueryApi<'api>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreAuto Trait Implementations§
impl<'api> Freeze for PipsQueryApi<'api>
impl<'api> !RefUnwindSafe for PipsQueryApi<'api>
impl<'api> Send for PipsQueryApi<'api>
impl<'api> Sync for PipsQueryApi<'api>
impl<'api> Unpin for PipsQueryApi<'api>
impl<'api> !UnwindSafe for PipsQueryApi<'api>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<Src, Dest> IntoTuple<Dest> for Srcwhere
Dest: FromTuple<Src>,
impl<Src, Dest> IntoTuple<Dest> for Srcwhere
Dest: FromTuple<Src>,
fn into_tuple(self) -> Dest
Source§impl<T, Outer> IsWrappedBy<Outer> for T
impl<T, Outer> IsWrappedBy<Outer> for T
Source§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
Source§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
Source§fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
T. Read moreSource§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
Source§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
unchecked_from.Source§impl<T, S> UniqueSaturatedInto<T> for S
impl<T, S> UniqueSaturatedInto<T> for S
Source§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
T.