Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

Exact lookup

1. GHEInvalidGitFile :: String -> GitHashException

   githash	GitHash

   No documentation available.

2. giDescribe :: GitInfo -> String

   githash	GitHash

   The output of git describe --always for the most recent commit.

3. giDirty :: GitInfo -> Bool

   githash	GitHash

   No documentation available.

4. type Grid s t a b = forall (f :: Type -> Type) (g :: Type -> Type) . (Applicative f, Functor g) => AdapterLike f g s t a b

   lens-family	Lens.Family2

   No documentation available.

5. type Grid' s a = forall (f :: Type -> Type) (g :: Type -> Type) . (Applicative f, Functor g) => AdapterLike' f g s a

   lens-family	Lens.Family2

   No documentation available.

6. data AlongsideLeft (f :: Type -> Type) b a

   lens-family	Lens.Family2.Stock

   No documentation available.

7. data AlongsideRight (f :: Type -> Type) a b

   lens-family	Lens.Family2.Stock

   No documentation available.

8. alongside :: Functor f => LensLike (AlongsideLeft f b1) s0 t0 a0 b0 -> LensLike (AlongsideRight f t0) s1 t1 a1 b1 -> LensLike f (s0, s1) (t0, t1) (a0, a1) (b0, b1)

   lens-family	Lens.Family2.Stock

   alongside :: Lens s0 t0 a0 b0 -> Lens s1 t1 a1 b1 -> Lens (s0, s1) (t0, t1) (a0, a1) (b0, b1)
   

   alongside :: Getter s0 t0 a0 b0 -> Getter s1 t1 a1 b1 -> Getter (s0, s1) (t0, t1) (a0, a1) (b0, b1)
   

   Given two lens/getter families, make a new lens/getter on their product.

9. beside :: (Applicative f, Functor g) => AdapterLike f g s0 t0 a b -> AdapterLike f g s1 t1 a b -> AdapterLike f g (s0, s1) (t0, t1) a b

   lens-family	Lens.Family2.Stock

   beside :: Grid s1 t1 a b -> Grid s2 t2 a b -> Grid (s1, s2) (t1, t2) a b
   

   Given two grids referencing a type c, create a grid on the pair referencing c.

10. beside' :: Functor g => GrateLike g s0 t0 a b -> GrateLike g s1 t1 a b -> GrateLike g (s0, s1) (t0, t1) a b

    lens-family	Lens.Family2.Stock

    beside' :: Grate s0 t0 a b -> Grate s1 t1 a b -> Grate (s0, s1) (t0, t1) a b
    

    beside' :: Resetter s0 t0 a b -> Resetter s1 t1 a b -> Resetter (s0, s1) (t0, t1) a b
    

    Given two grates/resetters referencing a type c, create a grate/resetter on the pair referencing c.

Page 578 of many | Previous | Next