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
patricia-trie
P
Analyzed about 9 hours ago
PATRICIA Trie
Practical Algorithm to Retrieve Information Coded in Alphanumeric
"A radix tree, Patricia trie/tree, or crit bit tree is a specialized set data structure based on the trie that is used to store a set of strings. In contrast with a regular trie, the edges of a Patricia trie are
Licenses:
apache_2
critbit-kd
C
Analyzed 1 day ago
Critical Bit tree for k-dimensional or arbitrary length keys
Licenses:
No declared licenses
Patricialib
P
No analysis available
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
Mostly written in language not available
Licenses:
bsd
hattrie
H
Analyzed about 16 hours ago
This a ANSI C99 implementation of the HAT-trie data structure of Askitis and Sinha, an extremely efficient (space and time) modern variant of tries.
The version implemented here maps arrays of bytes to words (i.e., unsigned longs), which can be used to store counts, pointers, etc, or not used at
Licenses:
No declared licenses
PH-Tree
P
Analyzed about 23 hours ago
The PH-Tree is a multi-dimensional spatial index structure. It is a 'trie' version of a quadtree. Properties: no rebalancing, ever. Depth limited to 64 nodes. Fast updates, window queries and kNN queries. Scales very well with large datasets (10M+) and prefers clustered data over evenly distributed
Licenses:
apache_2
Ruby Algorithms and Containers
R
Analyzed about 22 hours 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
trie keys - values
T
Analyzed about 21 hours ago
creates a compressed trie that maps keys to values and values to keys. Compression is on the front end of keys. Useful for lightweight reserved word creation in constrained memory/processor power situations. Written in C.
Licenses:
No declared licenses