Difference between revisions of "GDSL"
(Created page with "{{Entry |Name=GDSL |Short description=Routines for generic data structures manipulation |Full description=The Generic Data Structures Library (GDSL) is a collection of routines f...") |
(New version) |
||
Line 3: | Line 3: | ||
|Short description=Routines for generic data structures manipulation | |Short description=Routines for generic data structures manipulation | ||
|Full description=The Generic Data Structures Library (GDSL) is a collection of routines for generic data structures manipulation. It is a portable and re-entrant library designed to let C programmers access common data structures with powerful algorithms and hidden implementation. Available structures are lists, queues, stacks, hash tables, binary trees, binary search trees, red-black trees, 2D arrays, and permutations. | |Full description=The Generic Data Structures Library (GDSL) is a collection of routines for generic data structures manipulation. It is a portable and re-entrant library designed to let C programmers access common data structures with powerful algorithms and hidden implementation. Available structures are lists, queues, stacks, hash tables, binary trees, binary search trees, red-black trees, 2D arrays, and permutations. | ||
+ | |Homepage URL=http://home.gna.org/gdsl/ | ||
|User level=none | |User level=none | ||
− | |||
− | |||
− | |||
− | |||
|Computer languages=C | |Computer languages=C | ||
|Documentation note=User reference manual available in HTML format from http://home.gna.org/gdsl/ref/; User reference manual available in DVI format from http://home.gna.org/gdsl/refman.dvi; User reference manual available in PostScript format from http://home.gna.org/gdsl/refman.ps; User reference manual available in PDF format from http://home.gna.org/gdsl/refman.pdf | |Documentation note=User reference manual available in HTML format from http://home.gna.org/gdsl/ref/; User reference manual available in DVI format from http://home.gna.org/gdsl/refman.dvi; User reference manual available in PostScript format from http://home.gna.org/gdsl/refman.ps; User reference manual available in PDF format from http://home.gna.org/gdsl/refman.pdf | ||
− | |||
− | |||
− | |||
− | |||
− | |||
|Keywords=manipulation,lists,algorithm,stacks,permutations,data structure,routine,re-entrant,queues,hash tables,binary trees,binary search trees,red-black trees,2D arrays | |Keywords=manipulation,lists,algorithm,stacks,permutations,data structure,routine,re-entrant,queues,hash tables,binary trees,binary search trees,red-black trees,2D arrays | ||
− | | | + | |Version identifier=1.8 |
− | |Last review by= | + | |Version date=2015/02/12 |
− | |Last review date= | + | |Version status=stable |
+ | |Version download=http://download.gna.org/gdsl/gdsl-1.8.tar.gz | ||
+ | |Last review by=Alejandroindependiente | ||
+ | |Last review date=2017/03/15 | ||
|Submitted by=Database conversion | |Submitted by=Database conversion | ||
|Submitted date=2011-04-01 | |Submitted date=2011-04-01 | ||
− | | | + | |Status= |
− | | | + | |Is GNU=No |
− | | | + | |License verified date=2004-10-05 |
− | | | + | }} |
+ | {{Project license | ||
+ | |License=GPLv2orlater | ||
+ | |License verified by=Janet Casey | ||
|License verified date=2004-10-05 | |License verified date=2004-10-05 | ||
− | |||
}} | }} | ||
{{Person | {{Person | ||
+ | |Real name=Nicolas Darnis | ||
|Role=Maintainer | |Role=Maintainer | ||
− | |||
|Email=ndarnis@free.fr | |Email=ndarnis@free.fr | ||
|Resource URL= | |Resource URL= | ||
Line 56: | Line 53: | ||
{{Software category | {{Software category | ||
|Interface=library | |Interface=library | ||
− | |||
|Use=library | |Use=library | ||
}} | }} | ||
− | {{ | + | {{Featured}} |
− | |||
− | |||
− | |||
− | }} |
Latest revision as of 12:55, 15 March 2017
GDSL
http://home.gna.org/gdsl/
Routines for generic data structures manipulation
The Generic Data Structures Library (GDSL) is a collection of routines for generic data structures manipulation. It is a portable and re-entrant library designed to let C programmers access common data structures with powerful algorithms and hidden implementation. Available structures are lists, queues, stacks, hash tables, binary trees, binary search trees, red-black trees, 2D arrays, and permutations.
Licensing
License
Verified by
Verified on
Notes
Leaders and contributors
Contact(s) | Role |
---|---|
Nicolas Darnis | Maintainer |
Resources and communication
Audience | Resource type | URI |
---|---|---|
Help | mailto:gdsl-announce@gna.org | |
Bug Tracking | VCS Repository Webview | http://gna.org/projects/gdsl/ |
Developer | VCS Repository Webview | http://cvs.gna.org/viewcvs/gdsl/gdsl/ |
Support | mailto:gdsl-general@gna.org |
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.