some new hs-ports

Hi,

here are 6 new hs-ports (from Greg Steuck, with some minor tweaks
by me) that are required for the ghc update. Attached tarballs are
relative to /usr/ports/devel. When updating ghc, the following ports
will be removed: devel/hs-mtl, devel/hs-parsec, devel/hs-stm,
devel/hs-text, textproc/hs-stringsearch, so the number of hs-ports
doesn't explode ;-)

ok to import them?

Ciao,
Kili

ps: comments and descriptions:

*** devel/hs-base-compat:

Comment:
a compatibility layer for base

Description:
The scope of base-compat is to provide functions available in later
versions of base to a wider (older) range of compilers.

In addition, successful library proposals that have been accepted to
be part of upcoming versions of base are also included. This package
is not intended to replace base, but to complement it.

*** devel/hs-byteable:

Comment:
type class for sequence of bytes

Description:
Abstract class to manipulate sequence of bytes

The use case of this class is abstracting manipulation of types that
are just wrapping a bytestring with stronger and more meaniful name.

*** devel/hs-mono-traversable:

Comment:
type classes for working with monomorphic containers

Description:
Type classes for mapping, folding, and traversing monomorphic and
polymorphic containers. Haskell is good at operating over polymorphic
containers such as a list [a]. A monomorphic container is one such as
Text which has a type Text that does not expose a type variable for
the underlying characters.

*** devel/hs-unliftio-core:

Comment:
typeclass for unlifting monads to IO

Description:
Provides the core MonadUnliftIO typeclass, instances for base and
transformers, and basic utility functions. Typically, you'll want to
use the unliftio library, which provides more functionality (and a
much better description).

*** devel/hs-unordered-containers:

Comment:
efficient hashing-based container types

Description:
Efficient hashing-based container types. The containers have been
optimized for performance critical use, both in terms of large data
quantities and high speed.

The declared cost of each operation is either worst-case or amortized,
but remains valid even if structures are shared.

*** devel/hs-vector-algorithms:

Comment:
efficient algorithms for vector arrays

Description:
Efficient algorithms for sorting vector arrays. At some stage other
vector algorithms may be added.