Hoogle Search

Within LTS Haskell 24.2 (ghc-9.10.2)

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

Exact lookup

1. module Rebase.Data.IntSet

   No documentation available.

2. data IntSet

   rebase	Rebase.Prelude

   A set of integers.

3. module Math.NumberTheory.Primes.IntSet

   A newtype wrapper around IntSet. This module is intended to be imported qualified, e. g.,

   import Math.NumberTheory.Primes.IntSet (PrimeIntSet)
   import qualified Math.NumberTheory.Primes.IntSet as PrimeIntSet
   

4. data IntSet

   incipit-base	Incipit.Libraries

   A set of integers.

5. data IntSet

   Agda	Agda.Utils.IntSet.Infinite

   Represents a set of integers. Invariants: - All cannot be the argument to Below or Above - at most one IntsBelow - at most one IntsAbove - if `Below lo` and `Below hi`, then `lo < hi` - if `Below lo .. (Some xs)` then `all (> lo) xs` - if `Above hi .. (Some xs)` then `all (< hi - 1) xs`

6. module Data.Interned.IntSet

   An efficient implementation of integer sets. Since many function names (but not the type name) clash with Prelude names, this module is usually imported qualified, e.g.

   import Data.IntSet (IntSet)
   import qualified Data.IntSet as IntSet
   

   The implementation is based on big-endian patricia trees. This data structure performs especially well on binary operations like union and intersection. However, my benchmarks show that it is also (much) faster on insertions and deletions when compared to a generic size-balanced set implementation (see Data.Set).
   • Chris Okasaki and Andy Gill, "Fast Mergeable Integer Maps", Workshop on ML, September 1998, pages 77-86, http://citeseer.ist.psu.edu/okasaki98fast.html
   • D.R. Morrison, "/PATRICIA -- Practical Algorithm To Retrieve Information Coded In Alphanumeric/", Journal of the ACM, 15(4), October 1968, pages 514-534.
   Many operations have a worst-case complexity of O(min(n,W)). This means that the operation can become linear in the number of elements with a maximum of W -- the number of bits in an Int (32 or 64). Unlike the reference implementation in Data.IntSet, Data.Interned.IntSet uses hash consing to ensure that there is only ever one copy of any given IntSet in memory. This is enabled by the normal form of the PATRICIA trie. This can mean a drastic reduction in the memory footprint of a program in exchange for much more costly set manipulation.

7. data IntSet

   intern	Data.Interned.IntSet

   A set of integers.

8. data IntSet s

   intset-imperative	Data.IntSet.Bounded.Imperative

   A strict bounded integer set. The set is very efficient when accessing elements within the bounds of the set. It uses a regular list to hold numbers outside of this range. The type parameter s is determined by the monad the data structure lives in.

9. module Yaya.Containers.Pattern.IntSet

   No documentation available.

10. data IntSet

    classy-prelude-yesod	ClassyPrelude.Yesod

    A set of integers.

Page 2 of many | Previous | Next