[ 原始碼： golang-github-petar-gollrb ]
套件：golang-github-petar-gollrb-dev（0.0~git20130427.0.53be0d3+dfsg-5）
golang-github-petar-gollrb-dev 的相關連結
Debian 的資源：
下載原始碼套件 golang-github-petar-gollrb：
- [golang-github-petar-gollrb_0.0~git20130427.0.53be0d3+dfsg-5.dsc]
- [golang-github-petar-gollrb_0.0~git20130427.0.53be0d3+dfsg.orig.tar.xz]
- [golang-github-petar-gollrb_0.0~git20130427.0.53be0d3+dfsg-5.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.