/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

www.philipotoole.com
| | attractivechaos.wordpress.com

Array and hash table are probably the most important data structures. Some programming languages such as Perl, Lua and Javascript, almost build the language core on top of the two data structures. While array is straightforward to implement, hash table is not. This is why we have paid continuous efforts in improving the hash table...
12.9 parsecs

Travel
| |
| | www.layer9.org

Group blog for the computer networking and systems research community.
21.6 parsecs

Travel
| |
| | ncona.com

Hash tables are a very important data structure that can be used for many things. They are really fast so they are a good fit for almost anything where they can be used. One example of when a hash table is useful is an associative array, for example: 1 2 3 4 5 var a = {}; a['hello'] = 'hola'; a['bye'] = 'adios'; console.log(a['hello']); // Prints hola The beauty of hash tables is that searching for the value of a['hello'] (ideally)takes the same time no matter how many values the associative array has. I...
9.5 parsecs

Travel
| |
| | attractivechaos.wordpress.com

As a Perl programmer, I enjoy a lot using hash tables. I keep this habit in C/C++ programming. Then what C/C++ hash libraries are available? How are they compared to each other? In this post, I will give a brief review of hash libraries and present a small benchmark showing their practical performance. Hash table...
51.1 parsecs

Travel
|