root / htest / Test / Ganeti / Utils.hs @ 256e28c4
History | View | Annotate | Download (9.3 kB)
1 |
{-# LANGUAGE TemplateHaskell #-} |
---|---|
2 |
{-# OPTIONS_GHC -fno-warn-orphans #-} |
3 |
|
4 |
{-| Unittests for ganeti-htools. |
5 |
|
6 |
-} |
7 |
|
8 |
{- |
9 |
|
10 |
Copyright (C) 2009, 2010, 2011, 2012 Google Inc. |
11 |
|
12 |
This program is free software; you can redistribute it and/or modify |
13 |
it under the terms of the GNU General Public License as published by |
14 |
the Free Software Foundation; either version 2 of the License, or |
15 |
(at your option) any later version. |
16 |
|
17 |
This program is distributed in the hope that it will be useful, but |
18 |
WITHOUT ANY WARRANTY; without even the implied warranty of |
19 |
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
20 |
General Public License for more details. |
21 |
|
22 |
You should have received a copy of the GNU General Public License |
23 |
along with this program; if not, write to the Free Software |
24 |
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA |
25 |
02110-1301, USA. |
26 |
|
27 |
-} |
28 |
|
29 |
module Test.Ganeti.Utils (testUtils) where |
30 |
|
31 |
import Test.QuickCheck hiding (Result) |
32 |
import Test.HUnit |
33 |
|
34 |
import Data.Char (isSpace) |
35 |
import Data.List |
36 |
import qualified Text.JSON as J |
37 |
|
38 |
import Test.Ganeti.TestHelper |
39 |
import Test.Ganeti.TestCommon |
40 |
|
41 |
import Ganeti.BasicTypes |
42 |
import qualified Ganeti.JSON as JSON |
43 |
import Ganeti.Utils |
44 |
|
45 |
-- | Helper to generate a small string that doesn't contain commas. |
46 |
genNonCommaString :: Gen String |
47 |
genNonCommaString = do |
48 |
size <- choose (0, 20) -- arbitrary max size |
49 |
vectorOf size (arbitrary `suchThat` (/=) ',') |
50 |
|
51 |
-- | If the list is not just an empty element, and if the elements do |
52 |
-- not contain commas, then join+split should be idempotent. |
53 |
prop_commaJoinSplit :: Property |
54 |
prop_commaJoinSplit = |
55 |
forAll (choose (0, 20)) $ \llen -> |
56 |
forAll (vectorOf llen genNonCommaString `suchThat` (/=) [""]) $ \lst -> |
57 |
sepSplit ',' (commaJoin lst) ==? lst |
58 |
|
59 |
-- | Split and join should always be idempotent. |
60 |
prop_commaSplitJoin :: String -> Property |
61 |
prop_commaSplitJoin s = |
62 |
commaJoin (sepSplit ',' s) ==? s |
63 |
|
64 |
-- | fromObjWithDefault, we test using the Maybe monad and an integer |
65 |
-- value. |
66 |
prop_fromObjWithDefault :: Integer -> String -> Bool |
67 |
prop_fromObjWithDefault def_value random_key = |
68 |
-- a missing key will be returned with the default |
69 |
JSON.fromObjWithDefault [] random_key def_value == Just def_value && |
70 |
-- a found key will be returned as is, not with default |
71 |
JSON.fromObjWithDefault [(random_key, J.showJSON def_value)] |
72 |
random_key (def_value+1) == Just def_value |
73 |
|
74 |
-- | Test that functional if' behaves like the syntactic sugar if. |
75 |
prop_if'if :: Bool -> Int -> Int -> Gen Prop |
76 |
prop_if'if cnd a b = |
77 |
if' cnd a b ==? if cnd then a else b |
78 |
|
79 |
-- | Test basic select functionality |
80 |
prop_select :: Int -- ^ Default result |
81 |
-> [Int] -- ^ List of False values |
82 |
-> [Int] -- ^ List of True values |
83 |
-> Gen Prop -- ^ Test result |
84 |
prop_select def lst1 lst2 = |
85 |
select def (flist ++ tlist) ==? expectedresult |
86 |
where expectedresult = if' (null lst2) def (head lst2) |
87 |
flist = zip (repeat False) lst1 |
88 |
tlist = zip (repeat True) lst2 |
89 |
|
90 |
-- | Test basic select functionality with undefined default |
91 |
prop_select_undefd :: [Int] -- ^ List of False values |
92 |
-> NonEmptyList Int -- ^ List of True values |
93 |
-> Gen Prop -- ^ Test result |
94 |
prop_select_undefd lst1 (NonEmpty lst2) = |
95 |
select undefined (flist ++ tlist) ==? head lst2 |
96 |
where flist = zip (repeat False) lst1 |
97 |
tlist = zip (repeat True) lst2 |
98 |
|
99 |
-- | Test basic select functionality with undefined list values |
100 |
prop_select_undefv :: [Int] -- ^ List of False values |
101 |
-> NonEmptyList Int -- ^ List of True values |
102 |
-> Gen Prop -- ^ Test result |
103 |
prop_select_undefv lst1 (NonEmpty lst2) = |
104 |
select undefined cndlist ==? head lst2 |
105 |
where flist = zip (repeat False) lst1 |
106 |
tlist = zip (repeat True) lst2 |
107 |
cndlist = flist ++ tlist ++ [undefined] |
108 |
|
109 |
prop_parseUnit :: NonNegative Int -> Property |
110 |
prop_parseUnit (NonNegative n) = |
111 |
conjoin |
112 |
[ parseUnit (show n) ==? (Ok n::Result Int) |
113 |
, parseUnit (show n ++ "m") ==? (Ok n::Result Int) |
114 |
, parseUnit (show n ++ "M") ==? (Ok (truncate n_mb)::Result Int) |
115 |
, parseUnit (show n ++ "g") ==? (Ok (n*1024)::Result Int) |
116 |
, parseUnit (show n ++ "G") ==? (Ok (truncate n_gb)::Result Int) |
117 |
, parseUnit (show n ++ "t") ==? (Ok (n*1048576)::Result Int) |
118 |
, parseUnit (show n ++ "T") ==? (Ok (truncate n_tb)::Result Int) |
119 |
, printTestCase "Internal error/overflow?" |
120 |
(n_mb >=0 && n_gb >= 0 && n_tb >= 0) |
121 |
, property (isBad (parseUnit (show n ++ "x")::Result Int)) |
122 |
] |
123 |
where n_mb = (fromIntegral n::Rational) * 1000 * 1000 / 1024 / 1024 |
124 |
n_gb = n_mb * 1000 |
125 |
n_tb = n_gb * 1000 |
126 |
|
127 |
{-# ANN case_niceSort_static "HLint: ignore Use camelCase" #-} |
128 |
|
129 |
case_niceSort_static :: Assertion |
130 |
case_niceSort_static = do |
131 |
assertEqual "empty list" [] $ niceSort [] |
132 |
assertEqual "punctuation" [",", "."] $ niceSort [",", "."] |
133 |
assertEqual "decimal numbers" ["0.1", "0.2"] $ niceSort ["0.1", "0.2"] |
134 |
assertEqual "various numbers" ["0,099", "0.1", "0.2", "0;099"] $ |
135 |
niceSort ["0;099", "0,099", "0.1", "0.2"] |
136 |
|
137 |
assertEqual "simple concat" ["0000", "a0", "a1", "a2", "a20", "a99", |
138 |
"b00", "b10", "b70"] $ |
139 |
niceSort ["a0", "a1", "a99", "a20", "a2", "b10", "b70", "b00", "0000"] |
140 |
|
141 |
assertEqual "ranges" ["A", "Z", "a0-0", "a0-4", "a1-0", "a9-1", "a09-2", |
142 |
"a20-3", "a99-3", "a99-10", "b"] $ |
143 |
niceSort ["a0-0", "a1-0", "a99-10", "a20-3", "a0-4", "a99-3", "a09-2", |
144 |
"Z", "a9-1", "A", "b"] |
145 |
|
146 |
assertEqual "large" |
147 |
["3jTwJPtrXOY22bwL2YoW", "Eegah9ei", "KOt7vn1dWXi", |
148 |
"KVQqLPDjcPjf8T3oyzjcOsfkb", "WvNJd91OoXvLzdEiEXa6", |
149 |
"Z8Ljf1Pf5eBfNg171wJR", "a07h8feON165N67PIE", "bH4Q7aCu3PUPjK3JtH", |
150 |
"cPRi0lM7HLnSuWA2G9", "guKJkXnkULealVC8CyF1xefym", |
151 |
"pqF8dkU5B1cMnyZuREaSOADYx", "uHXAyYYftCSG1o7qcCqe", |
152 |
"xij88brTulHYAv8IEOyU", "xpIUJeVT1Rp"] $ |
153 |
niceSort ["Eegah9ei", "xij88brTulHYAv8IEOyU", "3jTwJPtrXOY22bwL2YoW", |
154 |
"Z8Ljf1Pf5eBfNg171wJR", "WvNJd91OoXvLzdEiEXa6", |
155 |
"uHXAyYYftCSG1o7qcCqe", "xpIUJeVT1Rp", "KOt7vn1dWXi", |
156 |
"a07h8feON165N67PIE", "bH4Q7aCu3PUPjK3JtH", |
157 |
"cPRi0lM7HLnSuWA2G9", "KVQqLPDjcPjf8T3oyzjcOsfkb", |
158 |
"guKJkXnkULealVC8CyF1xefym", "pqF8dkU5B1cMnyZuREaSOADYx"] |
159 |
|
160 |
-- | Tests single-string behaviour of 'niceSort'. Last test is special |
161 |
-- in the sense that /0/ is before any other non-empty string (except |
162 |
-- itself, etc.). |
163 |
prop_niceSort_single :: Property |
164 |
prop_niceSort_single = |
165 |
forAll genName $ \name -> |
166 |
conjoin |
167 |
[ printTestCase "single string" $ [name] ==? niceSort [name] |
168 |
, printTestCase "single plus empty" $ ["", name] ==? niceSort [name, ""] |
169 |
, printTestCase "single plus 0-digit" $ ["0", name] ==? niceSort [name, "0"] |
170 |
] |
171 |
|
172 |
-- | Tests some generic 'niceSort' properties. Note that the last test |
173 |
-- must add a non-digit prefix; a digit one might change ordering. |
174 |
prop_niceSort_generic :: Property |
175 |
prop_niceSort_generic = |
176 |
forAll (resize 20 arbitrary) $ \names -> |
177 |
let n_sorted = niceSort names in |
178 |
conjoin [ printTestCase "length" $ length names ==? length n_sorted |
179 |
, printTestCase "same strings" $ sort names ==? sort n_sorted |
180 |
, printTestCase "idempotence" $ n_sorted ==? niceSort n_sorted |
181 |
, printTestCase "static prefix" $ n_sorted ==? |
182 |
map tail (niceSort $ map (" "++) names) |
183 |
] |
184 |
|
185 |
-- | Tests that niceSorting numbers is identical to actual sorting |
186 |
-- them (in numeric form). |
187 |
prop_niceSort_numbers :: Property |
188 |
prop_niceSort_numbers = |
189 |
forAll (listOf (arbitrary::Gen (NonNegative Int))) $ \numbers -> |
190 |
map show (sort numbers) ==? niceSort (map show numbers) |
191 |
|
192 |
-- | Tests that 'niceSort' and 'niceSortKey' are equivalent. |
193 |
prop_niceSortKey_equiv :: Property |
194 |
prop_niceSortKey_equiv = |
195 |
forAll (resize 20 arbitrary) $ \names -> |
196 |
forAll (vectorOf (length names) (arbitrary::Gen Int)) $ \numbers -> |
197 |
let n_sorted = niceSort names in |
198 |
conjoin |
199 |
[ printTestCase "key id" $ n_sorted ==? niceSortKey id names |
200 |
, printTestCase "key rev" $ niceSort (map reverse names) ==? |
201 |
map reverse (niceSortKey reverse names) |
202 |
, printTestCase "key snd" $ n_sorted ==? map snd (niceSortKey snd $ |
203 |
zip numbers names) |
204 |
] |
205 |
|
206 |
-- | Tests 'rstripSpace'. |
207 |
prop_rStripSpace :: NonEmptyList Char -> Property |
208 |
prop_rStripSpace (NonEmpty str) = |
209 |
forAll (resize 50 $ listOf1 (arbitrary `suchThat` isSpace)) $ \whitespace -> |
210 |
conjoin [ printTestCase "arb. string last char is not space" $ |
211 |
case rStripSpace str of |
212 |
[] -> True |
213 |
xs -> not . isSpace $ last xs |
214 |
, printTestCase "whitespace suffix is stripped" $ |
215 |
rStripSpace str ==? rStripSpace (str ++ whitespace) |
216 |
, printTestCase "whitespace reduced to null" $ |
217 |
rStripSpace whitespace ==? "" |
218 |
, printTestCase "idempotent on empty strings" $ |
219 |
rStripSpace "" ==? "" |
220 |
] |
221 |
|
222 |
-- | Test list for the Utils module. |
223 |
testSuite "Utils" |
224 |
[ 'prop_commaJoinSplit |
225 |
, 'prop_commaSplitJoin |
226 |
, 'prop_fromObjWithDefault |
227 |
, 'prop_if'if |
228 |
, 'prop_select |
229 |
, 'prop_select_undefd |
230 |
, 'prop_select_undefv |
231 |
, 'prop_parseUnit |
232 |
, 'case_niceSort_static |
233 |
, 'prop_niceSort_single |
234 |
, 'prop_niceSort_generic |
235 |
, 'prop_niceSort_numbers |
236 |
, 'prop_niceSortKey_equiv |
237 |
, 'prop_rStripSpace |
238 |
] |