Hoogle Search

Within LTS Haskell 24.39 (ghc-9.10.3)

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

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

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

  3. singletonS :: DeBruijn a => Int -> a -> Substitution' a

    Agda Agda.TypeChecking.Substitute.Class

    To replace index n by term u, do applySubst (singletonS n u). Γ, Δ ⊢ u : A --------------------------------- Γ, Δ ⊢ singletonS |Δ| u : Γ, A, Δ

  4. singletonProjectConfigSkeleton :: ProjectConfig -> ProjectConfigSkeleton

    cabal-install Distribution.Client.ProjectConfig.Legacy

    No documentation available.

  5. singletonUnique :: Uniquable a => a -> UniqMap a

    clash-lib Clash.Data.UniqMap

    A map containing a single value indexed by the value's unique.

  6. singletonFL :: a -> FocusList a

    focuslist Data.FocusList

    Create a FocusList with a single element. 

    >>> singletonFL "hello"
FocusList (Focus 0) ["hello"]
    complexity: O(1)

  7. singletonKeys :: Key a b -> Keys a

    greskell Data.Greskell

    Keys with a single Key.

  8. singletonKeys :: Key a b -> Keys a

    greskell Data.Greskell.Graph

    Keys with a single Key.

  9. singletonNodeSet :: NavXmlTree -> NodeSet

    hxt-xpath Text.XML.HXT.XPath.XPathDataTypes

    No documentation available.

  10. singletonWithDist :: Real a => PointAsListFn a p -> SquaredDistanceFn a p -> (p, v) -> KdMap a p v

    kdt Data.KdMap.Dynamic

    Generates a KdMap with a single point-value pair using a user-specified distance function.

Page 47 of many | Previous | Next