bitwise-1.0.0.1: fast multi-dimensional unboxed bit packed Bool arrays

# bitwise-1.0.0.1: 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 `Bits`.
Data.Array.BitArray
  Immutable bit arrays.
Data.Array.BitArray.ST
  Mutable bit arrays in `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`,
- `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`.

Modules

bitwise-1.0.0.1

- Codec
  Submodules
  - Image
    Submodules
    - Codec.Image.PBM
- Data
  Submodules
  - Array
    Submodules
    - Data.Array.BitArray
      Submodules
      - Data.Array.BitArray.ByteString
      - Data.Array.BitArray.IO
      - Data.Array.BitArray.ST
  - Bits
    Submodules
    - Data.Bits.Bitwise