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
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
Ruby Algorithms and Containers
R
Analyzed 11 months ago
Using the right data structure or algorithm for the situation is an important aspect of programming. In computer science literature, many data structures and algorithms have been researched and extensively documented. However, there is still no standard library in Ruby implementing useful structures
Ruby Unified Queues
Analyzed 11 months ago
Unifies many queue implementations under the single interface. Includes both single queue libraries and multiple queue libraries.