Struct ChunkPosition 

pub struct ChunkPosition {
    pub index: u32,
    pub count: u32,
}

Where one record sits in the run of records that together carry a message too large for one RPC record: its index, from 0, and the run’s length. Every record of a run carries the same count, each index in [0, count) is sent exactly once, and a run always has at least one record, so an empty message is a run of one empty record. The sender may issue a run’s calls concurrently and over several connections, so its records can arrive in any order, and the runs of several messages can be in flight at once; the driver’s ChunkRunAssembler puts them back together.

Fields

index: u32

The record’s index in its run, from 0.

count: u32

The number of records in the run; at least 1.

Implementations

impl ChunkPosition

pub const fn new(index: u32, count: u32) -> Self

The position of record index in a run of count records.

Trait Implementations

impl Clone for ChunkPosition

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for ChunkPosition

impl Debug for ChunkPosition

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

Formats the value using the given formatter.

impl Eq for ChunkPosition

impl Hash for ChunkPosition

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for ChunkPosition

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for ChunkPosition