Enum RteKind 

#[repr(i32)]
pub enum RteKind {
    RtekindUndefined = 0,
    RteRelation = 1,
    RteSubquery = 2,
    RteJoin = 3,
    RteFunction = 4,
    RteTablefunc = 5,
    RteValues = 6,
    RteCte = 7,
    RteNamedtuplestore = 8,
    RteResult = 9,
}

Variants

RtekindUndefined = 0

RteRelation = 1

RteSubquery = 2

RteJoin = 3

RteFunction = 4

RteTablefunc = 5

RteValues = 6

RteCte = 7

RteNamedtuplestore = 8

RteResult = 9

Implementations

impl RteKind

pub fn is_valid(value: i32) -> bool

Returns true if value is a variant of RteKind.

pub fn from_i32(value: i32) -> Option<RteKind>

Converts an i32 to a RteKind, or None if value is not a valid variant.

Trait Implementations

impl Clone for RteKind

fn clone(&self) -> RteKind

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RteKind

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

Formats the value using the given formatter.

impl Default for RteKind

fn default() -> RteKind

Returns the “default value” for a type.

impl From<RteKind> for i32

fn from(value: RteKind) -> i32

Converts to this type from the input type.

impl Hash for RteKind

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for RteKind

fn cmp(&self, other: &RteKind) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for RteKind

fn eq(&self, other: &RteKind) -> 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 PartialOrd for RteKind

fn partial_cmp(&self, other: &RteKind) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Copy for RteKind

impl Eq for RteKind

impl StructuralPartialEq for RteKind