Hoogle Search

Within LTS Haskell 24.51 (ghc-9.10.3)

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

Exact lookup

1. data ((a6989586621679187056 :: b ~> c) .@#@$$$ (a6989586621679187057 :: a ~> b)) (c1 :: TyFun a c)

   singletons-base	Prelude.Singletons

   No documentation available.

2. type family ((a6989586621679187056 :: b ~> c) .@#@$$$$ (a6989586621679187057 :: a ~> b)) (a6989586621679187058 :: a) :: c

   singletons-base	Prelude.Singletons

   No documentation available.

3. (.<|) :: Char -> Buffer % 1 -> Buffer

   text-builder-linear	Data.Text.Builder.Linear.Buffer

   Prepend Char to a Buffer by mutating it.

   >>> :set -XLinearTypes
   
   >>> runBuffer (\b -> 'q' .<| 'w' .<| b)
   "qw"
   

   Warning: In contrast to singleton, it is the responsibility of the caller to sanitize surrogate code points with safe.

4. (.~) :: ((a -> Identity b) -> s -> Identity t) -> b -> s -> t

   generic-lens	Data.Generics.Internal.VL

   No documentation available.

5. (...) :: Enum a => a -> Infinite a

   infinite-list	Data.List.Infinite

   Generate an infinite progression, starting from a given element, similar to [x..]. For better user experience consider enabling {-# LANGUAGE PostfixOperators #-}:

   >>> :set -XPostfixOperators
   
   >>> Data.List.Infinite.take 10 (0...)
   [0,1,2,3,4,5,6,7,8,9]
   

   Beware that for finite types (...) applies cycle atop of [x..]:

   >>> :set -XPostfixOperators
   
   >>> Data.List.Infinite.take 10 (EQ...)
   [EQ,GT,EQ,GT,EQ,GT,EQ,GT,EQ,GT]
   

   Remember that Int is a finite type as well. One is unlikely to hit this on a 64-bit architecture, but on a 32-bit machine it's fairly possible to traverse ((0 :: Int) ...) far enough to encounter 0 again.

6. (....) :: Enum a => (a, a) -> Infinite a

   infinite-list	Data.List.Infinite

   Generate an infinite arithmetic progression, starting from given elements, similar to [x,y..]. For better user experience consider enabling {-# LANGUAGE PostfixOperators #-}:

   >>> :set -XPostfixOperators
   
   >>> Data.List.Infinite.take 10 ((1,3)....)
   [1,3,5,7,9,11,13,15,17,19]
   

   Beware that for finite types (....) applies cycle atop of [x,y..]:

   >>> :set -XPostfixOperators
   
   >>> Data.List.Infinite.take 10 ((EQ,GT)....)
   [EQ,GT,EQ,GT,EQ,GT,EQ,GT,EQ,GT]
   

   Remember that Int is a finite type as well: for a sufficiently large step of progression y - x one may observe ((x :: Int, y)....) cycling back to emit x fairly soon.

7. (.~) :: Setter s t a b -> b -> s -> t

   lens-family	Lens.Family2

   Set all referenced fields to the given value.

8. (.=) :: MonadState s m => Setter s s a b -> b -> m ()

   lens-family	Lens.Family2.State.Lazy

   Set a field of the state.

9. (.=) :: MonadState s m => Setter s s a b -> b -> m ()

   lens-family	Lens.Family2.State.Strict

   Set a field of the state.

10. (.&.) :: Bits a => a -> a -> a

    ghc-internal	GHC.Internal.Bits

    Bitwise "and"

Page 21 of many | Previous | Next