[libtree-redblack-perl] 05/10: Mention module name in long package description

[Axel Beckert]

This is an automated email from the git hooks/post-receive script.

abe pushed a commit to branch master
in repository libtree-redblack-perl.

commit d78b09917d153a81ac2deac9aa8e6aab385d3a3d
Author: Axel Beckert <abe at deuxchevaux.org>
Date:   Sun Nov 19 20:07:48 2017 +0100

    Mention module name in long package description
---
 debian/changelog |  1 +
 debian/control   | 17 +++++++++--------
 2 files changed, 10 insertions(+), 8 deletions(-)

diff --git a/debian/changelog b/debian/changelog
index 1fa247e..d5c3e5c 100644
--- a/debian/changelog
+++ b/debian/changelog
@@ -24,6 +24,7 @@ libtree-redblack-perl (0.5-2) UNRELEASED; urgency=low
   * Bump debhelper compatibility level to 10.
     + Update versioned build-dependency on debhelper accordingly.
   * Drop dh_make comments about how to rename the file from debian/watch.
+  * Mention module name in long package description.
 
  -- gregor herrmann <gregoa at debian.org>  Sun, 16 Nov 2008 20:48:42 +0100
 
diff --git a/debian/control b/debian/control
index b16764c..2321809 100644
--- a/debian/control
+++ b/debian/control
@@ -16,14 +16,15 @@ Architecture: all
 Depends: ${misc:Depends},
          ${perl:Depends}
 Description: Perl implementation of Red/Black tree, a balanced tree
- This is a demonstration package, showing the performance differences
- between different methods of data storage and accessing. It contains
- a perl implementation of the Red/Black tree algorithm found in the
- book "Algorithms", by Cormen, Leiserson & Rivest (more commonly known
- as "CLR" or "The White Book").  A Red/Black tree is a binary tree
- which remains "balanced"- that is, the longest length from root to a
- node is at most one more than the shortest such length.  It is fairly
- efficient; no operation takes more than O(lg(n)) time.
+ Tree::RedBlack is a demonstration package, showing the performance
+ differences between different methods of data storage and
+ accessing. It contains a perl implementation of the Red/Black tree
+ algorithm found in the book "Algorithms", by Cormen, Leiserson &
+ Rivest (more commonly known as "CLR" or "The White Book").  A
+ Red/Black tree is a binary tree which remains "balanced"- that is,
+ the longest length from root to a node is at most one more than the
+ shortest such length.  It is fairly efficient; no operation takes
+ more than O(lg(n)) time.
  .
  An example perl script is contained in the documentation directory,
  which would show the different run times using hash table, linear or

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libtree-redblack-perl.git