{-# language MultiParamTypeClasses, FlexibleInstances, FlexibleContexts, UndecidableInstances #-}
module Satchmo.Integer.Data
( Number, make, number
, constant, decode
, bits, width, sign
)
where
import Prelude hiding ( and, or, not, (&&), (||) )
import qualified Prelude
import qualified Satchmo.Code as C
import Satchmo.Boolean hiding ( constant )
import qualified Satchmo.Boolean as B
import Satchmo.Counting
import Control.Monad
data Number = Number
{ Number -> [Boolean]
bits :: [ Boolean ]
}
instance (Monad m, C.Decode m Boolean Bool) => C.Decode m Number Integer where
decode :: Number -> m Integer
decode Number
n = do [Bool]
ys <- forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
mapM forall (m :: * -> *) c a. Decode m c a => c -> m a
C.decode (Number -> [Boolean]
bits Number
n) ; forall (m :: * -> *) a. Monad m => a -> m a
return forall a b. (a -> b) -> a -> b
$ [Bool] -> Integer
fromBinary [Bool]
ys
width :: Number -> Int
width :: Number -> Int
width Number
n = forall (t :: * -> *) a. Foldable t => t a -> Int
length forall a b. (a -> b) -> a -> b
$ Number -> [Boolean]
bits Number
n
sign :: Number -> Boolean
sign :: Number -> Boolean
sign Number
n = case Number -> [Boolean]
bits Number
n of
[] -> forall a. HasCallStack => [Char] -> a
error [Char]
"Satchmo.Integer.Data:sign no bits"
[Boolean]
bs -> forall a. [a] -> a
last [Boolean]
bs
number :: MonadSAT m => Int -> m Number
number :: forall (m :: * -> *). MonadSAT m => Int -> m Number
number Int
w = do
[Boolean]
xs <- forall (t :: * -> *) (m :: * -> *) a.
(Traversable t, Monad m) =>
t (m a) -> m (t a)
sequence forall a b. (a -> b) -> a -> b
$ forall a. Int -> a -> [a]
replicate Int
w forall (m :: * -> *). MonadSAT m => m Boolean
boolean
forall (m :: * -> *) a. Monad m => a -> m a
return forall a b. (a -> b) -> a -> b
$ [Boolean] -> Number
make [Boolean]
xs
make :: [ Boolean ] -> Number
make :: [Boolean] -> Number
make [Boolean]
xs = Number
{ bits :: [Boolean]
bits = [Boolean]
xs
}
fromBinary :: [ Bool ] -> Integer
fromBinary :: [Bool] -> Integer
fromBinary [Bool]
xs = forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr ( \ Bool
x Integer
y -> Integer
2forall a. Num a => a -> a -> a
*Integer
y forall a. Num a => a -> a -> a
+ if Bool
x then Integer
1 else Integer
0 ) Integer
0 [Bool]
xs
toBinary :: Integer -> [ Bool ]
toBinary :: Integer -> [Bool]
toBinary Integer
0 = []
toBinary Integer
n =
let (Integer
d,Integer
m) = forall a. Integral a => a -> a -> (a, a)
divMod Integer
n Integer
2
in forall a. Enum a => Int -> a
toEnum ( forall a b. (Integral a, Num b) => a -> b
fromIntegral Integer
m ) forall a. a -> [a] -> [a]
: Integer -> [Bool]
toBinary Integer
d
constant :: MonadSAT m
=> Int
-> Integer
-> m Number
constant :: forall (m :: * -> *). MonadSAT m => Int -> Integer -> m Number
constant Int
w Integer
n = do
[Boolean]
xs <- if Integer
0 forall a. Ord a => a -> a -> Bool
<= Integer
n Bool -> Bool -> Bool
Prelude.&& Integer
n forall a. Ord a => a -> a -> Bool
< Integer
2forall a b. (Num a, Integral b) => a -> b -> a
^(Int
wforall a. Num a => a -> a -> a
-Int
1)
then forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
mapM forall (m :: * -> *). MonadSAT m => Bool -> m Boolean
B.constant forall a b. (a -> b) -> a -> b
$ Integer -> [Bool]
toBinary Integer
n
else if forall a. Num a => a -> a
negate ( Integer
2forall a b. (Num a, Integral b) => a -> b -> a
^(Int
wforall a. Num a => a -> a -> a
-Int
1)) forall a. Ord a => a -> a -> Bool
<= Integer
n Bool -> Bool -> Bool
Prelude.&& Integer
n forall a. Ord a => a -> a -> Bool
< Integer
0
then forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
mapM forall (m :: * -> *). MonadSAT m => Bool -> m Boolean
B.constant forall a b. (a -> b) -> a -> b
$ Integer -> [Bool]
toBinary (Integer
n forall a. Num a => a -> a -> a
+ Integer
2forall a b. (Num a, Integral b) => a -> b -> a
^Int
w)
else forall a. HasCallStack => [Char] -> a
error [Char]
"Satchmo.Integer.Data.constant"
Boolean
z <- forall (m :: * -> *). MonadSAT m => Bool -> m Boolean
B.constant Bool
False
forall (m :: * -> *) a. Monad m => a -> m a
return forall a b. (a -> b) -> a -> b
$ [Boolean] -> Number
make forall a b. (a -> b) -> a -> b
$ forall a. Int -> [a] -> [a]
take Int
w forall a b. (a -> b) -> a -> b
$ [Boolean]
xs forall a. [a] -> [a] -> [a]
++ forall a. a -> [a]
repeat Boolean
z
decode :: b -> Number -> m Integer
decode b
w Number
n = do
[Bool]
bs <- forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
t a -> (a -> m b) -> m (t b)
forM (Number -> [Boolean]
bits Number
n) forall (m :: * -> *) c a. Decode m c a => c -> m a
C.decode
forall (m :: * -> *) a. Monad m => a -> m a
return forall a b. (a -> b) -> a -> b
$ [Bool] -> Integer
fromBinary [Bool]
bs
forall a. Num a => a -> a -> a
- if forall a. [a] -> a
last [Bool]
bs then Integer
2forall a b. (Num a, Integral b) => a -> b -> a
^b
w else Integer
0