Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

Exact lookup

1. idIO :: (a -> IO ()) -> a -> a

   code-conjure	Conjure.Utils

   WARNING: uses unsafePerformIO and should only be used for debugging!

   > idIO print 10
   10
   10
   

2. identity :: (C sh, Floating a) => sh -> Square sh a

   comfort-blas	Numeric.BLAS.Matrix.RowMajor

   >>> Matrix.identity (Shape.ZeroBased 0) :: Matrix.Square (Shape.ZeroBased Int) Real_
   StorableArray.fromList (ZeroBased {... 0},ZeroBased {... 0}) []
   
   >>> Matrix.identity (Shape.ZeroBased 3) :: Matrix.Square (Shape.ZeroBased Int) Real_
   StorableArray.fromList (ZeroBased {... 3},ZeroBased {... 3}) [1.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,1.0]
   

3. idm :: Monoid m => m

   configuration-tools	Configuration.Utils.CommandLine

   Trivial option modifier.

4. identity :: (Num a, Bits a) => IntTrie a

   data-inttrie	Data.IntTrie

   The identity trie.

   apply identity = id
   

5. idecideAll :: forall k (p :: k ~> Type) (as :: f k) . Universe f => (forall (a :: k) . () => Elem f as a -> Sing a -> Decision (p @@ a)) -> Sing as -> Decision (All f p @@ as)

   decidable	Data.Type.Predicate.Quantification

   decideAll, but providing an Elem.

6. idecideAny :: forall k (p :: k ~> Type) (as :: f k) . Universe f => (forall (a :: k) . () => Elem f as a -> Sing a -> Decision (p @@ a)) -> Sing as -> Decision (Any f p @@ as)

   decidable	Data.Type.Predicate.Quantification

   decideAny, but providing an Elem.

7. idecideNone :: forall (f :: Type -> Type) k (p :: k ~> Type) (as :: f k) . Universe f => (forall (a :: k) . () => Elem f as a -> Sing a -> Decision (p @@ a)) -> Sing as -> Decision (None f p @@ as)

   decidable	Data.Type.Predicate.Quantification

   decideNone, but providing an Elem.

8. idecideAll :: forall k (p :: k ~> Type) (as :: f k) . Universe f => (forall (a :: k) . () => Elem f as a -> Sing a -> Decision (p @@ a)) -> Sing as -> Decision (All f p @@ as)

   decidable	Data.Type.Universe

   decideAll, but providing an Elem.

9. idecideAny :: forall k (p :: k ~> Type) (as :: f k) . Universe f => (forall (a :: k) . () => Elem f as a -> Sing a -> Decision (p @@ a)) -> Sing as -> Decision (Any f p @@ as)

   decidable	Data.Type.Universe

   decideAny, but providing an Elem.

10. idle :: Delta da => Base da -> Machine da da

    delta-types	Data.Delta.Embedding.Internal

    Identity machine starting from a base type.

Page 316 of many | Previous | Next