Difference between revisions of "Avl"

From Free Software Directory
Jump to: navigation, search
(Created page with "{{Entry |Name=avl |Short description=Library for balanced binary trees |Full description=libavl is a balanced tree library that comes with full documentation. It includes unthrea...")
 
(add package identifier)
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://www.stanford.edu/~blp/avl/
 
|User level=none
 
|User level=none
|Status=Live
 
|Component programs=
 
|Homepage URL=http://www.stanford.edu/~blp/avl/
 
|VCS checkout command=
 
 
|Computer languages=C
 
|Computer languages=C
 
|Documentation note=User manual available from http://www.stanford.edu/~blp/avl/libavl.html/
 
|Documentation note=User manual available from http://www.stanford.edu/~blp/avl/libavl.html/
|Paid support=
 
|IRC help=
 
|IRC general=
 
|IRC development=
 
|Related projects=
 
 
|Keywords=threading,library,tree,libavl,avl,library avl,avl library
 
|Keywords=threading,library,tree,libavl,avl,library avl,avl library
|Is GNU=y
+
|Version identifier=2.0.3
 +
|Version date=2007-08-26
 +
|Version status=stable
 +
|Version download=http://ftp.gnu.org/pub/gnu/avl/avl-2.0.3.tar.gz
 +
|Version comment=2.0.3 stable released 2007-08-26
 
|Last review by=Janet Casey
 
|Last review by=Janet Casey
 
|Last review date=2007-08-27
 
|Last review date=2007-08-27
 
|Submitted by=Database conversion
 
|Submitted by=Database conversion
 
|Submitted date=2011-04-01
 
|Submitted date=2011-04-01
|Version identifier=2.0.3
+
|Status=
|Version date=2007-08-26
+
|Is GNU=Yes
|Version status=stable
+
|GNU package identifier=avl
|Version download=http://ftp.gnu.org/pub/gnu/avl/avl-2.0.3.tar.gz
+
|License verified date=2008-01-07
 +
}}
 +
{{Project license
 +
|License=GPLv3orlater
 +
|License verified by=Deborah Nicholson
 +
|License verified date=2008-01-07
 +
}}
 +
{{Project license
 +
|License=LGPLv3orlater
 +
|License verified by=Deborah Nicholson
 
|License verified date=2008-01-07
 
|License verified date=2008-01-07
|Version comment=2.0.3 stable released 2007-08-26
 
 
}}
 
}}
 
{{Person
 
{{Person
 +
|Real name=Ben Pfaff
 
|Role=Maintainer
 
|Role=Maintainer
|Real name=Ben Pfaff
 
|Email=
 
 
|Resource URL=
 
|Resource URL=
 
}}
 
}}
Line 41: Line 44:
 
{{Software category
 
{{Software category
 
|Interface=library
 
|Interface=library
|Library=c
 
 
|Use=library
 
|Use=library
 
}}
 
}}
{{Project license
+
{{Featured}}
|License=GPLv3orlater
 
|License verified by=Deborah Nicholson
 
|License verified date=2008-01-07
 
}}
 
{{Project license
 
|License=LGPLv3orlater
 
|License verified by=Deborah Nicholson
 
|License verified date=2008-01-07
 
}}
 

Revision as of 16:23, 12 September 2014


[edit]

avl

https://www.gnu.org/software/avl/
Library for balanced binary trees.

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.





Licensing

License

Verified by

Verified on

Notes

Verified by

Deborah Nicholson

Verified on

7 January 2008

Verified by

Deborah Nicholson

Verified on

7 January 2008




Leaders and contributors

Contact(s)Role
Ben Pfaff Maintainer


Resources and communication

AudienceResource typeURI
Mailing Listhttps://lists.gnu.org/mailman/listinfo/gnu-system-discuss/
Savannah (Ref)https://savannah.gnu.org/projects/avl/
Mailing Listhttps://lists.gnu.org/mailman/listinfo/bug-avl/
Downloadhttps://alpha.gnu.org/gnu/avl/
VCS Repository Webviewhttps://cvs.savannah.gnu.org/viewvc/avl/
Downloadhttps://ftp.gnu.org/gnu/avl/
Generalhttps://savannah.gnu.org/people/
VCS Repository Webviewhttps://git.savannah.gnu.org/cgit/avl.git/
Downloadhttps://ftp.gnu.org/old-gnu/avl/
VCS Repository Webviewhttps://web.cvs.savannah.gnu.org/viewvc/avl/


Software prerequisites




Entry


















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.