Safe Haskell	Safe

Eta.Classes.Bounded

Description

The Bounded class defines the upper and lower limit of a type

Synopsis

Documentation

minimumBound :: Bounded a => a #

Returns the lower limit of a type

>>> minimumBound :: Int
-9223372036854775808
>>> minimumBound :: Bool
False

maximumBound :: Bounded a => a #

Returns the upper limit of a type

>>> maximumBound :: Int
9223372036854775807
>>> maximumBound :: Bool
True

class Bounded a where #

Minimal complete definition

minBound, maxBound

Methods

minBound :: a #

maxBound :: a #

Instances

Bounded Bool
Methods minBound :: Bool # maxBound :: Bool #
Bounded Char
Methods minBound :: Char # maxBound :: Char #
Bounded Int
Methods minBound :: Int # maxBound :: Int #
Bounded Int8
Methods minBound :: Int8 # maxBound :: Int8 #
Bounded Int16
Methods minBound :: Int16 # maxBound :: Int16 #
Bounded Int32
Methods minBound :: Int32 # maxBound :: Int32 #
Bounded Int64
Methods minBound :: Int64 # maxBound :: Int64 #
Bounded Ordering
Methods minBound :: Ordering # maxBound :: Ordering #
Bounded Word
Methods minBound :: Word # maxBound :: Word #
Bounded ()
Methods minBound :: () # maxBound :: () #
Bounded GeneralCategory
Methods minBound :: GeneralCategory # maxBound :: GeneralCategory #
Bounded Any
Methods minBound :: Any # maxBound :: Any #
Bounded All
Methods minBound :: All # maxBound :: All #
Bounded SourceUnpackedness
Methods minBound :: SourceUnpackedness # maxBound :: SourceUnpackedness #
Bounded SourceStrictness
Methods minBound :: SourceStrictness # maxBound :: SourceStrictness #
Bounded DecidedStrictness
Methods minBound :: DecidedStrictness # maxBound :: DecidedStrictness #
Bounded Associativity
Methods minBound :: Associativity # maxBound :: Associativity #
Bounded a => Bounded (Sum a)
Methods minBound :: Sum a # maxBound :: Sum a #
Bounded a => Bounded (Product a)
Methods minBound :: Product a # maxBound :: Product a #
Bounded a => Bounded (Dual a)
Methods minBound :: Dual a # maxBound :: Dual a #
(Bounded a, Bounded b) => Bounded (a, b)
Methods minBound :: (a, b) # maxBound :: (a, b) #
Bounded (Proxy k s)
Methods minBound :: Proxy k s # maxBound :: Proxy k s #
(Bounded a, Bounded b, Bounded c) => Bounded (a, b, c)
Methods minBound :: (a, b, c) # maxBound :: (a, b, c) #
(~) k a b => Bounded ((:~:) k a b)
Methods minBound :: (k :~: a) b # maxBound :: (k :~: a) b #
(Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (a, b, c, d)
Methods minBound :: (a, b, c, d) # maxBound :: (a, b, c, d) #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (a, b, c, d, e)
Methods minBound :: (a, b, c, d, e) # maxBound :: (a, b, c, d, e) #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f) => Bounded (a, b, c, d, e, f)
Methods minBound :: (a, b, c, d, e, f) # maxBound :: (a, b, c, d, e, f) #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g) => Bounded (a, b, c, d, e, f, g)
Methods minBound :: (a, b, c, d, e, f, g) # maxBound :: (a, b, c, d, e, f, g) #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h) => Bounded (a, b, c, d, e, f, g, h)
Methods minBound :: (a, b, c, d, e, f, g, h) # maxBound :: (a, b, c, d, e, f, g, h) #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i) => Bounded (a, b, c, d, e, f, g, h, i)
Methods minBound :: (a, b, c, d, e, f, g, h, i) # maxBound :: (a, b, c, d, e, f, g, h, i) #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j) => Bounded (a, b, c, d, e, f, g, h, i, j)
Methods minBound :: (a, b, c, d, e, f, g, h, i, j) # maxBound :: (a, b, c, d, e, f, g, h, i, j) #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k) => Bounded (a, b, c, d, e, f, g, h, i, j, k)
Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k) # maxBound :: (a, b, c, d, e, f, g, h, i, j, k) #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l)
Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k, l) # maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l) #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m)
Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m) # maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m) #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m, n)
Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n, Bounded o) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)
Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #

minBound :: Bounded a => a #

maxBound :: Bounded a => a #