singletons 2.0 → 2.0.0.1

raw patch · 4 files changed

+11/−53 lines, 4 files

Files

• CHANGES.md +4/−0
• singletons.cabal +2/−2
• src/Data/Singletons/Prelude.hs +0/−46
• src/Data/Singletons/Prelude/Num.hs +5/−5

@@ -1,6 +1,10 @@ Changelog for singletons project ================================ +2.0.0.1+-------+ * Make haddock work.+ 2.0 --- 

@@ -1,5 +1,5 @@ name:           singletons-version:        2.0+version:        2.0.0.1                 -- Remember to bump version in the Makefile as well cabal-version:  >= 1.10 synopsis:       A framework for generating singleton types@@ -38,7 +38,7 @@ source-repository this   type:     git   location: https://github.com/goldfirere/singletons.git-  tag:      v2.0+  tag:      v2.0.0.1  library   hs-source-dirs:     src

@@ -24,52 +24,6 @@    Sing(SFalse, STrue, SNil, SCons, SJust, SNothing, SLeft, SRight, SLT, SEQ, SGT,        STuple0, STuple2, STuple3, STuple4, STuple5, STuple6, STuple7),-  -- | Though Haddock doesn't show it, the 'Sing' instance above includes-  -- the following instances-  ---  -- > data instance Sing (a :: Bool) where-  -- >   SFalse :: Sing False-  -- >   STrue  :: Sing True-  -- >-  -- > data instance Sing (a :: [k]) where-  -- >   SNil  :: Sing '[]-  -- >   SCons :: Sing (h :: k) -> Sing (t :: [k]) -> Sing (h ': t)-  -- >-  -- > data instance Sing (a :: Maybe k) where-  -- >   SNothing :: Sing Nothing-  -- >   SJust    :: Sing (a :: k) -> Sing (Just a)-  -- >-  -- > data instance Sing (a :: Either x y) where-  -- >   SLeft  :: Sing (a :: x) -> Sing (Left a)-  -- >   SRight :: Sing (b :: y) -> Sing (Right b)-  -- >-  -- > data instance Sing (a :: Ordering) where-  -- >   SLT :: Sing LT-  -- >   SEQ :: Sing EQ-  -- >   SGT :: Sing GT-  -- >-  -- > data instance Sing (a :: ()) where-  -- >   STuple0 :: Sing '()-  -- >-  -- > data instance Sing (z :: (a, b)) where-  -- >   STuple2 :: Sing a -> Sing b -> Sing '(a, b)-  -- >-  -- > data instance Sing (z :: (a, b, c)) where-  -- >   STuple3 :: Sing a -> Sing b -> Sing c -> Sing '(a, b, c)-  -- >-  -- > data instance Sing (z :: (a, b, c, d)) where-  -- >   STuple4 :: Sing a -> Sing b -> Sing c -> Sing d -> Sing '(a, b, c, d)-  -- >-  -- > data instance Sing (z :: (a, b, c, d, e)) where-  -- >   STuple5 :: Sing a -> Sing b -> Sing c -> Sing d -> Sing e -> Sing '(a, b, c, d, e)-  -- >-  -- > data instance Sing (z :: (a, b, c, d, e, f)) where-  -- >   STuple6 :: Sing a -> Sing b -> Sing c -> Sing d -> Sing e -> Sing f-  -- >           -> Sing '(a, b, c, d, e, f)-  -- >-  -- > data instance Sing (z :: (a, b, c, d, e, f, g)) where-  -- >   STuple7 :: Sing a -> Sing b -> Sing c -> Sing d -> Sing e -> Sing f-  -- >           -> Sing g -> Sing '(a, b, c, d, e, f, g)    -- * Singleton type synonyms 

@@ -40,7 +40,7 @@ import Unsafe.Coerce  $(singletonsOnly [d|-  -- | Basic numeric class.+  -- Basic numeric class.   --   -- Minimal complete definition: all except 'negate' or @(-)@   class  Num a  where@@ -48,11 +48,11 @@       infixl 6 +       infixl 6 -       infixl 6 *-      -- | Unary negation.+      -- Unary negation.       negate              :: a -> a-      -- | Absolute value.+      -- Absolute value.       abs                 :: a -> a-      -- | Sign of a number.+      -- Sign of a number.       -- The functions 'abs' and 'signum' should satisfy the law:       --       -- > abs x * signum x == x@@ -60,7 +60,7 @@       -- For real numbers, the 'signum' is either @-1@ (negative), @0@ (zero)       -- or @1@ (positive).       signum              :: a -> a-      -- | Conversion from a 'Nat'.+      -- Conversion from a 'Nat'.       fromInteger         :: Nat -> a        x - y               = x + negate y