summaryrefslogtreecommitdiffstats
path: root/haskell/haskell-unordered-containers/DETAILS
blob: 6c9b1fba1679c1c6ab6484c0136b18c8c5353aac (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
           SPELL=haskell-unordered-containers
         VERSION=0.2.10.0
          SOURCE="unordered-containers-${VERSION}.tar.gz"
   SOURCE_URL[0]=https://hackage.haskell.org/package/${SOURCE%.tar.*}/${SOURCE}
     SOURCE_HASH=sha512:450e5e839e0092b2476a0abfc3eb2f45fba634a9e782cddf25b3db3730d16dd2e65673f46678ab4ad23be71525ae5f72888b89b03402cb70e20fc33feb765766
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