Hoogle Search

Within Stackage Nightly 2025-09-22 (ghc-9.12.2)

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

Exact lookup

1. class Set (b :: Type -> Type) (m :: Type -> Type) a v | m -> b, a -> b v

   metrics	Data.Metrics.Types

   Update a metric by performing wholesale replacement of a value.

2. module Data.Multimap.Set

   This module provides set-specific multimap functionality.

3. module Data.Recursive.Set

   The type RS.RSet a is like Set a, but allows recursive definitions:

   >>> :{
   let s1 = RS.insert 23 s2
   s2 = RS.insert 42 s1
   in RS.get s1
   :}
   fromList [23,42]
   

4. data Set

   relational-query	Database.Relational.Arrow

   Type tag for normal aggregatings set

5. data Set

   relational-query	Database.Relational.Context

   Type tag for normal aggregatings set

6. module Database.Relational.Set

   This module defines set operations on monadic Relation operations.

7. 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.

8. module Data.Trie.Set

   This module provides a type TSet c, which is a set of list of some characters. It serves almost same purpose to Set [c], and functions of this module mirrors functions with same name from Data.Set module. The advantages to use this module over Data.Set are:

   • Faster member.
   • Partial match provided by beginWith function.
   • Efficient append, prefixes, and suffixes functions.
   But notice for some disadvantages:
   • Some operations are slower than Set [c]. Especially, count is much much slower than size (because Set.size is already recorded in the data structure). Consider TSet.count be like length of list.
   • Constructed TSet c from a list of lists [[c]] do not share each member lists with original list unlike Set [c] does. This means holding both TSet c and [[c]] in memory consumes much more memory than Set [c] and [[c]].

9. Set :: a -> Update a

   ecstasy	Data.Ecstasy

   Set the current value.

10. Set :: a -> Update a

    ecstasy	Data.Ecstasy.Types

    Set the current value.

Page 4 of many | Previous | Next