Hi Lindsay,
> implementation; from the performance benefit point of view. At least for
> the two tables I cared most about.. multiplication and division. An idx,
> while impressively fast, comes nowhere near native multiplication.
True
> In the meantime I thought I would share the code below fo
For a much faster solution than the idx mechanism, look at this:
http://www.mail-archive.com/picolisp@software-lab.de/msg05199.html
It would be nice if Picolisp had this generic fastNth function,
in order to solve this kind of lookup accesses.
Enrique.
>
> For a much faster solution than the idx mechanism, look at this:
> http://www.mail-archive.com/picolisp@software-lab.de/msg05199.html
>
> This is a very interesting idea. Thanks for pointing it out. Is there a
formal name for the algorithm?
For some more general purpose data structures I am wor
Hello Karl-Heinz Kreis :-)
You are now subscribed
--
UNSUBSCRIBE: mailto:picolisp@software-lab.de?subject=Unsubscribe
Hi Lindsay,
I like a lot what you are doing with fixed point scaling and lookup tables.
It reminds me of programming in the Forth language, years ago.
The formal name of the algorithm coded in the fastNth primitive is Digital
Tree Searching, a special case of Radix Searching.
The algorithm is th
