quickcheck: size limit randomly generated Benc structures

diff --git a/functorrent.cabal b/functorrent.cabal
index 50bd270cbe3f16027bfed70c303183b9ae89bd58..5e71ebfa93526c76ed186dc913360270ab655d82 100644 (file)
--- a/functorrent.cabal
+++ b/functorrent.cabal
@@ -81,7 +81,9 @@ test-suite functorrent-test
   default-language:  Haskell2010
   hs-source-dirs:    test
   main-is:           Main.hs
-  other-modules:     MagneturiTests
+  other-modules:     BencodeTests
+                   , MagneturiTests
+                   , MetainfoTests
   build-depends:     base
                    , bytestring
                    , functorrent

diff --git a/src/FuncTorrent/Bencode.hs b/src/FuncTorrent/Bencode.hs
index ac6221119663077f83aeb17757d26a7afc057926..b55b3fe15509e5e4745a5451fd9509d842eb7c05 100644 (file)
--- a/src/FuncTorrent/Bencode.hs
+++ b/src/FuncTorrent/Bencode.hs
@@ -59,9 +59,9 @@ instance Arbitrary BVal where
                                , Bstr <$> arbitrary]
                 bval n = oneof [ Bint <$> arbitrary
                                , Bstr <$> arbitrary
-                               , Blist <$> vectorOf n (bval (n `div` 4))
-                               , do keys <- vectorOf n genNonEmptyString
-                                    vals <- vectorOf n (bval (n `div` 4))
+                               , Blist <$> vectorOf (n `div` 2) (bval (n `div` 4))
+                               , do keys <- vectorOf (n `div` 2) genNonEmptyString
+                                    vals <- vectorOf (n `div` 2) (bval (n `div` 4))
                                     return $ Bdict $ fromList $ zip keys vals ]
 
 -- getters