parent
8e230a7c85
commit
7ae1712e3e
|
@ -2,21 +2,43 @@ Source: gf-complete
|
||||||
Section: libs
|
Section: libs
|
||||||
Priority: optional
|
Priority: optional
|
||||||
Maintainer: Thomas Goirand <zigo@debian.org>
|
Maintainer: Thomas Goirand <zigo@debian.org>
|
||||||
Build-Depends: autoconf-archive,
|
Build-Depends:
|
||||||
autotools-dev,
|
autoconf-archive,
|
||||||
debhelper (>= 9),
|
autotools-dev,
|
||||||
dh-autoreconf,
|
debhelper (>= 9),
|
||||||
|
dh-autoreconf,
|
||||||
Standards-Version: 4.1.3
|
Standards-Version: 4.1.3
|
||||||
Homepage: http://jerasure.org/
|
Homepage: http://jerasure.org/
|
||||||
Vcs-Git: https://anonscm.debian.org/git/openstack/gf-complete.git
|
Vcs-Git: https://anonscm.debian.org/git/openstack/gf-complete.git
|
||||||
Vcs-Browser: https://anonscm.debian.org/cgit/openstack/gf-complete.git/
|
Vcs-Browser: https://anonscm.debian.org/cgit/openstack/gf-complete.git/
|
||||||
|
|
||||||
|
Package: gf-complete-tools
|
||||||
|
Section: math
|
||||||
|
Architecture: any
|
||||||
|
Depends:
|
||||||
|
libgf-complete1 (= ${binary:Version}),
|
||||||
|
${misc:Depends},
|
||||||
|
${shlibs:Depends},
|
||||||
|
Description: 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(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 miscellaneous tools for working with gf-complete.
|
||||||
|
|
||||||
Package: libgf-complete-dev
|
Package: libgf-complete-dev
|
||||||
Section: libdevel
|
Section: libdevel
|
||||||
Architecture: any
|
Architecture: any
|
||||||
Depends: libgf-complete1 (= ${binary:Version}),
|
Depends:
|
||||||
${misc:Depends},
|
libgf-complete1 (= ${binary:Version}),
|
||||||
${shlibs:Depends},
|
${misc:Depends},
|
||||||
|
${shlibs:Depends},
|
||||||
Multi-Arch: same
|
Multi-Arch: same
|
||||||
Description: Galois Field Arithmetic - development files
|
Description: Galois Field Arithmetic - development files
|
||||||
Galois Field arithmetic forms the backbone of erasure-coded storage systems,
|
Galois Field arithmetic forms the backbone of erasure-coded storage systems,
|
||||||
|
@ -34,8 +56,9 @@ Description: Galois Field Arithmetic - development files
|
||||||
|
|
||||||
Package: libgf-complete1
|
Package: libgf-complete1
|
||||||
Architecture: any
|
Architecture: any
|
||||||
Depends: ${misc:Depends},
|
Depends:
|
||||||
${shlibs:Depends},
|
${misc:Depends},
|
||||||
|
${shlibs:Depends},
|
||||||
Multi-Arch: same
|
Multi-Arch: same
|
||||||
Description: Galois Field Arithmetic - shared library
|
Description: Galois Field Arithmetic - shared library
|
||||||
Galois Field arithmetic forms the backbone of erasure-coded storage systems,
|
Galois Field arithmetic forms the backbone of erasure-coded storage systems,
|
||||||
|
@ -49,22 +72,3 @@ Description: Galois Field Arithmetic - shared library
|
||||||
of the field by taking that value to successively higher powers.
|
of the field by taking that value to successively higher powers.
|
||||||
.
|
.
|
||||||
This package contains the shared library.
|
This package contains the shared library.
|
||||||
|
|
||||||
Package: gf-complete-tools
|
|
||||||
Section: math
|
|
||||||
Architecture: any
|
|
||||||
Depends: libgf-complete1 (= ${binary:Version}),
|
|
||||||
${misc:Depends},
|
|
||||||
${shlibs:Depends},
|
|
||||||
Description: 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(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 miscellaneous tools for working with gf-complete.
|
|
||||||
|
|
Loading…
Reference in New Issue