Chuck Moore on stack size, stack operators and function arguments

[John Keith]

(11-09-2024 11:31 AM)c3d Wrote:  As far as I know, all existing RPL implementations do a simple linear search, so the cost is O(n) where n is the number of variables to search.
...

This means that on DB48x, local names are significantly faster than local names, and should be used whenever you can.

Thanks, that was very informative, and leads me to another question: Would it be possible to encode global names with a hash table, binary tree or similar data structure with O(log2(n)) access time? And going further, would it be practical to add a set or dictionary data type to RPL?

Also I thank you for your work on this inspiring project. I was sad when Claudio discontinued work on NewRPL and DB48X gives me new hope. I am also hoping for Swiss Micros or others to make a hardware platform with a keyboard more suitable for an RPL calculator. In the mean time an Android emulator would be nice.

BTW, I assume that in the quoted text you meant "global names are significantly faster than local names".