Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. package quickcheck-transformer

   A GenT monad transformer for QuickCheck library. A fork of QuickCheck-GenT that works for older GHC versions and uses the Test module folder like QuickCheck.

2. package radix-tree

   Radix trees Radix and PATRICIA trees, both spine-strict and spine-lazy. See the README for a brief overview of the data structures included in this package.

3. package rainbow

   Print text to terminal with colors and effects Please see README.md

4. package ral

   Random access lists This package provides ordinary random access list, RAList, and also a length indexed variant, RAVec. The data structure allows fast cons-operation (like ordinary list) but also fast random access (like non-functional arrays). For lens or optics support see ral-lens and ral-optics packages respectively.

   Similar packages

   These packages don't provide length-indexed variants, and their RAList has opaque structure.
   • https://hackage.haskell.org/package/ralist
   • https://hackage.haskell.org/package/random-access-list

5. package rampart

   Determine how intervals relate to each other. Rampart determines how intervals relate to each other.

6. package ramus

   Elm signal system for Haskell Ramus is a direct port of purescript-signal into Haskell, offering the Elm signal system for Haskell.

7. package range

   An efficient and versatile range library. The range library alows the use of performant and versatile ranges in your code. It supports bounded and unbounded ranges, ranges in a nested manner (like library versions), an efficient algebra of range computation and even a simplified interface for ranges for the common cases. This library is far more efficient than using the default Data.List functions to approximate range behaviour. Performance is the major value offering of this library. If this is your first time using this library it is highly recommended that you start with Data.Range; it contains the basics of this library that meet most use cases.

8. package range-set-list

   Memory efficient sets with ranges of elements. Memory efficient sets with continuous ranges of discrete, bounded elements. List- and map-based implementations. Interface mimics Data.Set where possible.

9. package ranged-list

   The list like structure whose length or range of length can be specified Please see the README on GitHub at https://github.com/YoshikuniJujo/ranged-list#readme

10. package ranges

    Ranges and various functions on them. Ranges and some functions allowing things like fast membership lookup on ranges with holes in them and so on.

Page 233 of many | Previous | Next