Package statechum.DeterministicDirectedSparseGraph

Examples of statechum.DeterministicDirectedSparseGraph.DeterministicVertex

626
627
628
629
630
631
632
  }

  @Test
  public void checkDComparison1()
  {
    checkLessHelper(DvertA, new DeterministicVertex("b"));
  }
View Full Code Here
639
640
641
642
643
644
645
 
  @Test
  public void checkComparison_differentTypes()
  {
    checkLessHelper(DvertA, new StringVertex("b"));
    checkLessHelper(SvertA, new DeterministicVertex("b"));
  }
View Full Code Here
664
665
666
667
668
669
670
671
672
673
674
675
676
   */
 
  @Test
  public void testDeterministicVertexComparison1_old()
  {
    DeterministicVertex p = new DeterministicVertex("P"), q= new DeterministicVertex("Q");
    assertFalse(p.equals(q));
    assertTrue(p.compareTo(q)<0);
    assertTrue(q.compareTo(p)>0);
    assertFalse(p.hashCode() == q.hashCode());
    assertEquals(0,p.compareTo(p));
    assertEquals(0,q.compareTo(q));
  }
View Full Code Here
378
379
380
381
382
383
384
385
  {
      if (conf.isLearnerUseStrings())
          return  new StringVertex(name);
      synchronized(syncObj)
      {
        return new DeterministicVertex(name);     
      }   
  }
View Full Code Here
676
677
678
679
680
681
682
683
684
685
686
687
688
  }
   
  @Test
  public void testDeterministicVertexComparison2_old()
  {
    DeterministicVertex p = new DeterministicVertex("A"), q= new DeterministicVertex("B");
    assertFalse(p.equals(q));
    assertTrue(p.compareTo(q)<0);
    assertTrue(q.compareTo(p)>0);
    assertFalse(p.hashCode() == q.hashCode());
    assertEquals(0,p.compareTo(p));
    assertEquals(0,q.compareTo(q));
  }
View Full Code Here
688
689
690
691
692
693
694
695
696
  }

  @Test
  public void testDeterministicVertexComparison3_old()
  {
    DeterministicVertex p = new DeterministicVertex("P"), q= new DeterministicVertex("P");
    assertTrue(p.equals(q));
    assertTrue(p.compareTo(q)==0);
  }
View Full Code Here
895
896
897
898
899
900
901
902
903
904
905
906
907
  @Test
  public void testStatePairEquality()
  {
    final Object samePairs[] = new StatePair[]{
        new StatePair(new StringVertex("a"), new StringVertex("b")),
        new StatePair(new DeterministicVertex("a"), new StringVertex("b")),
        new StatePair(new StringVertex("a"), new DeterministicVertex("b")),
        new StatePair(new DeterministicVertex("a"), new DeterministicVertex("b"))       
    },
    differentPairs[] = new Object[] {
        new StatePair(new StringVertex("a"), new StringVertex("c")),
        new StatePair(new StringVertex("d"), new StringVertex("b")),
        new StatePair(new StringVertex("d"), new StringVertex("e")),
View Full Code Here
920
921
922
923
924
925
926
927
  }
 
  private static void checkLess(String a,String b,String c,String d)
  {
    checkLessHelper(new StatePair(new StringVertex(a), new StringVertex(b)), new StatePair(new StringVertex(c), new StringVertex(d)));
    checkLessHelper(new StatePair(new DeterministicVertex(a), new StringVertex(b)), new StatePair(new DeterministicVertex(c), new StringVertex(d)));
    checkLessHelper(new StatePair(new StringVertex(a), new DeterministicVertex(b)), new StatePair(new StringVertex(c), new DeterministicVertex(d)));
  }
View Full Code Here
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
    g.setUserDatum(JUConstants.TITLE, name,UserData.SHARED);

    new TestFSMParser.fsmParser(fsm).parse(new TestFSMParser.TransitionReceiver()
    {
      public void put(String from, String to, String label, boolean accept) {
        DeterministicVertex fromVertex = existingVertices.get(from), toVertex = existingVertices.get(to);
       
        if (fromVertex == null)
        {
          fromVertex = new DeterministicDirectedSparseGraph.DeterministicVertex(from);
          if (existingVertices.isEmpty())
            fromVertex.addUserDatum(JUConstants.INITIAL, true, UserData.SHARED);
          fromVertex.addUserDatum(JUConstants.ACCEPTED, true, UserData.SHARED);
          existingVertices.put(from, fromVertex);
          g.addVertex(fromVertex);
        }
        else
          if (!Boolean.valueOf(fromVertex.getUserDatum(JUConstants.ACCEPTED).toString()))
            throw new IllegalArgumentException("conflicting acceptance assignment on vertex "+from);

        if (from.equals(to))
        {
          if (!accept) throw new IllegalArgumentException("conflicting acceptance assignment on vertex "+to);
View Full Code Here
298
299
300
301
302
303
304
  public static final String PTA1 = "\nA-p->I-q->B"+"\nB-a->B1-a-#B2\nB1-b->B3-b->B4\n";
 
  @Test(expected = IllegalArgumentException.class)
  public final void testLearnerFailsWhenRedNotFound()
  {
    ComputeQuestions.computeQS_orig(new StatePair(null,new DeterministicVertex("non-existing")), new LearnerGraph(testConfig), new LearnerGraph(testConfig));
  }
View Full Code Here
TOP

Related Classes of statechum.DeterministicDirectedSparseGraph.DeterministicVertex

  • statechum.analysis.learning.experiments.ForestFireStateMachineGenerator
  • statechum.analysis.learning.experiments.TestForestFireGenerator
  • statechum.analysis.learning.linear.DifferenceVisualiser$ChangesToGraph
  • statechum.analysis.learning.rpnicore.AbstractLearnerGraph
  • statechum.analysis.learning.rpnicore.AbstractPathRoutines
  • statechum.analysis.learning.rpnicore.FsmParser
  • statechum.analysis.learning.rpnicore.LearnerGraph
  • statechum.analysis.learning.rpnicore.MergeStates
  • statechum.analysis.learning.rpnicore.PathRoutines
  • statechum.analysis.learning.rpnicore.TestEqualityComparisonAndHashCode
    • 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.