Struct KeysetPlan 

pub struct KeysetPlan<'a> {
    pub cursor: &'a Cursor,
    pub sort: SortDirection,
    pub query_sort: SortDirection,
}

How a request carrying a cursor is executed.

Keyset pagination selects the rows on the far side of the cursor and takes the nearest per_page of them. For an After cursor that is the natural sort order. For a Before cursor the query runs in the reversed order so that LIMIT picks the rows closest to the cursor, and the page is flipped back into the caller’s order afterwards (see PaginatorResponseMeta::from_cursor_page).

Fields

cursor: &'a Cursor

sort: SortDirection

The order the caller wants rows in: sort_direction, ascending by default.

query_sort: SortDirection

The order to put in the query. Equal to sort for After cursors and reversed for Before cursors.

Implementations

impl<'a> KeysetPlan<'a>

pub fn field(&self) -> &'a str

pub fn value(&self) -> &'a CursorValue

pub fn operator(&self) -> &'static str

The comparison that selects rows on the far side of the cursor in query order: > when the query sorts ascending, < when descending.

pub fn reverse_rows(&self) -> bool

Whether the fetched rows must be reversed to restore the caller’s order.

Trait Implementations

impl<'a> Clone for KeysetPlan<'a>

fn clone(&self) -> KeysetPlan<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for KeysetPlan<'a>

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

Formats the value using the given formatter.

impl<'a> PartialEq for KeysetPlan<'a>

fn eq(&self, other: &KeysetPlan<'a>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<'a> StructuralPartialEq for KeysetPlan<'a>