Package statechum.DeterministicDirectedSparseGraph

Examples of statechum.DeterministicDirectedSparseGraph.VertexID

191
192
193
194
195
196
197
198
199
200
201
202
203
      updateIDWith(vert);
  }
 
  public void updateIDWith(CmpVertex vert)
  {
    VertexID id = vert.getID();
    if ((id.getKind() == VertKind.NEUTRAL || id.getKind() == VertKind.POSITIVE)
      && id.getIngegerID() >= vertPositiveID)
      vertPositiveID = id.getIngegerID()+1;
    if ((id.getKind() == VertKind.NEGATIVE)
        && id.getIngegerID() >= vertNegativeID)
      vertNegativeID = id.getIngegerID()+1;
  }
View Full Code Here
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
   * modifying the graph in the process. For graphs we'd rather not modify, this can be set to false, but then each call
   * will give the same identifier.
   */
  public synchronized VertexID nextID(JUConstants.VERTEXLABEL accepted, boolean store)
  {
    VertexID result = null;
    int positiveID = vertPositiveID, negativeID = vertNegativeID;
    if (config.getLearnerIdMode() == IDMode.POSITIVE_ONLY)
      result = new VertexID(VertKind.NEUTRAL,positiveID++);
    else
      result = (accepted != VERTEXLABEL.REJECT?new VertexID(VertKind.POSITIVE,positiveID++):
          new VertexID(VertKind.NEGATIVE,negativeID++));

    if (store)
    {
      vertPositiveID = positiveID;vertNegativeID = negativeID;
    }
View Full Code Here
246
247
248
249
250
251
252
253
254
255
256
  }

  public synchronized VertexID getDefaultInitialPTAName()
  {
    if (config.getDefaultInitialPTAName().length() > 0)
      return new VertexID(config.getDefaultInitialPTAName());
    return new VertexID(VertKind.POSITIVE,vertPositiveID++);
    // Since the text ID of the initial vertex is "Init" which does not contain numerical ID,
    // I cannot adequately load graphs containing such vertices. The best solution is to abolish it.
    //new VertexID(VertKind.INIT,vertPositiveID++);
  }
View Full Code Here
511
512
513
514
515
516
517
518
519
520
521
    CmpVertex result = null;
    Iterator<Entry<CmpVertex,Map<String,TARGET_TYPE>>> entryIt = transitionMatrix.entrySet().iterator();
    while(entryIt.hasNext() && result == null)
    {
      CmpVertex currentVert = entryIt.next().getKey();
      VertexID vertName = currentVert.getID();
      if (vertName.equals(name))
        result = currentVert;
    }
    return result;
  }
View Full Code Here
648
649
650
651
652
653
654
655
656
657
658
  /** Non-existing vertices in a tentative automaton. */
  @Test
  public final void testPerformAugment_fail0()
  {
    final LearnerGraph graph = buildLearnerGraph("A-a->B-b->C", "testPerformAugment_fail0a",mainConfiguration,converter);
    graph.transitionMatrix.put(AbstractLearnerGraph.generateNewCmpVertex(new VertexID(VertKind.NONEXISTING,90),mainConfiguration),graph.createNewRow());
    Helper.checkForCorrectException(new whatToRun() { public @Override void run() throws IncompatibleStatesException {
      LearnerGraph[] ifthenCollection = new LearnerGraph[]{buildLearnerGraph("A-a->B-a->B /  T-b->N / B=THEN=T", "testPerformAugment_fail0b", mainConfiguration,converter)};
      Transform.augmentFromIfThenAutomaton(graph, null, ifthenCollection, 2);
    }},IllegalArgumentException.class,"non-existing vertices");
  }
View Full Code Here
332
333
334
335
336
337
338
339
 
  @Test
  public void testGraphConstructionFail2()
  {
    DirectedSparseVertex v = new DirectedSparseVertex();
    v.addUserDatum(JUConstants.ACCEPTED, true, UserData.SHARED);v.addUserDatum(JUConstants.LABEL, new VertexID("B"), UserData.SHARED);
    checkWithVertex(v, "multiple states with the same name", "testGraphConstructionFail2");
  }
View Full Code Here
340
341
342
343
344
345
346
347
 
  @Test
  public void testGraphConstructionFail3()
  {
    DirectedSparseVertex v = new DirectedSparseVertex();
    v.addUserDatum(JUConstants.ACCEPTED, true, UserData.SHARED);v.addUserDatum(JUConstants.LABEL, new VertexID("CONFL"), UserData.SHARED);
    checkWithVertex(v, "multiple states with the same name", "testGraphConstructionFail3");
  }
View Full Code Here
348
349
350
351
352
353
354
355
 
  @Test
  public void testGraphConstructionFail4a()
  {
    DirectedSparseVertex v = new DirectedSparseVertex();
    v.addUserDatum(JUConstants.ACCEPTED, true, UserData.SHARED);v.addUserDatum(JUConstants.LABEL, new VertexID("Q"), UserData.SHARED);v.addUserDatum(JUConstants.INITIAL, true, UserData.SHARED);
    checkWithVertex(v, "both labelled as initial states", "testGraphConstructionFail4a");
  }
View Full Code Here
356
357
358
359
360
361
362
363
 
  @Test
  public void testGraphConstructionFail4b()
  {
    DirectedSparseVertex v = new DirectedSparseVertex();
    v.addUserDatum(JUConstants.ACCEPTED, true, UserData.SHARED);v.addUserDatum(JUConstants.LABEL, new VertexID("Q"), UserData.SHARED);v.addUserDatum(JUConstants.INITIAL, new VertexID("aa"), UserData.SHARED);
    checkWithVertex(v, "invalid init property", "testGraphConstructionFail4b");
  }
View Full Code Here
364
365
366
367
368
369
370
371
 
  @Test
  public void testGraphConstructionFail5a()
  {
    DirectedSparseVertex v = new DirectedSparseVertex();
    v.addUserDatum(JUConstants.ACCEPTED, true, UserData.SHARED);v.addUserDatum(JUConstants.LABEL, new VertexID("Q"), UserData.SHARED);v.addUserDatum(JUConstants.INITIAL, "aa", UserData.SHARED);
    checkWithVertex(v, "invalid init property", "testGraphConstructionFail5a");
  }
View Full Code Here
TOP

Related Classes of statechum.DeterministicDirectedSparseGraph.VertexID

  • collections.TestMapWithSearch
  • statechum.analysis.learning.experiments.ExperimentGraphMLHandler
  • statechum.analysis.learning.experiments.ForestFireNDStateMachineGenerator
  • statechum.analysis.learning.experiments.ForestFireStateMachineGenerator
  • statechum.analysis.learning.experiments.mutation.GraphMutator
  • statechum.analysis.learning.linear.GD
  • statechum.analysis.learning.linear.GD$DCollector
  • statechum.analysis.learning.linear.GD$LearnerGraphMutator
  • statechum.analysis.learning.linear.TestGD_Multithreaded
  • statechum.analysis.learning.linear.TestLinear
    • 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.