Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

Exact lookup

1. enumOf :: Eq k => Text -> [(Text, k)] -> UnjsonDef k

   unjson	Data.Unjson

   Provide sum type support for parameterless constructors. For related functionality see disjointUnionOf. Example:

   data X = A | B
   
   unjsonX = enumOf "type_thing"
   [("a_thing", A),
   ("b_thing", B)]
   

2. enumUnjsonDef :: (Eq a, Typeable a, Enum a, Bounded a, Data a) => UnjsonDef a

   unjson	Data.Unjson

   Automatic sum type conversion with parameterless constructors. Basically an automatic version of enumOf. Example:

   data X = A | B deriving (Eq, Data, Enum, Bounded)
   
   instance Unjson X where unjsonDef = enumUnjsonDef
   

3. enumContent :: [(Text, a)] -> Content a

   xml-parser	XmlParser

   Map the content using a dictionary.

4. enumAdjacent :: (Ord a, Enum a) => a -> a -> Bool

   Ranged-sets	Data.Ranged.Boundaries

   Check adjacency for sparse enumerated types (i.e. where there is no value between x and succ x).

5. enumFrom :: Enum a => a -> [a]

   classy-prelude-yesod	ClassyPrelude.Yesod

   Used in Haskell's translation of [n..] with [n..] = enumFrom n, a possible implementation being enumFrom n = n : enumFrom (succ n).

   Examples

   • enumFrom 4 :: [Integer] = [4,5,6,7,...]

   • enumFrom 6 :: [Int] = [6,7,8,9,...,maxBound ::
     Int]

6. enumFromThen :: Enum a => a -> a -> [a]

   classy-prelude-yesod	ClassyPrelude.Yesod

   Used in Haskell's translation of [n,n'..] with [n,n'..] = enumFromThen n n', a possible implementation being enumFromThen n n' = n : n' : worker (f x) (f x n'), worker s v = v : worker s (s v), x = fromEnum n' - fromEnum n and

   f n y
   | n > 0 = f (n - 1) (succ y)
   | n < 0 = f (n + 1) (pred y)
   | otherwise = y
   
   

   Examples

   • enumFromThen 4 6 :: [Integer] = [4,6,8,10...]

   • enumFromThen 6 2 :: [Int] = [6,2,-2,-6,...,minBound ::
     Int]

7. enumFromThenTo :: Enum a => a -> a -> a -> [a]

   classy-prelude-yesod	ClassyPrelude.Yesod

   Used in Haskell's translation of [n,n'..m] with [n,n'..m] = enumFromThenTo n n' m, a possible implementation being enumFromThenTo n n' m = worker (f x) (c x) n m, x = fromEnum n' - fromEnum n, c x = bool (>=) ((x 0)

   f n y
   | n > 0 = f (n - 1) (succ y)
   | n < 0 = f (n + 1) (pred y)
   | otherwise = y
   
   

   and

   worker s c v m
   | c v m = v : worker s c (s v) m
   | otherwise = []
   
   

   Examples

   • enumFromThenTo 4 2 -6 :: [Integer] =
     [4,2,0,-2,-4,-6]

   • enumFromThenTo 6 8 2 :: [Int] = []

8. enumFromTo :: Enum a => a -> a -> [a]

   classy-prelude-yesod	ClassyPrelude.Yesod

   Used in Haskell's translation of [n..m] with [n..m] = enumFromTo n m, a possible implementation being

   enumFromTo n m
   | n <= m = n : enumFromTo (succ n) m
   | otherwise = []
   
   

   Examples

   • enumFromTo 6 10 :: [Int] = [6,7,8,9,10]

   • enumFromTo 42 1 :: [Integer] = []

9. enumFromToC :: forall (m :: Type -> Type) a i . (Monad m, Enum a, Ord a) => a -> a -> ConduitT i a m ()

   classy-prelude-yesod	ClassyPrelude.Yesod

   Enumerate from a value to a final value, inclusive, via succ. This is generally more efficient than using Prelude's enumFromTo and combining with sourceList since this avoids any intermediate data structures.

10. enumFrom :: Enum a => a -> [a]

    constrained-categories	Control.Category.Constrained.Prelude

    Used in Haskell's translation of [n..] with [n..] = enumFrom n, a possible implementation being enumFrom n = n : enumFrom (succ n).

    Examples

    • enumFrom 4 :: [Integer] = [4,5,6,7,...]

    • enumFrom 6 :: [Int] = [6,7,8,9,...,maxBound ::
      Int]

Page 85 of many | Previous | Next