Select a tag to browse associated projects and drill deeper into the tag cloud.
M2Collections
M
No analysis available
Modula-2 collections library. The library provides an API for collection ADTs, in particular: stacks, queues, double ended queues, priority queues, balanced binary search trees, patricia tries, dynamic arrays and hash tables to store arbitrary data. The hash table ADT allows data to be stored and
Mostly written in language not available
Licenses:
bsd
DASlib
D
No analysis available
C library for dynamic array storage. The library provides an API to create and use auto-resizing dynamic arrays for arbitrary data. Data may be stored and retrieved by reference only. An extension for storage and retrieval by copy is planned. Requires C99, no dependencies, platform independent. BSD style license.
Mostly written in language not available
Licenses:
bsd
CTElib
C
No analysis available
C Template Engine library to recursively expand placeholders in a template string, expanded string grows dynamically during template expansion, includes event notification for asynchronously reporting information, warnings and errors back to caller. Requires C99 and KVSlib.
Mostly written in language not available
Licenses:
bsd
Patricialib
P
No analysis available
C library for Patricia trie storage. The library provides an API to create and use dynamic compact Patricia tries for arbitrary data. Keys may be of variable length. Data may be stored and retrieved by reference only. Supports in-order retrieval and best-match prefix searches with foreach closure
Mostly written in language not available
Licenses:
bsd
FIFOlib
F
No analysis available
C library for FIFO (queue) storage. The library provides an API to create and use queues for arbitrary data. Data may be stored and retrieved by reference only. An extension for storage and retrieval by copy is planned. Requires C99, no dependencies, platform independent. BSD style license.
Mostly written in language not available
Licenses:
bsd
KVSlib
K
No analysis available
C library for key-value storage. The library provides an API to create and use dynamic associative arrays for arbitrary data. Data may be stored and retrieved by copy or by reference. Stored data is reference counted to prevent dangling pointers. Optimised for fast lookups and large data sets.
Mostly written in language not available
Licenses:
bsd
PQlib
P
No analysis available
C library for dynamic priority queues. The library provides an API to create and use dynamic priority queues for arbitrary data. Data may be stored and retrieved by reference only. All operations are O(log n). Requires C99, no dependencies, platform independent. BSD style license.
Mostly written in language not available
Licenses:
bsd
LIFOlib
L
No analysis available
C library for LIFO (stack) storage. The library provides an API to create and use dynamic stacks for arbitrary data. Data may be stored and retrieved by reference only. An extension for storage and retrieval by copy is planned. Requires C99, no dependencies, platform independent. BSD style license.
Mostly written in language not available
Licenses:
bsd
DEQlib
D
No analysis available
C library for double ended queue storage. The library provides an API to create and use dynamic double ended queues for arbitrary data. Data may be stored and retrieved by reference only. An extension for storage and retrieval by copy is planned. Requires C99, no dependencies, platform independent. BSD style license.
Mostly written in language not available
Licenses:
bsd
BSTlib
B
No analysis available
C library for balanced binary search tree storage. The library provides an API to create and use dynamic balanced binary search trees for arbitrary data. Data may be stored and retrieved by reference only. At present, AA trees and Splay trees are implemented. An implementation of Scapegoat trees is
Mostly written in language not available
Licenses:
bsd