How to Install and Uninstall libghc-bitwise-doc Package on Kali Linux
Last updated: November 07,2024
1. Install "libghc-bitwise-doc" package
Please follow the steps below to install libghc-bitwise-doc on Kali Linux
$
sudo apt update
Copied
$
sudo apt install
libghc-bitwise-doc
Copied
2. Uninstall "libghc-bitwise-doc" package
Please follow the instructions below to uninstall libghc-bitwise-doc on Kali Linux:
$
sudo apt remove
libghc-bitwise-doc
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libghc-bitwise-doc package on Kali Linux
Package: libghc-bitwise-doc
Source: haskell-bitwise
Version: 1.0.0.1-3
Installed-Size: 1410
Maintainer: Debian Haskell Group
Architecture: all
Depends: haddock-interface-41
Recommends: ghc-doc, libghc-bitwise-dev, libjs-mathjax
Suggests: libghc-bitwise-prof
Size: 89856
SHA256: 48db72f6ba58b0563576a98bce2ec0da089fb4df23f19895cebdb54b90c5cd1f
SHA1: 65b67f1587b6ee23f2afe9382abec8f91272a72b
MD5sum: 43aaa988e6f99daf5a9eaacec627e279
Description: 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.
Description-md5:
Homepage: https://code.mathr.co.uk/bitwise
Section: doc
Priority: optional
Filename: pool/main/h/haskell-bitwise/libghc-bitwise-doc_1.0.0.1-3_all.deb
Source: haskell-bitwise
Version: 1.0.0.1-3
Installed-Size: 1410
Maintainer: Debian Haskell Group
Architecture: all
Depends: haddock-interface-41
Recommends: ghc-doc, libghc-bitwise-dev, libjs-mathjax
Suggests: libghc-bitwise-prof
Size: 89856
SHA256: 48db72f6ba58b0563576a98bce2ec0da089fb4df23f19895cebdb54b90c5cd1f
SHA1: 65b67f1587b6ee23f2afe9382abec8f91272a72b
MD5sum: 43aaa988e6f99daf5a9eaacec627e279
Description: 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.
Description-md5:
Homepage: https://code.mathr.co.uk/bitwise
Section: doc
Priority: optional
Filename: pool/main/h/haskell-bitwise/libghc-bitwise-doc_1.0.0.1-3_all.deb