Struct CursorPage 

pub struct CursorPage<T> {
    pub items: Vec<T>,
    pub next_cursor: Option<String>,
}

A single page of cursor (keyset) paginated results.

Unlike Page, there is no total_items/total_pages — computing those would require a separate COUNT(*) query, which is exactly what keyset pagination avoids. All you get (and all you need to fetch the next page) is next_cursor.

Fields

items: Vec<T>

next_cursor: Option<String>

Opaque cursor to pass back for the next page. None means this is the last page.

Implementations

impl<T> CursorPage<T>

pub fn has_next(&self) -> bool

pub fn map<U>(self, f: impl FnMut(T) -> U) -> CursorPage<U>

Maps items through f, leaving next_cursor unchanged.

pub fn link_header(&self, base_url: &str, cursor_param: &str) -> Option<String>

Builds a Link header with a single rel="next" entry, adding (or overwriting) cursor_param as a query parameter on base_url. Returns None if there is no next page, or if base_url fails to parse.

Trait Implementations

impl<T: Clone> Clone for CursorPage<T>

fn clone(&self) -> CursorPage<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for CursorPage<T>

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

Formats the value using the given formatter.

impl<T: PartialEq> PartialEq for CursorPage<T>

fn eq(&self, other: &CursorPage<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: PartialEq> StructuralPartialEq for CursorPage<T>