Struct ListProposalsInput

#[non_exhaustive]
pub struct ListProposalsInput {
    pub network_id: Option<String>,
    pub max_results: Option<i32>,
    pub next_token: Option<String>,
}

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

network_id: Option<String>

The unique identifier of the network.

max_results: Option<i32>

The maximum number of proposals to return.

next_token: Option<String>

The pagination token that indicates the next set of results to retrieve.

Implementations

impl ListProposalsInput

pub fn network_id(&self) -> Option<&str>

The unique identifier of the network.

pub fn max_results(&self) -> Option<i32>

The maximum number of proposals to return.

pub fn next_token(&self) -> Option<&str>

The pagination token that indicates the next set of results to retrieve.

impl ListProposalsInput

pub fn builder() -> ListProposalsInputBuilder

Creates a new builder-style object to manufacture ListProposalsInput.

Trait Implementations

impl Clone for ListProposalsInput

fn clone(&self) -> ListProposalsInput

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ListProposalsInput

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

Formats the value using the given formatter.

impl PartialEq for ListProposalsInput

fn eq(&self, other: &ListProposalsInput) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for ListProposalsInput