To finish our glorious Fibonacci/Binary Tree Series, let's solve the second task of the Euler Project. Task description Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 t...
Welcome back to our "Binary Tree" week! Today we will discuss the enum function. It can be used to emulate arrays (as you might have noticed, PicoLisp doesn't have an array data type). But what do arrays have to do with binary trees...?! The enum fu...
In the previous posts, we discussed the theory of binary trees. Now we will look at at two actually useful implementations of binary trees: the cache function and the enum function. Obviously you can also use those functions without knowing anything ...
Today we will discuss an interesting function called fifo: First-In-First-Out. As always in "PicoLisp Explored", we will check the documentation and the internal representation of the data to understand what is happening. The FIFO principle The FIF...
There are things known and things unknown and in between are the DOORS … (Jim Morrison)
Welcome back! This is the last post of the 60 most common PicoLisp functions series. Today we will cover lists and strings. We will handle the topic lists quite extensively as it is one of the most important data types in PicoLisp. After that, we wil...
