Struct r::callable::operators::InfixAnd

pub struct InfixAnd;

Trait Implementations

impl Builtin for InfixAnd

fn kind(&self) -> SymKind

fn is_transparent(&self) -> bool

fn is_infix(&self) -> bool

impl Callable for InfixAnd

fn call(&self, args: ExprList, stack: &mut CallStack) -> EvalResult

fn match_args( &self, args: List, stack: &mut CallStack, ) -> Result<(List, List), Signal>

fn match_arg_exprs( &self, args: ExprList, stack: &mut CallStack, ) -> Result<(List, List), Signal>

fn call_mut(&self, args: ExprList, stack: &mut CallStack) -> EvalResult

fn call_matched( &self, _args: List, _ellipsis: List, _stack: &mut CallStack, ) -> EvalResult

fn call_assign( &self, value: Expr, args: ExprList, stack: &mut CallStack, ) -> EvalResult

impl CallableClone for InfixAnd

where Self: Callable,

fn callable_clone(&self) -> Box<dyn Builtin>

impl CallableFormals for InfixAnd

fn formals(&self) -> ExprList

impl Clone for InfixAnd

fn clone(&self) -> InfixAnd

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for InfixAnd

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

Formats the value using the given formatter.

impl PartialEq for InfixAnd

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

const SYM: &'static str = "&&"

const KIND: &'static SymKind = _

impl StructuralPartialEq for InfixAnd