Struct LaneTable 

pub struct LaneTable { /* private fields */ }

The lanes of one laned state: which are taken, and which of them a turn seats.

Plain data. Taking a lane does not touch the state’s buffers, and clearing what a stream left in a lane it gave up is the table’s caller’s, since it writes the state – device memory for a state on a GPU – and must run where the state lives. So a lane handed to a new stream carries the previous one’s history until that caller resets it.

Implementations

impl LaneTable

pub fn new(max_lanes: usize) -> TractResult<LaneTable>

pub fn max_lanes(&self) -> usize

The extent of the lane axis of the state’s per-lane buffers, fixed for the life of the state.

pub fn taken(&self) -> usize

pub fn take(&mut self) -> Option<LaneId>

The lowest free lane, None when every lane is taken – whether that blocks the new stream or fails it is the caller’s policy. Lowest first, so that a turn seating every lane seats a run of consecutive lanes.

pub fn give_back(&mut self, lane: LaneId) -> TractResult<()>

Hand lane back, for LaneTable::take to give to another stream.

pub fn is_taken(&self, lane: LaneId) -> bool

pub fn seat( &self, lanes: impl IntoIterator<Item = LaneId>, ) -> TractResult<Seating>

Seat lanes, in that order: seat ix of the coming turn carries the ixth of them. Every one must be taken, so that a stream which ended can not be seated by a stale handle of it.

Trait Implementations

impl Clone for LaneTable

fn clone(&self) -> LaneTable

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LaneTable

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

Formats the value using the given formatter.

impl Eq for LaneTable

impl PartialEq for LaneTable

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for LaneTable