Struct IfsTable 

pub struct IfsTable {
    pub maps: [IfsMap; 4],
}

A curated figure, fully resolved: four maps in canonical order — index 0 the trunk or dominant map, 1 the main body, 2 the left branch, 3 the right branch.

The order is load-bearing and nothing enforces it. Phase 3 pairs maps by index when it morphs one figure into another, so a table authored with its trunk at index 2 morphs that trunk into its partner’s left branch and every intermediate figure is ugly. This is a comment-and-review property; the authored tables below each name their four roles.

Fields

maps: [IfsMap; 4]

The four maps, in canonical order.

Implementations

impl IfsTable

pub fn sigma_max(&self) -> f32

The largest operator norm in the table — below 1 exactly when the whole system converges.

Trait Implementations

impl Clone for IfsTable

fn clone(&self) -> IfsTable

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IfsTable

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

Formats the value using the given formatter.

impl PartialEq for IfsTable

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

impl StructuralPartialEq for IfsTable