Tags : Browse Projects

Select a tag to browse associated projects and drill deeper into the tag cloud.

M2Collections

Compare

  Analyzed 17 days ago

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 ... [More] retrieved by reference or by copy, with built-in reference counting. All other ADTs allow data to be stored and retrieved by reference only. The library follows PIM4, it has no dependencies and it is platform independent. The library is tested with GM2 using option 'fpim4'. Under development. BSD style license. [Less]

1.74K lines of code

0 current contributors

over 2 years since last commit

5 users on Open Hub

Inactive
5.0
 
I Use This

DASlib

Compare

  Analyzed 17 days ago

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.

214 lines of code

0 current contributors

almost 8 years since last commit

2 users on Open Hub

Inactive
5.0
 
I Use This

DEQlib

Compare

  Analyzed 17 days ago

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.

240 lines of code

0 current contributors

almost 8 years since last commit

1 users on Open Hub

Inactive
5.0
 
I Use This

FIFOlib

Compare

  Analyzed 17 days ago

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.

152 lines of code

0 current contributors

almost 8 years since last commit

1 users on Open Hub

Inactive
5.0
 
I Use This

KVSlib

Compare

  Analyzed 12 days ago

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. ... [More] Requires C99, no dependencies, platform independent. BSD style license. [Less]

706 lines of code

0 current contributors

about 8 years since last commit

1 users on Open Hub

Inactive
5.0
 
I Use This

LIFOlib

Compare

  Analyzed 17 days ago

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.

322 lines of code

0 current contributors

almost 8 years since last commit

1 users on Open Hub

Inactive
5.0
 
I Use This

PQlib

Compare

  Analyzed 12 days ago

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.

272 lines of code

0 current contributors

over 5 years since last commit

1 users on Open Hub

Inactive
5.0
 
I Use This

Patricialib

Compare

  Analyzed 17 days ago

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 ... [More] semantics. Requires C99, no dependencies, platform independent. Work in progress. BSD style license. [Less]

344 lines of code

0 current contributors

almost 8 years since last commit

1 users on Open Hub

Inactive
0.0
 
I Use This

SETlib

Compare

  Analyzed 17 days ago

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.

294 lines of code

0 current contributors

almost 8 years since last commit

1 users on Open Hub

Inactive
5.0
 
I Use This

BSTlib

Compare

  Analyzed 17 days ago

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 ... [More] planned. Requires C99, no dependencies, platform independent. BSD style license. [Less]

557 lines of code

0 current contributors

almost 8 years since last commit

1 users on Open Hub

Inactive
5.0
 
I Use This