Package nz.ac.waikato.modeljunit.coverage

Examples of nz.ac.waikato.modeljunit.coverage.TransitionCoverage

244
245
246
247
248
249
250
251
252
253
254
255
256
    model.addListener("graph");
    assertTrue(model.getListener("graph") instanceof GraphListener);
    assertEquals(model.getGraphListener(), model.getListener("graph"));
    assertEquals(1, model.getListenerNames().size());
    assertEquals(model.getGraphListener(), new RandomTester(model).buildGraph());
    model.addListener(new TransitionCoverage());
    TransitionCoverage tr = (TransitionCoverage) model.getListener("transition coverage");
    assertEquals(2, model.getListenerNames().size());
    assertEquals(5, tr.getMaximum()); // it should have been given the graph
    assertEquals("0/5", tr.toString());
    model.removeAllListeners();
    assertEquals(0, model.getListenerNames().size());
  }
View Full Code Here
88
89
90
91
92
93
94
95
96
97
98
  /** This tests a random walk, plus transition coverage */
  public static void testRandomWalk()
  {
    output_.write("STARTING RANDOM\n");
    Tester tester = new RandomTester(quidonc);
    CoverageHistory metric = new CoverageHistory(new TransitionCoverage(), 1);
    tester.addListener(metric);
    tester.generate(100);
    int coverage = metric.getCoverage();
    List<Integer> hist = metric.getHistory();
    Assert.assertNotNull(hist);
View Full Code Here
108
109
110
111
112
113
114
115
116
117
118
  /** This tests a greedy random walk, plus transition coverage */
  public static void testGreedyRandomWalk()
  {
    output_.write("STARTING GREEDY\n");
    Tester tester = new GreedyTester(new QuiDonc());
    CoverageHistory metric = new CoverageHistory(new TransitionCoverage(), 1);
    tester.addListener(metric);
    tester.generate(100);
    int coverage = metric.getCoverage();
    List<Integer> hist = metric.getHistory();
    Assert.assertNotNull(hist);
View Full Code Here
128
129
130
131
132
133
134
135
136
137
138
  /** This tests an all-round-trips walk, plus transition coverage */
  public static void testAllRoundTrips()
  {
    output_.write("STARTING ALL ROUND TRIPS\n");
    Tester tester = new AllRoundTester(new QuiDonc());
    CoverageHistory metric = new CoverageHistory(new TransitionCoverage(), 1);
    tester.addCoverageMetric(metric);
    tester.generate(100);
    int coverage = metric.getCoverage();
    List<Integer> hist = metric.getHistory();
    Assert.assertNotNull(hist);
View Full Code Here
162
163
164
165
166
167
168
169
170
171
172
  /** This tests a greedy random walk, plus TransitionCoverage metric with history */
  public static void testGreedyRandomWalk()
  {
    ModelTestCase model = new ModelTestCase(new FSM());
    CoverageHistory metric = new CoverageHistory(new TransitionCoverage(), 1);
    model.addCoverageMetric(metric);
    model.greedyRandomWalk(7); // 7 transitions plus a few resets
    int coverage = metric.getCoverage();
    Assert.assertEquals(5, coverage);
    Assert.assertEquals(-1, metric.getMaximum());
View Full Code Here
275
276
277
278
279
280
281
282
   *  It may need adjusting when the seed or random walk algorithm changes.
   */
  public void testTransitionCoverage()
  {
    //    System.out.println("Starting testTransitionCoverage");
    FsmCoverage(new TransitionCoverage(), 5,
        new int[] {1,1, 3,3, 40,5});
  }
View Full Code Here
153
154
155
156
157
158
159
160
   *  It may need adjusting when the seed or random walk algorithm changes.
   */
  public void testTransitionCoverage()
  {
    //    System.out.println("Starting testTransitionCoverage");
    FsmCoverage(new TransitionCoverage(), 5,
        new int[] {1,1, 3,3, 40,5});
  }
View Full Code Here
164
165
166
167
168
169
170
171
172
173
174
175
176
177
  public static void testResetHigh()
  {
    RandomTester tester = new RandomTester(new FSM());
    tester.buildGraph();
    tester.setResetProbability(0.9);
    CoverageMetric trCover = new TransitionCoverage();
    CoverageHistory hist = new CoverageHistory(trCover,1);
    tester.addListener(hist);
    tester.generate(40);
    // the random walk should choose reset almost all the time
    // so should not get much past the first transition.
    Assert.assertEquals(41, hist.getHistory().size());
    Assert.assertEquals(1, trCover.getCoverage());
  }
View Full Code Here
32
33
34
35
36
37
38
39
40
41
42
{
  /** This tests a random walk, plus TransitionCoverage metric with history.*/
  public static void testAllRoundWalk()
  {
    AllRoundTester tester = new AllRoundTester(new FSM());
    CoverageHistory metric = new CoverageHistory(new TransitionCoverage(), 1);
    //tester.addListener(new VerboseListener());
    tester.addCoverageMetric(metric);
    tester.setLoopTolerance(1);
    tester.setRandom(new Random(3));
    tester.generate(10);
View Full Code Here
22
23
24
25
26
27
28
29
30
31
32
  protected CoverageMetric transitions;

  @Before
  public void setUp()   {
    tester = new QuickTester(new SimpleSet());
    transitions = tester.addCoverageMetric(new TransitionCoverage());
    path = new ArrayList<Transition>();
    tester.addListener(new AbstractListener() {
      private Object lastState = "";
      public String getName()
      {
View Full Code Here
TOP

Related Classes of nz.ac.waikato.modeljunit.coverage.TransitionCoverage

  • nz.ac.waikato.jdsl.graph.api.Edge
  • nz.ac.waikato.modeljunit.AllRoundTesterTest
  • nz.ac.waikato.modeljunit.examples.ecinema.ECinema
  • nz.ac.waikato.modeljunit.examples.FSM
  • nz.ac.waikato.modeljunit.examples.gsm.GSM11ImplTest
  • nz.ac.waikato.modeljunit.examples.LargeSet
  • nz.ac.waikato.modeljunit.examples.SimpleSetWithAdaptor
  • nz.ac.waikato.modeljunit.examples.SizeExperiments
  • nz.ac.waikato.modeljunit.examples.SpecialFSM
  • nz.ac.waikato.modeljunit.examples.SpecialFSMNoLoops
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.