gf-complete 1.0.2+2017.04.10.git.ea75cdf-5 source package in Ubuntu
Changelog
gf-complete (1.0.2+2017.04.10.git.ea75cdf-5) unstable; urgency=medium
[ Thomas Goirand ]
* Apply patch from Kaminskiy for SSE runtime detection (Closes: #921874).
Thanks to him, and see below for details.
[ Yuriy M. Kaminskiy ]
* Fix i386 simd compilation.
* Fix runtime cpudetection.
* Fix neon for armhf.
* Run complete test suite under qemu.
[ Ondřej Nový ]
* Removing gbp.conf, not used anymore or should be specified in the
developers dotfiles
* Use debhelper-compat instead of debian/compat.
-- Thomas Goirand <email address hidden> Tue, 16 Nov 2021 15:06:51 +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 | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| gf-complete_1.0.2+2017.04.10.git.ea75cdf-5.dsc | 2.3 KiB | cb93e606400b6d3a44b347758d87e49b2592faa15411706429e4b6ab6e726d4c |
| 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-5.debian.tar.xz | 9.5 KiB | e98d81c96657d06e404e420179a8a7853b1ecdd83f70f356bccb466927c60d4e |
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
