[ 源代码： golang-github-petar-gollrb ]
软件包：golang-github-petar-gollrb-dev（0.0~git20130427.0.53be0d3+dfsg-7）
golang-github-petar-gollrb-dev 的相关链接
Debian 的资源：
下载源码包 golang-github-petar-gollrb：
- [golang-github-petar-gollrb_0.0~git20130427.0.53be0d3+dfsg-7.dsc]
- [golang-github-petar-gollrb_0.0~git20130427.0.53be0d3+dfsg.orig.tar.xz]
- [golang-github-petar-gollrb_0.0~git20130427.0.53be0d3+dfsg-7.debian.tar.xz]
维护者：
外部的资源：
- 主页 [github.com]
相似软件包：
LLRB implementation of balanced binary search trees for Go
GoLLRB is a Left-Leaning Red-Black (LLRB) implementation of 2-3 balanced binary search trees in Go the Language.
2-3 trees (a type of BBST's), as well as the runtime-similar 2-3-4 trees, are the de facto standard BBST algorithms found in implementations of Python, Java, and other libraries. The LLRB method of implementing 2-3 trees is a recent improvement over the traditional implementation. The LLRB approach was discovered relatively recently (in 2008) by Robert Sedgewick of Princeton University.