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.

Exact lookup

1. (<<<>=) :: (MonadState s m, Semigroup r) => LensLike' ((,) r) s r -> r -> m r

   diagrams-lib	Diagrams.Prelude

   Modify the target of a Lens into your Monad's state by using (<>) and return the old value that was replaced. When you do not need the result of the operation, (<>=) is more flexible.

   (<<<>=) :: (MonadState s m, Semigroup r) => Lens' s r -> r -> m r
   (<<<>=) :: (MonadState s m, Semigroup r) => Iso' s r -> r -> m r
   

2. (<<<>~) :: Semigroup r => LensLike' ((,) r) s r -> r -> s -> (r, s)

   diagrams-lib	Diagrams.Prelude

   Modify the target of a monoidally valued Lens by using (<>) a new value and return the old value. When you do not need the old value, (<>~) is more flexible.

   >>> (Sum a,b) & _1 <<<>~ Sum c
   (Sum {getSum = a},(Sum {getSum = a + c},b))
   

   >>> _2 <<<>~ ", 007" $ ("James", "Bond")
   ("Bond",("James","Bond, 007"))
   

   (<<<>~) :: Semigroup r => Lens' s r -> r -> s -> (r, s)
   (<<<>~) :: Semigroup r => Iso' s r -> r -> s -> (r, s)
   

3. (<<>:=) :: (MonadState s m, Semigroup r) => LensLike' ((,) r) s r -> r -> m r

   diagrams-lib	Diagrams.Prelude

   (<>) a Semigroup value onto the front of the target of a Lens into your Monad's state and return the result. However, unlike (<<>=), it is prepended to the head side. When you do not need the result of the operation, (<>:=) is more flexible.

4. (<<>:~) :: Semigroup m => LensLike ((,) m) s t m m -> m -> s -> (m, t)

   diagrams-lib	Diagrams.Prelude

   (<>) a Semigroup value onto the front of the target of a Lens and return the result. However, unlike (<<>~), it is prepended to the head side. When you do not need the result of the operation, (<>:~) is more flexible.

5. (<<>=) :: (MonadState s m, Semigroup r) => LensLike' ((,) r) s r -> r -> m r

   diagrams-lib	Diagrams.Prelude

   (<>) a Semigroup value onto the end of the target of a Lens into your Monad's state and return the result. When you do not need the result of the operation, (<>=) is more flexible.

6. (<<>~) :: Semigroup m => LensLike ((,) m) s t m m -> m -> s -> (m, t)

   diagrams-lib	Diagrams.Prelude

   (<>) a Semigroup value onto the end of the target of a Lens and return the result. When you do not need the result of the operation, (<>~) is more flexible.

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

   Cabal-syntax	Distribution.Compat.Prelude

   New name for <>

8. data ((b :: a) .<> (c :: a)) (d :: a)

   first-class-families	Fcf.Class.Monoid

   Type-level semigroup composition (<>). This is the fcf-encoding of (<>). To define a new semigroup, add type instances to (<>).

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

   first-class-families	Fcf.Utils

   Put two pieces of error message next to each other.

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

    singletons-base	Data.Semigroup.Singletons

    No documentation available.

Page 17 of many | Previous | Next