haskell/haskell-unordered-containers: new spell, efficient hashing-based container types

1 files changed, 18 insertions, 0 deletions

diff --git a/haskell/haskell-unordered-containers/DETAILS b/haskell/haskell-unordered-containers/DETAILS
new file mode 100755
index 0000000000..62adc924a2
--- /dev/null
+++ b/haskell/haskell-unordered-containers/DETAILS
@@ -0,0 +1,18 @@
+           SPELL=haskell-unordered-containers
+         VERSION=0.2.3.1
+          SOURCE="unordered-containers-${VERSION}.tar.gz"
+   SOURCE_URL[0]=http://hackage.haskell.org/packages/archive/unordered-containers/${VERSION}/${SOURCE}
+     SOURCE_HASH=sha512:d145396c75d21b07dd4b9ad87275b514e589a534abcd095b71c201e47f422ce35c240ff98fb9c4ee133334e08f2dbf8ecad191d328a099f32585bc4819fe2215
+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