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]
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.
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.
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.
Queued JSON-RPC client and server. Works as normal RPC server, but through queue interface, so allows highly scalable, distributed and asynchronous remote API implementation and fast data processing. It's based on EventMachine and Beanstalk, so it's fast and thread safe.
This site uses cookies to give you the best possible experience.
By using the site, you consent to our use of cookies.
For more information, please see our
Privacy Policy