rbtree
A RBTree is a sorted associative collection that is implemented with a Red-Black Tree. It maps keys to values like a Hash, but maintains its elements in ascending key order. The interface is the almost identical to that of Hash.
Activity
- Latest release
- 2mo ago
- Total releases
- 11
- Cadence
- ~11 months
- Last 12 months
- 1
Details
- License
- MIT
- First release
- Feb 04, 2008
Releases
| Version | Released | |
|---|---|---|
0.4.7
patch
|
0.4.7
patch
|
|
0.4.6
patch
|
0.4.6
patch
|
|
0.4.5
patch
|
0.4.5
patch
|
|
0.4.4
patch
|
0.4.4
patch
|
|
0.4.3
patch
|
0.4.3
patch
|
|
0.4.2
patch
|
0.4.2
patch
|
|
0.4.1
patch
|
0.4.1
patch
|
|
0.4.0
minor
|
0.4.0
minor
|
|
0.3.0
minor
|
0.3.0
minor
|
|
0.2.1
patch
|
0.2.1
patch
|
|
0.2.0
initial
|
0.2.0
initial
|