abstract-deque
- Ebuilds: 1, Testing: 0.3 Description:
An abstract interface to highly-parameterizable queues/deques.
Background: There exists a feature space for queues that extends between:
* simple, single-ended, non-concurrent, bounded queues
* double-ended, threadsafe, growable queues
... with important points inbetween (such as
the queues used for work-stealing).
This package includes an interface for Deques that allows the
programmer to use a single API for all of the above, while using the
type-system to select an efficient implementation given the
requirements (using type families).
This package also includes a simple reference implementation based
on 'IORef' and "Data.Sequence".
Homepage:https://github.com/rrnewton/haskell-lockfree/wiki License: BSD
alex
- Ebuilds: 2, Testing: 3.2.7.2 Description: Alex is a tool for generating lexical analysers in Haskell
Homepage:https://www.haskell.org/alex/ License: BSD
async
- Ebuilds: 1, Testing: 2.2.4-r1 Description: Run IO operations asynchronously and wait for their results
Homepage:https://github.com/simonmar/async License: BSD
atomic-primops
- Ebuilds: 1, Testing: 0.8.4 Description:
After GHC 7.4 a new `casMutVar#` primop became available, but it's
difficult to use safely, because pointer equality is a highly
unstable property in Haskell. This library provides a safer method
based on the concept of "Tickets".
Also, this library uses the "foreign primop" capability of GHC to
add access to other variants that may be of
interest, specifically, compare and swap inside an array.
Note that as of GHC 7.8, the relevant primops have been included in GHC itself.
This library is engineered to work pre- and post-GHC-7.8, while exposing the
same interface.
Homepage:https://github.com/rrnewton/haskell-lockfree/wiki License: BSD
auto-update
- Ebuilds: 1, Testing: 0.1.6 Description:
A common problem is the desire to have an action run at a scheduled interval, but only if it is needed. For example, instead of having every web request result in a new @getCurrentTime@ call, we'd like to have a single worker thread run every second, updating an @IORef@. However, if the request frequency is less than once per second, this is a pessimization, and worse, kills idle GC.
This library allows you to define actions which will either be performed by a dedicated thread or, in times of low volume, will be executed by the calling thread.
Homepage:https://github.com/yesodweb/wai License: MIT
aws
- Ebuilds: 2, Testing: 0.24 Description: Amazon Web Services (AWS) for Haskell
Homepage:https://github.com/aristidb/aws License: BSD
base-unicode-symbols
- Ebuilds: 1, Testing: 0.2.4.2 Description:
This package defines new symbols for a number of functions,
operators and types in the base package.
All symbols are documented with their actual definition and
information regarding their Unicode code point. They should be
completely interchangeable with their definitions.
For further Unicode goodness you can enable the @UnicodeSyntax@
language extension \[1\]. This extension enables Unicode characters
to be used to stand for certain ASCII character sequences,
i.e. → instead of @->@, ∀ instead of @forall@ and many
others.
Original idea by Péter Diviánszky.
\[1\] <http://www.haskell.org/ghc/docs/latest/html/users_guide/syntax-extns.html#unicode-syntax>
Homepage:http://haskell.org/haskellwiki/Unicode-symbols License: BSD
blaze-html
- Ebuilds: 1, Testing: 0.9.1.2-r2 Description: A blazingly fast HTML combinator library for Haskell
Homepage:https://jaspervdj.be/blaze License: BSD
blaze-markup
- Ebuilds: 1, Testing: 0.8.2.8-r1 Description: A blazingly fast markup combinator library for Haskell
Homepage:https://jaspervdj.be/blaze License: BSD
bytestring-builder
- Ebuilds: 1, Testing: 0.10.8.2.0 Description:
This is the bytestring builder that is debuting in bytestring-0.10.4.0, which
should be shipping with GHC 7.8, probably late in 2013. This builder has
several nice simplifications and improvements, and more out-of-box
functionality than the older blaze-builder.
Note that this package detects which version of bytestring you are compiling
against, and if you are compiling against bytestring-0.10.4 or later, will
be an empty package.
This package lets the new interface and implementation be used with most
older compilers without upgrading bytestring, which can be rather
problematic. In conjunction with blaze-builder-0.4 or later, which
offers an implementation of blaze-builder in terms of bytestring-builder,
this should let most people try the new interface and implementation without
causing undue compatibility problems with packages that depend on
blaze-builder.
GHC 7.6 did debut an almost identical interface and implementation, but with
slightly different module names and organization. Trying to re-export/rename
the builder provided with 7.6 did not turn out to be very practical, because
this interface includes new functions that rely on Builder internals,
which are not exported in 7.6. Furthermore, these module names should be
deprecated in 7.10.
Homepage:https://hackage.haskell.org/package/bytestring-builder License: BSD
c2hs
- Ebuilds: 2, Testing: 0.28.8-r2 Description: C->Haskell FFI tool that gives some cross-language type safety
Homepage:https://github.com/haskell/c2hs License: GPL-2
cabal
- Ebuilds: 2, Testing: 3.6.3.0 Description: A framework for packaging Haskell software
Homepage:https://www.haskell.org/cabal/ License: BSD
case-insensitive
- Ebuilds: 1, Testing: 1.2.1.0 Description:
The module @Data.CaseInsensitive@ provides the 'CI' type
constructor which can be parameterised by a string-like
type like: 'String', 'ByteString', 'Text',
etc.. Comparisons of values of the resulting type will be
insensitive to cases.
Homepage:https://github.com/basvandijk/case-insensitive License: BSD
charset
- Ebuilds: 2, Testing: 0.3.10 Description: Fast unicode character sets based on complemented PATRICIA tries
Homepage:https://github.com/ekmett/charset License: BSD
chell
- Ebuilds: 2, Testing: 0.5.0.2-r1 Description: A simple and intuitive library for automated testing
Homepage:https://github.com/typeclasses/chell License: MIT
configurator
- Ebuilds: 1, Testing: 0.3.0.0-r1 Description:
A configuration management library for programs and daemons.
Features include:
* Automatic, dynamic reloading in response to modifications to
configuration files.
* A simple, but flexible, configuration language, supporting several
of the most commonly needed types of data, along with
interpolation of strings from the configuration or the system
environment (e.g. @$(HOME)@).
* Subscription-based notification of changes to configuration
properties.
* An @import@ directive allows the configuration of a complex
application to be split across several smaller files, or common
configuration data to be shared across several applications.
For details of the configuration file format, see
<http://hackage.haskell.org/packages/archive/configurator/latest/doc/html/Data-Configurator.html>.
Homepage:https://github.com/bos/configurator License: BSD
crypto-api
- Ebuilds: 1, Testing: 0.13.3 Description:
A generic interface for cryptographic operations (hashes, ciphers, randomness).
Maintainers of hash and cipher implementations are
encouraged to add instances for the classes defined
in Crypto.Classes. Crypto users are similarly
encouraged to use the interfaces defined in the Classes
module.
Any concepts or functions of general use to more than
one cryptographic algorithm (ex: padding) is within
scope of this package.
Homepage:https://github.com/TomMD/crypto-api License: BSD
cryptonite-conduit
- Ebuilds: 1, Testing: 0.2.2 Description:
Conduit bridge for cryptonite
For now only provide a conduit version for hash and hmac, but
with contribution, this could provide cipher conduits too,
and probably other things.
Homepage:https://github.com/haskell-crypto/cryptonite-conduit License: BSD
dav
- Ebuilds: 1, Testing: 1.3.4 Description:
This is a library for the Web Distributed Authoring and Versioning
(WebDAV) extensions to HTTP. At present it supports a very small
subset of client functionality.
In addition, there is an executable, hdav, which can be used for
command-line operation.
Homepage:http://floss.scru.org/hDAV License: GPL-3
fail
- Ebuilds: 1, Testing: 4.9.0.0 Description:
This package contains the "Control.Monad.Fail" module providing the
<https://prime.haskell.org/wiki/Libraries/Proposals/MonadFail MonadFail>
class that became available in
<https://hackage.haskell.org/package/base-4.9.0.0 base-4.9.0.0>
for older @base@ package versions.
This package turns into an empty package when used with GHC versions
which already provide the "Control.Monad.Fail" module to make way for
GHC's own "Control.Monad.Fail" module.
Homepage:https://prime.haskell.org/wiki/Libraries/Proposals/MonadFail License: BSD
ghc-byteorder
- Ebuilds: 1, Testing: 4.11.0.0.10 Description:
This package transparently supplies the "GHC.ByteOrder" API as provided in @base-4.11.0.0@ for legacy GHC releases which didn't provide it yet (i.e. GHC 7.0 through GHC 8.2).
This release reexports [GHC.ByteOrder from base](https://hackage.haskell.org/package/base-4.11.1.0/docs/GHC-ByteOrder.html) via Cabal's @reexported-modules@ mechanism. For GHC 8.2 and earlier a different release of @ghc-byteorder@ (with the same minor version) is eligible by the Cabal solver with a backported "GHC.ByteOrder" module.
In order to use this compatibility layer, simply declare a dependency on @ghc-byteorder@ in your @.cabal@ package description like so
> build-depends: ghc-byteorder ^>= 4.11.0.0
And your code will be able to access this respective API version of the module via the usual
> import GHC.ByteOrder
mechanism.
Homepage:http://hackage.haskell.org/package/ghc-byteorder License: BSD
hspec-meta
- Ebuilds: 2, Testing: 2.10.5 Description: A version of Hspec which is used to test Hspec itself
Homepage:https://hspec.github.io/ License: MIT
html-conduit
- Ebuilds: 2, Testing: 1.3.2.2 Description:
This package uses tagstream-conduit for its parser. It automatically balances mismatched tags, so that there shouldn't be any parse failures. It does not handle a full HTML document rendering, such as adding missing html and head tags.
Homepage:https://github.com/snoyberg/xml License: MIT
http-conduit
- Ebuilds: 1, Testing: 2.3.8 Description:
This package uses attoparsec for parsing the actual contents of the HTTP connection. It also provides higher-level functions which allow you to avoid direct usage of conduits. See <http://www.yesodweb.com/book/http-conduit> for more information.
Homepage:https://www.yesodweb.com/book/https-conduit License: BSD
http-media
- Ebuilds: 1, Testing: 0.8.0.0 Description:
This library is intended to be a comprehensive solution to parsing and
selecting quality-indexed values in HTTP headers. It is capable of parsing
both media types and language parameters from the Accept and Content header
families, and can be extended to match against other accept headers as well.
Selecting the appropriate header value is achieved by comparing a list of
server options against the quality-indexed values supplied by the client.
In the following example, the Accept header is parsed and then matched against
a list of server options to serve the appropriate media using
'mapAcceptMedia':
> getHeader >>= maybe send406Error sendResourceWith . mapAcceptMedia
> [ ("text/html", asHtml)
> , ("application/json", asJson)
> ]
Similarly, the Content-Type header can be used to produce a parser for request
bodies based on the given content type with 'mapContentMedia':
> getContentType >>= maybe send415Error readRequestBodyWith . mapContentMedia
> [ ("application/json", parseJson)
> , ("text/plain", parseText)
> ]
The API is agnostic to your choice of server.
Homepage:https://github.com/zmthy/http-media License: MIT
httpd-shed
- Ebuilds: 1, Testing: 0.4.1.1-r1 Description:
This web server promotes a Request to IO Response function
into a local web server. The user can decide how to interpret
the requests, and the library is intended for implementing Ajax APIs.
Homepage:https://hackage.haskell.org/package/httpd-shed License: BSD
ipynb
- Ebuilds: 1, Testing: 0.2 Description:
ipynb defines a data structure for representing Jupyter
notebooks, along with ToJSON and FromJSON instances
for conversion to and from JSON .ipynb files.
Homepage:https://hackage.haskell.org/package/ipynb License: BSD
language-haskell-extract
- Ebuilds: 1, Testing: 0.2.4-r1 Description:
@language-haskell-extract@ contains some useful helper functions on top of Template Haskell.
@functionExtractor@ extracts all functions after a regexp-pattern.
> foo = "test"
> boo = "testing"
> bar = $(functionExtractor "oo$")
will automagically extract the functions ending with @oo@ such as
> bar = [("foo",foo), ("boo",boo)]
This can be useful if you wish to extract all functions beginning with test (for a test-framework)
or all functions beginning with wc (for a web service).
@functionExtractorMap@ works like @functionsExtractor@ but applies a function over all function-pairs.
This functions is useful if the common return type of the functions is a type class.
Example:
> secondTypeclassTest =
> do let expected = ["45", "88.8", "\"hej\""]
> actual = $(functionExtractorMap "^tc" [|\n f -> show f|] )
> expected @=? actual
>
> tcInt :: Integer
> tcInt = 45
>
> tcDouble :: Double
> tcDouble = 88.8
>
> tcString :: String
> tcString = "hej"
Homepage:https://github.com/finnsson/template-helper License: BSD
lifted-base
- Ebuilds: 1, Testing: 0.2.3.12 Description:
@lifted-base@ exports IO operations from the base library lifted to
any instance of 'MonadBase' or 'MonadBaseControl'.
Note that not all modules from @base@ are converted yet. If
you need a lifted version of a function from @base@, just
ask me to add it or send me a patch.
The package includes a copy of the @monad-peel@ testsuite written
by Anders Kaseorg The tests can be performed using @cabal test@.
Homepage:https://github.com/basvandijk/lifted-base License: BSD
mmap
- Ebuilds: 1, Testing: 0.5.9 Description:
This library provides a wrapper to mmap(2) or MapViewOfFile,
allowing files or devices to be lazily loaded into memory as
strict or lazy ByteStrings, ForeignPtrs or plain Ptrs, using
the virtual memory subsystem to do on-demand loading.
Modifications are also supported.
Homepage:https://hackage.haskell.org/package/mmap License: BSD
monad-par
- Ebuilds: 1, Testing: 0.3.5-r1 Description:
This library offers an alternative parallel programming
API to that provided by the @parallel@ package.
The 'Par' monad allows the simple description of
parallel computations, and can be used to add
parallelism to pure Haskell code. The basic API
is straightforward: the monad supports forking
and simple communication in terms of 'IVar's.
The library comes with an efficient work-stealing
implementation, but the internals are also
exposed so that you can build your own scheduler
if necessary.
Examples of use can be found in the examples/ directory
of the source package.
Homepage:https://github.com/simonmar/monad-par License: BSD
monad-par-extras
- Ebuilds: 1, Testing: 0.3.3-r1 Description:
The modules below provide additional
data structures, and other added capabilities
layered on top of the 'Par' monad.
* Finish These
* Module Descriptions
Homepage:https://github.com/simonmar/monad-par License: BSD
network-bsd
- Ebuilds: 1, Testing: 2.8.1.0-r1 Description:
This package reexports the "Network.BSD" module split from the <https://hackage.haskell.org/package/network-2.8.0.0 network-2.8.0.0> package.
See newer versions of <https://hackage.haskell.org/package/network-bsd network-bsd> for more information.
Homepage:https://github.com/haskell/network-bsd License: BSD
old-time
- Ebuilds: 1, Testing: 1.1.0.3-r1 Description:
This package provides the old time library.
For new projects, the newer
<http://hackage.haskell.org/package/time time library>
is recommended.
Homepage:https://hackage.haskell.org/package/old-time License: BSD
only
- Ebuilds: 1, Testing: 0.1 Description:
This package provides a canonical anonymous 1-tuple type missing
from Haskell for attaching typeclass instances.
NOTE: There is also the </package/OneTuple OneTuple package> which
by using a boxed @data@-type provides a 1-tuple type which has
laziness properties which are more faithful to the ones of Haskell's
native tuples; whereas the primary purpose of 'Only' is to
provide the traditionally so named type-wrapper for attaching typeclass
instances.
Homepage:https://hackage.haskell.org/package/Only License: BSD
parallel-io
- Ebuilds: 1, Testing: 0.3.5 Description:
This package provides combinators for sequencing IO actions onto a thread pool. The
thread pool is guaranteed to contain no more unblocked threads than a user-specified upper limit, thus
minimizing contention.
Furthermore, the parallel combinators can be used reentrantly - your parallel
actions can spawn more parallel actions - without violating this property of the thread pool.
The package is inspired by the thread <http://thread.gmane.org/gmane.comp.lang.haskell.cafe/56499/focus=56521>.
Thanks to Neil Mitchell and Bulat Ziganshin for some of the code this package is based on.
Homepage:https://batterseapower.github.io/parallel-io/ License: BSD
pcre-light
- Ebuilds: 1, Testing: 0.4.1.3 Description:
A small, efficient and portable regex library for Perl 5 compatible regular expressions
The PCRE library is a set of functions that implement regular
expression pattern matching using the same syntax and semantics as Perl 5.
Test coverage data for this library is available at:
<http://code.haskell.org/~dons/tests/pcre-light/hpc_index.html>
Homepage:https://codeberg.org/daniel-casanueva/pcre-light License: BSD
pem
- Ebuilds: 1, Testing: 0.2.4 Description: Privacy Enhanced Mail (PEM) format reader and writer
Homepage:https://github.com/vincenthz/hs-pem License: BSD
persistent-template
- Ebuilds: 1, Testing: 2.12.0.0 Description:
This library provides just the general interface and helper functions. You must use a specific backend in order to make this useful.
Homepage:https://www.yesodweb.com/book/persistent License: MIT
persistent-test
- Ebuilds: 1, Testing: 2.13.1.3 Description:
Tests for Persistent. This is only for use in developing libraries that should conform to the persistent interface, not for users of the persistent suite of database libraries.
Homepage:https://www.yesodweb.com/book/persistent License: MIT
pgp-wordlist
- Ebuilds: 1, Testing: 0.1.0.3 Description:
Translate between binary data and a human-readable
collection of words.
The PGP Word List consists of two phonetic alphabets, each
with one word per possible byte value. A string of bytes
is translated with these alphabets, alternating between
them at each byte.
The PGP words corresponding to the bytes @5B 1D CA 6E@
are "erase breakaway spellbind headwaters", for example.
For further information, see
<http://en.wikipedia.org/wiki/PGP_word_list Wikipedia>.
Homepage:https://github.com/quchen/pgp-wordlist License: BSD
pretty-show
- Ebuilds: 1, Testing: 1.10 Description:
We provide a library and an executable for working with derived 'Show'
instances. By using the library, we can parse derived 'Show' instances into a
generic data structure. The @ppsh@ tool uses the library to produce
human-readable versions of 'Show' instances, which can be quite handy for
debugging Haskell programs.
Homepage:https://github.com/yav/pretty-show License: MIT
psqueues
- Ebuilds: 1, Testing: 0.2.7.3 Description:
The psqueues package provides
<https://en.wikipedia.org/wiki/Priority_queue Priority Search Queues> in
three different flavors.
* @OrdPSQ k p v@, which uses the @Ord k@ instance to provide fast insertion,
deletion and lookup. This implementation is based on Ralf Hinze's
<http://citeseer.ist.psu.edu/hinze01simple.html A Simple Implementation Technique for Priority Search Queues>.
Hence, it is similar to the
<http://hackage.haskell.org/package/PSQueue PSQueue> library, although it is
considerably faster and provides a slightly different API.
* @IntPSQ p v@ is a far more efficient implementation. It fixes the key type
to @Int@ and uses a <https://en.wikipedia.org/wiki/Radix_tree radix tree>
(like @IntMap@) with an additional min-heap property.
* @HashPSQ k p v@ is a fairly straightforward extension of @IntPSQ@: it
simply uses the keys' hashes as indices in the @IntPSQ@. If there are any
hash collisions, it uses an @OrdPSQ@ to resolve those. The performance of
this implementation is comparable to that of @IntPSQ@, but it is more widely
applicable since the keys are not restricted to @Int@, but rather to any
@Hashable@ datatype.
Each of the three implementations provides the same API, so they can be used
interchangeably. The benchmarks show how they perform relative to one
another, and also compared to the other Priority Search Queue
implementations on Hackage:
<http://hackage.haskell.org/package/PSQueue PSQueue>
and
<http://hackage.haskell.org/package/fingertree-psqueue fingertree-psqueue>.
<<http://i.imgur.com/KmbDKR6.png>>
<<http://i.imgur.com/ClT181D.png>>
Typical applications of Priority Search Queues include:
* Caches, and more specifically LRU Caches;
* Schedulers;
* Pathfinding algorithms, such as Dijkstra's and A*.
Homepage:https://hackage.haskell.org/package/psqueues License: BSD
puremd5
- Ebuilds: 1, Testing: 2.1.4 Description:
A Haskell-only implementation of the MD5 digest (hash) algorithm. This now supports
the crypto-api class interface.
Homepage:https://hackage.haskell.org/package/pureMD5 License: BSD
reducers
- Ebuilds: 2, Testing: 3.12.4 Description: Semigroups, specialized containers and a general map/reduce framework
Homepage:https://github.com/ekmett/reducers/ License: BSD
reflection
- Ebuilds: 1, Testing: 2.1.6 Description: Reifies arbitrary terms into types that can be reflected back into terms
Homepage:https://github.com/ekmett/reflection License: BSD
regex-applicative
- Ebuilds: 1, Testing: 0.3.3.1 Description:
regex-applicative is a Haskell library for parsing using regular expressions.
Parsers can be built using Applicative interface.
Homepage:https://github.com/feuerbach/regex-applicative License: MIT
resolv
- Ebuilds: 1, Testing: 0.1.2.0-r1 Description:
This package implements an API for accessing
the [Domain Name Service (DNS)](https://tools.ietf.org/html/rfc1035)
resolver service via the standard @libresolv@ system library (whose
API is often available directly via the standard @libc@ C library) on
Unix systems.
This package also includes support for decoding message record types
as defined in the following RFCs:
- [RFC 1035](https://tools.ietf.org/html/rfc1035): Domain Names - Implementation And Specification
- [RFC 1183](https://tools.ietf.org/html/rfc1183): New DNS RR Definitions
- [RFC 2782](https://tools.ietf.org/html/rfc2782): A DNS RR for specifying the location of services (DNS SRV)
- [RFC 2915](https://tools.ietf.org/html/rfc2915): The Naming Authority Pointer (NAPTR) DNS Resource Record
- [RFC 3596](https://tools.ietf.org/html/rfc3596): DNS Extensions to Support IP Version 6
- [RFC 4034](https://tools.ietf.org/html/rfc4034): Resource Records for the DNS Security Extensions
- [RFC 4255](https://tools.ietf.org/html/rfc4255): Using DNS to Securely Publish Secure Shell (SSH) Key Fingerprints
- [RFC 4408](https://tools.ietf.org/html/rfc4408): Sender Policy Framework (SPF) for Authorizing Use of Domains in E-Mail, Version 1
- [RFC 5155](https://tools.ietf.org/html/rfc5155): DNS Security (DNSSEC) Hashed Authenticated Denial of Existence
- [RFC 6844](https://tools.ietf.org/html/rfc6844): DNS Certification Authority Authorization (CAA) Resource Record
- [RFC 6891](https://tools.ietf.org/html/rfc6891): Extension Mechanisms for DNS (EDNS(0))
- [RFC 7553](https://tools.ietf.org/html/rfc7553): The Uniform Resource Identifier (URI) DNS Resource Record
Homepage:https://hackage.haskell.org/package/resolv License: GPL-2+
safe
- Ebuilds: 1, Testing: 0.3.19 Description:
Partial functions from the base library, such as @head@ and @!!@, modified
to return more descriptive error messages, programmer defined error messages,
@Maybe@ wrapped results and default values.
These functions can be used to reduce the number of unsafe pattern matches in
your code.
Homepage:https://github.com/ndmitchell/safe#readme License: BSD
securemem
- Ebuilds: 1, Testing: 0.1.10 Description:
SecureMem is similar to ByteString, except that it provides a memory chunk that
will be auto-scrubbed after it run out of scope.
Homepage:https://github.com/vincenthz/hs-securemem License: BSD
servant
- Ebuilds: 2, Testing: 0.20 Description: A family of combinators for defining webservices APIs
Homepage:https://docs.servant.dev/ License: BSD
servant-server
- Ebuilds: 2, Testing: 0.20 Description: A family of combinators for defining webservices APIs and serving them
Homepage:https://docs.servant.dev/ License: BSD
sha
- Ebuilds: 1, Testing: 1.6.4.4 Description:
This library implements the SHA suite of message digest functions,
according to NIST FIPS 180-2 (with the SHA-224 addendum), as well
as the SHA-based HMAC routines. The functions have been tested
against most of the NIST and RFC test vectors for the various
functions. While some attention has been paid to performance,
these do not presently reach the speed of well-tuned libraries,
like OpenSSL.
Homepage:https://hackage.haskell.org/package/SHA License: BSD
should-not-typecheck
- Ebuilds: 1, Testing: 2.1.0 Description:
For examples and an introduction to the library please take a look at the <https://github.com/CRogers/should-not-typecheck#should-not-typecheck- README> on github.
Homepage:https://github.com/CRogers/should-not-typecheck License: BSD
simple-reflect
- Ebuilds: 1, Testing: 0.3.3 Description:
This package allows simple reflection of expressions containing variables.
Reflection here means that a Haskell expression is turned into a string.
The primary aim of this package is teaching and understanding;
there are no options for manipulating the reflected expressions beyond showing them.
Homepage:https://twanvl.nl/blog/haskell/simple-reflection-of-expressions License: BSD
skein
- Ebuilds: 1, Testing: 1.0.9.4 Description:
Skein (<http://www.skein-hash.info/>) is a family of fast
secure cryptographic hash functions designed by Niels
Ferguson, Stefan Lucks, Bruce Schneier, Doug Whiting, Mihir
Bellare, Tadayoshi Kohno, Jon Callas and Jesse Walker.
This package uses bindings to the optimized C implementation
of Skein. We provide a high-level interface (see module
"Crypto.Skein") to some of the Skein use cases. We also
provide a low-level interface (see module
"Crypto.Skein.Internal") should you need to use Skein in a
different way.
Currently we have support for Skein as cryptographic hash
function as Skein as a message authentication code
(Skein-MAC). For examples of how to use this package, see
"Crypto.Skein" module documentation.
This package includes Skein v1.3. Versions of this package
before 1.0.0 implemented Skein v1.1.
Homepage:https://github.com/meteficha/skein License: BSD
sop-core
- Ebuilds: 1, Testing: 0.5.0.2 Description:
Implementation of n-ary sums and n-ary products.
The module "Data.SOP" is the main module of this library and contains
more detailed documentation.
The main use case of this package is to serve as the core of
https://hackage.haskell.org/package/generics-sop generics-sop
A detailed description of the ideas behind this library is provided by
the paper:
* Edsko de Vries and Andres Löh.
http://www.andres-loeh.de/TrueSumsOfProducts True Sums of Products
Workshop on Generic Programming (WGP) 2014.
Homepage:https://hackage.haskell.org/package/sop-core License: BSD
system-fileio
- Ebuilds: 1, Testing: 0.3.16.7 Description:
This is a small wrapper around the \"directory\", \"unix\", and \"Win32\"
packages, for use with \"system-filepath\". It provides a consistent API
to the various versions of these packages distributed with different
versions of GHC.
In particular, this library supports working with POSIX files that have
paths which can't be decoded in the current locale encoding.
Homepage:https://github.com/fpco/haskell-filesystem License: MIT
tagsoup
- Ebuilds: 1, Testing: 0.14.8 Description:
TagSoup is a library for parsing HTML/XML. It supports the HTML 5 specification,
and can be used to parse either well-formed XML, or unstructured and malformed HTML
from the web. The library also provides useful functions to extract information
from an HTML document, making it ideal for screen-scraping.
Users should start from the "Text.HTML.TagSoup" module.
Homepage:https://github.com/ndmitchell/tagsoup#readme License: BSD
tar
- Ebuilds: 1, Testing: 0.5.1.1-r3 Description: Reading, writing and manipulating \".tar\" archive files
Homepage:https://hackage.haskell.org/package/tar License: BSD
tasty-rerun
- Ebuilds: 1, Testing: 1.1.18 Description:
This ingredient adds the ability to run tests by first filtering the test tree
based on the result of a previous test run. For example, you can use this to
run only those tests that failed in the last run, or to run only tests that
have been added since tests were last ran.
This ingredient is specifically an ingredient *transformer* - given a list of
'Tasty.Ingredient's, 'rerunningTests' adds the ability for all of these
ingredients to run against a filtered test tree. This transformer can be
applied as follows:
> import Test.Tasty
> import Test.Tasty.Runners
>
> main :: IO ()
> main =
> defaultMainWithIngredients
> [ rerunningTests [ listingTests, consoleTestReporter ] ]
> tests
>
> tests :: TestTree
> tests = undefined
This ingredient adds three command line parameters:
[@--rerun-update@] If specified the results of this test run will be saved to
the log file at @--rerun-log-file@. If the ingredient does not execute tests
(for example, @--list-tests@ is used) then the log file will not be
updated. This option is not enabled by default. This option does not require
a value.
[@--rerun-log-file@] The path to the log file to read previous test
information from, and where to write new information to (if @--rerun-update@
is specified). This option defaults to @.tasty-rerun-log@.
[@--rerun-filter@] Which filters to apply to the 'Tasty.TestTree' based on
previous test runs. The value of this option is a comma separated list of the
following options:
* @failures@: Only run tests that failed on the previous run.
* @exceptions@: Only run tests that threw an exception on the previous run.
* @new@: Only run tests that are new since the previous test run.
* @successful@: Only run tests that were successful in the previous run.
Multiple options can be combined and will be taken under disjunction - so
@--rerun-filter=failures,exceptions@ will run only tests that failed *or*
threw an exception on the last run.
Defaults to all filters, which means all tests will be ran.
Homepage:https://github.com/ocharles/tasty-rerun License: BSD
tf-random
- Ebuilds: 1, Testing: 0.5 Description:
This package contains an implementation of a high-quality splittable pseudorandom number generator. The generator is based on a cryptographic hash function built on top of the ThreeFish block cipher. See the paper /Splittable Pseudorandom Number Generators Using Cryptographic Hashing/ by Claessen, PaBka for details and the rationale of the design.
The package provides the following:
* A splittable PRNG that implements the standard 'System.Random.RandomGen' class.
* The generator also implements an alternative version of the 'System.Random.TF.Gen.RandomGen' class (exported from "System.Random.TF.Gen"), which requires the generator to return pseudorandom integers from the full 32-bit range, and contains an n-way split function.
* An alternative version of the @Random@ class is provided, which is linked to the new @RandomGen@ class, together with @Random@ instances for some integral types.
* Two functions for initialising the generator with a non-deterministic seed: one using the system time, and one using the @\/dev\/urandom@ UNIX special file.
The package uses an adapted version of the reference C implementation of ThreeFish from the reference package of the Skein hash function (<https://www.schneier.com/skein.html>), originally written by Doug Whiting.
Please note that even though the generator provides very high-quality pseudorandom numbers, it has not been designed with cryptographic applications in mind.
Homepage:https://hackage.haskell.org/package/tf-random License: BSD
type-equality
- Ebuilds: 1, Testing: 1 Description:
In the presence of GADTs, sometimes a proof is
needed that two types are equal. This package
contains an equality type for this purpose, plus its
properties (reflexive, symmetric, transitive) and
some useful operations (substitution, congruence,
coercion/cast). It also contains a type class for
producing equality proofs, providing some form of
decidable equality on types.
Homepage:https://github.com/hesselink/type-equality License: BSD
warp
- Ebuilds: 2, Testing: 3.3.28 Description: A fast, light-weight web server for WAI applications
Homepage:https://github.com/yesodweb/wai License: MIT
wcwidth
- Ebuilds: 1, Testing: 0.0.2 Description:
Bindings for your system's native wcwidth and a command line tool to examine
the widths assigned by it. The command line tool can compile a width table
to Haskell code that assigns widths to the Char type.
Homepage:https://github.com/solidsnack/wcwidth/ License: BSD
websockets
- Ebuilds: 1, Testing: 0.12.7.3 Description: A sensible and clean way to write WebSocket-capable servers in Haskell
Homepage:https://jaspervdj.be/websockets License: BSD
xml
- Ebuilds: 1, Testing: 1.3.14 Description: A simple XML library
Homepage:http://code.galois.com License: BSD
xml-conduit
- Ebuilds: 2, Testing: 1.9.1.3 Description: Pure-Haskell utilities for dealing with XML with the conduit package
Homepage:https://github.com/snoyberg/xml License: MIT
xml-hamlet
- Ebuilds: 2, Testing: 0.5.0.2 Description: Hamlet-style quasiquoter for XML content
Homepage:https://www.yesodweb.com/ License: BSD