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.

Exact lookup

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

2. singletonProjectConfigSkeleton :: ProjectConfig -> ProjectConfigSkeleton

   cabal-install	Distribution.Client.ProjectConfig.Legacy

   No documentation available.

3. singletonFL :: a -> FocusList a

   focuslist	Data.FocusList

   Create a FocusList with a single element.

   >>> singletonFL "hello"
   FocusList (Focus 0) ["hello"]
   

   complexity: O(1)

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

   greskell	Data.Greskell

   Keys with a single Key.

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

   greskell	Data.Greskell.Graph

   Keys with a single Key.

6. singletonNodeSet :: NavXmlTree -> NodeSet

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

   No documentation available.

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

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

   kdt	Data.KdMap.Static

   Builds a KdMap with a single point-value pair and a user-specified squared distance function.

9. singletonWithDist :: Real a => PointAsListFn a p -> SquaredDistanceFn a p -> p -> KdTree a p

   kdt	Data.KdTree.Dynamic

   Generates a KdTree with a single point using a user-specified distance function.

10. singletonWithDist :: Real a => PointAsListFn a p -> SquaredDistanceFn a p -> p -> KdTree a p

    kdt	Data.KdTree.Static

    Builds a KdTree with a single point using a user-specified squared distance function.

Page 47 of many | Previous | Next