How to Install and Uninstall golang-github-steveyen-gtreap-dev Package on Ubuntu 20.10 (Groovy Gorilla)

Last updated: May 06,2024

1. Install "golang-github-steveyen-gtreap-dev" package

This tutorial shows how to install golang-github-steveyen-gtreap-dev on Ubuntu 20.10 (Groovy Gorilla)

$ sudo apt update $ sudo apt install golang-github-steveyen-gtreap-dev

2. Uninstall "golang-github-steveyen-gtreap-dev" package

Please follow the guidelines below to uninstall golang-github-steveyen-gtreap-dev on Ubuntu 20.10 (Groovy Gorilla):

$ sudo apt remove golang-github-steveyen-gtreap-dev $ sudo apt autoclean && sudo apt autoremove

3. Information about the golang-github-steveyen-gtreap-dev package on Ubuntu 20.10 (Groovy Gorilla)

Package: golang-github-steveyen-gtreap-dev
Architecture: all
Version: 0.0~git20150807.0.0abe01e-4
Priority: extra
Section: universe/devel
Source: golang-github-steveyen-gtreap
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: QA Group
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 29
Filename: pool/universe/g/golang-github-steveyen-gtreap/golang-github-steveyen-gtreap-dev_0.0~git20150807.0.0abe01e-4_all.deb
Size: 6552
MD5sum: 3931d61014436e6ca68af08a28037bad
SHA1: 7cf7191fc28806aecc33f218c1e3f05a4a6c1844
SHA256: 939b9165cfecd0ac2f71149fd008c2eb19f81ec730ba9dbd1e30e95135fca065
SHA512: 58b0961aa95d93e7ca065794372b9920048169006e8943750c5286bc2ca7fb3dbb6871abd6deab47a61262f2795fd8b89e2bffd0e687e509892ffda9c31f4524
Homepage: https://github.com/steveyen/gtreap
Description-en: gtreap is an immutable treap implementation in the Go Language
Gtreap implements an immutable treap data structure in golang.
.
By treap, this data structure is both a heap and a binary search tree.
.
By immutable, any updates/deletes to a treap will return a new treap
which can share internal nodes with the previous treap. All nodes in this
implementation are read-only after their creation. This allows concurrent
readers to operate safely with concurrent writers as modifications only
create new data structures and never modify existing data structures.
This is a simple approach to achieving MVCC or multi-version concurrency
control.
.
By heap, items in the treap follow the heap-priority property, where a
parent node will have higher priority than its left and right children
nodes.
.
By binary search tree, items are store lexigraphically, ordered by a
user-supplied Compare function.
Description-md5: 569db9d1a8793d5752f9afb88aa05688