Enum RWrapperPriority 

pub enum RWrapperPriority {
    Sidecar,
    Class,
    Function,
    TraitImpl,
    Vctrs,
}

Ordering priority for R wrapper code fragments.

Variant declaration order = output order. The order matters because R evaluates the wrapper file top-to-bottom, so dependencies must come first: sidecar accessors before class definitions, classes before functions, etc.

Variants

Sidecar

#[r_data] getters/setters — must come before class definitions.

Class

Class definitions (impl blocks: env/R6/S3/S4/S7).

Function

Standalone #[miniextendr] functions.

TraitImpl

Trait impl wrappers (impl Trait for Type).

Vctrs

Vctrs S3 method wrappers (#[derive(Vctrs)]).

Trait Implementations

impl Clone for RWrapperPriority

fn clone(&self) -> RWrapperPriority

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Eq for RWrapperPriority

#[doc(hidden)]

fn assert_fields_are_eq(&self)

🔬This is a nightly-only experimental API. (derive_eq_internals)

#[doc(hidden)]

fn assert_receiver_is_total_eq(&self)

👎Deprecated since 1.95.0:

implementation detail of #[derive(Eq)]

impl Ord for RWrapperPriority

fn cmp(&self, other: &RWrapperPriority) -> 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 RWrapperPriority

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

fn partial_cmp(&self, other: &RWrapperPriority) -> 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.

#[doc(hidden)]

fn __chaining_lt(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

If self == other, returns ControlFlow::Continue(()). Otherwise, returns ControlFlow::Break(self < other).

#[doc(hidden)]

fn __chaining_le(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

Same as __chaining_lt, but for <= instead of <.

#[doc(hidden)]

fn __chaining_gt(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

Same as __chaining_lt, but for > instead of <.

#[doc(hidden)]

fn __chaining_ge(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

Same as __chaining_lt, but for >= instead of <.

impl Copy for RWrapperPriority

impl StructuralPartialEq for RWrapperPriority

impl TrivialClone for RWrapperPriority

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 1 byte

Size for each variant:

• Sidecar: 0 bytes
• Class: 0 bytes
• Function: 0 bytes
• TraitImpl: 0 bytes
• Vctrs: 0 bytes