@hackage rbst dependencies

20 results

library:rbst (7 dependencies)

@haskell/transformers

Concrete functor and monad transformers

BSD-3-Clause>=0.5.0.0 && <0.6.0.0

@haskell/text

An efficient packed Unicode text type.

BSD-2-Clause>=1.2.3.0 && <2.0.0.0

@haskell/deepseq

Deep evaluation of data structures

BSD-3-Clause>=1.4 && <1.5

@haskell/containers

Assorted concrete container types

BSD-3-Clause>=0.5.0.1 && <0.7

@haskell/bytestring

Fast, compact, strict and lazy byte strings with a list interface

BSD-3-Clause>=0.10.8.2 && <0.11.0.0

@haskell/base

Core data structures and operations

BSD-3-Clause>=4.12 && <4.15

@hackage/mersenne-random-pure64

Generate high quality pseudorandom numbers purely using a Mersenne Twister

BSD-3-Clause>=0.2.2.0 && <0.3

test:rbst-doctest (3 dependencies)

@haskell/base

Core data structures and operations

BSD-3-Clause

@hackage/doctest

Test interactive Haskell examples

MIT>=0.16 && <0.17

@hackage/Glob

Globbing library

BSD-3-Clause>=0.9 && <0.11

test:rbst-tests (6 dependencies)

@haskell/base

Core data structures and operations

BSD-3-Clause

@hackage/rbst

Randomized Binary Search Trees

MIT

@hackage/hspec-expectations

Catchy combinators for HUnit

MIT>=0.8.0 && <0.9

@hackage/hspec-core

A Testing Framework for Haskell

MIT>=2.6.0 && <2.8

@hackage/hspec

A Testing Framework for Haskell

MIT>=2.6.0 && <2.8

@hackage/QuickCheck

Automatic testing of Haskell programs

BSD-3-Clause>=2.12 && <2.14

benchmark:rbst-bench (4 dependencies)

@haskell/base

Core data structures and operations

BSD-3-Clause

@hackage/rbst

Randomized Binary Search Trees

MIT

@hackage/mwc-random

Fast, high quality pseudo random number generation

BSD-2-Clause>=0.14.0 && <0.15

@hackage/gauge

small framework for performance measurement and analysis

BSD-3-Clause>=0.2.4 && <0.3