Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

  1. required_ :: Text -> Attribute

    lucid Lucid.Html5

    The required attribute.

  2. _equal :: Word8

    word8 Data.Word8

    No documentation available.

  3. type AnEquality (s :: k) (t :: k1) (a :: k) (b :: k2) = Identical a Proxy b a Proxy b -> Identical a Proxy b s Proxy t

    diagrams-lib Diagrams.Prelude

    When you see this as an argument to a function, it expects an Equality.

  4. type AnEquality' (s :: k) (a :: k) = AnEquality s s a a

    diagrams-lib Diagrams.Prelude

    A Simple AnEquality.

  5. data Sequenced a (m :: Type -> Type)

    diagrams-lib Diagrams.Prelude

    Used internally by mapM_ and the like. The argument a of the result should not be used! See 4.16 Changelog entry for the explanation of "why not Apply f =>"?

  6. mapEq :: forall k1 k2 (s :: k1) (t :: k2) (a :: k1) (b :: k2) f . AnEquality s t a b -> f s -> f a

    diagrams-lib Diagrams.Prelude

    We can use Equality to do substitution into anything.

  7. sequence1Of_ :: Functor f => Getting (TraversedF a f) s (f a) -> s -> f ()

    diagrams-lib Diagrams.Prelude

    See sequenceAOf_ and traverse1Of_. 

    sequence1Of_ :: Apply f => Fold1 s (f a) -> s -> f ()

  8. sequenceAOf :: LensLike f s t (f b) b -> s -> f t

    diagrams-lib Diagrams.Prelude

    Evaluate each action in the structure from left to right, and collect the results. 

    >>> sequenceAOf both ([1,2],[3,4])
[(1,3),(1,4),(2,3),(2,4)]

    sequenceA ≡ sequenceAOf traverse ≡ traverse id
sequenceAOf l ≡ traverseOf l id ≡ l id

    sequenceAOf :: Functor f => Iso s t (f b) b       -> s -> f t
sequenceAOf :: Functor f => Lens s t (f b) b      -> s -> f t
sequenceAOf :: Applicative f => Traversal s t (f b) b -> s -> f t

  9. sequenceAOf_ :: Functor f => Getting (Traversed a f) s (f a) -> s -> f ()

    diagrams-lib Diagrams.Prelude

    Evaluate each action in observed by a Fold on a structure from left to right, ignoring the results. 

    sequenceA_ ≡ sequenceAOf_ folded

    >>> sequenceAOf_ both (putStrLn "hello",putStrLn "world")
hello
world

    sequenceAOf_ :: Functor f     => Getter s (f a)     -> s -> f ()
sequenceAOf_ :: Applicative f => Fold s (f a)       -> s -> f ()
sequenceAOf_ :: Functor f     => Lens' s (f a)      -> s -> f ()
sequenceAOf_ :: Functor f     => Iso' s (f a)       -> s -> f ()
sequenceAOf_ :: Applicative f => Traversal' s (f a) -> s -> f ()
sequenceAOf_ :: Applicative f => Prism' s (f a)     -> s -> f ()

  10. sequenceBy :: Traversable t => (forall x . () => x -> f x) -> (forall x y . () => f (x -> y) -> f x -> f y) -> t (f a) -> f (t a)

    diagrams-lib Diagrams.Prelude

    Sequence a container using its Traversable instance using explicitly provided Applicative operations. This is like sequence where the Applicative instance can be manually specified.

Page 283 of many | Previous | Next