Skip to main content

PollPlan

Struct PollPlan 

Source
pub struct PollPlan {
    pub max_polls: u32,
    pub poll_interval: Duration,
    pub partition_concurrency: usize,
    pub row_cap: Option<usize>,
}
Expand description

How a 202 handle is polled: how many times, and how long to wait between GETs.

Fields§

§max_polls: u32

Maximum number of poll GETs before LifecycleErrorCode::PollQuotaExhausted.

§poll_interval: Duration

Wall-clock delay the async driver waits between successive poll GETs on a still-running (202) handle. The pure machine carries this as data only; the crate::driver performs the cancel-aware sleep. The transport only backs off on retryable statuses (429/5xx); a 202 returns immediately, so without this interval the poll loop would spin with no gap.

§partition_concurrency: usize

How many non-inline partitions the driver fetches concurrently once a result set completes (a window; assembly stays in partition order).

§row_cap: Option<usize>

Stop fetching further partitions once at least this many rows are assembled. The statement then completes early and reports itself partial (CompletedStatement::is_partial).

Implementations§

Source§

impl PollPlan

Source

pub fn with_max_polls(max_polls: u32) -> Self

A plan with an explicit poll ceiling (clamped to at least 1), keeping the default inter-poll interval.

Source

pub fn with_poll_interval(self, poll_interval: Duration) -> Self

Set the inter-poll wait, clamped to MIN_POLL_INTERVAL so the 202 poll loop can never become a tight spin.

Source

pub fn effective_poll_interval(&self) -> Duration

The effective inter-poll wait, never below MIN_POLL_INTERVAL even if the public field was set directly.

Source

pub fn with_partition_concurrency(self, concurrency: usize) -> Self

Set the partition fetch window, clamped to 1..=MAX_PARTITION_CONCURRENCY.

Source

pub fn with_row_cap(self, row_cap: Option<usize>) -> Self

Stop fetching partitions once row_cap rows are assembled (None fetches every partition).

Source

pub fn effective_partition_concurrency(&self) -> usize

The effective window size, never zero even if the field was set directly.

Trait Implementations§

Source§

impl Clone for PollPlan

Source§

fn clone(&self) -> Self

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Copy for PollPlan

Source§

impl Debug for PollPlan

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Default for PollPlan

Source§

fn default() -> Self

Returns the “default value” for a type. Read more
Source§

impl Eq for PollPlan

Source§

impl PartialEq for PollPlan

Source§

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

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

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

Inequality operator !=. Read more
Source§

impl StructuralPartialEq for PollPlan

Auto Trait Implementations§

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<'a, T, E> AsTaggedExplicit<'a, E> for T
where T: 'a,

Source§

fn explicit(self, class: Class, tag: u32) -> TaggedParser<'a, Explicit, Self, E>

Source§

impl<'a, T, E> AsTaggedImplicit<'a, E> for T
where T: 'a,

Source§

fn implicit( self, class: Class, constructed: bool, tag: u32, ) -> TaggedParser<'a, Implicit, Self, E>

Source§

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

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

Mutably borrows from an owned value. Read more
Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, _span: NoopSpan) -> Self

Instruments this future with a span (no-op when disabled).
Source§

fn in_current_span(self) -> Self

Instruments this future with the current span (no-op when disabled).
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V