vitalif
/
gf-complete
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

run wrap-and-sort -bast 

Signed-off-by: Shengjing Zhu <i@zhsj.me>
master
Shengjing Zhu 2018-03-29 15:07:14 +00:00
parent 8e230a7c85
commit 7ae1712e3e
1 changed files with 32 additions and 28 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

60
debian/control vendored
View File

@ -2,21 +2,43 @@ Source: gf-complete
Section: libs
Priority: optional
Maintainer: Thomas Goirand <zigo@debian.org>
Build-Depends: autoconf-archive,
autotools-dev,
debhelper (>= 9),
dh-autoreconf,
Build-Depends:
autoconf-archive,
autotools-dev,
debhelper (>= 9),
dh-autoreconf,
Standards-Version: 4.1.3
Homepage: http://jerasure.org/
Vcs-Git: https://anonscm.debian.org/git/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
Section: libdevel
Architecture: any
Depends: libgf-complete1 (= ${binary:Version}),
${misc:Depends},
${shlibs:Depends},
Depends:
libgf-complete1 (= ${binary:Version}),
${misc:Depends},
${shlibs:Depends},
Multi-Arch: same
Description: Galois Field Arithmetic - development files
Galois Field arithmetic forms the backbone of erasure-coded storage systems,
@ -34,8 +56,9 @@ Description: Galois Field Arithmetic - development files
Package: libgf-complete1
Architecture: any
Depends: ${misc:Depends},
${shlibs:Depends},
Depends:
${misc:Depends},
${shlibs:Depends},
Multi-Arch: same
Description: Galois Field Arithmetic - shared library
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.
.
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.