toutes les options
buster  ] [  bullseye  ] [  bookworm  ] [  trixie  ] [  sid  ]
[ Paquet source : golang-github-petar-gollrb  ]

Paquet : golang-github-petar-gollrb-dev (0.0~git20130427.0.53be0d3+dfsg-7)

Liens pour golang-github-petar-gollrb-dev

Screenshot

Ressources Debian :

Télécharger le paquet source golang-github-petar-gollrb :

Responsable :

Ressources externes :

Paquets similaires :

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.

Télécharger golang-github-petar-gollrb-dev

Télécharger pour toutes les architectures proposées
Architecture Taille du paquet Espace occupé une fois installé Fichiers
all 11,4 ko45,0 ko [liste des fichiers]