How to Install and Uninstall golang-github-petar-gollrb-dev Package on Kali Linux
Last updated: November 26,2024
1. Install "golang-github-petar-gollrb-dev" package
This is a short guide on how to install golang-github-petar-gollrb-dev on Kali Linux
$
sudo apt update
Copied
$
sudo apt install
golang-github-petar-gollrb-dev
Copied
2. Uninstall "golang-github-petar-gollrb-dev" package
Please follow the instructions below to uninstall golang-github-petar-gollrb-dev on Kali Linux:
$
sudo apt remove
golang-github-petar-gollrb-dev
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the golang-github-petar-gollrb-dev package on Kali Linux
Package: golang-github-petar-gollrb-dev
Source: golang-github-petar-gollrb
Version: 0.0~git20130427.0.53be0d3+dfsg-7
Installed-Size: 45
Maintainer: Debian QA Group
Architecture: all
Size: 11652
SHA256: f32b15a5bdffbf95b6ca7c7e436938749fe9164a7b169d6fef91e666c4f3510f
SHA1: c8d3cb4722ed9a5f71b888244fcd50db16e47bed
MD5sum: befa4c3a774438935b5344bd98ddcc98
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.
Description-md5:
Multi-Arch: foreign
Homepage: https://github.com/petar/gollrb
Section: golang
Priority: optional
Filename: pool/main/g/golang-github-petar-gollrb/golang-github-petar-gollrb-dev_0.0~git20130427.0.53be0d3+dfsg-7_all.deb
Source: golang-github-petar-gollrb
Version: 0.0~git20130427.0.53be0d3+dfsg-7
Installed-Size: 45
Maintainer: Debian QA Group
Architecture: all
Size: 11652
SHA256: f32b15a5bdffbf95b6ca7c7e436938749fe9164a7b169d6fef91e666c4f3510f
SHA1: c8d3cb4722ed9a5f71b888244fcd50db16e47bed
MD5sum: befa4c3a774438935b5344bd98ddcc98
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.
Description-md5:
Multi-Arch: foreign
Homepage: https://github.com/petar/gollrb
Section: golang
Priority: optional
Filename: pool/main/g/golang-github-petar-gollrb/golang-github-petar-gollrb-dev_0.0~git20130427.0.53be0d3+dfsg-7_all.deb