Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

Exact lookup

1. (<.) :: Num t => LinearForm t -> LinearForm t -> Constraint t

   exp-pairs	Math.ExpPairs

   Build a constraint, which states that the value of the first linear form is less than the value of the second one.

2. (<=.) :: Num t => LinearForm t -> LinearForm t -> Constraint t

   exp-pairs	Math.ExpPairs

   Build a constraint, which states that the value of the first linear form is less or equal to the value of the second one.

3. (>.) :: Num t => LinearForm t -> LinearForm t -> Constraint t

   exp-pairs	Math.ExpPairs

   Build a constraint, which states that the value of the first linear form is greater than the value of the second one.

4. (>=.) :: Num t => LinearForm t -> LinearForm t -> Constraint t

   exp-pairs	Math.ExpPairs

   Build a constraint, which states that the value of the first linear form is greater or equal to the value of the second one.

5. (<.) :: (b -> c) -> (a -> b) -> a -> c

   flow	Flow

   Right-associative compose operator. Read as "compose backward" or "but first". Use this to create long chains of computation that suggest which direction things move in. You may prefer this operator over (.>) for IO actions since it puts the last function first.

   >>> let f = print <. negate <. recip <. succ
   
   >>> f 3
   -0.25
   

   Or use it anywhere you would use (.). Note that (<.) and (.>) have the same precedence, so they cannot be used together.

   >>> -- This doesn't work!
   
   >>> -- print <. succ .> recip .> negate
   

   \ x -> (g <. f) x == g (f x)
   

   \ x -> (h <. g <. f) x == h (g (f x))
   

6. ($.) :: Walk c b d -> GTraversal c a b -> GTraversal c a d

   greskell	Data.Greskell

   Same as &. with arguments flipped.

7. (&.) :: GTraversal c a b -> Walk c b d -> GTraversal c a d

   greskell	Data.Greskell

   Apply the Walk to the GTraversal. In Gremlin, this means calling a chain of methods on the Traversal object.

8. (<$.>) :: Functor f => Walk c b d -> f (GTraversal c a b) -> f (GTraversal c a d)

   greskell	Data.Greskell

   Similar to <$>, but for $..

9. (<*.>) :: Applicative f => f (Walk c b d) -> f (GTraversal c a b) -> f (GTraversal c a d)

   greskell	Data.Greskell

   Similar to <*>, but for $..

10. ($.) :: Walk c b d -> GTraversal c a b -> GTraversal c a d

    greskell	Data.Greskell.GTraversal

    Same as &. with arguments flipped.

Page 144 of many | Previous | Next