haskell-bitwise 1.0.0.1-3build1 source package in Ubuntu
Changelog
haskell-bitwise (1.0.0.1-3build1) oracular; urgency=medium * Rebuild against new GHC ABIs. -- Gianfranco Costamagna <email address hidden> Wed, 15 May 2024 11:11:36 +0200
Upload details
- Uploaded by:
- Gianfranco Costamagna
- Uploaded to:
- Oracular
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Oracular | release | universe | misc |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
haskell-bitwise_1.0.0.1.orig.tar.gz | 16.1 KiB | 76ae082a9f1950555dae8f1fb57ac6a7da85f30114b2f252dd2fa5e567fbbe0f |
haskell-bitwise_1.0.0.1-3build1.debian.tar.xz | 3.1 KiB | 746ec0031da68708a24d2076c2546c699b2735ae6b9a5d95ae65c1f3a9d6dabd |
haskell-bitwise_1.0.0.1-3build1.dsc | 2.3 KiB | 49d50fed536697f07a46cdde4fd7410bcd19b1691f0bf7a0bd08341b8e9a3c3c |
Available diffs
Binary packages built by this source
- libghc-bitwise-dev: fast multi-dimensional unboxed bit packed Bool arrays
Unboxed multidimensional bit packed Bool arrays with fast aggregate
operations based on lifting Bool operations to bitwise operations.
.
There are many other bit packed structures out there, but none met
all of these requirements:
.
(1) unboxed bit packed Bool array,
.
(2) multi-dimensional indexing,
.
(3) fast (de)serialization, or interoperable with foreign code,
.
(4) fast aggregate operations (fold, map, zip).
.
Quick tour of the bitwise library:
.
[Data.Bits.Bitwise] Lift boolean operations on 'Bool' to bitwise
operations on 'Data.Bits.Bits'.
.
[Data.Array.BitArray] Immutable bit arrays.
.
[Data.Array.BitArray. ST] Mutable bit arrays in 'Control. Monad.ST. ST'.
.
[Data.Array.BitArray. IO] Mutable bit arrays in 'IO'.
.
[Data.Array.BitArray. ByteString] (De)serialization.
.
[Codec.Image.PBM] Portable bitmap monochrome 2D image format.
.
Very rough performance benchmarks:
.
* immutable random access single bit reads:
@BitArray ix@ is about 40% slower than @UArray ix Bool@,
.
* 'Control.Monad.ST. ST' mutable random access single bit reads:
@STBitArray s ix@ is about the same as @STUArray s ix Bool@,
.
* immutable map @Bool -> Bool@:
@BitArray ix@ is about 85x faster than @UArray ix Bool@,
.
* immutable zipWith @Bool -> Bool -> Bool@:
@BitArray ix@ is about 1300x faster than @UArray ix Bool@.
.
This package provides a library for the Haskell programming language.
See http://www.haskell. org/ for more information on Haskell.
- libghc-bitwise-doc: fast multi-dimensional unboxed bit packed Bool arrays; documentation
Unboxed multidimensional bit packed Bool arrays with fast aggregate
operations based on lifting Bool operations to bitwise operations.
.
There are many other bit packed structures out there, but none met
all of these requirements:
.
(1) unboxed bit packed Bool array,
.
(2) multi-dimensional indexing,
.
(3) fast (de)serialization, or interoperable with foreign code,
.
(4) fast aggregate operations (fold, map, zip).
.
Quick tour of the bitwise library:
.
[Data.Bits.Bitwise] Lift boolean operations on 'Bool' to bitwise
operations on 'Data.Bits.Bits'.
.
[Data.Array.BitArray] Immutable bit arrays.
.
[Data.Array.BitArray. ST] Mutable bit arrays in 'Control. Monad.ST. ST'.
.
[Data.Array.BitArray. IO] Mutable bit arrays in 'IO'.
.
[Data.Array.BitArray. ByteString] (De)serialization.
.
[Codec.Image.PBM] Portable bitmap monochrome 2D image format.
.
Very rough performance benchmarks:
.
* immutable random access single bit reads:
@BitArray ix@ is about 40% slower than @UArray ix Bool@,
.
* 'Control.Monad.ST. ST' mutable random access single bit reads:
@STBitArray s ix@ is about the same as @STUArray s ix Bool@,
.
* immutable map @Bool -> Bool@:
@BitArray ix@ is about 85x faster than @UArray ix Bool@,
.
* immutable zipWith @Bool -> Bool -> Bool@:
@BitArray ix@ is about 1300x faster than @UArray ix Bool@.
.
This package provides the documentation for a library for the Haskell
programming language.
See http://www.haskell. org/ for more information on Haskell.
- libghc-bitwise-prof: fast multi-dimensional unboxed bit packed Bool arrays; profiling libraries
Unboxed multidimensional bit packed Bool arrays with fast aggregate
operations based on lifting Bool operations to bitwise operations.
.
There are many other bit packed structures out there, but none met
all of these requirements:
.
(1) unboxed bit packed Bool array,
.
(2) multi-dimensional indexing,
.
(3) fast (de)serialization, or interoperable with foreign code,
.
(4) fast aggregate operations (fold, map, zip).
.
Quick tour of the bitwise library:
.
[Data.Bits.Bitwise] Lift boolean operations on 'Bool' to bitwise
operations on 'Data.Bits.Bits'.
.
[Data.Array.BitArray] Immutable bit arrays.
.
[Data.Array.BitArray. ST] Mutable bit arrays in 'Control. Monad.ST. ST'.
.
[Data.Array.BitArray. IO] Mutable bit arrays in 'IO'.
.
[Data.Array.BitArray. ByteString] (De)serialization.
.
[Codec.Image.PBM] Portable bitmap monochrome 2D image format.
.
Very rough performance benchmarks:
.
* immutable random access single bit reads:
@BitArray ix@ is about 40% slower than @UArray ix Bool@,
.
* 'Control.Monad.ST. ST' mutable random access single bit reads:
@STBitArray s ix@ is about the same as @STUArray s ix Bool@,
.
* immutable map @Bool -> Bool@:
@BitArray ix@ is about 85x faster than @UArray ix Bool@,
.
* immutable zipWith @Bool -> Bool -> Bool@:
@BitArray ix@ is about 1300x faster than @UArray ix Bool@.
.
This package provides a library for the Haskell programming language, compiled
for profiling. See http://www.haskell. org/ for more information on Haskell.