Package statechum

Examples of statechum.StringVertex

399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
  public final void testGraphConstruction2()
  {
    confString.setUseOrderedEntrySet(true);config.setUseOrderedEntrySet(true);
    LearnerGraph expected = new LearnerGraph(confString);expected.initEmpty();
    LearnerGraph graph = buildLearnerGraph("A--a-->B-b->C-c->A-b->B-a-#D","testConstruction2",config,converter);
    CmpVertex A = new StringVertex("A"), B = new StringVertex("B"), C = new StringVertex("C");
    CmpVertex D = new StringVertex("D");D.setAccept(false);
    expected.transitionMatrix.put(A, convertRowToDet(expected,createLabelToStateMap(labelList(new String[] {"a","b"}),
        new StringVertex("B"),null), null, A));
    expected.transitionMatrix.put(B, convertRowToDet(expected,createLabelToStateMap(labelList(new String[] {"b"}),
        new StringVertex("C"),createLabelToStateMap(labelList(new String[] {"a"}),D,null)), null, B));
    expected.transitionMatrix.put(C, convertRowToDet(expected,createLabelToStateMap(labelList(new String[] {"c"}),
        new StringVertex("A"),null), null, C));
    expected.transitionMatrix.put(D, convertRowToDet(expected,createLabelToStateMap(emptyCollectionOfLabels,null,null), null, D));
    expected.setInit(expected.findVertex("A"));
   
    assertEquals("A", graph.getInit().getStringId());
    assertEquals("incorrect transition set",true,expected.transitionMatrix.equals(graph.transitionMatrix));
View Full Code Here
422
423
424
425
426
427
428
429
430
431
432
433
434
  public final void testGraphConstruction3()
  {
    confString.setUseOrderedEntrySet(true);config.setUseOrderedEntrySet(true);
    LearnerGraph expected = new LearnerGraph(confString);expected.initEmpty();
    LearnerGraph graph = buildLearnerGraph("A--a-->B<-b--C-c->A-b->A-c->A\nB-d->B-p->C\nB-q->C\nB-r->C\n","testConstruction3",config,converter);
    CmpVertex A = new StringVertex("A"), B = new StringVertex("B"), C = new StringVertex("C");
    expected.transitionMatrix.put(A, convertRowToDet(expected,createLabelToStateMap(labelList(new String[] {"b","c"}),
        new StringVertex("A"),createLabelToStateMap(labelList(new String[] {"a"}),B,null)), null, A));
    expected.transitionMatrix.put(B, convertRowToDet(expected,createLabelToStateMap(labelList(new String[] {"d"}),B,
        createLabelToStateMap(labelList(new String[] {"r","p","q"}),C,null)), null, B));
    expected.transitionMatrix.put(C, convertRowToDet(expected,createLabelToStateMap(labelList(new String[] {"b"}),B,
        createLabelToStateMap(labelList(new String[] {"c"}),A,null)), null, C));
    expected.setInit(expected.findVertex("A"));
View Full Code Here
443
444
445
446
447
448
449
450
451
452
453
454
455
456
  public final void testGraphConstruction4()
  {
    confString.setUseOrderedEntrySet(true);config.setUseOrderedEntrySet(true);
    LearnerGraph expected = new LearnerGraph(confString);expected.initEmpty();
    LearnerGraph graph = buildLearnerGraph("A--a-->B<-b--D-c->A-b->A-c->A\nB-d->B-p-#C\nB-q-#C\nB-r-#C\n","testConstruction4",config,converter);
    CmpVertex A = new StringVertex("A"), B = new StringVertex("B"), C = new StringVertex("C"),D = new StringVertex("D");
    C.setAccept(false);
    expected.transitionMatrix.put(A, convertRowToDet(expected,createLabelToStateMap(labelList(new String[] {"b","c"}),
        new StringVertex("A"),createLabelToStateMap(labelList(new String[] {"a"}),B,null)), null, A));
    expected.transitionMatrix.put(B, convertRowToDet(expected,createLabelToStateMap(labelList(new String[] {"d"}),B,
        createLabelToStateMap(labelList(new String[] {"r","p","q"}),C,null)), null, B));
    expected.transitionMatrix.put(D, convertRowToDet(expected,createLabelToStateMap(labelList(new String[] {"b"}),B,
        createLabelToStateMap(labelList(new String[] {"c"}),A,null)), null, D));
    expected.transitionMatrix.put(C, convertRowToDet(expected,createLabelToStateMap(emptyCollectionOfLabels,null,null), null, C));
View Full Code Here
470
471
472
473
474
475
476
477
478
479
480
481
  public final void testGraphConstruction5()
  {
    confString.setUseOrderedEntrySet(true);config.setUseOrderedEntrySet(true);
    LearnerGraph expected = new LearnerGraph(confString);expected.initEmpty();
    LearnerGraph graph = buildLearnerGraph("A--a-->B-b-#C\nA-b->A-c->A\nB-d->B-p-#C\nB-q-#C\nB-r-#C\n","testConstruction5",config,converter);
    CmpVertex A = new StringVertex("A"), B = new StringVertex("B"), C = new StringVertex("C");
    C.setAccept(false);
    expected.transitionMatrix.put(A, convertRowToDet(expected,createLabelToStateMap(labelList(new String[] {"b","c"}),A,
        createLabelToStateMap(labelList(new String[] {"a"}),B,null)), null, A));
    expected.transitionMatrix.put(B, convertRowToDet(expected,createLabelToStateMap(labelList(new String[] {"d"}),B,
        createLabelToStateMap(labelList(new String[] {"b","r","p","q"}),C,null)), null, B));
    expected.transitionMatrix.put(C, convertRowToDet(expected,createLabelToStateMap(emptyCollectionOfLabels,null,null), null, C));
View Full Code Here
491
492
493
494
495
496
497
498
499
500
501
  public final void testGraphConstruction6()
  {
    confString.setUseOrderedEntrySet(true);config.setUseOrderedEntrySet(true);
    LearnerGraph expected = new LearnerGraph(confString);expected.initEmpty();
    LearnerGraph graph = buildLearnerGraph("P-c->P<-b-Q_St<-a-P-b->P\nQ_St-a->Q_St","testConstruction6",config,converter);
    CmpVertex P = new StringVertex("P"), Q_State = new StringVertex("Q_St");
    expected.transitionMatrix.put(P, convertRowToDet(expected,createLabelToStateMap(labelList(new String[] {"b","c"}),P,
        createLabelToStateMap(labelList(new String[] {"a"}),Q_State,null)), null, P));
    expected.transitionMatrix.put(Q_State, convertRowToDet(expected,createLabelToStateMap(labelList(new String[] {"a"}),Q_State,
        createLabelToStateMap(labelList(new String[] {"b"}),P,null)), null, Q_State));
    expected.setInit(expected.findVertex("P"));
View Full Code Here
92
93
94
95
96
97
98
99
100
 
  /** test with empty data. */
  @Test
  public final void testCreateLabelToStateMap1()
  {
    assertTrue(createLabelToStateMap(new LinkedList<Label>(), new StringVertex("junk"), null).isEmpty());
    Map<Label,List<CmpVertex>> map = new HashMap<Label,List<CmpVertex>>();
    assertSame(map,createLabelToStateMap(new LinkedList<Label>(), new StringVertex("junk"), map));assertTrue(map.isEmpty());
  }
View Full Code Here
140
141
142
143
144
145
146
147
148
149
150
  /** test for no changes when nothing is to be added. */
  @Test
  public final void testCreateLabelToStateMap2()
  {
    Map<Label,List<CmpVertex>> trans = new HashMap<Label,List<CmpVertex>>();
    List<CmpVertex> A=Arrays.asList(new CmpVertex[]{new StringVertex("A")}),B=Arrays.asList(new CmpVertex[]{new StringVertex("B")});
    trans.put(lb("a"), A);trans.put(lb("b"), A);trans.put(lb("c"), B);
    Map<Label,List<CmpVertex>> expected = new HashMap<Label,List<CmpVertex>>();expected.putAll(trans);
    assertSame(trans,createLabelToStateMap(new LinkedList<Label>(), new StringVertex("junk"),trans));
    assertEquals(expected,trans);
  }
View Full Code Here
152
153
154
155
156
157
158
159
160
161
162
  /** test for correct data being added when two transitions lead to the same state as one of the existing states. */
  @Test
  public final void testCreateLabelToStateMap3()
  {
    Map<Label,List<CmpVertex>> trans = new HashMap<Label,List<CmpVertex>>();
    List<CmpVertex> A=Arrays.asList(new CmpVertex[]{new StringVertex("A")}),B=Arrays.asList(new CmpVertex[]{new StringVertex("B")});
    trans.put(lb("a"), A);trans.put(lb("b"), A);trans.put(lb("c"), B);
    Map<Label,List<CmpVertex>> expected = new HashMap<Label,List<CmpVertex>>();expected.putAll(trans);expected.put(lb("e"), A);expected.put(lb("g"), A);
    assertSame(trans,createLabelToStateMap(labelList(new String[] {"g","e"}), new StringVertex("A"),trans));
    assertEquals(expected,trans);
  }
View Full Code Here
164
165
166
167
168
169
170
171
172
173
174
175
176
  /** test for correct data being added when two transitions lead to a new state. */
  @Test
  public final void testCreateLabelToStateMap4()
  {
    Map<Label,List<CmpVertex>> trans = new HashMap<Label,List<CmpVertex>>();
    List<CmpVertex> A=Arrays.asList(new CmpVertex[]{new StringVertex("A")}),
      B=Arrays.asList(new CmpVertex[]{new StringVertex("B")}),
      D=Arrays.asList(new CmpVertex[]{new StringVertex("D")});
    trans.put(lb("a"), A);trans.put(lb("b"), A);trans.put(lb("c"), B);
    Map<Label,List<CmpVertex>> expected = new HashMap<Label,List<CmpVertex>>();expected.putAll(trans);expected.put(lb("e"),D);expected.put(lb("f"), D);
    assertSame(trans,createLabelToStateMap(labelList(new String[] {"f","e"}), new StringVertex("D"),trans));
    assertEquals(expected,trans);
  }
View Full Code Here
178
179
180
181
182
183
184
185
186
187
188
189
  /** test for correct data being added when two transitions lead to the same state as one of the existing states. */
  @Test
  public final void testCreateLabelToStateMap5()
  {
    Map<Label,List<CmpVertex>> trans = new HashMap<Label,List<CmpVertex>>();
    List<CmpVertex> A=Arrays.asList(new CmpVertex[]{new StringVertex("A")}),
      B=Arrays.asList(new CmpVertex[]{new StringVertex("B")});
    trans.put(lb("a"), A);trans.put(lb("b"), A);trans.put(lb("c"), B);
    Map<Label,List<CmpVertex>> expected = new HashMap<Label,List<CmpVertex>>();expected.putAll(trans);expected.put(lb("e"), B);expected.put(lb("g"), B);
    assertSame(trans,createLabelToStateMap(labelList(new String[] {"g","e"}), new StringVertex("B"),trans));
    assertEquals(expected,trans);
  }
View Full Code Here
TOP

Related Classes of statechum.StringVertex

  • statechum.analysis.learning.experiments.ForestFireNDStateMachineGenerator
  • statechum.analysis.learning.rpnicore.AbstractLearnerGraph
  • statechum.analysis.learning.rpnicore.AngluinLearner
  • statechum.analysis.learning.rpnicore.LearnerGraph
  • statechum.analysis.learning.rpnicore.TestEqualityComparisonAndHashCode
  • statechum.analysis.learning.rpnicore.TestGraphConstruction
  • statechum.analysis.learning.rpnicore.TestGraphConstructionWithDifferentConf
  • statechum.analysis.learning.rpnicore.TestWMethod
  • statechum.analysis.learning.TestFSMAlgo
  • statechum.DeterministicDirectedSparseGraph.CmpVertex
    • 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.