Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. SetAnsiStyle :: Maybe (Intensity, Color) -> Maybe (Intensity, Color) -> Maybe Bold -> Maybe Italicized -> Maybe Underlined -> AnsiStyle

   prettyprinter-ansi-terminal	Prettyprinter.Render.Terminal.Internal

   No documentation available.

2. data Settings (m :: Type -> Type)

   haskeline	System.Console.Haskeline

   Application-specific customizations to the user interface.

3. Settings :: CompletionFunc m -> Maybe FilePath -> Bool -> Settings (m :: Type -> Type)

   haskeline	System.Console.Haskeline

   No documentation available.

4. class (Applicative f, Distributive f, Traversable f) => Settable (f :: Type -> Type)

   diagrams-lib	Diagrams.Prelude

   Anything Settable must be isomorphic to the Identity Functor.

5. type Setter s t a b = forall (f :: Type -> Type) . Settable f => a -> f b -> s -> f t

   diagrams-lib	Diagrams.Prelude

   The only LensLike law that can apply to a Setter l is that

   set l y (set l x a) ≡ set l y a
   

   You can't view a Setter in general, so the other two laws are irrelevant. However, two Functor laws apply to a Setter:

   over l id ≡ id
   over l f . over l g ≡ over l (f . g)
   

   These can be stated more directly:

   l pure ≡ pure
   l f . untainted . l g ≡ l (f . untainted . g)
   

   You can compose a Setter with a Lens or a Traversal using (.) from the Prelude and the result is always only a Setter and nothing more.

   >>> over traverse f [a,b,c,d]
   [f a,f b,f c,f d]
   

   >>> over _1 f (a,b)
   (f a,b)
   

   >>> over (traverse._1) f [(a,b),(c,d)]
   [(f a,b),(f c,d)]
   

   >>> over both f (a,b)
   (f a,f b)
   

   >>> over (traverse.both) f [(a,b),(c,d)]
   [(f a,f b),(f c,f d)]
   

6. Setter :: Setter s t a b -> ReifiedSetter s t a b

   diagrams-lib	Diagrams.Prelude

   No documentation available.

7. type Setter' s a = Setter s s a a

   diagrams-lib	Diagrams.Prelude

   A Setter' is just a Setter that doesn't change the types. These are particularly common when talking about monomorphic containers. e.g.

   sets Data.Text.map :: Setter' Text Char
   

   type Setter' = Simple Setter
   

8. type Setting (p :: Type -> Type -> Type) s t a b = p a Identity b -> s -> Identity t

   diagrams-lib	Diagrams.Prelude

   This is a convenient alias when defining highly polymorphic code that takes both ASetter and AnIndexedSetter as appropriate. If a function takes this it is expecting one of those two things based on context.

9. type Setting' (p :: Type -> Type -> Type) s a = Setting p s s a a

   diagrams-lib	Diagrams.Prelude

   This is a convenient alias when defining highly polymorphic code that takes both ASetter' and AnIndexedSetter' as appropriate. If a function takes this it is expecting one of those two things based on context.

10. data Set' sep b a

    Cabal-syntax	Distribution.FieldGrammar.Newtypes

    Like List, but for Set.

Page 30 of many | Previous | Next