Speed improvements using hash tables

added 18.05.2020 06:53


where is the initial value set to all of , representing no key at that index [resizable].

I wrote the Forth Lisp Python Continuum (Flpc)'s self hosted compiler in stages.

However, we will avoid using too many language features so the resulting prototype could be translated more directly.

When compiled, the in-memory representation of the getter looks something like Above we're showing what the integer values in memory represent rather than the integers themselves.

I looked at other results before event considering speeding up in the first place.