Struct polymesh_api::polymesh::api::corporate_ballot::QueryApi
source · [−]pub struct QueryApi<'api> { /* private fields */ }Implementations
sourceimpl<'api> QueryApi<'api>
impl<'api> QueryApi<'api>
sourcepub async fn metas(&self, key_0: CAId) -> Result<Option<BallotMeta>>
pub async fn metas(&self, key_0: CAId) -> Result<Option<BallotMeta>>
Metadata of a corporate ballot.
(CAId) => BallotMeta
sourcepub async fn time_ranges(&self, key_0: CAId) -> Result<Option<BallotTimeRange>>
pub async fn time_ranges(&self, key_0: CAId) -> Result<Option<BallotTimeRange>>
Time details of a corporate ballot associated with a CA. The timestamps denote when voting starts and stops.
(CAId) => BallotTimeRange
sourcepub async fn motion_num_choices(&self, key_0: CAId) -> Result<Vec<u16>>
pub async fn motion_num_choices(&self, key_0: CAId) -> Result<Vec<u16>>
Stores how many choices there are in each motion.
At all times, the invariant holds that motion_choices[idx] is equal to
metas.unwrap().motions[idx].choices.len(). That is, this is just a cache,
used to avoid fetching all the motions with their associated texts.
u16 choices should be more than enough to fit real use cases.
(CAId) => Number of choices in each motion.
sourcepub async fn rcv(&self, key_0: CAId) -> Result<bool>
pub async fn rcv(&self, key_0: CAId) -> Result<bool>
Is ranked choice voting (RCV) enabled for this ballot?
For an understanding of how RCV is handled, see note on BallotVote’s fallback field.
(CAId) => bool
sourcepub async fn results(&self, key_0: CAId) -> Result<Vec<u128>>
pub async fn results(&self, key_0: CAId) -> Result<Vec<u128>>
Stores the total vote tally on each choice.
RCV is not accounted for, as there are too many wants to interpret the graph, and because it would not be efficient.
(CAId) => [current vote weights]
sourcepub async fn votes(
&self,
key_0: CAId,
key_1: IdentityId
) -> Result<Vec<BallotVote>>
pub async fn votes(
&self,
key_0: CAId,
key_1: IdentityId
) -> Result<Vec<BallotVote>>
Stores each DID’s votes in a given ballot.
See the documentation of BallotVote for notes on semantics.
(CAId) => (DID) => [vote weight]
User must enter 0 vote weight if they don’t want to vote for a choice.
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
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
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>ⓘNotable traits for Box<W, Global>impl<W> Write for Box<W, Global>where
W: Write + ?Sized,impl<R> Read for Box<R, Global>where
R: Read + ?Sized,impl<I, A> Iterator for Box<I, A>where
I: Iterator + ?Sized,
A: Allocator, type Item = <I as Iterator>::Item;impl<F, A> Future for Box<F, A>where
F: Future + Unpin + ?Sized,
A: Allocator + 'static, type Output = <F as Future>::Output;
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>ⓘNotable traits for Box<W, Global>impl<W> Write for Box<W, Global>where
W: Write + ?Sized,impl<R> Read for Box<R, Global>where
R: Read + ?Sized,impl<I, A> Iterator for Box<I, A>where
I: Iterator + ?Sized,
A: Allocator, type Item = <I as Iterator>::Item;impl<F, A> Future for Box<F, A>where
F: Future + Unpin + ?Sized,
A: Allocator + 'static, type Output = <F as Future>::Output;
W: Write + ?Sized,impl<R> Read for Box<R, Global>where
R: Read + ?Sized,impl<I, A> Iterator for Box<I, A>where
I: Iterator + ?Sized,
A: Allocator, type Item = <I as Iterator>::Item;impl<F, A> Future for Box<F, A>where
F: Future + Unpin + ?Sized,
A: Allocator + 'static, type Output = <F as Future>::Output;
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 morefn 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 morefn 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 morefn 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 moresourceimpl<T> Instrument for T
impl<T> Instrument for T
sourcefn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
sourcefn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
sourceimpl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
sourcefn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
sourcefn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
T. Read moreimpl<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.sourceimpl<T, S> UniqueSaturatedInto<T> for Swhere
T: Bounded,
S: TryInto<T>,
impl<T, S> UniqueSaturatedInto<T> for Swhere
T: Bounded,
S: TryInto<T>,
sourcefn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
T.