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. (<..<) :: Extended Integer -> Extended Integer -> IntegerInterval

   data-interval	Data.IntegerInterval

   open interval (l, u)

2. (<..<=) :: Extended Integer -> Extended Integer -> IntegerInterval

   data-interval	Data.IntegerInterval

   left-open right-closed interval (l,u]

3. (<=..<) :: Extended Integer -> Extended Integer -> IntegerInterval

   data-interval	Data.IntegerInterval

   left-closed right-open interval [l, u)

4. (<=..<=) :: Extended Integer -> Extended Integer -> IntegerInterval

   data-interval	Data.IntegerInterval

   closed interval [l,u]

5. (<..<) :: Ord r => Extended r -> Extended r -> Interval r

   data-interval	Data.Interval

   open interval (l, u)

6. (<..<=) :: Ord r => Extended r -> Extended r -> Interval r

   data-interval	Data.Interval

   left-open right-closed interval (l,u]

7. (<=..<) :: Ord r => Extended r -> Extended r -> Interval r

   data-interval	Data.Interval

   left-closed right-open interval [l, u)

8. (<=..<=) :: Ord r => Extended r -> Extended r -> Interval r

   data-interval	Data.Interval

   closed interval [l,u]

9. (<.) :: 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.

10. (<=.) :: 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.

Page 143 of many | Previous | Next