Am 07/12/2013 09:18 AM, schrieb Roman Cheplyaka:
QuickCheck's Gen is a functor. So you can generate a list, and then
use fmap to add a hash to it.
instance Arbitrary HashedList where
arbitrary = addHashToList $ arbitrary
This requires HashedList to be a new type, right? So far my
On Sat, 13 Jul 2013 10:10:39 +0200
martin martin.drautzb...@web.de wrote:
This requires HashedList to be a new type, right? So far my code only
used type synonyms.
Does this mean I have to convert type synonyms into types in order to
use QuickCheck?
Does this mean I have to plan for
* martin martin.drautzb...@web.de [2013-07-13 10:10:39+0200]
Am 07/12/2013 09:18 AM, schrieb Roman Cheplyaka:
QuickCheck's Gen is a functor. So you can generate a list, and then
use fmap to add a hash to it.
instance Arbitrary HashedList where
arbitrary = addHashToList $
Hello all,
I have a type (Mail) which consists of hash and a list, where the hash
keeps some redundant data of the list for faster access. I can add and
remove elements to values of this type using custom functions, called
push and pop.
Now I wanted to write some quick checks, but I have no clue
* martin martin.drautzb...@web.de [2013-07-12 08:33:54+0200]
Hello all,
I have a type (Mail) which consists of hash and a list, where the hash
keeps some redundant data of the list for faster access. I can add and
remove elements to values of this type using custom functions, called
push
Hello all
I have a data type
data Index = Index {indexSize::Float, indexIds::[Int],
indexDown::(IntMap.IntMap Index)}
| IndexLeaf {indexSize::Float, indexIds::[Int]}
| IndexEmpty {indexSize::Float}
deriving ( Show , Eq )
I derived some thing like this for QuickCheck testing
instance
Mukesh,
You need to write a generator function for the type (IntMap
Index) which
keeps track of the n parameter that you're using in arbIndex.
You can't rely on the Arbitrary instance for (IntMap a) because
it
doesn't have access to the n parameter that you are so
controlling
in arbIndex.
Hello,
What are some examples of libraries in HackageDB that use either Quick
Check (pure side) or Monad testing? Is there a way to use darcs to answer
my question?
Thanks, vasili
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Galchin, Vasili [EMAIL PROTECTED] writes:
What are some examples of libraries in HackageDB that use either Quick
Check (pure side) or Monad testing? Is there a way to use darcs to answer my
question?
I used the ByteString library as a guideline when developing testing
(and to a lesser
