On Sat, 2017-09-16 at 14:25 +0200, Ludovic Courtès wrote: > Hello, > > Christopher Howard <christopher.how...@qlfiles.net> skribis: > > > Hello, I am making a request to have my new module listed on > > <https://w > > ww.gnu.org/software/guile/libraries/>. The project name is Guile AA > > Tree, which is of course an AA tree implementation available at > > > > https://savannah.nongnu.org/projects/guile-aa-tree/ > > Could you send a patch against > <https://git.savannah.gnu.org/cgit/guile/guile-web.git>? > > The libraries are listed at > <https://git.savannah.gnu.org/cgit/guile/guile-web.git/tree/website/a > pps/base/libraries-page.scm#n64>. > > TIA! > > Ludo’. > >
Is this what you need (attached)? -- https://qlfiles.net https://emailselfdefense.fsf.org/en/
diff --git a/website/apps/base/libraries-page.scm b/website/apps/base/libraries-page.scm index c6108f7..688e216 100644 --- a/website/apps/base/libraries-page.scm +++ b/website/apps/base/libraries-page.scm @@ -322,6 +322,17 @@ for GNU Guile programs. It is a wrapper to the underlying ;;; Tools implemented with Guile. ;;; +(define aatree + (package #:name "Guile AA Tree" + #:description "Guile AA tree implementation. AA trees are +self-balancing binary trees, which ensure O(log n) worst case +performance for core operations. The module provides non-mutating +insert, delete, and search operations, with support for convenient +nested tree operations." + #:url "http://savannah.nongnu.org/projects/guile-aa-tree"; + #:tags '("Guile 2.2") + #:license "GPL 3 or later")) + (define aiscm (package #:name "AIscm" #:description "Guile numerical arrays and tensor extension. @@ -376,7 +387,7 @@ compression. It is written in C and Scheme, with Guile 2.0 bindings." (define (%packages-tools) "These projects are tools for or implemented with Guile. Mostly, these are the types of things that automate documentation or code generation." - (list aiscm autogen guix libchop)) + (list aatree aiscm autogen guix libchop)) ;;;
signature.asc
Description: This is a digitally signed message part
