]> code.delx.au - offlineimap/blob - testsrc/runtests.hs
Rename syncThem to syncBiDir
[offlineimap] / testsrc / runtests.hs
1 {-
2 Copyright (C) 2002-2008 John Goerzen <jgoerzen@complete.org>
3
4 This program is free software; you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation; either version 2 of the License, or
7 (at your option) any later version.
8
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
13
14 You should have received a copy of the GNU General Public License
15 along with this program; if not, write to the Free Software
16 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 -}
18
19 module Main where
20 import Test.QuickCheck
21 import Test.QuickCheck.Batch
22 import qualified Test.HUnit as HU
23 import Test.HUnit.Utils
24 import qualified Data.Map as Map
25 import Data.List
26 import Data.Maybe(catMaybes)
27 import System.IO(stderr)
28
29 import Data.Syncable
30 import TestInfrastructure
31
32 prop_empty :: Bool
33 prop_empty =
34 syncBiDir (emptymap::Map.Map Int ()) emptymap emptymap == ([], []) -- ([DeleteItem 5], [], [])
35
36 prop_delAllFromChild :: SyncCollection Int -> Result
37 prop_delAllFromChild inp =
38 let (resMaster, resChild) = syncBiDir emptymap inp inp
39 expectedResChild = sort . map DeleteItem . Map.keys $ inp
40 in ([], expectedResChild) @=?
41 (resMaster, sort resChild)
42
43 prop_delAllFromMaster :: SyncCollection Int -> Result
44 prop_delAllFromMaster inp =
45 let (resMaster, resChild) = syncBiDir inp emptymap inp
46 expectedResMaster = sort . map DeleteItem . Map.keys $ inp
47 in (expectedResMaster, []) @=?
48 (sort resMaster, resChild)
49
50 prop_addFromMaster :: SyncCollection Int -> Result
51 prop_addFromMaster inp =
52 let (resMaster, resChild) = syncBiDir inp emptymap emptymap
53 expectedResChild = sort . map CopyItem . Map.keys $ inp
54 in ([], expectedResChild) @=?
55 (resMaster, sort resChild)
56
57 prop_allChangesToChild :: SyncCollection Int -> SyncCollection Int -> Result
58 prop_allChangesToChild master child =
59 let (resMaster, resChild) = syncBiDir master child child
60 expectedResChild = sort $
61 (map CopyItem . Map.keys . Map.difference master $ child) ++
62 (map DeleteItem . Map.keys . Map.difference child $ master)
63 in ([], expectedResChild) @=?
64 (resMaster, sort resChild)
65
66 prop_allChangesToMaster :: SyncCollection Int -> SyncCollection Int -> Result
67 prop_allChangesToMaster master child =
68 let (resMaster, resChild) = syncBiDir master child master
69 expectedResMaster = sort $
70 (map CopyItem . Map.keys . Map.difference child $ master) ++
71 (map DeleteItem . Map.keys . Map.difference master $ child)
72 in (expectedResMaster, []) @=?
73 (sort resMaster, resChild)
74
75 prop_allChanges :: SyncCollection Int -> SyncCollection Int -> SyncCollection Int -> Result
76 prop_allChanges master child lastchild =
77 let (resMaster, resChild) = syncBiDir master child lastchild
78 expectedResMaster = sort $
79 (map CopyItem . Map.keys . Map.difference child $ Map.union master lastchild) ++
80 (map DeleteItem . Map.keys . Map.intersection master $ Map.difference lastchild child)
81 expectedResChild = sort $
82 (map CopyItem . Map.keys . Map.difference master $ Map.union child lastchild) ++
83 (map DeleteItem . Map.keys . Map.intersection child $ Map.difference lastchild master)
84 in (expectedResMaster, expectedResChild) @=?
85 (sort resMaster, sort resChild)
86
87 {- | Basic validation that unaryApplyChanges works -}
88 prop_unaryApplyChanges :: SyncCollection Int -> [(Bool, Int)] -> Result
89 prop_unaryApplyChanges collection randcommands =
90 let -- We use nubBy to make sure we don't get input that has reference
91 -- to the same key more than once. We then convert True/False to
92 -- commands.
93 commands = map toCommand . nubBy (\x y -> snd x == snd y) $ randcommands
94 toCommand (True, x) = CopyItem x
95 toCommand (False, x) = DeleteItem x
96
97 addedKeys = catMaybes . map (\x -> case x of CopyItem y -> Just y; _ -> Nothing) $ commands
98 deletedKeys = catMaybes . map (\x -> case x of DeleteItem y -> Just y; _ -> Nothing) $ commands
99
100 collection' = Map.difference collection (keysToMap deletedKeys)
101 expectedCollection =
102 Map.union collection' (keysToMap addedKeys)
103 in (sort . Map.keys $ expectedCollection) @=?
104 (sort . Map.keys $ unaryApplyChanges collection commands)
105
106 {- | Should validate both that unaryApplyChanges works, and that it is
107 an identify -}
108 prop_unaryApplyChangesId :: SyncCollection Int -> SyncCollection Int -> Result
109 prop_unaryApplyChangesId master child =
110 let (resMaster, resChild) = syncBiDir master child child
111 newMaster = unaryApplyChanges master resMaster
112 newChild = unaryApplyChanges child resChild
113 newMasterKeys = sort . Map.keys $ newMaster
114 newChildKeys = sort . Map.keys $ newChild
115 in (True, sort (Map.keys master), sort (Map.keys master)) @=?
116 (newMasterKeys == newChildKeys, newMasterKeys, newChildKeys)
117
118 allt = [qctest "Empty" prop_empty,
119 qctest "Del all from child" prop_delAllFromChild,
120 qctest "Del all from master" prop_delAllFromMaster,
121 qctest "Add from master" prop_addFromMaster,
122 qctest "All changes to child" prop_allChangesToChild,
123 qctest "All changes to master" prop_allChangesToMaster,
124 qctest "All changes" prop_allChanges,
125 qctest "unaryApplyChanges" prop_unaryApplyChanges,
126 qctest "unaryApplyChangesId" prop_unaryApplyChangesId
127 ]
128
129 testh = HU.runTestTT $ HU.TestList allt
130 testv = runVerbTestText (HU.putTextToHandle stderr True) $ HU.TestList allt
131
132
133 main =
134 do testv
135 return ()
136