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
DocSharePoint
D
Analyzed about 22 hours ago
Open Source Peer To Peer application based on pastry
Licenses:
gpl3_or_l...
uthash
Analyzed 22 days ago
This is a hash table, implemented in C, supporting constant-time add/find/remove of C structures. Any structure having a unique, arbitrarily-typed key member can be hashed by adding a UT_hash_handle member to the structure and calling these macros.
Licenses:
No declared licenses
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
C utility library (clib)
No analysis available
The C utility library implements extended features such as hash tables et cetera. It also offers the possibility to replace or override missing parts of the POSIX specification.
Mostly written in language not available
Licenses:
BSD-3-Clause
ATerm Library
Analyzed about 3 hours ago
ATerms are an efficient symbolic computation and exchange format. The core of the ATerm library is the C code that efficiently implements maximally shared (persistent, hash-consed) trees and lists, including an automatic generational garbage collector, and fast textual and binary serialization.
Licenses:
BSD-3-Clause, lgpl