Struct TableCursor 

pub struct TableCursor<'p> { /* private fields */ }

A cursor over a table b-tree, iterating rows in ascending rowid order.

Implementations

impl<'p> TableCursor<'p>

pub fn new(pager: &'p dyn PageSource, root: u32) -> TableCursor<'p>

Create a cursor over the table b-tree rooted at page root. The cursor is unpositioned until first or seek.

pub fn last(&mut self) -> Result<bool>

Position at the last (highest-rowid) row. Returns false if empty. Useful for finding the next auto-assigned rowid in O(height).

pub fn first(&mut self) -> Result<bool>

Position at the first (lowest-rowid) row. Returns false if the table is empty.

pub fn is_valid(&self) -> bool

Whether the cursor currently points at a valid row.

pub fn rowid(&self) -> Result<i64>

The rowid at the cursor.

pub fn payload(&self) -> Result<Vec<u8>>

The full row record (payload) at the cursor.

pub fn next(&mut self) -> Result<bool>

Advance to the next row. Returns false when the cursor moves past the last row.

pub fn seek(&mut self, target: i64) -> Result<bool>

Seek to target rowid, positioning at the smallest rowid >= target. Returns true if an exact match exists.