Select a tag to browse associated projects and drill deeper into the tag cloud.
SETlib
S
No analysis available
C library for sets. The library provides an API to create and use sets and associated set iterators. Requires C99, no dependencies, platform independent. BSD style license.
Mostly written in language not available
Licenses:
bsd
JUtil
Analyzed about 17 hours ago
JUtil is a fully-parameterized (generic) collections library for Java. It was originally part of the FLEX compiler infrastructure.
fastutil
F
No analysis available
fastutil extends the Java™ Collections Framework by providing type-specific maps, sets, lists and queues with a small memory footprint and fast access and insertion; provides also big (64-bit) arrays, sets and lists, and fast, practical I/O classes for binary and text files.
Mostly written in language not available
Licenses:
apache_2
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
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
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
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
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
Minids
Analyzed about 12 hours ago
C library implementing basic data structures like stacks, queues, binary search trees, etc.