Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

  1. reallyUnsafePtrEquality :: a -> a -> Int#

    ghc-prim GHC.Prim.PtrEq

    Compare the underlying pointers of two values for equality. Returns 1 if the pointers are equal and 0 otherwise. The two values must be of the same type, of kind Type. See also reallyUnsafePtrEquality#, which doesn't have such restrictions.

  2. unsafePtrEquality# :: forall (a :: UnliftedType) (b :: UnliftedType) . a -> b -> Int#

    ghc-prim GHC.Prim.PtrEq

    Compare the underlying pointers of two unlifted values for equality. This is less dangerous than reallyUnsafePtrEquality, since the arguments are guaranteed to be evaluated. This means there is no risk of accidentally comparing a thunk. It's however still more dangerous than e.g. sameArray#.

  3. reallyUnsafePtrEquality# :: a_levpoly -> b_levpoly -> Int#

    ghc-prim GHC.PrimopWrappers

    No documentation available.

  4. seq# :: a -> State# s -> (# State# s, a #)

    ghc-prim GHC.PrimopWrappers

    No documentation available.

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

    lens Control.Lens.Combinators

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

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

    lens Control.Lens.Combinators

    A Simple AnEquality.

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

    lens Control.Lens.Combinators

    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 =>"?

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

    lens Control.Lens.Combinators

    We can use Equality to do substitution into anything.

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

    lens Control.Lens.Combinators

    See sequenceAOf_ and traverse1Of_. 

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

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

    lens Control.Lens.Combinators

    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

Page 149 of many | Previous | Next