Hoogle Search

Within LTS Haskell 24.18 (ghc-9.10.3)

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

Exact lookup

1. Set :: EDNSet -> Value

   hedn	Data.EDN.AST.Types.Value

   #{a set}
   

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

3. module Data.Multimap.Set

   This module provides set-specific multimap functionality.

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

5. Set :: ByteString -> Value

   statsd-rupp	System.Metrics.StatsD.Internal

   No documentation available.

6. module Toml.Codec.Combinator.Set

   TOML-specific combinators for converting between TOML and Haskell Set-like data types. There are two way to represent list-like structures with the tomland library.

   • Ordinary array sets of primitives:

     foo = [100, 200, 300]
     

   • Sets via tables:

     foo = [ {x = 100} , {x = 200} , {x = 300} ]
     OR [[foo]] x = 100 [[foo]] x = 200 [[foo]] x = 300 

   You can find both types of the codecs in this module for different set-like structures. See the following table for the better understanding: TODO: table

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

8. module Yaya.Containers.Pattern.Set

   No documentation available.

9. data Set a

   classy-prelude-yesod	ClassyPrelude.Yesod

   A set of values a.

10. Set :: a -> Update a

    ecstasy	Data.Ecstasy

    Set the current value.

Page 9 of many | Previous | Next