Ubuntu
golang-github-ryszard-goskiplist package

golang-github-ryszard-goskiplist 0.0~git20150312.2dfbae5-3 source package in Ubuntu

Changelog

golang-github-ryszard-goskiplist (0.0~git20150312.2dfbae5-3) unstable; urgency=medium

  [ Debian Janitor ]
  * Set upstream metadata fields: Bug-Database, Bug-Submit.
  * Update standards version to 4.5.0, no changes needed.

 -- Jelmer Vernooij <email address hidden>  Tue, 29 Nov 2022 19:16:28 +0000

Upload details

Uploaded by:
Debian Go Packaging Team
Uploaded to:
Sid
Original maintainer:
Debian Go Packaging Team
Architectures:
all
Section:
golang
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Oracular release universe misc
Noble release universe misc
Mantic release universe misc
Lunar release universe misc

Builds

Lunar: [FULLYBUILT] amd64

Downloads

File Size SHA-256 Checksum
golang-github-ryszard-goskiplist_0.0~git20150312.2dfbae5-3.dsc 2.4 KiB d269ccdad0c9d9eeaa1f0658ff27917d5479415b14acbea327d94edf03862842
golang-github-ryszard-goskiplist_0.0~git20150312.2dfbae5.orig.tar.xz 12.7 KiB 6225dc806e5bed291ea8d2e746636de76a21e5cb85609deb3b4d8aa9272d36d7
golang-github-ryszard-goskiplist_0.0~git20150312.2dfbae5-3.debian.tar.xz 2.2 KiB 5c5f611d83328fc5c4768c498561c5a79db7a086a3668dbbe1d6050f1d4772ce

No changes file available.

Binary packages built by this source

golang-github-ryszard-goskiplist-dev: A skip list implementation in Go

 This is a library implementing skip lists for the Go programming
 language (http://golang.org/).
 .
 Skip lists are a data structure that can be used in place of balanced
 trees. Skip lists use probabilistic balancing rather than strictly
 enforced balancing and as a result the algorithms for insertion and
 deletion in skip lists are much simpler and significantly faster than
 equivalent algorithms for balanced trees.
 .
 Skip lists were first described in Pugh, William (June 1990)
 (ftp://ftp.cs.umd.edu/pub/skipLists/skiplists.pdf). "Skip lists:
 a probabilistic alternative to balanced trees". Communications of the
 ACM 33 (6): 668–676