Dear List and Pilcon Participants,
I'm adding here the points that I feel will complete the recap given
earlier by Olaf.
Kindly take notice and correct me incase of any error.
1. Database not required for learners. Lists and symbols are sufficient. As
per Alex, symbols are higher level concept t
Ok, I managed to turn on the optimization (opt -O3) and the results improved
*** recursive
-- picolisp 3.007 sec
-- pil21 4.249 sec
*** iterative
-- picolisp 0.515 sec
-- pil21 0.368 sec
Apparently with the optimization cache does not segfault...
Cheers,
Davide
On Fri, Sep 4, 2020, 22:50 David
Hi all,
I compiled pil21 with llvm on termux and then I ran some simple fibonacci
benchmark. Here the results
*** recursive
n 37 fib 24157817
-- picolisp 3.013 sec
-- pil21 5.332 sec
-- python 21.247 sec
*** iterative
n 8 fib 4589178984+
-- picolisp 0.518 sec
-- pil21 0.409 sec
-- python 0.1
Hi Olaf,
Thanks for this recap, this is very nice indeed!
I would like to add the hand-made block diagram by Alex for his
documentation, very cool! Maybe we can call it pilDiagram and make it as
official diagram for PicoLisp? Lets see :)
Hi Alex,
Thank you once again for sharing your time and
Hi Olaf,
> I like to recap some topics/items, perhaps others can also enjoy
> (disclaimer: there may be misunderstandings or faults in the notes!)
Thanks a lot! This is a very good idea!
And all correct I think.
☺/ A!ex
--
UNSUBSCRIBE: mailto:picolisp@software-lab.de?subject=Unsubscribe
Thank you Alex and all other participants
(and not at least thanks to beneroth (typed correctly?) providing the
space, where we could meet)
again for this nice PilCon Session.
I like to recap some topics/items, perhaps others can also enjoy
(disclaimer: there may be misunderstandings or faults i
