Update documentation with link to blog post.

src/bk/mod.rs

@@ -12,6 +12,8 @@
 /// Many of these algorithms are super complex, so it is important that they're throughoutly
 /// commented and documented to make sure the code is readable in the future.
 ///
+/// I've described some of the optimizations I use [here](http://ticki.github.io/blog/skip-lists-done-right/).
+///
 ///     /------------------------------------------\
 ///     | Welcome to the dark corner of `ralloc`,  |
 ///     | have fun, and may the red ox be with you |

src/bk/pool.rs

@@ -23,10 +23,10 @@ impl Pool {
     /// # Example
     ///
     /// If we look for 8, we start in the top level and follow until we hit 9.
-    ///     # ~~~~~~~~~~~~~~~~~~> [6] --- overshoot ----> [9] -----------> NIL
-    ///     # ------------------> [6] ~~> [7] ----------> [9] -----------> NIL
-    ///     # ----------> [5] --> [6] ~~> [7] ----------> [9] --> [10] --> NIL
-    ///     # --> [1] --> [5] --> [6] --> [7] ~~> [8] --> [9] --> [10] --> NIL
+    ///     ==================> [6] --- overshoot ----> [9] -----------> NIL
+    ///     ------------------> [6] ==> [7] ----------> [9] -----------> NIL
+    ///     ----------> [5] --> [6] ==> [7] ----------> [9] --> [10] --> NIL
+    ///     --> [1] --> [5] --> [6] --> [7] ==> [8] --> [9] --> [10] --> NIL
     fn search(&mut self, block: &Block) -> Seek {
         log!(DEBUG, "Searching the block pool for block {:?}...", block);