Struct ListCrawlersInput 

#[non_exhaustive]
pub struct ListCrawlersInput {
    pub max_results: Option<i32>,
    pub next_token: Option<String>,
    pub tags: Option<HashMap<String, 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.

max_results: Option<i32>

The maximum size of a list to return.

next_token: Option<String>

A continuation token, if this is a continuation request.

tags: Option<HashMap<String, String>>

Specifies to return only these tagged resources.

Implementations

impl ListCrawlersInput

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

The maximum size of a list to return.

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

A continuation token, if this is a continuation request.

pub fn tags(&self) -> Option<&HashMap<String, String>>

Specifies to return only these tagged resources.

impl ListCrawlersInput

pub fn builder() -> ListCrawlersInputBuilder

Creates a new builder-style object to manufacture ListCrawlersInput.

Trait Implementations

impl Clone for ListCrawlersInput

fn clone(&self) -> ListCrawlersInput

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ListCrawlersInput

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

Formats the value using the given formatter.

impl PartialEq for ListCrawlersInput

fn eq(&self, other: &ListCrawlersInput) -> 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 ListCrawlersInput