Merge pull request #163 from msune/libcdada
data-structures: order section and add libcdada
This commit is contained in:
1 file changed
+10
-7
@@ -274,22 +274,24 @@ Databases and data stores with C APIs.
|
|||||||
* [CLIST][371] - Simple and lightweight [dynamic array][25] implementation.
|
* [CLIST][371] - Simple and lightweight [dynamic array][25] implementation.
|
||||||
[``BSD-2-Clause``][BSD-2-Clause]
|
[``BSD-2-Clause``][BSD-2-Clause]
|
||||||
* [Collections-C][406] - Library of generic data structures. [``LGPL-3.0-or-later``][LGPL-3.0-or-later]
|
* [Collections-C][406] - Library of generic data structures. [``LGPL-3.0-or-later``][LGPL-3.0-or-later]
|
||||||
* [kdtree][337] - Simple library for working with KD-trees. [``BSD-3-Clause``][BSD-3-Clause]
|
|
||||||
* [libavl][156] - Library containing a range of self-balancing binary
|
|
||||||
trees. [``GPL-3.0-or-later``][GPL-3.0-or-later]
|
|
||||||
* [ds][541] - Common Data Structures and Algorithms. [``MIT``][MIT]
|
* [ds][541] - Common Data Structures and Algorithms. [``MIT``][MIT]
|
||||||
* [igraph][544] - A graph processing library.
|
* [igraph][544] - A graph processing library.
|
||||||
[``GPL-2.0-or-later``][GPL-2.0-or-later]
|
[``GPL-2.0-or-later``][GPL-2.0-or-later]
|
||||||
|
* [kdtree][337] - Simple library for working with KD-trees. [``BSD-3-Clause``][BSD-3-Clause]
|
||||||
|
* [libavl][156] - Library containing a range of self-balancing binary
|
||||||
|
trees. [``GPL-3.0-or-later``][GPL-3.0-or-later]
|
||||||
|
* [libcdada][585] - A small, portable, MACRO-less library for basic data structures
|
||||||
|
(list, set, map, queue...) in C (C++ backend). [``BSD-2-Clause``][BSD-2-Clause]
|
||||||
* [liblfds][411] - Portable lock-free data structure library. Public domain
|
* [liblfds][411] - Portable lock-free data structure library. Public domain
|
||||||
(more exactly, whatever license you want).
|
(more exactly, whatever license you want).
|
||||||
* [M\*LIB][350] - Library for generic, but typesafe C containers. Implemented as
|
|
||||||
header-only. [``BSD-2-Clause``][BSD-2-Clause]
|
|
||||||
* [offbrand][498] - Collection of generic, reference-counted data structures.
|
|
||||||
[``MIT``][MIT]
|
|
||||||
* [libsrt][305] - Soft and hard real-time data structures.
|
* [libsrt][305] - Soft and hard real-time data structures.
|
||||||
[``BSD-3-Clause``][BSD-3-Clause].
|
[``BSD-3-Clause``][BSD-3-Clause].
|
||||||
* [list.h][538] - Implementations for singly linked and doubly linked list functions.
|
* [list.h][538] - Implementations for singly linked and doubly linked list functions.
|
||||||
[``GPL-3.0-only``][GPL-3.0-only]
|
[``GPL-3.0-only``][GPL-3.0-only]
|
||||||
|
* [M\*LIB][350] - Library for generic, but typesafe C containers. Implemented as
|
||||||
|
header-only. [``BSD-2-Clause``][BSD-2-Clause]
|
||||||
|
* [offbrand][498] - Collection of generic, reference-counted data structures.
|
||||||
|
[``MIT``][MIT]
|
||||||
* [PackedArray][241] - Random-access array of tightly packed unsigned integers of
|
* [PackedArray][241] - Random-access array of tightly packed unsigned integers of
|
||||||
any desired width. Has a SIMD-optimized implementation. [``WTFPL``][WTFPL]
|
any desired width. Has a SIMD-optimized implementation. [``WTFPL``][WTFPL]
|
||||||
* [rb3ptr][561] - Red-Black tree. Exposes almost all implementation primitives, so can be used for
|
* [rb3ptr][561] - Red-Black tree. Exposes almost all implementation primitives, so can be used for
|
||||||
@@ -1735,3 +1737,4 @@ support for C.
|
|||||||
[582]: https://www.infradead.org/~tgr/libnl/
|
[582]: https://www.infradead.org/~tgr/libnl/
|
||||||
[583]: https://www.gnu.org/software/automake/manual/html_node/GNU-Build-System.html
|
[583]: https://www.gnu.org/software/automake/manual/html_node/GNU-Build-System.html
|
||||||
[584]: https://github.com/msune/autotools-skeleton
|
[584]: https://github.com/msune/autotools-skeleton
|
||||||
|
[585]: https://msune.github.io/libcdada/
|
||||||
Reference in new issue
Block a user