--- /dev/null
+# Copyright 1999-2016 Gentoo Foundation
+# Distributed under the terms of the GNU General Public License v2
+# $Id$
+
+EAPI=6
+
+# ebuild generated by hackport 0.5.9999
+
+CABAL_FEATURES="lib profile haddock hoogle hscolour test-suite"
+inherit haskell-cabal
+
+DESCRIPTION="fast multi-dimensional unboxed bit packed Bool arrays"
+HOMEPAGE="http://code.mathr.co.uk/bitwise"
+SRC_URI="mirror://hackage/packages/archive/${PN}/${PV}/${P}.tar.gz"
+
+LICENSE="BSD"
+SLOT="0/${PV}"
+KEYWORDS="~amd64 ~x86"
+IUSE=""
+
+RDEPEND=">=dev-lang/ghc-7.4.1:=
+"
+DEPEND="${RDEPEND}
+ >=dev-haskell/cabal-1.9.2
+ test? ( >=dev-haskell/quickcheck-2.4 )
+"
+
+src_prepare() {
+ default
+
+ cabal_chdeps \
+ 'QuickCheck >= 2.4 && < 2.9' 'QuickCheck >= 2.4'
+}
--- /dev/null
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd">
+<pkgmetadata>
+ <maintainer type="project">
+ <email>haskell@gentoo.org</email>
+ <name>Gentoo Haskell</name>
+ </maintainer>
+ <longdescription>
+ 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@.
+ </longdescription>
+</pkgmetadata>