Struct CteSearch 

pub struct CteSearch {
    pub order: SearchOrder,
    pub columns: Vec<Cow<'static, str>>,
    pub set: Cow<'static, str>,
}

SEARCH { BREADTH | DEPTH } FIRST BY <cols> SET <col>

PostgreSQL rewrites a recursive CTE with this into one that carries an ordering column, so the column list decides whether the clause exists at all.

Fields

order: SearchOrder

Breadth-first or depth-first.

columns: Vec<Cow<'static, str>>

The columns that identify a row, quoted.

set: Cow<'static, str>

The name of the ordering column to add, quoted.

Implementations

impl CteSearch

pub fn new( order: SearchOrder, columns: impl IntoIterator<Item = impl Into<Cow<'static, str>>>, set: impl Into<Cow<'static, str>>, ) -> Self

A search clause over columns, adding set.

pub fn is_empty(&self) -> bool

Whether the clause is absent.

Trait Implementations

impl Clone for CteSearch

fn clone(&self) -> CteSearch

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CteSearch

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

Formats the value using the given formatter.

impl Default for CteSearch

fn default() -> CteSearch

Returns the “default value” for a type.

impl Expression for CteSearch

fn write_sql(&self, w: &mut SqlWriter<'_>)

Append this fragment to w.