How to Install and Uninstall libgf-complete-dev Package on Ubuntu 20.10 (Groovy Gorilla)
Last updated: November 26,2024
1. Install "libgf-complete-dev" package
Please follow the guidelines below to install libgf-complete-dev on Ubuntu 20.10 (Groovy Gorilla)
$
sudo apt update
Copied
$
sudo apt install
libgf-complete-dev
Copied
2. Uninstall "libgf-complete-dev" package
Please follow the guidance below to uninstall libgf-complete-dev on Ubuntu 20.10 (Groovy Gorilla):
$
sudo apt remove
libgf-complete-dev
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libgf-complete-dev package on Ubuntu 20.10 (Groovy Gorilla)
Package: libgf-complete-dev
Architecture: amd64
Version: 1.0.2+2017.04.10.git.ea75cdf-3
Multi-Arch: same
Priority: extra
Section: libdevel
Source: gf-complete
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian OpenStack
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 27
Depends: libgf-complete1 (= 1.0.2+2017.04.10.git.ea75cdf-3)
Filename: pool/main/g/gf-complete/libgf-complete-dev_1.0.2+2017.04.10.git.ea75cdf-3_amd64.deb
Size: 5676
MD5sum: 6205fb2290d286889419106674585bcd
SHA1: 4be48919d94e7d3ab33248e3c484b97ee286a1e5
SHA256: 7a766820e238b01729e2cccb8014c703eb90dbc821dc221c667d330fd29565f7
SHA512: 5decee1e4fddf4edcb3d98d09022216a084cfd698a48072b82f067bc01e8d60540371ddf74042e842bf688c16edf1ee584321660a377567bfe8320641ee1ea0e
Homepage: http://jerasure.org/
Description-en: Galois Field Arithmetic - development files
Galois Field arithmetic forms the backbone of erasure-coded storage systems,
most famously the Reed-Solomon erasure code. A Galois Field is defined over
w-bit words and is termed GF(2w). As such, the elements of a Galois Field are
the integers 0, 1, . . ., 2^w − 1. Galois Field arithmetic defines addition
and multiplication over these closed sets of integers in such a way that they
work as you would hope they would work. Specifically, every number has a
unique multiplicative inverse. Moreover, there is a value, typically the value
2, which has the property that you can enumerate all of the non-zero elements
of the field by taking that value to successively higher powers.
.
This package contains the development files needed to build against the shared
library.
Description-md5: c9208c5bf2fca7bcffbb0c95c0d5122a
Architecture: amd64
Version: 1.0.2+2017.04.10.git.ea75cdf-3
Multi-Arch: same
Priority: extra
Section: libdevel
Source: gf-complete
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian OpenStack
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 27
Depends: libgf-complete1 (= 1.0.2+2017.04.10.git.ea75cdf-3)
Filename: pool/main/g/gf-complete/libgf-complete-dev_1.0.2+2017.04.10.git.ea75cdf-3_amd64.deb
Size: 5676
MD5sum: 6205fb2290d286889419106674585bcd
SHA1: 4be48919d94e7d3ab33248e3c484b97ee286a1e5
SHA256: 7a766820e238b01729e2cccb8014c703eb90dbc821dc221c667d330fd29565f7
SHA512: 5decee1e4fddf4edcb3d98d09022216a084cfd698a48072b82f067bc01e8d60540371ddf74042e842bf688c16edf1ee584321660a377567bfe8320641ee1ea0e
Homepage: http://jerasure.org/
Description-en: Galois Field Arithmetic - development files
Galois Field arithmetic forms the backbone of erasure-coded storage systems,
most famously the Reed-Solomon erasure code. A Galois Field is defined over
w-bit words and is termed GF(2w). As such, the elements of a Galois Field are
the integers 0, 1, . . ., 2^w − 1. Galois Field arithmetic defines addition
and multiplication over these closed sets of integers in such a way that they
work as you would hope they would work. Specifically, every number has a
unique multiplicative inverse. Moreover, there is a value, typically the value
2, which has the property that you can enumerate all of the non-zero elements
of the field by taking that value to successively higher powers.
.
This package contains the development files needed to build against the shared
library.
Description-md5: c9208c5bf2fca7bcffbb0c95c0d5122a