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
django-treebeard
D
No analysis available
django-treebeard is a library that implements efficient tree implementations for the Django Web Framework 1.0+, written by Gustavo Picón and licensed under the Apache License 2.0.
django-treebeard is:
- Flexible: Includes 3 different tree implementations
- with the same API:
1.
Mostly written in language not available
Licenses:
apache_2
Qtilities
Analyzed 11 months ago
Qtilities is a set of Qt C++ libraries which provides building blocks for Qt applications, allowing rapid application development.
Licenses:
Commercial, gpl3
OpenTreeMap
O
Analyzed 12 months ago
Urban street trees have myriad proven benefits for communities including providing shade, improving air quality, assisting with stormwater runoff, raising property values, decreasing utility bills, and enhancing the look and feel of communities. While tree inventories provide municipalities with
Licenses:
gpl3_or_l...
BSTlib
B
No analysis available
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
Mostly written in language not available
Licenses:
bsd
Rbppavl - PHP AVL binary search tree
R
Analyzed 11 months ago
PHP AVL binary search tree.
A set of PHP classes implementing binary search trees that comply to AVL rules. The API exposes methods for tree operations (insert, replace, delete, find), and for inorder traversal (find, first, last, prev, next, curr). Tree and traversal operations implement relaxed
ATerm Library
Analyzed 11 months 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
django-admirarchy
Analyzed 11 months ago
Django Admin addon to navigate through hierarchies.
Licenses:
BSD-3-Clause