Your message dated Tue, 21 Jun 2016 10:21:33 +0000 with message-id <[email protected]> and subject line Bug#235380: fixed in libavl 0.3.5-4 has caused the Debian Bug report #235380, regarding libavl-dev: no man pages [patch] to be marked as done.
This means that you claim that the problem has been dealt with. If this is not the case it is now your responsibility to reopen the Bug report if necessary, and/or fix the problem forthwith. (NB: If you are a system administrator and have no idea what this message is talking about, this may indicate a serious mail system misconfiguration somewhere. Please contact [email protected] immediately.) -- 235380: http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=235380 Debian Bug Tracking System Contact [email protected] with problems
--- Begin Message ---Package: libavl-dev Version: 0.3.5-1 Severity: normal There are no man pages for the libavl functions. Here are suggested man pages for 11 of them. - Jim Van Zandt diff -Nur debian-orig/avl_alloc_tree.3 debian/avl_alloc_tree.3 --- debian-orig/avl_alloc_tree.3 1969-12-31 19:00:00.000000000 -0500 +++ debian/avl_alloc_tree.3 2004-02-28 19:22:55.000000000 -0500 @@ -0,0 +1,124 @@ +.\" (c) 2004 by James R. Van Zandt -*- nroff -*- +.\" +.\" This manual is free software; you can redistribute it and/or +.\" modify it under the terms of the GNU Lesser General Public +.\" License as published by the Free Software Foundation; either +.\" version 2.1 of the License, or (at your option) any later version. +.\" +.\" This manual page may be incorrect or out-of-date. The author(s) +.\" assume no responsibility for errors or omissions, or for damages +.\" resulting from the use of the information contained herein. The +.\" author(s) may not have taken the same level of care in the +.\" production of this manual, which is licensed free of charge, as +.\" they might when working professionally. +.\" +.\" Written Sat Feb 28 08:45:03 EST 2004 by Jim Van Zandt +.TH AVL_ALLOC_TREE 3 "February 28, 2004" "GNU" "Linux Programmer's Manual" +.SH NAME +avl_alloc_tree, avl_init_tree, avl_clear_tree, avl_free_tree, avl_free_nodes \- allocate, initialize, or free an AVL tree +.SH SYNOPSIS +.nf +.B #include <avl.h> +.sp +.BI "extern avl_tree_t *avl_alloc_tree ( avl_compare_t " compareitems , +.BI " avl_freeitem_t " freeitem ");" +.sp +.BI "extern avl_tree_t *avl_init_tree ( avl_tree_t *" avltree , +.BI " avl_compare_t " compareitems ", avl_freeitem_t " freeitem ");" +.sp +.BI "extern void avl_clear_tree ( avl_tree_t *" avltree ");" +.sp +.BI "extern void avl_free_tree ( avl_tree_t *" avltree ");" +.sp +.BI "extern void avl_free_nodes ( avl_tree_t *" avltree ");" +.fi +.SH DESCRIPTION +\fBavl_alloc_tree()\fP allocates and initializes a new tree for +elements that will be ordered using \fIcompareitems\fP (an +\fBstrcmp()\fP-like function) and whose elements will be free'd using +\fIfreeitem\fP (which may be \fBNULL\fP). +\fBavl_alloc_tree\fP() returns a pointer to the newly allocated tree, +declared as +.nf +.sp + typedef struct avl_tree_t { + avl_node_t *head; + avl_node_t *tail; + avl_node_t *top; + avl_compare_t compareitems; + avl_freeitem_t freeitem; + } avl_tree_t; +.sp +.fi +or \fBNULL\fP if +memory could not be allocated. O(1). The following two functions do +successively smaller parts of what \fBavl_alloc_tree\fP does: +.PP +\fBavl_init_tree()\fP initializes \fBavltree\fP (i.e. clears it and +records its \fIcompareitems\fP and \fIfreeitem\fP functions). +\fBavltree\fP may be an already-allocated tree or \fBNULL\fP. O(1). +.PP +\fBavl_clear_tree()\fP clears the tree structure for reuse. Nothing is +free()d. \fIcompareitem\fP and \fIfreeitem\fP functions are left +alone. \fIavltree\fP must not be \fBNULL\fP. O(1). +.PP +\fBavl_free_tree\fP frees the entire tree efficiently. Nodes will be +\fBfree()\fPd. If the tree's \fIfreeitem\fP is not \fBNULL\fP it will be +invoked on every item. O(n). +.PP +\fBavl_free_nodes()\fP free()s all nodes in the tree but leaves the +tree itself. If the tree's \fIfreeitem\fP is not \fBNULL\fP it will +be invoked on every item. O(n). +.SH "RETURN VALUE" +\fBavl_alloc_tree\fP() returns a pointer to the newly allocated tree, +or \fBNULL\fP if memory could not be allocated. +.PP +\fBavl_init_tree()\fP returns the value of \fIavltree\fP (even if it's +NULL). +.SH "EXAMPLES" +The following example program, adapted from the source code, illustrates the +use of \fBavl_alloc_tree()\fP and \fBavl_free_tree()\fP. +.nf +.sp + #include <avl.h> + #include <string.h> + #include <stdlib.h> + #include <stdio.h> + + #define BUFSIZE 8192 + + int main(void) { + char buf[BUFSIZE]; + avl_tree_t *tree; + avl_node_t *node; + + tree = avl_alloc_tree((avl_compare_t)strcmp, + (avl_freeitem_t)free); + + while(fgets(buf, BUFSIZE, stdin)) + avl_insert(tree, strdup(buf)); + + for(node = tree->head; node; node = node->next) + printf("%s", node->item); + + avl_free_tree(tree); + } +.fi +.SH "BUGS" +None that we know of. +.SH "SEE ALSO" +.BR avl_insert "(3), " +.br +.BR avl_search "(3), " +.br +.BR avl_delete "(3), " +.br +.BR avl_delete_node "(3), " +.br +.BR avl_unlink_node "(3), " +.br +.BR avl_insert_node "(3) " +.SH AUTHORS +Michael H. Buselli <[email protected]> +.br +Wessel Dankers <[email protected]> diff -Nur debian-orig/avl_clear_tree.3 debian/avl_clear_tree.3 --- debian-orig/avl_clear_tree.3 1969-12-31 19:00:00.000000000 -0500 +++ debian/avl_clear_tree.3 2004-02-28 19:22:55.000000000 -0500 @@ -0,0 +1 @@ +.so man3/avl_alloc_tree.3 diff -Nur debian-orig/avl_delete.3 debian/avl_delete.3 --- debian-orig/avl_delete.3 1969-12-31 19:00:00.000000000 -0500 +++ debian/avl_delete.3 2004-02-28 19:22:55.000000000 -0500 @@ -0,0 +1 @@ +.so man3/avl_insert.3 diff -Nur debian-orig/avl_delete_node.3 debian/avl_delete_node.3 --- debian-orig/avl_delete_node.3 1969-12-31 19:00:00.000000000 -0500 +++ debian/avl_delete_node.3 2004-02-28 19:22:55.000000000 -0500 @@ -0,0 +1 @@ +.so man3/avl_insert.3 diff -Nur debian-orig/avl_free_nodes.3 debian/avl_free_nodes.3 --- debian-orig/avl_free_nodes.3 1969-12-31 19:00:00.000000000 -0500 +++ debian/avl_free_nodes.3 2004-02-28 19:22:55.000000000 -0500 @@ -0,0 +1 @@ +.so man3/avl_alloc_nodes.3 diff -Nur debian-orig/avl_free_tree.3 debian/avl_free_tree.3 --- debian-orig/avl_free_tree.3 1969-12-31 19:00:00.000000000 -0500 +++ debian/avl_free_tree.3 2004-02-28 19:22:55.000000000 -0500 @@ -0,0 +1 @@ +.so man3/avl_alloc_tree.3 diff -Nur debian-orig/avl_init_tree.3 debian/avl_init_tree.3 --- debian-orig/avl_init_tree.3 1969-12-31 19:00:00.000000000 -0500 +++ debian/avl_init_tree.3 2004-02-28 19:22:55.000000000 -0500 @@ -0,0 +1 @@ +.so man3/avl_alloc_tree.3 diff -Nur debian-orig/avl_insert.3 debian/avl_insert.3 --- debian-orig/avl_insert.3 1969-12-31 19:00:00.000000000 -0500 +++ debian/avl_insert.3 2004-02-28 19:22:55.000000000 -0500 @@ -0,0 +1,78 @@ +.\" (c) 2004 by James R. Van Zandt -*- nroff -*- +.\" +.\" This manual is free software; you can redistribute it and/or +.\" modify it under the terms of the GNU Lesser General Public +.\" License as published by the Free Software Foundation; either +.\" version 2.1 of the License, or (at your option) any later version. +.\" +.\" This manual page may be incorrect or out-of-date. The author(s) +.\" assume no responsibility for errors or omissions, or for damages +.\" resulting from the use of the information contained herein. The +.\" author(s) may not have taken the same level of care in the +.\" production of this manual, which is licensed free of charge, as +.\" they might when working professionally. +.\" +.\" Written Sat Feb 28 08:45:03 EST 2004 by Jim Van Zandt +.TH AVL_INSERT 3 "February 28, 2004" "GNU" "Linux Programmer's Manual" +.SH NAME +avl_insert, avl_search, avl_delete, avl_delete_node, avl_unlink_node, avl_insert_node \- insert, search, and delete items in an AVL tree +.SH SYNOPSIS +.nf +.B #include <avl.h> +.sp +.BI "extern avl_node_t *avl_insert ( avl_tree_t *" avltree ", void *" item ");" +.sp +.BI "extern avl_node_t *avl_search ( const avl_tree_t *" avltree ", const void * " item ");" +.sp +.BI "extern void *avl_delete ( avl_tree_t *" avltree ", const void *" item ");" +.sp +.BI "extern void *avl_delete_node ( avl_tree_t *" avltree ", avl_node_t *" avlnode ");" +.sp +.BI "extern void avl_unlink_node ( avl_tree_t *" avltree ", avl_node_t *" avlnode ");" +.sp +.BI "extern avl_node_t *avl_insert_node ( avl_tree_t *" avltree ", avl_node_t *" avlnode ");" +.fi +.SH DESCRIPTION +\fBavl_insert()\fP inserts \fIitem\fP into the tree and returns the +new node. Returns \fBNULL\fP and sets \fBerrno\fP if memory for the +new node could not be allocated or if the node is already in the tree +(\fBEEXIST\fP). O(lg n). +.PP +\fBavl_search()\fP searches for \fIitem\fP in the tree and returns a +matching node if found or \fBNULL\fP if not. O(lg n). +.PP +\fBavl_delete()\fP searches for \fIitem\fP in the tree and deletes it if +found. If the tree's \fIfreeitem\fP is not \fBNULL\fP, it is invoked +on the item. Otherwise, the item is returned. O(lg n). +.PP +\fBavl_delete_node()\fP deletes a node from the tree. Returns +immediately if the node is \fBNULL\fP. If the tree's \fIfreeitem\fP +is not \fBNULL\fP, it is invoked on the item. Otherwise, the item is +returned. O(lg n). +.PP +\fBavl_unlink_node()\fP deletes a node from the tree. Returns +immediately if the node is NULL. The item will not be free()d +regardless of the tree's \fIfreeitem\fP handler. This function comes +in handy if you need to update the search key. O(lg n). +.PP +\fBavl_insert_node()\fP inserts a node into the tree and returns it. +Returns \fBNULL\fP if the node is already in the tree. This is useful +for re-inserting a node after updating its search key. O(lg n). +.\" .SH "RETURN VALUE" +.\" .SH "EXAMPLES" +.SH "BUGS" +None that we know of. +.SH "SEE ALSO" +.BR avl_alloc_tree "(3), " +.br +.BR avl_init_tree "(3), " +.br +.BR avl_clear_tree "(3), " +.br +.BR avl_free_tree "(3), " +.br +.BR avl_free_nodes "(3) " +.SH AUTHORS +Michael H. Buselli <[email protected]> +.br +Wessel Dankers <[email protected]> diff -Nur debian-orig/avl_insert_node.3 debian/avl_insert_node.3 --- debian-orig/avl_insert_node.3 1969-12-31 19:00:00.000000000 -0500 +++ debian/avl_insert_node.3 2004-02-28 19:22:55.000000000 -0500 @@ -0,0 +1 @@ +.so man3/avl_insert.3 diff -Nur debian-orig/avl_search.3 debian/avl_search.3 --- debian-orig/avl_search.3 1969-12-31 19:00:00.000000000 -0500 +++ debian/avl_search.3 2004-02-28 19:22:55.000000000 -0500 @@ -0,0 +1 @@ +.so man3/avl_insert.3 diff -Nur debian-orig/avl_unlink_node.3 debian/avl_unlink_node.3 --- debian-orig/avl_unlink_node.3 1969-12-31 19:00:00.000000000 -0500 +++ debian/avl_unlink_node.3 2004-02-28 19:22:55.000000000 -0500 @@ -0,0 +1 @@ +.so man3/avl_insert.3 -- System Information: Debian Release: testing/unstable APT prefers testing APT policy: (990, 'testing'), (500, 'unstable') Architecture: i386 (i686) Kernel: Linux 2.6.1 Locale: LANG=C, LC_CTYPE=C Versions of packages libavl-dev depends on: ii libavl1 0.3.5-1 AVL tree manipulation library - de ii libc6-dev 2.3.2.ds1-11 GNU C Library: Development Librari -- no debconf information
--- End Message ---
--- Begin Message ---Source: libavl Source-Version: 0.3.5-4 We believe that the bug you reported is fixed in the latest version of libavl, which is due to be installed in the Debian FTP archive. A summary of the changes between this version and the previous one is attached. Thank you for reporting the bug, which will now be closed. If you have further comments please address them to [email protected], and the maintainer will reopen the bug report if appropriate. Debian distribution maintenance software pp. Guus Sliepen <[email protected]> (supplier of updated libavl package) (This message was generated automatically at their request; if you believe that there is a problem with it please contact the archive administrators by mailing [email protected]) -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA256 Format: 1.8 Date: Tue, 21 Jun 2016 12:03:16 +0200 Source: libavl Binary: libavl-dev libavl1 Architecture: source amd64 Version: 0.3.5-4 Distribution: unstable Urgency: medium Maintainer: Guus Sliepen <[email protected]> Changed-By: Guus Sliepen <[email protected]> Description: libavl-dev - AVL tree manipulation library - development libavl1 - AVL tree manipulation library - runtime Closes: 194221 235380 817525 Changes: libavl (0.3.5-4) unstable; urgency=medium . [ Guus Sliepen ] * Convert package to 3.0 (quilt) format. * Convert debian/rules to dh. * Bump Standards-Version and debian/compat. Closes: #817525 . [ James R. Van Zandt ] * Add manpages. Closes: #235380 . [ Tomek Dudziak ] * Fix code example in README. Closes: #194221 Checksums-Sha1: c30f2f16e57db6643ecf148a3694b84fa9672dbf 1680 libavl_0.3.5-4.dsc 785f9fccda6c791aabad8a97ce578ca03d797b14 2760 libavl_0.3.5-4.debian.tar.xz 5cc8a5178d0c36117dadc0b5b27c72211be7e3ce 5622 libavl-dev_0.3.5-4_amd64.deb 901b1cc4cc9aca4051764b97ce9ce7ceb93e2e1e 7554 libavl1-dbgsym_0.3.5-4_amd64.deb d05882677e01fa6b08fbbd0c8f76897f6edc4424 6430 libavl1_0.3.5-4_amd64.deb Checksums-Sha256: 289c36e168d0fcf3e2bf37879151456b6f991f54f3f1a240985c1acc94364508 1680 libavl_0.3.5-4.dsc f832a69c02947f733f0a4838c244820f1b3716ba52e841877455a0d528620397 2760 libavl_0.3.5-4.debian.tar.xz d53415c9c2a18ce913b29931a6f933e3401cb3ebe071797c4d9ff626c112dddc 5622 libavl-dev_0.3.5-4_amd64.deb 1349b026efef76af6a1e1746931946c57f12a35094176e5613884d5ac5e3921a 7554 libavl1-dbgsym_0.3.5-4_amd64.deb 19f1851b0eb7f659712b337aacec32418da0cfd4ba93db583ef59c4c537bf6ce 6430 libavl1_0.3.5-4_amd64.deb Files: 952645efc4dcd83dbc04d88254670ed1 1680 devel optional libavl_0.3.5-4.dsc ad3d4c324fbe439cd6bc0ea447ad50c1 2760 devel optional libavl_0.3.5-4.debian.tar.xz d022df76b869e98c23ad5160ff2d1a87 5622 libdevel optional libavl-dev_0.3.5-4_amd64.deb c01f3752170380708a686b5f7bfd4f45 7554 debug extra libavl1-dbgsym_0.3.5-4_amd64.deb 1d85a2682beec85222e8d618d514587e 6430 libs optional libavl1_0.3.5-4_amd64.deb -----BEGIN PGP SIGNATURE----- Version: GnuPG v1 iQIcBAEBCAAGBQJXaRD6AAoJED9JDeuHHvn6u0AP/jxYRw8//koa5z4/Fp8a/a+J Dt6pb5YWJHc7WEUh9LYjEAkGBxPjmYmElmLeJ4lHlsAimSYL85F0kGT2wlroi9wg ZVWEeGKQW/MqnzqgZYOAZYZ1mD5LdajQkmdu4tN8m9kQbbrVeO/+Ng9xL1IbK8xb qD3rch/TH9MzSHOsLP+zV9e+IE0ahJVZaxnNYZMc6aVXdG6Z2EvW8VQkN41YBDxn bThe6ySG/gtYIejz3NgBzNkCqlTZ6AfA2NGnIInXBCF02Tn/IfxIUK0pBfn14Wp3 NxHTqFrf2YnMsomFFB/SOf0JDR2lfxrb37KGMvvAr/jXhgtTK9UeRKrbhUqRFgC/ dt+E3PFdu074HX28jnQyUaKYVY8mLmPlKvXmPIkkSc/XCNqAPnsmFtZYZLgDj79E 1y72M8fi9+okfYH7n6FkxASKsXFO9Wymqd0dZj9mVUvjvH4WFNMGjehEf2oEDHDm Z0fLGAMh+5qbTY5GfgFWnvI8gtv5++DKaymftR7V2ck2PyUcSloDcUvGaokpYaIw kCgOEyFoR8yaQJRZ4+U6OGGC4sVHB+ZtFbN/h7WfjCtoz8a1qPI4oZjiGCExVP2t vbCmdNbrku9kSWcIBKz3TqkeYSlOVghvSWj+/WDSH01tQlnvUBBPSOw4NzNc83MV HT9/vvLRWu+fjqkfaxQH =aQDp -----END PGP SIGNATURE-----
--- End Message ---
