Struct FibLikeRecAddPattern 

pub struct FibLikeRecAddPattern {
    pub param: String,
    pub base_k: i64,
    pub left_k: i64,
    pub right_k: i64,
}

See [crate::fib_like_tail::detect_fib_like_recursive_add] — iterative fast path for return f($p-a)+f($p-b) with a simple integer base case.

Fields

param: String

Scalar from my $p = shift (e.g. n).

base_k: i64

n <= base_k ⇒ return n.

left_k: i64

Left call uses $param - left_k.

right_k: i64

Right call uses $param - right_k.

Trait Implementations

impl Clone for FibLikeRecAddPattern

fn clone(&self) -> FibLikeRecAddPattern

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for FibLikeRecAddPattern

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

Formats the value using the given formatter.

impl PartialEq for FibLikeRecAddPattern

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

impl StructuralPartialEq for FibLikeRecAddPattern