Ubuntu
gf-complete package

gf-complete 1.0.2+2017.04.10.git.ea75cdf-6 source package in Ubuntu

Changelog

gf-complete (1.0.2+2017.04.10.git.ea75cdf-6) unstable; urgency=medium

  * Reverse previous changes, as it broke build on Arm.

 -- Thomas Goirand <email address hidden>  Thu, 18 Nov 2021 10:47:05 +0100

Upload details

Uploaded by:
Debian OpenStack
Uploaded to:
Sid
Original maintainer:
Debian OpenStack
Architectures:
any
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
gf-complete_1.0.2+2017.04.10.git.ea75cdf-6.dsc 2.3 KiB 3e7feb8811c6cf08c0841c63697b196d014f13a39b43c42b25e55b751dd12f5a
gf-complete_1.0.2+2017.04.10.git.ea75cdf.orig.tar.xz 289.0 KiB 6a11e814556bda953c59510e893763bafafd346e05995c3c0fc6c0153c220069
gf-complete_1.0.2+2017.04.10.git.ea75cdf-6.debian.tar.xz 4.7 KiB 7cf414c5b7ad3098e1995e48ad6b67d639bc94d5d084f0e4469ce857aaabc453

Available diffs

No changes file available.

Binary packages built by this source

gf-complete-tools: Galois Field Arithmetic - tools

 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(2^w). 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 miscellaneous tools for working with gf-complete.

gf-complete-tools-dbgsym: debug symbols for gf-complete-tools
libgf-complete-dev: 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(2^w). 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.

libgf-complete1: Galois Field Arithmetic - shared library

 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(2^w). 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 shared library.

libgf-complete1-dbgsym: debug symbols for libgf-complete1