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

Show
Ignore:
Timestamp:
03/19/13 00:05:51 (18 months ago)
Author:
tibbe (IP: 207.198.105.20)
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • Proposals/unordered-containers

    v1 v2  
    2525The '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. 
    2626 
    27 Documentation and tarball from the hackage page: 
     27Documentation and tarballs from Hackage: 
    2828 
    29   http://hackage.haskell.org/package/unordered-containers 
    30   http://hackage.haskell.org/package/hashable 
     29 * http://hackage.haskell.org/package/unordered-containers 
     30 * http://hackage.haskell.org/package/hashable 
    3131 
    32 Development repo: 
     32Development repos: 
    3333 
    34   https://github.com/tibbel/unordered-containers 
    35   https://github.com/tibbel/hashable 
     34 * https://github.com/tibbel/unordered-containers 
     35 * https://github.com/tibbel/hashable 
    3636 
    3737 
     
    7272 
    7373{{{ 
    74 empty 
    75     :: (k -> Int)  -- ^ hash function 
    76     -> (k -> k -> Bool)  -- ^ equality test 
    77     -> HashMap k v 
     74empty :: (k -> Int)  -- ^ hash function 
     75      -> (k -> k -> Bool)  -- ^ equality test 
     76      -> HashMap k v 
    7877}}} 
    7978