Hoogle Search

Within LTS Haskell 24.22 (ghc-9.10.3)

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

  1. singletonStar :: OptionsMonad q => [Name] -> q [Dec]

    singletons-th Data.Singletons.TH.CustomStar

    Produce a representation and singleton for the collection of types given. A datatype Rep is created, with one constructor per type in the declared universe. When this type is promoted by the singletons-th library, the constructors become full types in *, not just promoted data constructors. For example, 

    $(singletonStar [''Nat, ''Bool, ''Maybe])
    generates the following: 
    data Rep = Nat | Bool | Maybe Rep deriving (Eq, Ord, Read, Show)
    and its singleton. However, because Rep is promoted to *, the singleton is perhaps slightly unexpected: 
    data SRep (a :: *) where
SNat :: Sing Nat
SBool :: Sing Bool
SMaybe :: Sing a -> Sing (Maybe a)
type instance Sing = SRep
    The unexpected part is that Nat, Bool, and Maybe above are the real Nat, Bool, and Maybe, not just promoted data constructors. Please note that this function is very experimental. Use at your own risk.

  2. singleton2 :: BCP47 -> a -> Trie2 a

    bcp47 Data.BCP47.Trie.Internal

    No documentation available.

  3. singletonWithConflict :: Var QPN -> Conflict -> ConflictSet

    cabal-install-solver Distribution.Solver.Modular.ConflictSet

    No documentation available.

  4. singletonMap :: Key κ => κ -> ν -> Map κ ν

    core-data Core.Data.Structures

    Construct a dictionary with only a single key/value pair.

  5. singletonSet :: Key ε => ε -> Set ε

    core-data Core.Data.Structures

    Construct a collection comprising only the supplied element.

  6. singletonN :: (Representable k, Representable a) => k % 1 -> a % 1 -> Pool % 1 -> NEHeap k a

    linear-base Foreign.Heap

    No documentation available.

  7. singletonBundle :: forall a (m :: Type -> Type) . a -> Bundle m a

    reactive-midyim Reactive.Banana.MIDI.Common

    No documentation available.

  8. singletonCached :: Cached -> Maybe Dynamic

    registry Data.Registry.Internal.Cache

    No documentation available.

  9. singletons :: forall (ins :: [Type]) (out :: [Type]) . MakeSingletons out => Registry ins out -> Registry ins out

    registry Data.Registry.Rio

    Make singletons for all the output types of a registry but only if they not specialized values

  10. singletonDT :: [Key] -> a -> DiscrimTree a

    Agda Agda.TypeChecking.DiscrimTree.Types

    Construct the case tree corresponding to only performing proper matches on the given key. In this context, a "proper match" is any Key that is not FlexK.

Page 46 of many | Previous | Next