summaryrefslogtreecommitdiff
path: root/p/haskell-unordered-containers
diff options
context:
space:
mode:
authorJoachim Breitner <mail@joachim-breitner.de>2013-05-26 01:43:30 +0400
committerJoachim Breitner <mail@joachim-breitner.de>2013-05-26 01:43:30 +0400
commit65d0cadaa4851a0a243ca97f3178c1c8d654686b (patch)
tree49a5e114f4d24679e20176469af637f517c85d01 /p/haskell-unordered-containers
parent821037aea159b5fbb672fb0fdc48acaec78c9d36 (diff)
downloadDHG_packages-65d0cadaa4851a0a243ca97f3178c1c8d654686b.tar.gz
haskell-unordered-containers: Move Haskell blurb to the end of the description, reduces the impact of #708703
Diffstat (limited to 'p/haskell-unordered-containers')
-rw-r--r--p/haskell-unordered-containers/debian/changelog7
-rw-r--r--p/haskell-unordered-containers/debian/control12
2 files changed, 13 insertions, 6 deletions
diff --git a/p/haskell-unordered-containers/debian/changelog b/p/haskell-unordered-containers/debian/changelog
index 9086f052a..bd08f9828 100644
--- a/p/haskell-unordered-containers/debian/changelog
+++ b/p/haskell-unordered-containers/debian/changelog
@@ -1,3 +1,10 @@
+haskell-unordered-containers (0.2.3.0-3) UNRELEASED; urgency=low
+
+ * Move Haskell blurb to the end of the description, reduces the impact
+ of #708703
+
+ -- Joachim Breitner <nomeata@debian.org> Sat, 25 May 2013 23:43:30 +0200
+
haskell-unordered-containers (0.2.3.0-2) unstable; urgency=low
* Enable compat level 9
diff --git a/p/haskell-unordered-containers/debian/control b/p/haskell-unordered-containers/debian/control
index 1c3b21b8b..a70644ba0 100644
--- a/p/haskell-unordered-containers/debian/control
+++ b/p/haskell-unordered-containers/debian/control
@@ -32,14 +32,14 @@ Recommends: ${haskell:Recommends}
Suggests: ${haskell:Suggests}
Provides: ${haskell:Provides}
Description: Efficient hashing-based container types${haskell:ShortBlurb}
- ${haskell:Blurb}
- .
It contains 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.
+ .
+ ${haskell:Blurb}
Package: libghc-unordered-containers-prof
Architecture: any
@@ -49,14 +49,14 @@ Recommends: ${haskell:Recommends}
Suggests: ${haskell:Suggests}
Provides: ${haskell:Provides}
Description: Efficient hashing-based container types${haskell:ShortBlurb}
- ${haskell:Blurb}
- .
It contains 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.
+ .
+ ${haskell:Blurb}
Package: libghc-unordered-containers-doc
Section: doc
@@ -65,11 +65,11 @@ Depends: ${misc:Depends}, ${haskell:Depends}
Recommends: ${haskell:Recommends}
Suggests: ${haskell:Suggests}
Description: Efficient hashing-based container types${haskell:ShortBlurb}
- ${haskell:Blurb}
- .
It contains 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.
+ .
+ ${haskell:Blurb}