Scans your site and returns information about your SSL implementation and certificate. Helpful for debugging and validating your SSL configuration.

One of a set of tools we are providing to everyone as a way of saying thank you for being a part of the community.

It just occured to me that "evenly spaced" and "random" are probably both attempts to express the same thought, for which I can't seem to come up with a good word. Maybe more internet acronyms would help ;-)

Also note that there are generally two different kinds of hash schemes - closed and open. In closed schemes, if there is a collision, you march ahead in the table and find an open spot. This means that (a) you cannot have more inputs than the size of the table (hence closed), and (b) you degenerate into doing key compares as you march through the table. In open schemes, there is the possibility for a sub-container at every node (e.g. a list, tree, array, whatever) so that collisions generate multiple entries at that node. This removes the limit to the number of items stored, but, again, you have to go back to doing key compares to resolve the collision.

Despite the complexity, hash tables do, in practice, operate much faster than balanced trees on appropriate sized tables. Consider the case of 1024 items - with a balanced tree, you will end up doing 10 compares; in a hash table (if you're lucky), you might get your "hit" with a hash calculation and a single indexed lookup. Conversely, the worse case goes way up (e.g. your hash algorithm, for some reason, puts all of your items into two slots, and the sub-container is linear, so you do 512 key compares to find the hit).

I seem to be babbling now, so I'll sign this one off.