Package nz.ac.waikato.modeljunit.examples

Examples of nz.ac.waikato.modeljunit.examples.SimpleSet

18
19
20
21
22
23
24
25
26
27
28
  public static void testGetRandomNumber()
  {
    TestFailureException exception = new TestFailureException();
    exception.setSequence(new ArrayList<Transition>());
    ShortenFailure sut = new ShortenFailure(new RandomTester(new SimpleSet()),
        exception);

    assertTrue(sut.getRandomNumber(0) == 0); //modified

    for (int i = 0; i < 10; i++) //check number is within the range
View Full Code Here
34
35
36
37
38
39
40
41
42
43
44
  public static void testGetRefinedSequence()
  {
    TestFailureException exception = new TestFailureException();
    exception.setSequence(new ArrayList<Transition>());
    ShortenFailure sut = new ShortenFailure(new RandomTester(new SimpleSet()),
        exception);
    List<Transition> list = new ArrayList<Transition>();
    list.add(new Transition("1", "a1", "2")); //0
    list.add(new Transition("2", "a2", "3")); //1
    list.add(new Transition("3", "a1", "3")); //2
View Full Code Here
56
57
58
59
60
61
62
63
64
65
66
  public static void testAddToHashTable()
  {
    TestFailureException exception = new TestFailureException();
    exception.setSequence(new ArrayList<Transition>());
    ShortenFailure sut = new ShortenFailure(new RandomTester(new SimpleSet()),
        exception);
    HashMap<String, ArrayList<Integer>> table = new HashMap<String, ArrayList<Integer>>();
    sut.addToHashTable(table, "1", 0);
    sut.addToHashTable(table, "3", 2);
    sut.addToHashTable(table, "3", 3);
View Full Code Here
75
76
77
78
79
80
81
82
83
84
85
  public static void testFindAllSequenceCycles()
  {
    TestFailureException exception = new TestFailureException();
    exception.setSequence(new ArrayList<Transition>());
    ShortenFailure sut = new ShortenFailure(new RandomTester(new SimpleSet()),
        exception);
    List<Transition> list = new ArrayList<Transition>();
    list.add(new Transition("1", "a1", "2")); //0
    list.add(new Transition("2", "a2", "3")); //1
    list.add(new Transition("3", "a1", "3")); //2
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
  public void testGetShortest()
  {
    TestFailureException exception = new TestFailureException();
    exception.setSequence(new ArrayList<Transition>());
    ShortenFailure sut = new ShortenFailure(new RandomTester(new SimpleSet()),
        exception);
    List<Transition> list = new ArrayList<Transition>();
    list.add(new Transition("1", "a1", "2")); //0
    list.add(new Transition("2", "a2", "3")); //1
    list.add(new Transition("3", "a1", "3")); //2
View Full Code Here
123
124
125
126
127
128
129
130
131
132
133
  public void testAreListsEqual()
  {
    TestFailureException exception = new TestFailureException();
    exception.setSequence(new ArrayList<Transition>());
    ShortenFailure sut = new ShortenFailure(new RandomTester(new SimpleSet()),
        exception);
    List<Transition> list1 = new ArrayList<Transition>();
    list1.add(new Transition("1", "a1", "2")); //0
    list1.add(new Transition("2", "a2", "3")); //1
    list1.add(new Transition("3", "a1", "3")); //2
View Full Code Here
21
22
23
24
25
26
27
28
29
30
31
  protected List<Transition> path;
  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
39
40
41
42
43
44
45
46
47
48
49
  protected List<Transition> path;
  protected CoverageMetric transitions;

  public void setUp()
  {
    tester = new LookaheadTester(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
86
87
88
89
90
91
92
93
94
95
    assertEquals(10, tester.getNewTransValue());
  }
 
  public void testGraph() throws FileNotFoundException
  {
    Tester test = new GreedyTester(new SimpleSet());
    GraphListener graph = (GraphListener) test.addListener("graph");
    test.buildGraph();
    graph.printGraphDot("simpleset.dot");
  }
View Full Code Here
193
194
195
196
197
198
199
200
201
202
203
    assertEquals(16, transitions.getCoverage());
    assertEquals(4, tester.getMaxLength());
  }
 
  public void testConstructor() {
    LookaheadTester tester = new LookaheadTester(new Model(new SimpleSet()));
    assertEquals("Lookahead Walk", tester.getName());
    assertEquals("At each state, this test generator looks ahead through all" +
        " the known paths, upto a fixed DEPTH, to find the path" +
        " that leads to an Action or a Transition that has not yet" +
        " been explored.  Can be exponentially slow if DEPTH is set" +
View Full Code Here
TOP

Related Classes of nz.ac.waikato.modeljunit.examples.SimpleSet

  • nz.ac.waikato.modeljunit.GreedyTester
  • nz.ac.waikato.modeljunit.LookaheadTesterTest
  • nz.ac.waikato.modeljunit.QuickTester
  • nz.ac.waikato.modeljunit.QuickTesterTest
  • nz.ac.waikato.modeljunit.ShortenFailureTest
  • nz.ac.waikato.modeljunit.SimpleMBT
  • nz.ac.waikato.modeljunit.Tester
  • nz.ac.waikato.modeljunit.VerboseListener
    • 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.