Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

Exact lookup

1. setDiagramImports :: MonadInterpreter m => String -> [(String, Maybe String)] -> m ()

   diagrams-builder	Diagrams.Builder

   Set up the module to be interpreted, in the context of the necessary imports.

2. setDyn :: Typeable a => DynamicState -> a -> DynamicState

   dynamic-state	Data.DynamicState

   No documentation available.

3. setLoggingDestination :: String -> LogDestination -> LogFromAllPackages -> IO ()

   easy-logger	EasyLogger.Logger

   Set the destination for all consequitive for logging. You should only set this once, at the beginning of the program! The default is LogStdOut.

4. setMinLogLevel :: LogLevel -> IO ()

   easy-logger	EasyLogger.Logger

   Set the least logging level. Levels lower will not be logged. Log Level Order: Debug < Info < Warning < Error. None disables all logging. Note that the output to stderr using e.g. logPrintError will not be affected!

5. setPrintLocationToConsole :: Bool -> IO ()

   easy-logger	EasyLogger.Logger

   Set the least logging level. Levels lower will not be logged. Log Level Order: Debug < Info < Warning < Error. None disables all logging. Note that the output to stderr using e.g. logPrintError will not be affected!

6. setExtended :: Bool -> Context a -> Context a

   ede	Text.EDE.Internal.Eval

   No documentation available.

7. settings :: Lens' Env Syntax

   ede	Text.EDE.Internal.Parser

   No documentation available.

8. setCons :: Listable a => ([a] -> b) -> [[b]]

   extrapolate	Test.Extrapolate

   Given a constructor that takes a set of elements (as a list), lists tiers of applications of this constructor. A naive Listable instance for the Set (of Data.Set) would read:

   instance Listable a => Listable (Set a) where
   tiers  =  cons0 empty \/ cons2 insert
   

   The above instance has a problem: it generates repeated sets. A more efficient implementation that does not repeat sets is given by:

   tiers  =  setCons fromList
   

   Alternatively, you can use setsOf direclty.

9. setsOf :: [[a]] -> [[[a]]]

   extrapolate	Test.Extrapolate

   Takes as argument tiers of element values; returns tiers of size-ordered lists of elements without repetition.

   setsOf [[0],[1],[2],...] =
   [ [[]]
   , [[0]]
   , [[1]]
   , [[0,1],[2]]
   , [[0,2],[3]]
   , [[0,3],[1,2],[4]]
   , [[0,1,2],[0,4],[1,3],[5]]
   , ...
   ]
   

   Can be used in the constructor of specialized Listable instances. For Set (from Data.Set), we would have:

   instance Listable a => Listable (Set a) where
   tiers  =  mapT fromList $ setsOf tiers
   

10. setCons :: Listable a => ([a] -> b) -> [[b]]

    extrapolate	Test.Extrapolate.Core

    Given a constructor that takes a set of elements (as a list), lists tiers of applications of this constructor. A naive Listable instance for the Set (of Data.Set) would read:

    instance Listable a => Listable (Set a) where
    tiers  =  cons0 empty \/ cons2 insert
    

    The above instance has a problem: it generates repeated sets. A more efficient implementation that does not repeat sets is given by:

    tiers  =  setCons fromList
    

    Alternatively, you can use setsOf direclty.

Page 776 of many | Previous | Next