Struct RecursiveQueue 

pub struct RecursiveQueue {
    pub order_by: Vec<BoundOrderTerm>,
    pub limit: Option<BoundExpr>,
    pub offset: Option<BoundExpr>,
}

What a recursive CTE’s own ORDER BY, LIMIT and OFFSET mean to the loop that fills it.

The ORDER BY decides which queued row is taken next, so ORDER BY depth DESC walks depth first, and the LIMIT stops the recursion once that many rows have been produced after the OFFSET.

Fields

order_by: Vec<BoundOrderTerm>

The terms that order the queue; empty for first in, first out.

limit: Option<BoundExpr>

The LIMIT.

offset: Option<BoundExpr>

The OFFSET.

Trait Implementations

impl Clone for RecursiveQueue

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RecursiveQueue

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

Formats the value using the given formatter.

impl PartialEq for RecursiveQueue

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for RecursiveQueue