Struct spl_governance::state::proposal::ProposalOption
source · pub struct ProposalOption {
pub label: String,
pub vote_weight: u64,
pub vote_result: OptionVoteResult,
pub transactions_executed_count: u16,
pub transactions_count: u16,
pub transactions_next_index: u16,
}
Expand description
Proposal Option
Fields§
§label: String
Option label
vote_weight: u64
Vote weight for the option
vote_result: OptionVoteResult
Vote result for the option
transactions_executed_count: u16
The number of the transactions already executed
transactions_count: u16
The number of transactions included in the option
transactions_next_index: u16
The index of the the next transaction to be added
Trait Implementations§
source§impl BorshDeserialize for ProposalOption
impl BorshDeserialize for ProposalOption
fn deserialize_reader<R: Read>(reader: &mut R) -> Result<Self, Error>
source§fn deserialize(buf: &mut &[u8]) -> Result<Self, Error>
fn deserialize(buf: &mut &[u8]) -> Result<Self, Error>
Deserializes this instance from a given slice of bytes.
Updates the buffer to point at the remaining bytes.
source§fn try_from_slice(v: &[u8]) -> Result<Self, Error>
fn try_from_slice(v: &[u8]) -> Result<Self, Error>
Deserialize this instance from a slice of bytes.
fn try_from_reader<R>(reader: &mut R) -> Result<Self, Error>where
R: Read,
source§impl BorshSchema for ProposalOption
impl BorshSchema for ProposalOption
source§fn declaration() -> Declaration
fn declaration() -> Declaration
Get the name of the type without brackets.
source§fn add_definitions_recursively(
definitions: &mut HashMap<Declaration, Definition>
)
fn add_definitions_recursively( definitions: &mut HashMap<Declaration, Definition> )
Recursively, using DFS, add type definitions required for this type. For primitive types
this is an empty map. Type definition explains how to serialize/deserialize a type.
source§fn add_definition(
declaration: String,
definition: Definition,
definitions: &mut HashMap<String, Definition>
)
fn add_definition( declaration: String, definition: Definition, definitions: &mut HashMap<String, Definition> )
Helper method to add a single type definition to the map.
fn schema_container() -> BorshSchemaContainer
source§impl BorshSerialize for ProposalOptionwhere
String: BorshSerialize,
u64: BorshSerialize,
OptionVoteResult: BorshSerialize,
u16: BorshSerialize,
impl BorshSerialize for ProposalOptionwhere
String: BorshSerialize,
u64: BorshSerialize,
OptionVoteResult: BorshSerialize,
u16: BorshSerialize,
source§impl Clone for ProposalOption
impl Clone for ProposalOption
source§fn clone(&self) -> ProposalOption
fn clone(&self) -> ProposalOption
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl Debug for ProposalOption
impl Debug for ProposalOption
source§impl PartialEq for ProposalOption
impl PartialEq for ProposalOption
source§fn eq(&self, other: &ProposalOption) -> bool
fn eq(&self, other: &ProposalOption) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.impl Eq for ProposalOption
impl StructuralEq for ProposalOption
impl StructuralPartialEq for ProposalOption
Auto Trait Implementations§
impl RefUnwindSafe for ProposalOption
impl Send for ProposalOption
impl Sync for ProposalOption
impl Unpin for ProposalOption
impl UnwindSafe for ProposalOption
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
Mutably borrows from an owned value. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more