Frankly, it wasn’t very exciting at all, but still we needed to lay the ground work for stuff we’ll be looking at today. In this post (and the subsequent posts in the series) we’ll make use of the Core module that we had established in Part 1.
Example 2 : Pythagoras Tree
Starting from this example, things get interesting as we need to draw things on the screen, yay!
First, we need to define our L-System:
and a couple of type aliases:
Notice that we’re going to use a linked-list as the LIFO stack to record the position and angle. Because that’s how this particular L-System work:
Next, let’s add 2 helper functions for working with the stack:
Now, before we get into the drawing part, let’s take a quick refresher on how the coordinate system works in Elm (when you’re working with a collage at least).
Here, (0, 0) is at the centre of the collage. For every object, its position is also determined by its centre point.
This coordinate system works great in some cases, but having been used to most other coordinate systems (that places (0, 0) at the top-left corner) this can take a while to get used to.
Next, let’s add another helper function that takes the current position of the path, and work out the next position based on the rotation angle (in radians) and the length of the new segment.
Next, let’s add a createSegments function that takes in:
- the starting position (at the base of the tree);
- the length of a line segment not ending in a leaf, with the assumption that line segments ending in a leaf is half as long;
- the current state of the tree
and returns a list of line segments.
The above code is a pretty literal translation of the instructions:
However, for those of you coming from F#, you might notice that I used newRotation’ when popping from the stack, but then used newRotation on the next line:
This is because shadowing is not allowed in Elm.
All that is left to do now, is to collect the line segments and put them inside a collage that covers the entire window.
As I experimented with a number of length settings it became clear that the length really needs to change along with the generations.
I thought of two approaches:
- use a simple formula to calculate the length based on a baseline value and the current generation number;
- use the same length throughout, then scale the whole tree back to fit into collage
In the end, I opted for the first approach for simplicity and for this example it works sufficiently well.
Finally, to tie everything together:
Live Demo (here)
Use LEFT and RIGHT arrow keys to evolve/devolve the L-System.
Source Code (here)
Next : Cantor Dust
I’m an AWS Serverless Hero and the author of Production-Ready Serverless. I have run production workload at scale in AWS for nearly 10 years and I have been an architect or principal engineer with a variety of industries ranging from banking, e-commerce, sports streaming to mobile gaming. I currently work as an independent consultant focused on AWS and serverless.
Here is a complete list of all my posts on serverless and AWS Lambda. In the meantime, here are a few of my most popular blog posts.
- Lambda optimization tip – enable HTTP keep-alive
- You are thinking about serverless costs all wrong
- Many faced threats to Serverless security
- We can do better than percentile latencies
- I’m afraid you’re thinking about AWS Lambda cold starts all wrong
- Yubl’s road to Serverless
- AWS Lambda – should you have few monolithic functions or many single-purposed functions?
- AWS Lambda – compare coldstart time with different languages, memory and code sizes
- Guys, we’re doing pagination wrong