Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. module Data.Enum.Set

   Efficient sets over bounded enumerations, using bitwise operations based on containers and EdisonCore. In many cases, EnumSets may be optimised away entirely by constant folding at compile-time. For example, in the following code:

   import Data.Enum.Set as E
   
   data Foo = A | B | C | D | E | F | G | H deriving (Bounded, Enum, Eq, Ord)
   
   instance E.AsEnumSet Foo
   
   addFoos :: E.EnumSet Foo -> E.EnumSet Foo
   addFoos = E.delete A . E.insert B
   
   bar :: E.EnumSet Foo
   bar = addFoos $ E.fromFoldable [A, C, E]
   
   barHasA :: Bool
   barHasA = E.member A bar
   

   With -O or -O2, bar will compile to GHC.Types.W# 22## and barHasA will compile to GHC.Types.False. By default, Words are used as the representation. Other representations may be chosen in the class instance:

   {-# LANGUAGE TypeFamilies #-}
   
   import Data.Enum.Set as E
   import Data.Word (Word64)
   
   data Foo = A | B | C | D | E | F | G | H deriving (Bounded, Enum, Eq, Ord, Show)
   
   instance E.AsEnumSet Foo where
   type EnumSetRep Foo = Word64
   

   For type EnumSet E, EnumSetRep E should be a Word-like type that implements Bits and Num, and E should be a type that implements Eq and Enum equivalently and is a bijection to Int over its range. EnumSet E can only store a value of E if the result of applying fromEnum to the value is positive and less than the number of bits in EnumSetRep E. For this reason, it is preferable for E to be a type that derives Eq and Enum, and for EnumSetRep E to have more bits than the number of constructors of E. If the highest fromEnum value of E is 29, EnumSetRep E should be Word, because it always has at least 30 bits. This is the default implementation. Otherwise, options include Word32, Word64, and the wide-word package's Data.WideWord.Word128. Foreign types may also be used. Note: complexity calculations assume that EnumSetRep E implements Bits with constant-time functions, as is the case with Word etc. Otherwise, the complexity of those operations should be added to the complexity of EnumSet functions.

2. module CabalGild.Unstable.Type.Set

   No documentation available.

3. newtype Set s b a

   cabal-gild	CabalGild.Unstable.Type.Set

   A thin wrapper around Set'. This is used to define custom instances of Pretty that use trailing commas when the Cabal spec version is recent enough (at least 2.2).

4. Set :: Set' s b a -> Set s b a

   cabal-gild	CabalGild.Unstable.Type.Set

   No documentation available.

5. Set :: Set Version -> Versions

   cabal-gild	CabalGild.Unstable.Type.VersionRange

   No documentation available.

6. module Data.Delta.Set

   Delta types for Set.

7. data Set a

   distribution-opensuse	OpenSuse.Prelude

   A set of values a.

8. data Set a

   hashmap	Data.HashSet

   The abstract type of a Set. Its interface is a suitable subset of IntSet.

9. Set :: EDNSet -> Value

   hedn	Data.EDN

   #{a set}
   

10. Set :: EDNSet -> Value

    hedn	Data.EDN.AST.Types.Value

    #{a set}
    

Page 8 of many | Previous | Next