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. (%<>) :: forall (t1 :: a) (t2 :: a) . SSemigroup a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ((<>@#@$) :: TyFun a (a ~> a) -> Type) t1) t2)

    singletons-base Data.Singletons.Base.TH

    No documentation available.

  2. (:%<>:) :: forall (e1 :: ErrorMessage' Symbol) (e2 :: ErrorMessage' Symbol) . Sing e1 -> Sing e2 -> SErrorMessage (e1 ':<>: e2)

    singletons-base Data.Singletons.Base.TypeError

    No documentation available.

  3. (:<>:) :: ErrorMessage' s -> ErrorMessage' s -> ErrorMessage' s

    singletons-base Data.Singletons.Base.TypeError

    Put two pieces of error message next to each other.

  4. data (a6989586621680219413 :: ErrorMessage' s) :<>:@#@$$ (b :: TyFun ErrorMessage' s ErrorMessage' s)

    singletons-base Data.Singletons.Base.TypeError

    No documentation available.

  5. type family (a6989586621680219413 :: ErrorMessage' s) :<>:@#@$$$ (a6989586621680219414 :: ErrorMessage' s) :: ErrorMessage' s

    singletons-base Data.Singletons.Base.TypeError

    No documentation available.

  6. (%<>) :: forall (t1 :: a) (t2 :: a) . SSemigroup a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ((<>@#@$) :: TyFun a (a ~> a) -> Type) t1) t2)

    singletons-base Prelude.Singletons

    No documentation available.

  7. (:<>:) :: ErrorMessage -> ErrorMessage -> ErrorMessage

    ghc-internal GHC.Internal.TypeError

    Put two pieces of error message next to each other.

  8. (:<>:) :: ErrorMessage -> ErrorMessage -> ErrorMessage

    ghc-internal GHC.Internal.TypeLits

    Put two pieces of error message next to each other.

  9. (|<>) :: Ord k => OMap k v -> OMap k v -> OMap k v

    ordered-containers Data.Map.Ordered

    When a key occurs in both maps, prefer the value from the first map. See asymptotics of unionWithL.

  10. (|<>) :: Ord k => OMap k v -> OMap k v -> OMap k v

    ordered-containers Data.Map.Ordered.Strict

    When a key occurs in both maps, prefer the value from the first map. See asymptotics of unionWithL.

Page 18 of many | Previous | Next