summaryrefslogblamecommitdiffstats
path: root/haskell/haskell-unordered-containers/DETAILS
blob: ab7f6525662055a8e419460565b07dfe35e0054c (plain) (tree)
1
2
3
4
5
                                             
                        

                                                                                                      
                                                                                                                                                        












                                                                                
           SPELL=haskell-unordered-containers
         VERSION=0.2.9.0
          SOURCE="unordered-containers-${VERSION}.tar.gz"
   SOURCE_URL[0]=http://hackage.haskell.org/packages/archive/unordered-containers/${VERSION}/${SOURCE}
     SOURCE_HASH=sha512:d9fb6d173f7d07494cffeffa74d3827e4011957be7f309e9f9c16d484b46d04824a21269185d340b09d65d386d19fd5f6b78a51036a5292e5d33e29819fd225a
SOURCE_DIRECTORY="${BUILD_DIRECTORY}/unordered-containers-${VERSION}"
        WEB_SITE="Homepage:       https://github.com/tibbe/unordered-containers"
      LICENSE[0]=BSD3
         ENTERED=20130829
           SHORT="Efficient hashing-based container types"
cat << EOF
Efficient hashing-based container types.  The containers have been optimized
for performance critical use, both in terms of large data quantities and
high speed.

The declared cost of each operation is either worst-case or amortized,
but remains valid even if structures are shared.
EOF