Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. classIdNamer :: FieldNamer

   lens	Control.Lens.TH

   A FieldNamer for classIdFields.

2. makeFieldsId :: Name -> DecsQ

   lens	Control.Lens.TH

   Generate overloaded field accessors, using exactly the same names as the underlying fields. Intended for use with the NoFieldSelectors and DuplicateRecordFields language extensions. As an example:

   data Foo a  = Foo { x :: Int, y :: a }
   newtype Bar = Bar { x :: Char }
   makeFieldsId ''Foo
   makeFieldsId ''Bar
   

   will create classes

   class HasX s a | s -> a where
   x :: Lens' s a
   class HasY s a | s -> a where
   y :: Lens' s a
   

   together with instances

   instance HasX (Foo a) Int
   instance HasY (Foo a) a where
   instance HasX Bar Char where
   

   makeFieldsId = makeLensesWith classIdFields
   

3. beside :: (Representable q, Applicative (Rep q), Applicative f, Bitraversable r) => Optical p q f s t a b -> Optical p q f s' t' a b -> Optical p q f (r s s') (r t t') a b

   lens	Control.Lens.Traversal

   Apply a different Traversal or Fold to each side of a Bitraversable container.

   beside :: Traversal s t a b                -> Traversal s' t' a b                -> Traversal (r s s') (r t t') a b
   beside :: IndexedTraversal i s t a b       -> IndexedTraversal i s' t' a b       -> IndexedTraversal i (r s s') (r t t') a b
   beside :: IndexPreservingTraversal s t a b -> IndexPreservingTraversal s' t' a b -> IndexPreservingTraversal (r s s') (r t t') a b
   

   beside :: Traversal s t a b                -> Traversal s' t' a b                -> Traversal (s,s') (t,t') a b
   beside :: Lens s t a b                     -> Lens s' t' a b                     -> Traversal (s,s') (t,t') a b
   beside :: Fold s a                         -> Fold s' a                          -> Fold (s,s') a
   beside :: Getter s a                       -> Getter s' a                        -> Fold (s,s') a
   

   beside :: IndexedTraversal i s t a b       -> IndexedTraversal i s' t' a b       -> IndexedTraversal i (s,s') (t,t') a b
   beside :: IndexedLens i s t a b            -> IndexedLens i s' t' a b            -> IndexedTraversal i (s,s') (t,t') a b
   beside :: IndexedFold i s a                -> IndexedFold i s' a                 -> IndexedFold i (s,s') a
   beside :: IndexedGetter i s a              -> IndexedGetter i s' a               -> IndexedFold i (s,s') a
   

   beside :: IndexPreservingTraversal s t a b -> IndexPreservingTraversal s' t' a b -> IndexPreservingTraversal (s,s') (t,t') a b
   beside :: IndexPreservingLens s t a b      -> IndexPreservingLens s' t' a b      -> IndexPreservingTraversal (s,s') (t,t') a b
   beside :: IndexPreservingFold s a          -> IndexPreservingFold s' a           -> IndexPreservingFold (s,s') a
   beside :: IndexPreservingGetter s a        -> IndexPreservingGetter s' a         -> IndexPreservingFold (s,s') a
   

   >>> ("hello",["world","!!!"])^..beside id traverse
   ["hello","world","!!!"]
   

4. _DecidedLazy :: Prism' DecidedStrictness ()

   lens	Language.Haskell.TH.Lens

   No documentation available.

5. _DecidedStrict :: Prism' DecidedStrictness ()

   lens	Language.Haskell.TH.Lens

   No documentation available.

6. _DecidedUnpack :: Prism' DecidedStrictness ()

   lens	Language.Haskell.TH.Lens

   No documentation available.

7. _ExplBidir :: Prism' PatSynDir [Clause]

   lens	Language.Haskell.TH.Lens

   No documentation available.

8. _ImplBidir :: Prism' PatSynDir ()

   lens	Language.Haskell.TH.Lens

   No documentation available.

9. _Unidir :: Prism' PatSynDir ()

   lens	Language.Haskell.TH.Lens

   No documentation available.

10. dividing :: (Fractional a, Eq a) => a -> Iso' a a

    lens	Numeric.Lens

    dividing n = iso (/n) (*n)
    dividing n = from (multiplying n)
    

    Note: This errors for n = 0

Page 388 of many | Previous | Next