Hoogle Search

Within LTS Haskell 22.21 (ghc-9.6.5)

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

  1. module Data.IntSet

    Finite Int Sets

    The IntSet type represents a set of elements of type Int. For a walkthrough of the most commonly used functions see their sets introduction. These modules are intended to be imported qualified, to avoid name clashes with Prelude functions, e.g. 
    import Data.IntSet (IntSet)
import qualified Data.IntSet as IntSet

    Performance information

    Many operations have a worst-case complexity of <math>. This means that the operation can become linear in the number of elements with a maximum of <math> -- the number of bits in an Int (32 or 64).

    Implementation

    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://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.5452
    • D.R. Morrison, "PATRICIA -- Practical Algorithm To Retrieve Information Coded In Alphanumeric", Journal of the ACM, 15(4), October 1968, pages 514-534.
    Additionally, this implementation places bitmaps in the leaves of the tree. Their size is the natural size of a machine word (32 or 64 bits) and greatly reduces the memory footprint and execution times for dense sets, e.g. sets where it is likely that many values lie close to each other. The asymptotics are not affected by this optimization.

  2. data IntSet

    containers Data.IntSet

    A set of integers.

  3. data IntSet

    containers Data.IntSet.Internal

    A set of integers.

  4. module Data.IntSet

    No documentation available.

  5. data () => IntSet

    rio RIO.Prelude.Types

    A set of integers.

  6. data () => IntSet

    relude Relude.Container.Reexport

    A set of integers.

  7. data IntSet

    uniplate Data.Generics.Uniplate.Data.Instances

    Invariant preserving version of IntSet from the containers packages, suitable for use with Uniplate. Use toIntSet to construct values, and fromIntSet to deconstruct values.

  8. data () => IntSet

    classy-prelude ClassyPrelude

    A set of integers.

  9. data () => IntSet

    protolude Protolude

    A set of integers.

  10. data () => IntSet

    basic-prelude CorePrelude

    A set of integers.

Page 1 of many | Next