Hoogle Search

Within Stackage Nightly 2025-08-08 (ghc-9.12.2)

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

  1. Set :: ASN1ConstructionType

    asn1-types Data.ASN1.Types

    No documentation available.

  2. module Data.GenValidity.Set

    No documentation available.

  3. module Data.Type.Set

    No documentation available.

  4. data Set a

    type-set Data.Type.Set

    No documentation available.

  5. Set :: v -> UpdateRequest v

    parameterized-utils Data.Parameterized.Map

    Set the value to a new value.

  6. module Rebase.Data.Set

    No documentation available.

  7. data Set ε

    core-data Core.Data.Structures

    A set of unique elements. The element type needs to be an instance of the same Key typeclass that is used for keys in the Map type above. Instances are already provided for many common element types. Set implements Foldable, Monoid, etc so many common operations such as foldr to walk the elements and reduce them, length to return the size of the collection, null to test whether is empty, and (<>) to take the union of two sets are available. To convert to other collection types see fromSet below. (this is a thin wrapper around unordered-containers's HashSet, but if you use the conversion functions to extract a list the list will be ordered according to the elements' Ord instance)

  8. Set :: ASN1ConstructionType

    crypton-asn1-types Data.ASN1.Types

    No documentation available.

  9. data Set a

    linear-base Data.Set.Mutable.Linear

    No documentation available.

  10. module Data.SBV.Set

    A collection of set utilities, useful when working with symbolic sets. To the extent possible, the functions in this module follow those of Data.Set so importing qualified is the recommended workflow. Note that unlike Data.Set, SBV sets can be infinite, represented as a complement of some finite set. This means that a symbolic set is either finite, or its complement is finite. (If the underlying domain is finite, then obviously both the set itself and its complement will always be finite.) Therefore, there are some differences in the API from Haskell sets. For instance, you can take the complement of any set, which is something you cannot do in Haskell! Conversely, you cannot compute the size of a symbolic set (as it can be infinite!), nor you can turn it into a list or necessarily enumerate its elements.

Page 2 of many | Previous | Next