Ubuntu
golang-github-petar-gollrb package

golang-github-petar-gollrb 0.0~git20130427.0.53be0d3+dfsg-6 source package in Ubuntu

Changelog

golang-github-petar-gollrb (0.0~git20130427.0.53be0d3+dfsg-6) unstable; urgency=medium

  * QA upload.
  * UNRELEASED

 -- Jelmer Vernooij <email address hidden>  Wed, 25 May 2022 12:09:50 +0100

Upload details

Uploaded by:
Debian QA Group
Uploaded to:
Sid
Original maintainer:
Debian QA Group
Architectures:
all
Section:
golang
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Builds

Kinetic: [FULLYBUILT] amd64

Downloads

File Size SHA-256 Checksum
golang-github-petar-gollrb_0.0~git20130427.0.53be0d3+dfsg-6.dsc 2.3 KiB 7bc72c2dad9f90a1139d26948a04a0520850813e18ff551b637c599ac31cd40e
golang-github-petar-gollrb_0.0~git20130427.0.53be0d3+dfsg.orig.tar.xz 8.8 KiB 05b03b030ce45dd5e9ba210d5d6f203f197ad21808ff56d80303c706c22be3c5
golang-github-petar-gollrb_0.0~git20130427.0.53be0d3+dfsg-6.debian.tar.xz 2.8 KiB 713a82a8cb71d02dd86c180443454b836535ed7339592d1acb9c647b9177316e

No changes file available.

Binary packages built by this source

golang-github-petar-gollrb-dev: 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.