Difference between revisions of "Avl"
(add package identifier) |
m (updated links) |
||
| Line 3: | Line 3: | ||
|Short description=Library for balanced binary trees | |Short description=Library for balanced binary trees | ||
|Full description=libavl is a balanced tree library that comes with full documentation. It includes unthreaded, right threaded, and fully threaded variants of AVL tree, as well as unthreaded red-black trees. It features self-test routines as well as insertion, deletion, tree count, tree copy, tree walking and traversal, search, and threading and unthreading routines. Each function has a comment describing its interface, and each step in the algoritms the program uses has a comment also. Each source code file includes a built-in test routine. | |Full description=libavl is a balanced tree library that comes with full documentation. It includes unthreaded, right threaded, and fully threaded variants of AVL tree, as well as unthreaded red-black trees. It features self-test routines as well as insertion, deletion, tree count, tree copy, tree walking and traversal, search, and threading and unthreading routines. Each function has a comment describing its interface, and each step in the algoritms the program uses has a comment also. Each source code file includes a built-in test routine. | ||
| − | |Homepage URL=http:// | + | |Homepage URL=http://adtinfo.org/ |
|User level=none | |User level=none | ||
|Computer languages=C | |Computer languages=C | ||
| − | |Documentation note=User manual available from http:// | + | |Documentation note=User manual available from http://adtinfo.org/libavl.html/index.html |
|Keywords=threading,library,tree,libavl,avl,library avl,avl library | |Keywords=threading,library,tree,libavl,avl,library avl,avl library | ||
|Version identifier=2.0.3 | |Version identifier=2.0.3 | ||
| Line 35: | Line 35: | ||
|Real name=Ben Pfaff | |Real name=Ben Pfaff | ||
|Role=Maintainer | |Role=Maintainer | ||
| + | |Email=blp@cs.stanford.edu | ||
|Resource URL= | |Resource URL= | ||
}} | }} | ||
Revision as of 12:35, 14 October 2016
GNU libavl
https://adtinfo.org/
Libraries for the manipulation of binary trees and balanced binary trees.
libavl is a collection of computer subroutines for constructing and manipulating binary trees and balanced trees.
It includes unthreaded, right threaded, and fully threaded variants of AVL tree, as well as unthreaded red-black trees. It features self-test routines as well as insertion, deletion, tree count, tree copy, tree walking and traversal, search, and threading and unthreading routines. Each function has a comment describing its interface, and each step in the algoritms the program uses has a comment also. Each source code file includes a built-in test routine.
Licensing
License
Verified by
Verified on
Notes
License
Verified by
Genium
Verified on
1 March 2022
License
Verified by
Genium
Verified on
1 March 2022
Leaders and contributors
| Contact(s) | Role |
|---|---|
| Ben Pfaff | Maintainer |
Resources and communication
| Audience | Resource type | URI |
|---|---|---|
| Savannah | Developer | https://savannah.gnu.org/projects/avl/ |
| Wikidata | General | https://www.wikidata.org/wiki/Q72271270 |
| Mailing List | https://lists.gnu.org/mailman/listinfo/bug-avl/ | |
| Download | https://alpha.gnu.org/gnu/avl/ | |
| Download | https://ftp.gnu.org/gnu/avl/ | |
| VCS Repository Webview | https://git.savannah.gnu.org/cgit/avl.git/ | |
| FTP | Mailing List | https://ftpmirror.gnu.org/avl/ |
| Homepage | https://www.gnu.org/software/avl/ | |
| FTP | Download | https://ftp.gnu.org/old-gnu/avl/ |
Software prerequisites
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.