Changes between Version 1 and Version 2 of Proposals/unordered-containers

Timestamp:

03/19/13 00:05:51 (2 months ago)

Author:

tibbe (IP: 207.198.105.20)

Comment:

--

Proposals/unordered-containers

@@ -25 +25 @@
 The 'unordered-containers' package implements hashing-based containers that trade some functionality (lack of ordering) for speed. The 'hashable' package provides a type class that, like Ord, is implemented by all types that can be used as keys in these containers.
 
-Documentation and tarball from the hackage page:
+Documentation and tarballs from Hackage:
 
-  http://hackage.haskell.org/package/unordered-containers
-  http://hackage.haskell.org/package/hashable
+ * http://hackage.haskell.org/package/unordered-containers
+ * http://hackage.haskell.org/package/hashable
 
-Development repo:
+Development repos:
 
-  https://github.com/tibbel/unordered-containers
-  https://github.com/tibbel/hashable
+ * https://github.com/tibbel/unordered-containers
+ * https://github.com/tibbel/hashable
 
 
@@ -72 +72 @@
 
 {{{
-empty
-    :: (k -> Int)  -- ^ hash function
-    -> (k -> k -> Bool)  -- ^ equality test
-    -> HashMap k v
+empty :: (k -> Int)  -- ^ hash function
+      -> (k -> k -> Bool)  -- ^ equality test
+      -> HashMap k v
 }}}