Struct LimitIterator 

pub struct LimitIterator<I: RowIterator> { /* private fields */ }

Iterator that applies LIMIT and OFFSET constraints.

This iterator skips the first offset rows and yields at most limit rows. It provides early termination - once the limit is reached, no more rows are requested from the input.

With tie_keys (FETCH … WITH TIES, issue #152) the iterator keeps yielding rows past the limit while their ORDER BY sort key compares equal to the final counted row’s key. Rows discarded by OFFSET never revive, even when they are peers of the boundary row.

Implementations

impl<I: RowIterator> LimitIterator<I>

pub fn new(input: I, limit: Option<u64>, offset: Option<u64>) -> Self

Creates a new limit iterator with the given LIMIT and OFFSET.

pub fn with_ties( input: I, limit: Option<u64>, offset: Option<u64>, tie_keys: Vec<SortExpr>, ) -> Self

Creates a limit iterator that keeps boundary peers (FETCH … WITH TIES).

tie_keys must be the sort expressions of the input ordering; an empty vector degrades to plain LIMIT/OFFSET semantics.

Trait Implementations

impl<I: RowIterator> RowIterator for LimitIterator<I>

fn next_row(&mut self) -> Option<Result<Row>>

Advances the iterator and returns the next row, or None if exhausted.

fn schema(&self) -> &[ColumnMetadata]

Returns the schema of rows produced by this iterator.