Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

Exact lookup

1. (^.) :: s -> Getting a s a -> a

   diagrams-lib	Diagrams.Prelude

   View the value pointed to by a Getter or Lens or the result of folding over all the results of a Fold or Traversal that points at a monoidal values. This is the same operation as view with the arguments flipped. The fixity and semantics are such that subsequent field accesses can be performed with (.).

   >>> (a,b)^._2
   b
   

   >>> ("hello","world")^._2
   "world"
   

   >>> import Data.Complex
   
   >>> ((0, 1 :+ 2), 3)^._1._2.to magnitude
   2.23606797749979
   

   (^.) ::             s -> Getter s a     -> a
   (^.) :: Monoid m => s -> Fold s m       -> m
   (^.) ::             s -> Iso' s a       -> a
   (^.) ::             s -> Lens' s a      -> a
   (^.) :: Monoid m => s -> Traversal' s m -> m
   

2. (^..) :: s -> Getting (Endo [a]) s a -> [a]

   diagrams-lib	Diagrams.Prelude

   A convenient infix (flipped) version of toListOf.

   >>> [[1,2],[3]]^..id
   [[[1,2],[3]]]
   
   >>> [[1,2],[3]]^..traverse
   [[1,2],[3]]
   
   >>> [[1,2],[3]]^..traverse.traverse
   [1,2,3]
   

   >>> (1,2)^..both
   [1,2]
   

   toList xs ≡ xs ^.. folded
   (^..) ≡ flip toListOf
   

   (^..) :: s -> Getter s a     -> a :: s -> Fold s a       -> a :: s -> Lens' s a      -> a :: s -> Iso' s a       -> a :: s -> Traversal' s a -> a :: s -> Prism' s a     -> [a]
   

3. (^@.) :: s -> IndexedGetting i (i, a) s a -> (i, a)

   diagrams-lib	Diagrams.Prelude

   View the index and value of an IndexedGetter or IndexedLens. This is the same operation as iview with the arguments flipped. The fixity and semantics are such that subsequent field accesses can be performed with (.).

   (^@.) :: s -> IndexedGetter i s a -> (i, a)
   (^@.) :: s -> IndexedLens' i s a  -> (i, a)
   

   The result probably doesn't have much meaning when applied to an IndexedFold.

4. (^@..) :: s -> IndexedGetting i (Endo [(i, a)]) s a -> [(i, a)]

   diagrams-lib	Diagrams.Prelude

   An infix version of itoListOf.

5. (^.) :: s -> Getting a s a -> a

   Cabal-syntax	Distribution.Compat.Lens

   No documentation available.

6. (>.) :: ArrowList a => a b c -> ([c] -> d) -> a b d

   hxt	Control.Arrow.ArrowList

   combinator for converting the result of an arrow into a single element result

7. (>>.) :: ArrowList a => a b c -> ([c] -> [d]) -> a b d

   hxt	Control.Arrow.ArrowList

   combinator for converting the result of a list arrow into another list example: foo >>. reverse reverses the the result of foo example: foo >>. take 1 constructs a deterministic version of foo by deleting all further results

8. newtype ((f :: k -> Type) -.-> (g :: k -> Type)) (a :: k)

   sop-core	Data.SOP

   Lifted functions.

9. newtype ((f :: l -> Type) :.: (g :: k -> l)) (p :: k)

   sop-core	Data.SOP

   Composition of functors. Like Compose, but kind-polymorphic and with a shorter name.

10. newtype ((f :: l -> Type) :.: (g :: k -> l)) (p :: k)

    sop-core	Data.SOP.BasicFunctors

    Composition of functors. Like Compose, but kind-polymorphic and with a shorter name.

Page 110 of many | Previous | Next