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. (<=.) :: x -> Double -> Inequality x

   linear-programming	Numeric.LinearProgramming.Common

   No documentation available.

2. (==.) :: x -> Double -> Inequality x

   linear-programming	Numeric.LinearProgramming.Common

   No documentation available.

3. (>=.) :: x -> Double -> Inequality x

   linear-programming	Numeric.LinearProgramming.Common

   No documentation available.

4. (>=<.) :: x -> (Double, Double) -> Inequality x

   linear-programming	Numeric.LinearProgramming.Common

   No documentation available.

5. (&.&) :: Pred -> Pred -> Pred

   liquid-fixpoint	Language.Fixpoint.Types.Refinements

   No documentation available.

6. (|.|) :: Pred -> Pred -> Pred

   liquid-fixpoint	Language.Fixpoint.Types.Refinements

   No documentation available.

7. (^.) :: a -> (a -> b) -> b

   sbv	Data.SBV.Tuple

   Field access, inspired by the lens library. This is merely reverse application, but allows us to write things like (1, 2)^._1 which is likely to be familiar to most Haskell programmers out there. Note that this is precisely equivalent to _1 (1, 2), but perhaps it reads a little nicer.

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

   sql-words	Language.SQL.Keyword.Concat

   Binary operator to create qualified name on SQL.

9. ( #. ) :: Coercible b c => (b -> c) -> (a -> b) -> a -> c

   streamly-core	Streamly.Internal.BaseCompat

   No documentation available.

10. (<.) :: (CApplicative f, Dom f a, Dom f b) => f a -> f b -> f a

    subcategories	Control.Subcategory.Applicative

    No documentation available.

Page 136 of many | Previous | Next