1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
|
Source: golang-github-petar-gollrb
Section: devel
Priority: extra
Maintainer: QA Group <packages@qa.debian.org>
Build-Depends: debhelper (>= 10),
dh-golang,
golang-any
Standards-Version: 4.1.0
Homepage: https://github.com/petar/gollrb
Vcs-Browser: https://anonscm.debian.org/cgit/pkg-go/packages/golang-github-petar-gollrb.git
Vcs-Git: https://anonscm.debian.org/git/pkg-go/packages/golang-github-petar-gollrb.git
Testsuite: autopkgtest-pkg-go
XS-Go-Import-Path: github.com/petar/GoLLRB
Package: golang-github-petar-gollrb-dev
Architecture: all
Depends: ${shlibs:Depends},
${misc:Depends}
Description: 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.
|
