How to Install and Uninstall golang-github-steveyen-gtreap-dev Package on Ubuntu 21.10 (Impish Indri)
Last updated: December 29,2024
1. Install "golang-github-steveyen-gtreap-dev" package
Please follow the guidelines below to install golang-github-steveyen-gtreap-dev on Ubuntu 21.10 (Impish Indri)
$
sudo apt update
Copied
$
sudo apt install
golang-github-steveyen-gtreap-dev
Copied
2. Uninstall "golang-github-steveyen-gtreap-dev" package
In this section, we are going to explain the necessary steps to uninstall golang-github-steveyen-gtreap-dev on Ubuntu 21.10 (Impish Indri):
$
sudo apt remove
golang-github-steveyen-gtreap-dev
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the golang-github-steveyen-gtreap-dev package on Ubuntu 21.10 (Impish Indri)
Package: golang-github-steveyen-gtreap-dev
Architecture: all
Version: 0.0~git20150807.0.0abe01e-5
Priority: extra
Section: universe/devel
Source: golang-github-steveyen-gtreap
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian 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-5_all.deb
Size: 6860
MD5sum: dd865284cf1aafcd89e40a3f066253c1
SHA1: 6f69455479b3a2f2b7ca7b15683b638da566b293
SHA256: 9ec5db15c019d349998b32148815d859386bec484c6016acaea4411a7031d27c
SHA512: 35fc6ae743f74edf087d7477e7ae97ba5b7a1edeefcd08ef4ddef06c3a5a0a22f54593f3060d6b81abbc2de9c24e60acd90d0b0ca2f12fbb33d54d21ab003d45
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
Architecture: all
Version: 0.0~git20150807.0.0abe01e-5
Priority: extra
Section: universe/devel
Source: golang-github-steveyen-gtreap
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian 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-5_all.deb
Size: 6860
MD5sum: dd865284cf1aafcd89e40a3f066253c1
SHA1: 6f69455479b3a2f2b7ca7b15683b638da566b293
SHA256: 9ec5db15c019d349998b32148815d859386bec484c6016acaea4411a7031d27c
SHA512: 35fc6ae743f74edf087d7477e7ae97ba5b7a1edeefcd08ef4ddef06c3a5a0a22f54593f3060d6b81abbc2de9c24e60acd90d0b0ca2f12fbb33d54d21ab003d45
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