Struct polymesh_api::polymesh::api::checkpoint::QueryApi

source · [−]

pub struct QueryApi<'api> { /* private fields */ }

Implementations

source

impl<'api> QueryApi<'api>

source

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

source

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

source

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

source

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]

source

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

source

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).

source

pub async fn schedule_id_sequence(&self, key_0: Ticker) -> Result<ScheduleId>

Checkpoint schedule ID sequence for tickers.

(ticker) -> schedule ID

source

pub async fn schedules(&self, key_0: Ticker) -> Result<Vec<StoredSchedule>>

Checkpoint schedules for tickers.

(ticker) -> [schedule]

source

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

source

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]

source

pub async fn storage_version(&self) -> Result<Version>

Storage version.

Trait Implementations

source

impl<'api> Clone for QueryApi<'api>

source

fn clone(&self) -> QueryApi<'api>

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<'api> Debug for QueryApi<'api>

source

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

Formats the value using the given formatter. Read more

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

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,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

const: unstable · source

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

Mutably borrows from an owned value. Read more

impl<T> CheckedConversion for T

fn checked_from<T>(t: T) -> Option<Self> where
Self: TryFrom<T>,

Convert from a value of T into an equivalent instance of Option<Self>. Read more

fn checked_into<T>(self) -> Option<T> where
Self: TryInto<T>,

Consume self to return Some equivalent value of Option<T>. Read more

impl<T> Downcast for T where
T: Any,

fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>ⓘNotable traits for Box<R, Global>`impl<R> Read for Box<R, Global> where R: Read + ?Sized, impl<W> Write for Box<W, Global> where W: Write + ?Sized, impl<I, A> Iterator for Box<I, A> where I: Iterator + ?Sized, A: Allocator, type Item = ::Item;impl<F, A> Future for Box<F, A> where F: Future + Unpin + ?Sized, A: Allocator + 'static, type Output = <F as Future>::Output;`

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

Convert 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)

Convert &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)

Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s. Read more

impl<T> DowncastSync for T where
T: Any + Send + Sync,

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Sync + Send + 'static>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait. Read more