Struct polymesh_api::polymesh::api::checkpoint::QueryApi
source · pub struct QueryApi<'api> { /* private fields */ }Implementations§
source§impl<'api> QueryApi<'api>
impl<'api> QueryApi<'api>
sourcepub async fn total_supply(
&self,
key_0: Ticker,
key_1: CheckpointId
) -> Result<u128>
pub async fn total_supply(
&self,
key_0: Ticker,
key_1: CheckpointId
) -> Result<u128>
Total supply of the token at the checkpoint.
(ticker, checkpointId) -> total supply at given checkpoint
sourcepub async fn balance(
&self,
key_0: (Ticker, CheckpointId),
key_1: IdentityId
) -> Result<u128>
pub async fn balance(
&self,
key_0: (Ticker, CheckpointId),
key_1: IdentityId
) -> Result<u128>
Balance of a DID at a checkpoint.
(ticker, did, checkpoint ID) -> Balance of a DID at a checkpoint
sourcepub async fn checkpoint_id_sequence(&self, key_0: Ticker) -> Result<CheckpointId>
pub async fn checkpoint_id_sequence(&self, key_0: Ticker) -> Result<CheckpointId>
Checkpoints ID generator sequence. ID of first checkpoint is 1 instead of 0.
(ticker) -> no. of checkpoints
sourcepub async fn balance_updates(
&self,
key_0: Ticker,
key_1: IdentityId
) -> Result<Vec<CheckpointId>>
pub async fn balance_updates(
&self,
key_0: Ticker,
key_1: IdentityId
) -> Result<Vec<CheckpointId>>
Checkpoints where a DID’s balance was updated. (ticker, did) -> [checkpoint ID where user balance changed]
sourcepub async fn timestamps(&self, key_0: Ticker, key_1: CheckpointId) -> Result<u64>
pub async fn timestamps(&self, key_0: Ticker, key_1: CheckpointId) -> Result<u64>
Checkpoint timestamps.
Every schedule-originated checkpoint maps its ID to its due time. Every checkpoint manually created maps its ID to the time of recording.
(ticker) -> (checkpoint ID) -> checkpoint timestamp
sourcepub async fn schedules_max_complexity(&self) -> Result<u64>
pub async fn schedules_max_complexity(&self) -> Result<u64>
The maximum complexity allowed for an arbitrary ticker’s schedule set
(i.e. Schedules storage item below).
sourcepub async fn schedule_id_sequence(&self, key_0: Ticker) -> Result<ScheduleId>
pub async fn schedule_id_sequence(&self, key_0: Ticker) -> Result<ScheduleId>
Checkpoint schedule ID sequence for tickers.
(ticker) -> schedule ID
sourcepub async fn schedules(&self, key_0: Ticker) -> Result<Vec<StoredSchedule>>
pub async fn schedules(&self, key_0: Ticker) -> Result<Vec<StoredSchedule>>
Checkpoint schedules for tickers.
(ticker) -> [schedule]
sourcepub async fn schedule_ref_count(
&self,
key_0: Ticker,
key_1: ScheduleId
) -> Result<u32>
pub async fn schedule_ref_count(
&self,
key_0: Ticker,
key_1: ScheduleId
) -> Result<u32>
How many “strong” references are there to a given ScheduleId?
The presence of a “strong” reference, in the sense of Rc<T>,
entails that the referenced schedule cannot be removed.
Thus, as long as strong_ref_count(schedule_id) > 0,
remove_schedule(schedule_id) will error.
(ticker, schedule ID) -> strong ref count
sourcepub async fn schedule_points(
&self,
key_0: Ticker,
key_1: ScheduleId
) -> Result<Vec<CheckpointId>>
pub async fn schedule_points(
&self,
key_0: Ticker,
key_1: ScheduleId
) -> Result<Vec<CheckpointId>>
All the checkpoints a given schedule originated.
(ticker, schedule ID) -> [checkpoint ID]
sourcepub async fn storage_version(&self) -> Result<Version>
pub async fn storage_version(&self) -> Result<Version>
Storage version.
Trait Implementations§
Auto Trait Implementations§
impl<'api> !RefUnwindSafe for QueryApi<'api>
impl<'api> Send for QueryApi<'api>
impl<'api> Sync for QueryApi<'api>
impl<'api> Unpin for QueryApi<'api>
impl<'api> !UnwindSafe for QueryApi<'api>
Blanket Implementations§
§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
§fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
§fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait. Read more§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait. Read more§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s. Read more§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s. Read moresource§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> 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 more§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
unchecked_from.source§impl<T, S> UniqueSaturatedInto<T> for Swhere
T: Bounded,
S: TryInto<T>,
impl<T, S> UniqueSaturatedInto<T> for Swhere
T: Bounded,
S: TryInto<T>,
source§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
T.