26. August 2013
A NavigableMap inspired class for PHP
Java has a nifty class named NavigableMap. It abstracts away some of the logic for mapping ranges to values. Java is reknowned for it’s ridiculously large library of collections.
16. August 2013
A Bloom Filter in c#
A bloom filter is a probabilistic data structure meant for checking whether a given entry does not occur in a list. It is meant to be quite fast, and is used as a way of not doing costly queries when it can be determined that no results will be returned. E.g., if you could turn this:
costly_lookup(key)Into this:
if (!cheap_check_that_key_isnt_there()) {
costly_lookup()
}Then that’s a win.
13. August 2013
Skip List Implementation in PHP
A skip list is similar to a linked list, but it is always sorted and maintains multiple pointers. The multiple pointers allow fast traversal of the list so that you can quickly look for elements, essentially performing a binary search on the data.