floor package:numeric-prelude

floor :: (C a, C b) => a -> b
numeric-prelude Algebra.RealRing
\x -> ceiling (-x) == negate (floor (x::Double) :: Integer)

\x -> ceiling (-x) == negate (floor (x::Rational) :: Integer)
floor :: (C a, C b) => a -> b
numeric-prelude NumericPrelude NumericPrelude NumericPrelude.Numeric NumericPrelude.Numeric
floorInt :: (C a, Ord a) => (a -> Int) -> (Int -> a) -> a -> Int
numeric-prelude Algebra.RealRing
genericFloor :: (Ord a, C a, C b) => a -> b
numeric-prelude Algebra.RealRing
The generic rounding functions need a number of operations proportional to the number of binary digits of the integer portion. If operations like multiplication with two and comparison need time proportional to the number of binary digits, then the overall rounding requires quadratic time. 
RealRing.genericFloor =~= (NP.floor :: Double -> Integer)

RealRing.genericFloor =~= (NP.floor :: Rational -> Integer)
genericHalfPosFloorDigits :: (Ord a, C a, C b) => a -> ((a, b), [Bool])
numeric-prelude Algebra.RealRing
genericPosFloor :: (Ord a, C a, C b) => a -> b
numeric-prelude Algebra.RealRing