| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Data.Algorithm.Hilbert.Types
Contents
- data PrecisionNum = PrecisionNum {}
- minPrecision :: Integral u => u -> PrecisionNum
- mkPrecisionNum :: (Integral a, Integral b) => a -> b -> Maybe PrecisionNum
- precisionRequired :: Integer -> Int
- floatingPlus :: PrecisionNum -> PrecisionNum -> PrecisionNum
- floatingTwoExp :: PrecisionNum -> PrecisionNum
- boolToNum :: [Bool] -> Maybe PrecisionNum
- shiftRA :: Integral a => PrecisionNum -> a -> PrecisionNum
- shiftLA :: Integral a => PrecisionNum -> a -> PrecisionNum
Types for pointToIndex
data PrecisionNum Source
Constructors
| PrecisionNum | |
minPrecision :: Integral u => u -> PrecisionNum Source
mkPrecisionNum :: (Integral a, Integral b) => a -> b -> Maybe PrecisionNum Source
precisionRequired :: Integer -> Int Source
boolToNum :: [Bool] -> Maybe PrecisionNum Source
Convert a list of Bool representation of an integer to an integer. For example, to obtain an integer from its binary representation: Assumes that the precision of the returned value should be equal to the number of bits that were provided. > boolToNum [False, True, True, True] > = 14
shiftRA :: Integral a => PrecisionNum -> a -> PrecisionNum Source
shiftLA :: Integral a => PrecisionNum -> a -> PrecisionNum Source