X-Git-Url: https://git.rkrishnan.org/?a=blobdiff_plain;f=fec.cabal;fp=fec.cabal;h=a0668ebcb8751d735118a6c17aad9aee95452403;hb=307b550ab0df85341b6fb662f4e1523d611d238b;hp=0000000000000000000000000000000000000000;hpb=82bb18a49a4813fa6618d69df11df34a4db50ead;p=tahoe-lafs%2Fzfec.git

diff --git a/fec.cabal b/fec.cabal
new file mode 100644
index 0000000..a0668eb
--- /dev/null
+++ b/fec.cabal
@@ -0,0 +1,30 @@
+name:            fec
+version:         0.1.1
+license:         GPL
+license-file:    README.rst
+author:          Adam Langley <agl@imperialviolet.org>
+maintainer:      Adam Langley <agl@imperialviolet.org>
+description:     This code, based on zfec by Zooko, based on code by Luigi
+		 Rizzo implements an erasure code, or forward error
+		 correction code. The most widely known example of an erasure
+		 code is the RAID-5 algorithm which makes it so that in the
+		 event of the loss of any one hard drive, the stored data can
+		 be completely recovered.  The algorithm in the zfec package
+		 has a similar effect, but instead of recovering from the loss
+		 of only a single element, it can be parameterized to choose in
+		 advance the number of elements whose loss it can tolerate.
+build-type:      Simple
+homepage:        http://allmydata.org/source/zfec
+synopsis:        Forward error correction of ByteStrings
+category:        Codec
+build-depends:   base, bytestring>=0.9
+stability:       provisional
+tested-with:     GHC == 6.8.2
+exposed-modules: Codec.FEC
+extensions:      ForeignFunctionInterface
+hs-source-dirs:  haskell
+ghc-options:     -Wall
+c-sources:       zfec/fec.c
+cc-options:      -std=c99
+include-dirs:    zfec
+extra-source-files: zfec/fec.h, COPYING.GPL, COPYING.TGPPL.rst