search

nlfiedler / bakeneko

Scheme R7RS interpreter in Go
BSD 3-Clause "New" or "Revised" License
2 stars 0 forks source link

Use an efficient data structure for property lists #2

Closed nlfiedler closed 10 years ago

nlfiedler commented 11 years ago

In the Scheme interpreter, need to replace the use of hash tables with something more appropriate to Scheme (i.e. space efficient for small numbers of properties), such as a left-leaning red-black tree. That's just one idea, there are many more in Steve Yegge's essay "The Universal Design Pattern" [1], such as linked lists that morph into hash tables when a threshold is crossed.

Additionally, this [2] came up on HackerNews recently.

[1] http://steve-yegge.blogspot.com/2008/10/universal-design-pattern.html [2] http://www.soi.city.ac.uk/~ross/papers/FingerTree.pdf

nlfiedler commented 11 years ago

Doing this now by incorporating petar/GoLLRB in the interpreter.

nlfiedler commented 10 years ago

Introduction of GoLLRB usage has been committed, closing this.