| 1 |
Source: haskell-bitwise |
| 2 |
Maintainer: Debian Haskell Group <[email protected]> |
| 3 |
Uploaders: Scott Talbert <[email protected]> |
| 4 |
Priority: optional |
| 5 |
Section: haskell |
| 6 |
Build-Depends: debhelper-compat (= 13), |
| 7 |
haskell-devscripts (>= 0.13), |
| 8 |
dh-sequence-haskell, |
| 9 |
ghc (>= 9.10), |
| 10 |
ghc-prof, |
| 11 |
libghc-quickcheck2-dev (>= 2.4), |
| 12 |
libghc-quickcheck2-dev (<< 2.16), |
| 13 |
Build-Depends-Indep: ghc-doc, |
| 14 |
Standards-Version: 4.7.0 |
| 15 |
Homepage: https://code.mathr.co.uk/bitwise |
| 16 |
Vcs-Browser: https://salsa.debian.org/haskell-team/DHG_packages/tree/master/p/haskell-bitwise |
| 17 |
Vcs-Git: https://salsa.debian.org/haskell-team/DHG_packages.git [p/haskell-bitwise] |
| 18 |
X-Description: fast multi-dimensional unboxed bit packed Bool arrays |
| 19 |
Unboxed multidimensional bit packed Bool arrays with fast aggregate |
| 20 |
operations based on lifting Bool operations to bitwise operations. |
| 21 |
. |
| 22 |
There are many other bit packed structures out there, but none met |
| 23 |
all of these requirements: |
| 24 |
. |
| 25 |
(1) unboxed bit packed Bool array, |
| 26 |
. |
| 27 |
(2) multi-dimensional indexing, |
| 28 |
. |
| 29 |
(3) fast (de)serialization, or interoperable with foreign code, |
| 30 |
. |
| 31 |
(4) fast aggregate operations (fold, map, zip). |
| 32 |
. |
| 33 |
Quick tour of the bitwise library: |
| 34 |
. |
| 35 |
[Data.Bits.Bitwise] Lift boolean operations on 'Bool' to bitwise |
| 36 |
operations on 'Data.Bits.Bits'. |
| 37 |
. |
| 38 |
[Data.Array.BitArray] Immutable bit arrays. |
| 39 |
. |
| 40 |
[Data.Array.BitArray.ST] Mutable bit arrays in 'Control.Monad.ST.ST'. |
| 41 |
. |
| 42 |
[Data.Array.BitArray.IO] Mutable bit arrays in 'IO'. |
| 43 |
. |
| 44 |
[Data.Array.BitArray.ByteString] (De)serialization. |
| 45 |
. |
| 46 |
[Codec.Image.PBM] Portable bitmap monochrome 2D image format. |
| 47 |
. |
| 48 |
Very rough performance benchmarks: |
| 49 |
. |
| 50 |
* immutable random access single bit reads: |
| 51 |
@BitArray ix@ is about 40% slower than @UArray ix Bool@, |
| 52 |
. |
| 53 |
* 'Control.Monad.ST.ST' mutable random access single bit reads: |
| 54 |
@STBitArray s ix@ is about the same as @STUArray s ix Bool@, |
| 55 |
. |
| 56 |
* immutable map @Bool -> Bool@: |
| 57 |
@BitArray ix@ is about 85x faster than @UArray ix Bool@, |
| 58 |
. |
| 59 |
* immutable zipWith @Bool -> Bool -> Bool@: |
| 60 |
@BitArray ix@ is about 1300x faster than @UArray ix Bool@. |
| 61 |
|
| 62 |
Package: libghc-bitwise-dev |
| 63 |
Architecture: any |
| 64 |
Depends: ${haskell:Depends}, |
| 65 |
${misc:Depends}, |
| 66 |
${shlibs:Depends}, |
| 67 |
Recommends: ${haskell:Recommends}, |
| 68 |
Suggests: ${haskell:Suggests}, |
| 69 |
Conflicts: ${haskell:Conflicts}, |
| 70 |
Provides: ${haskell:Provides}, |
| 71 |
Description: ${haskell:ShortDescription}${haskell:ShortBlurb} |
| 72 |
${haskell:LongDescription} |
| 73 |
. |
| 74 |
${haskell:Blurb} |
| 75 |
|
| 76 |
Package: libghc-bitwise-prof |
| 77 |
Architecture: any |
| 78 |
Depends: ${haskell:Depends}, |
| 79 |
${misc:Depends}, |
| 80 |
Recommends: ${haskell:Recommends}, |
| 81 |
Suggests: ${haskell:Suggests}, |
| 82 |
Conflicts: ${haskell:Conflicts}, |
| 83 |
Provides: ${haskell:Provides}, |
| 84 |
Description: ${haskell:ShortDescription}${haskell:ShortBlurb} |
| 85 |
${haskell:LongDescription} |
| 86 |
. |
| 87 |
${haskell:Blurb} |
| 88 |
|
| 89 |
Package: libghc-bitwise-doc |
| 90 |
Architecture: all |
| 91 |
Section: doc |
| 92 |
Depends: ${haskell:Depends}, |
| 93 |
${misc:Depends}, |
| 94 |
Recommends: ${haskell:Recommends}, |
| 95 |
Suggests: ${haskell:Suggests}, |
| 96 |
Conflicts: ${haskell:Conflicts}, |
| 97 |
Description: ${haskell:ShortDescription}${haskell:ShortBlurb} |
| 98 |
${haskell:LongDescription} |
| 99 |
. |
| 100 |
${haskell:Blurb} |