Hashbelts Live On!
William Grosso @ May 9, 2006
A little over four years ago, I wrote a series of articles deriving and describing a new datastructure (and associated algorithm) which I called a Hashbelt. Hashbelts have many nice properties. For one thing, they're easy to implement in almost any modern language. For another, they've also got some performance characteristics which make them close [...]
Filed under: Career, Java, Oldies but Goodies | Share on Facebook | Comments (0)