[4.0] a1a10e0 Clear up hash algorithms. Critbit is teh shit.

[Per Buer]

commit a1a10e0790f9ffb2aa859e76f6f4d1c7670ef33c
Author: Per Buer <perbu at varnish-software.com>
Date:   Tue Mar 25 12:56:21 2014 +0100

    Clear up hash algorithms.
    Critbit is teh shit.

diff --git a/doc/sphinx/reference/varnishd.rst b/doc/sphinx/reference/varnishd.rst
index 506e2e2..975fa14 100644
--- a/doc/sphinx/reference/varnishd.rst
+++ b/doc/sphinx/reference/varnishd.rst
@@ -145,20 +145,22 @@ Hash Algorithms
 
 The following hash algorithms are available:
 
+critbit 
+   A self-scaling tree structure. The default hash algorithm in
+    Varnish Cache 2.1 and onwards. In comparison to a more traditional
+    B tree the critbit tree is almost completely lockless. Do not 
+    change this unless you are certain what you're doing.
+
 simple_list
     A simple doubly-linked list.  Not recommended for production use.
 
 classic[,buckets]
-    A standard hash table.  This is the default.  The hash key is the
-    CRC32 of the object's URL modulo the size of the hash table.  Each
-    table entry points to a list of elements which share the same hash
-    key. The buckets parameter specifies the number of entries in the
-    hash table.  The default is 16383.
-
-critbit
-    A self-scaling tree structure. The default hash algorithm in 2.1. In
-    comparison to a more traditional B tree the critbit tree is almost
-    completely lockless.
+    A standard hash table. The hash key is the CRC32 of the object's
+    URL modulo the size of the hash table.  Each table entry points to
+    a list of elements which share the same hash key. The buckets
+    parameter specifies the number of entries in the hash table.  The
+    default is 16383.
+
 
 Storage Types
 -------------