全部搜索项
buster  ] [  bullseye  ] [  bookworm  ] [  sid  ]
[ 源代码: golang-github-petar-gollrb  ]

软件包:golang-github-petar-gollrb-dev(0.0~git20130427.0.53be0d3+dfsg-5)

golang-github-petar-gollrb-dev 的相关链接

Screenshot

Debian 的资源:

下载源码包 golang-github-petar-gollrb

维护者:

外部的资源:

相似软件包:

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.

下载 golang-github-petar-gollrb-dev

下载可用于所有硬件架构的
硬件架构 软件包大小 安装后大小 文件
all 11.4 kB45.0 kB [文件列表]