Skip to main content

LSystem

Struct LSystem 

Source
pub struct LSystem {
    pub alphabet: Vec<char>,
    pub rules: HashMap<char, String>,
    pub axiom: String,
    pub angle_deg: f64,
    pub step_size: f64,
}
Expand description

A deterministic context-free L-system (D0L-system).

An L-system generates strings by parallel rewriting: at each step, every character in the current string is replaced according to the production rules simultaneously.

Fields§

§alphabet: Vec<char>

The alphabet of valid symbols.

§rules: HashMap<char, String>

Production rules mapping symbols to replacement strings.

§axiom: String

The starting string (axiom).

§angle_deg: f64

Default turning angle in degrees (for turtle interpretation).

§step_size: f64

Default step size (for turtle interpretation).

Implementations§

Source§

impl LSystem

Source

pub fn new( alphabet: Vec<char>, rules: Vec<ProductionRule>, axiom: impl Into<String>, ) -> Self

Create a new L-system.

Source

pub fn koch_curve() -> Self

Koch curve L-system (angle = 60°).

Source

pub fn sierpinski() -> Self

Sierpinski triangle L-system (angle = 120°).

Source

pub fn dragon_curve() -> Self

Dragon curve L-system (angle = 90°).

Source

pub fn plant_branching() -> Self

Plant branching L-system (angle = 25°).

Source

pub fn evolve(&self, n: usize) -> LSystemEvolution

Evolve the L-system for n generations, returning the state.

Source

pub fn interpret(&self, state: &LSystemEvolution) -> Vec<(Point2, Point2)>

Interpret a previously evolved state as turtle graphics segments.

Source

pub fn iterate(&self, n: usize) -> String

Generate the string after n iterations.

Source

pub fn iterate_length(&self, n: usize) -> usize

Count the length of the string after n iterations without building it.

Source

pub fn turtle_interpret( &self, n: usize, step_size: f64, angle_deg: f64, ) -> Vec<(Point2, Point2)>

Interpret the generated string as turtle graphics commands.

  • F, G: move forward by step_size
  • +: turn left by angle_deg degrees
  • -: turn right by angle_deg degrees
  • [: push state
  • ]: pop state

Returns a list of line segments as (start, end) pairs.

Source

pub fn add_rule(&mut self, predecessor: char, successor: impl Into<String>)

Add a production rule.

Trait Implementations§

Source§

impl Clone for LSystem

Source§

fn clone(&self) -> LSystem

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for LSystem

Source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.