Package statechum

Examples of statechum.StringVertex

194
195
196
197
198
199
200
201
202
203
  /** test for correct data being added when an empty collection is passed. */
  @Test
  public final void testCreateLabelToStateMap6()
  {
    Map<Label,List<CmpVertex>> trans = new HashMap<Label,List<CmpVertex>>();
    List<CmpVertex> A=Arrays.asList(new CmpVertex[]{new StringVertex("A")});
    Map<Label,List<CmpVertex>> expected = new HashMap<Label,List<CmpVertex>>();expected.put(lb("e"),A);expected.put(lb("b"),A);
    assertSame(trans,createLabelToStateMap(labelList(new String[] {"b","e"}), new StringVertex("A"),trans));
    assertEquals(expected,trans);
  }
View Full Code Here
204
205
206
207
208
209
210
211
212
  /** test for correct data being added when null is passed. */
  @Test
  public final void testCreateLabelToStateMap7()
  {
    List<CmpVertex> A=Arrays.asList(new CmpVertex[]{new StringVertex("A")});
    Map<Label,List<CmpVertex>> expected = new HashMap<Label,List<CmpVertex>>();expected.put(lb("e"),A);expected.put(lb("b"),A);
    assertEquals(expected,createLabelToStateMap(labelList(new String[] {"b","e"}), new StringVertex("A"),null));
  }
View Full Code Here
217
218
219
220
221
222
223
224
225
226
227
228
   */
  @Test
  public final void testCreateLabelToStateMap8()
  {
    final 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);
    checkForCorrectException(new whatToRun() { public @Override void run() {
      createLabelToStateMap(labelList(new String[] {"b","e"}), new StringVertex("A"),trans);
    }},IllegalArgumentException.class,"duplicate");
  }
View Full Code Here
233
234
235
236
237
238
239
240
   */
  @Test
  public final void testCreateLabelToStateMap9() // test for correct detection of nondeterminism
  {
    checkForCorrectException(new whatToRun() { public @Override void run() {
      createLabelToStateMap(labelList(new String[] {"b","b"}), new StringVertex("A"),null);
    }},IllegalArgumentException.class,"duplicate");
  }
View Full Code Here
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
 
  /** test for correct data being added in the case of nondeterminism. */
  @Test
  public final void testCreateLabelToStateMap_nondet1()
  {
    Map<Label,List<CmpVertex>> trans = createLabelToStateMap(labelList(new String[] {"t"}), new StringVertex("A"),
      createLabelToStateMap(AbstractLearnerGraph.buildList(Arrays.asList(new String[] {"b","e"}),config,converter), new StringVertex("A"),
        createLabelToStateMap(AbstractLearnerGraph.buildList(Arrays.asList(new String[] {"f"}),config,converter), new StringVertex("C"),null)));
    List<CmpVertex>
      A=Arrays.asList(new CmpVertex[]{new StringVertex("A")}),
      C=Arrays.asList(new CmpVertex[]{new StringVertex("C")}),
      AC=Arrays.asList(new CmpVertex[]{new StringVertex("A"),new StringVertex("C")});
      Map<Label,List<CmpVertex>> expected = new HashMap<Label,List<CmpVertex>>();
      expected.put(lb("e"),AC);expected.put(lb("b"),AC);expected.put(lb("f"), C);expected.put(lb("t"), A);
    assertSame(trans,createLabelToStateMap(labelList(new String[] {"b","e"}), new StringVertex("C"),trans));
    assertEquals(expected,trans);
  }
View Full Code Here
279
280
281
282
283
284
285
286
287
288
289
  /** Empty row. */
  @Test
  public final void testRowConversion0()
  {
    CmpVertex A = new StringVertex("A");
    LearnerGraph graph = new LearnerGraph(confString);
    @SuppressWarnings("unchecked")
    Map<Label,CmpVertex> actual=convertRowToDet(graph,Collections.EMPTY_MAP, null, A),
      expected = graph.createNewRow();
    assertEquals(expected,actual);
View Full Code Here
291
292
293
294
295
296
297
298
299
300
301
  /** Row with a single entry. */
  @Test
  public final void testRowConversion1()
  {
    CmpVertex A = new StringVertex("A"), B = new StringVertex("B");
    LearnerGraph graph = new LearnerGraph(confString);
    Map<Label,CmpVertex> actual=convertRowToDet(graph,createLabelToStateMap(labelList(new String[] {"a"}),B,null), null, A),
      expected = graph.createNewRow();
    expected.put(lb("a"), B);
    assertEquals(expected,actual);
View Full Code Here
303
304
305
306
307
308
309
310
311
312
313
  /** Row with a number of entries including a loop. */
  @Test
  public final void testRowConversion2()
  {
    CmpVertex A = new StringVertex("A"), B = new StringVertex("B"), C = new StringVertex("C");
    LearnerGraph graph = new LearnerGraph(confString);
    Map<Label,CmpVertex> actual=convertRowToDet(graph,
            createLabelToStateMap(labelList(new String[] {"a","b"}),B,
                createLabelToStateMap(labelList(new String[] {"e"}),A,
                    createLabelToStateMap(labelList(new String[] {"c","d"}),C,null))), null, A),
View Full Code Here
318
319
320
321
322
323
324
325
326
327
328
329
  /** Row with multiple entries and a map for renumbering of vertices. */
  @Test
  public final void testRowConversion2_renumbered()
  {
    CmpVertex A = new StringVertex("A"), B = new StringVertex("B"), C = new StringVertex("C"),
      newA = new StringVertex("newA"),newB = new StringVertex("newB"), newC = new StringVertex("newC");
    Map<CmpVertex,CmpVertex> oldToNew = new TreeMap<CmpVertex,CmpVertex>();oldToNew.put(A,newA);oldToNew.put(B,newB);oldToNew.put(C,newC);
    LearnerGraph graph = new LearnerGraph(confString);
    Map<Label,CmpVertex> actual=convertRowToDet(graph,
            createLabelToStateMap(labelList(new String[] {"a","b"}),B,
                createLabelToStateMap(labelList(new String[] {"e"}),A,
View Full Code Here
335
336
337
338
339
340
341
342
343
344
345
  /** Non-determinism on transition a. */
  @Test
  public final void testRowConversion_nondet1()
  {
    final CmpVertex A = new StringVertex("A"), B = new StringVertex("B"), C = new StringVertex("C");
    final LearnerGraph graph = new LearnerGraph(confString);
   
    checkForCorrectException(new whatToRun() { public @Override void run() {
      convertRowToDet(graph,createLabelToStateMap(labelList(new String[] {"a","b"}),B,createLabelToStateMap(labelList(new String[] {"a"}),C,null)), null,A);
    }},IllegalArgumentException.class,"non-deterministic");
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.