Hi,
The paper for that is not in the source, be great if you could dig it out
Peli.
Andy
On 12/13/06, Jonathan de Halleux <[EMAIL PROTECTED]> wrote:
>
> The link to the paper I used should be in the sources. I can't recall it
> on the top of my head.
>
> There is no formal proff (that I know off) that pairwize works. However,
> studies have shown that pairwize was a nice trade off between exponential
> blow up of the number of test cases (you don't want that) and actually
> finding bugs.
>
>
> On 12/12/06, Todd Menier <[EMAIL PROTECTED]> wrote:
> >
> > Ah, thank you. Switching to Cartesian is exactly what I was looking for.
> > I probably should take some time to understand the pairwise generation
> > though. I'm not even sure how that algorithm works, much less the theories
> > behind why this gives you "good enough" test coverage most of the time,
> > though a quick google search did allude to something to that effect.
> >
> > Thanks again for the help,
> > Todd
> >
> >
> > On 12/12/06, Jonathan de Halleux <[EMAIL PROTECTED] > wrote:
> > >
> > > By default, combinatorial test does a pairwise generation of tuples.
> > > There's an option in the attribute ctor to select cartesian product (which
> > > will give 8)
> > >
> > > On 12/11/06, Todd Menier <[EMAIL PROTECTED]> wrote:
> > > >
> > > > Thanks. You understood my question just fine. I must have done
> > > > something else wrong the first time because after because now I am not
> > > > getting an error. However, in every case where I use 3 or more
> > > > parameters,
> > > > it is not generating as many tests as I would expect, unless I'm
> > > > misunderstanding the functionality.
> > > >
> > > > Here's a very simple example that demonstrates the behavior:
> > > >
> > > > [CombinatorialTest]
> > > > public void MyTest(
> > > > [UsingLiterals("a;b")] string s1,
> > > > [UsingLiterals("x;y")] string s2,
> > > > [UsingLiterals("1;2")] string s3)
> > > > {}
> > > >
> > > > I would expect that this would generate 2 x 2 x 2 = 8 tests.
> > > > Instead, it generates 6 tests:
> > > >
> > > > [success] MyTestFixture.MyTest(a,x,1)
> > > > [success] MyTestFixture.MyTest (a,x,2)
> > > > [success] MyTestFixture.MyTest(b,x,1)
> > > > [success] MyTestFixture.MyTest(b,y,1)
> > > > [success] MyTestFixture.MyTest(a,y,2)
> > > > [success] MyTestFixture.MyTest(b,y,2)
> > > >
> > > > Why are (a,y,1) and (b,x,2) not present?
> > > >
> > > >
> > > > On 12/11/06, Gunnlaugur Thor Briem <[EMAIL PROTECTED] > wrote:
> > > > >
> > > > > It definitely does support more than 2 factory-varied parameters.
> > > > > This is working fine for me:
> > > > >
> > > > > [CombinatorialTest]
> > > > > public void TestWeightedValue(
> > > > > [UsingLiterals("0;1e5;1e7")] double f,
> > > > > [UsingLiterals("0;1e4;1e6 ")] double i,
> > > > > [UsingLiterals("0;3e5;7e6")] double v,
> > > > > [UsingLiterals("5e3;250e3;25e6")] double r
> > > > > )
> > > > > {
> > > > > ....
> > > > > }
> > > > >
> > > > > Did I misunderstand the problem you're having?
> > > > >
> > > > > Regards,
> > > > >
> > > > > - Gulli
> > > > >
> > > > > On 12/11/06, Todd Menier <[EMAIL PROTECTED]> wrote:
> > > > > >
> > > > > > Hello,
> > > > > > I'm relatively new to mbUnit and am really liking the
> > > > > > CombinatorialTest feature. It appears that it doesn't support more
> > > > > > than 2
> > > > > > "UsingX" parameters in the test method though. Can anyone recommend
> > > > > > a good
> > > > > > approach to testing all possible permutations of 3 or more
> > > > > > enumerable
> > > > > > inputs?
> > > > > >
> > > > > > Thank you,
> > > > > > Todd
> > > > > >
> > > > > >
> > > > > >
> > > > > >
> > > > >
> > > > >
> > > > >
> > > >
> > > >
> > > >
> > > >
> >
> >
> > > >
> >
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"MbUnit.User" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at
http://groups.google.com/group/MbUnitUser?hl=en
-~----------~----~----~----~------~----~------~--~---
