[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Savannah-register-public] [task #6555] Submission of GNU libavl

From: Ben Pfaff
Subject: [Savannah-register-public] [task #6555] Submission of GNU libavl
Date: Sat, 24 Feb 2007 22:06:39 +0000
User-agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv: Gecko/20061205 Iceweasel/ (Debian-


                 Summary: Submission of GNU libavl
                 Project: Savannah Administration
            Submitted by: blp
            Submitted on: Saturday 02/24/07 at 14:06
         Should Start On: Saturday 02/24/07 at 00:00
   Should be Finished on: Tuesday 03/06/07 at 00:00
                Category: Project Approval
                Priority: 5 - Normal
                  Status: None
                 Privacy: Public
        Percent Complete: 0%
             Assigned to: None
             Open/Closed: Open
         Discussion Lock: Any
                  Effort: 0.00



A new project has been registered at Savannah 
This project account will remain inactive until a site admin approves or
discards the registration.

= Registration Administration =

While this item will be useful to track the registration process, *approving
or discarding the registration must be done using the specific Group
<> page*,
accessible only to site administrators, effectively *logged as site
administrators* (superuser):

* Group Administration

= Registration Details =

* Name: *GNU libavl*
* System Name:  *avl*
* Type: Official GNU software
* License: GNU Lesser General Public License (The current source tree
indicates GPL; however after discussion with RMS, libavl will be moving
primarily to LGPL, with test programs staying as GPL, and documentation
probably moving to GFDL, although for a literate program the distinction
between documentation and code is fuzzier.)


==== Description: ====
GNU libavl is a library in ANSI/ISO C for the
manipulation of binary trees and balanced binary trees.  libavl is
written using a literate programming system called TexiWEB.  By way of
TexiWEB, libavl is as much a textbook on binary trees and balanced
binary trees as it is a collection of code.

GNU libavl supports the following types of trees:

    Plain binary trees:
        * Binary search trees
        * AVL trees
        * Red-black trees

    Threaded binary trees:
        * Threaded binary search trees
        * Threaded AVL trees
        * Threaded red-black trees

    Right-threaded binary trees:
        * Right-threaded binary search trees
        * Right-threaded AVL trees
        * Right-threaded red-black trees

    Binary trees with parent pointers:
        * Binary search trees with parent pointers
        * AVL trees with parent pointers
        * Red-black trees with parent pointers

==== Other Software Required: ====
ANSI C compiler and standard C library.

==== Other Comments: ====
This is GNU software, available at


Reply to this item at:


  Message sent via/by Savannah

reply via email to

[Prev in Thread] Current Thread [Next in Thread]