import Test.QuickCheck.Batch
import qualified Test.HUnit as HU
import Test.HUnit.Utils
-import qualified Data.Map as Map
import Data.List
-import Data.Maybe(catMaybes)
import System.IO(stderr)
+import Data.Word
-import Data.Syncable
import TestInfrastructure
-prop_empty :: Bool
-prop_empty =
- syncBiDir (emptymap::Map.Map Int ()) emptymap emptymap == ([], []) -- ([DeleteItem 5], [], [])
+import qualified TestSyncable
+import qualified TestConnection
+import qualified TestParser
-prop_delAllFromChild :: SyncCollection Int () -> Result
-prop_delAllFromChild inp =
- let (resMaster, resChild) = syncBiDir emptymap inp inp
- expectedResChild = sort . map DeleteItem . Map.keys $ inp
- in ([], expectedResChild) @=?
- (resMaster, sort resChild)
-
-prop_delAllFromMaster :: SyncCollection Int () -> Result
-prop_delAllFromMaster inp =
- let (resMaster, resChild) = syncBiDir inp emptymap inp
- expectedResMaster = sort . map DeleteItem . Map.keys $ inp
- in (expectedResMaster, []) @=?
- (sort resMaster, resChild)
-
-prop_addFromMaster :: SyncCollection Int Float -> Result
-prop_addFromMaster inp =
- let (resMaster, resChild) = syncBiDir inp emptymap emptymap
- expectedResChild = sort . map (\(k, v) -> CopyItem k v) . Map.toList $ inp
- in ([], expectedResChild) @=?
- (resMaster, sort resChild)
+q :: Testable a => String -> a -> HU.Test
+q = qccheck (defaultConfig {configMaxTest = 250})
--- FIXME: prop_addFromChild
+tl msg t = HU.TestLabel msg $ HU.TestList t
-prop_allChangesToChild :: SyncCollection Int Float -> SyncCollection Int Float -> Result
-prop_allChangesToChild master child =
- let (resMaster, resChild) = syncBiDir master child child
- expectedResChild = sort $
- (map (\(k, v) -> CopyItem k v) . Map.toList . Map.difference master $ child) ++
- (map DeleteItem . Map.keys . Map.difference child $ master) ++
- (map (\(k, v) -> ModifyContent k v) changeList)
- changeList = foldl changefunc [] (Map.toList child)
- changefunc accum (k, v) =
- case Map.lookup k master of
- Nothing -> accum
- Just x -> if x /= v
- then (k, x) : accum
- else accum
- in ([], expectedResChild) @=?
- (resMaster, sort resChild)
-
-prop_allChangesToMaster :: SyncCollection Int Float -> SyncCollection Int Float -> Result
-prop_allChangesToMaster master child =
- let (resMaster, resChild) = syncBiDir master child master
- expectedResMaster = sort $
- (map (pairToFunc CopyItem) . Map.toList . Map.difference child $ master) ++
- (map DeleteItem . Map.keys . Map.difference master $ child) ++
- (map (pairToFunc ModifyContent) changeList)
- changeList = foldl changefunc [] (Map.toList child)
- changefunc accum (k, v) =
- case Map.lookup k master of
- Nothing -> accum
- Just x -> if x /= v
- then (k, v) : accum
- else accum
- in (expectedResMaster, []) @=?
- (sort resMaster, resChild)
-
--- FIXME: test findModified
-
-prop_allChanges :: SyncCollection Int Float -> SyncCollection Int Float -> SyncCollection Int Float -> Result
-prop_allChanges master child lastchild =
- let (resMaster, resChild) = syncBiDir master child lastchild
- masterChildCommon = findModified child master
- masterMods = findNewMods masterChildCommon master
- childMods = findNewMods masterChildCommon child
-
- findNewMods :: (Eq a, Ord a, Eq b) => SyncCollection a b -> SyncCollection a b -> [(a, b)]
- findNewMods common orig = catMaybes . map checkKV . Map.toList $ common
- where checkKV (k, v) =
- case Map.lookup k orig of
- Just v' -> if v' == v
- then Nothing
- else Just (k, v)
- Nothing -> Nothing
-
- expectedResMaster = sort $
- (map (pairToFunc CopyItem) . Map.toList . Map.difference child $ Map.union master lastchild) ++
- (map DeleteItem . Map.keys . Map.intersection master $ Map.difference lastchild child) ++
- (map (pairToFunc ModifyContent) masterMods)
-
- expectedResChild = sort $
- (map (pairToFunc CopyItem) . Map.toList . Map.difference master $ Map.union child lastchild) ++
- (map DeleteItem . Map.keys . Map.intersection child $ Map.difference lastchild master) ++
- (map (pairToFunc ModifyContent) childMods)
-
- in (expectedResMaster, expectedResChild) @=?
- (sort resMaster, sort resChild)
-
-{- | Basic validation that unaryApplyChanges works -}
-prop_unaryApplyChanges :: SyncCollection Int Float -> [(Bool, Int, Float)] -> Result
-prop_unaryApplyChanges collection randcommands =
- let -- We use nubBy to make sure we don't get input that has reference
- -- to the same key more than once. We then convert True/False to
- -- commands.
- commands = map toCommand . nubBy (\(x1, y1, z1) (x2, y2, z2) -> y1 == y2) $ randcommands
- toCommand (True, x, v) = CopyItem x v
- toCommand (False, x, _) = DeleteItem x
-
- addedItems = catMaybes . map (\x -> case x of CopyItem y v -> Just (y, v); _ -> Nothing) $ commands
- deletedKeys = catMaybes . map (\x -> case x of DeleteItem y -> Just y; _ -> Nothing) $ commands
-
- collection' = foldl (flip Map.delete) collection deletedKeys
- expectedCollection =
- Map.union collection' (Map.fromList addedItems)
- in (sort . Map.keys $ expectedCollection) @=?
- (sort . Map.keys $ unaryApplyChanges collection commands)
-
-{- | Should validate both that unaryApplyChanges works, and that it is
-an identify -}
-prop_unaryApplyChangesId :: SyncCollection Int Float -> SyncCollection Int Float -> Result
-prop_unaryApplyChangesId master child =
- let (resMaster, resChild) = syncBiDir master child child
- newMaster = unaryApplyChanges master resMaster
- newChild = unaryApplyChanges child resChild
- newMasterKeys = sort . Map.keys $ newMaster
- newChildKeys = sort . Map.keys $ newChild
- in (True, sort (Map.keys master), sort (Map.keys master)) @=?
- (newMasterKeys == newChildKeys, newMasterKeys, newChildKeys)
-
-prop_unaryApplyChanges3 :: SyncCollection Int Float -> SyncCollection Int Float -> SyncCollection Int Float -> Result
-prop_unaryApplyChanges3 master child lastChild =
- let (resMaster, resChild) = syncBiDir master child lastChild
- newMaster = unaryApplyChanges master resMaster
- newChild = unaryApplyChanges child resChild
- in newMaster @=? newChild
-
-prop_diffCollection :: SyncCollection Int Float -> SyncCollection Int Float -> Result
-prop_diffCollection coll1 coll2 =
- let commands = diffCollection coll1 coll2
- newcoll2 = unaryApplyChanges coll1 commands
- in coll2 @=? newcoll2
-
-allt = [qctest "Empty" prop_empty,
- qctest "Del all from child" prop_delAllFromChild,
- qctest "Del all from master" prop_delAllFromMaster,
- qctest "Add from master" prop_addFromMaster,
- qctest "All changes to child" prop_allChangesToChild,
- qctest "All changes to master" prop_allChangesToMaster,
- qctest "All changes" prop_allChanges,
- qctest "unaryApplyChanges" prop_unaryApplyChanges,
- qctest "unaryApplyChangesId" prop_unaryApplyChangesId,
- qctest "unaryApplyChanges3" prop_unaryApplyChanges3,
- qctest "diffCollection" prop_diffCollection
- ]
+allt = [tl "TestSyncable" TestSyncable.allt,
+ tl "TestConnection" TestConnection.allt,
+ tl "TestParser" TestParser.allt]
testh = HU.runTestTT $ HU.TestList allt
testv = runVerbTestText (HU.putTextToHandle stderr True) $ HU.TestList allt