Ubuntu
gf-complete package

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

Changelog

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

  [ Shengjing Zhu ]
  * Reenable non-SSE4 tests.
  * Build with -O1 (Closes: #1012935)
    To ensure gcc-12 won't optimize itself to generate SSE instruction.
    All SSE optimizations are implemented manually with runtime dispatch.

 -- Thomas Goirand <email address hidden>  Tue, 11 Oct 2022 09:21:54 +0200

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
Mantic release main misc
Lunar release main misc

Downloads

File Size SHA-256 Checksum
gf-complete_1.0.2+2017.04.10.git.ea75cdf-9.dsc 2.3 KiB bd5161536a3a580b70b8fc35f5506dfc3a89f81ed7ac97beab732f203b8587dc
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-9.debian.tar.xz 4.9 KiB af07a01acbcd3ab64de2b3672c032e0ad2b981369f1301116f6ebf811ae50e6e

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: No summary available for libgf-complete1 in ubuntu noble.

No description available for libgf-complete1 in ubuntu noble.

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