Package statechum.analysis.learning

Examples of statechum.analysis.learning.PairOfPaths

914
915
916
917
918
919
920
921
922
923
924
 
  @Test
  public void testRebuildStackFail1()
  {
    final LearnerGraph gr = buildLearnerGraph("A-a->A-b->B-c->C", "testWritePairsToXML1",mainConfiguration,converter);
    final PairOfPaths pair1 = new PairOfPaths(gr,new PairScore(gr.findVertex(VertexID.parseID("A")), gr.findVertex(VertexID.parseID("C")),1,2));
    final Stack<PairScore> stack=new Stack<PairScore>();
    Helper.checkForCorrectException(new whatToRun() { public @Override void run() {
      pair1.rebuildStack(gr, stack);
    }},IllegalArgumentException.class,"pair not found");
  }
View Full Code Here
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
 
  @Test
  public void testRebuildStackFail2()
  {
    final LearnerGraph gr = buildLearnerGraph("A-a->A-b->B-c->C", "testWritePairsToXML1",mainConfiguration,converter);
    final PairOfPaths pair1 = new PairOfPaths(gr,new PairScore(gr.findVertex(VertexID.parseID("A")), gr.findVertex(VertexID.parseID("C")),1,2));
    final Stack<PairScore> stack=new Stack<PairScore>();
    stack.push(new PairScore(gr.findVertex(VertexID.parseID("A")), gr.findVertex(VertexID.parseID("C")),1,2));
    stack.push(new PairScore(gr.findVertex(VertexID.parseID("A")), gr.findVertex(VertexID.parseID("C")),1,2));
    stack.push(new PairScore(gr.findVertex(VertexID.parseID("A")), gr.findVertex(VertexID.parseID("A")),2,2));
    stack.push(new PairScore(gr.findVertex(VertexID.parseID("C")), gr.findVertex(VertexID.parseID("C")),2,2));
    Helper.checkForCorrectException(new whatToRun() { public @Override void run() {
      pair1.rebuildStack(gr, stack);
    }},IllegalArgumentException.class,"pair not found");
  }
View Full Code Here
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
 
  @Test
  public void testRebuildStackFail3()
  {
    final LearnerGraph gr = buildLearnerGraph("A-a->A-b->B-c->C", "testWritePairsToXML1",mainConfiguration,converter);
    final PairOfPaths pair1 = new PairOfPaths(gr,new PairScore(gr.findVertex(VertexID.parseID("A")), gr.findVertex(VertexID.parseID("C")),1,2));
    final Stack<PairScore> stack=new Stack<PairScore>();
    stack.push(new PairScore(gr.findVertex(VertexID.parseID("B")), gr.findVertex(VertexID.parseID("C")),1,2));
    stack.push(new PairScore(gr.findVertex(VertexID.parseID("A")), gr.findVertex(VertexID.parseID("B")),1,2));
    stack.push(new PairScore(gr.findVertex(VertexID.parseID("A")), gr.findVertex(VertexID.parseID("A")),2,2));
    stack.push(new PairScore(gr.findVertex(VertexID.parseID("C")), gr.findVertex(VertexID.parseID("C")),2,2));
    Helper.checkForCorrectException(new whatToRun() { public @Override void run() {
      pair1.rebuildStack(gr, stack);
    }},IllegalArgumentException.class,"pair not found");
  }
View Full Code Here
955
956
957
958
959
960
961
962
963
964
965
966
 
  @Test
  public void testRebuildStackFail4()
  {
    final LearnerGraph gr = buildLearnerGraph("A-a->A-b->B-c->C", "testWritePairsToXML1",mainConfiguration,converter);
    final PairOfPaths pair1 = new PairOfPaths(gr,new PairScore(gr.findVertex(VertexID.parseID("A")), gr.findVertex(VertexID.parseID("C")),1,2));
    final Stack<PairScore> stack=new Stack<PairScore>();
    stack.push(new PairScore(gr.findVertex(VertexID.parseID("C")), gr.findVertex(VertexID.parseID("C")),2,2));
    Helper.checkForCorrectException(new whatToRun() { public @Override void run() {
      pair1.rebuildStack(gr, stack);
    }},IllegalArgumentException.class,"pair not found");
  }
View Full Code Here
910
911
912
913
914
915
916
917
918
919
920
          Stack<PairScore> outcome = decoratedLearner.ChooseStatePairs(graph);
          if (!outcome.isEmpty())
          {
            if (listOfPairsToWrite != null)
            {
              listOfPairsToWrite.add(new PairOfPaths(graph, outcome.peek()));
            }
           
            if(listOfPairsToCheckAgainstIterator != null)
            {
              listOfPairsToCheckAgainstIterator.next().rebuildStack(graph, outcome);
View Full Code Here
690
691
692
693
694
695
696
697
  @Test
  public void testWritePairsToXMLFail1()
  {
    final LearnerGraph gr = buildLearnerGraph("A-a->A-b->B-c->C\nD-a->D", "testWritePairsToXMLFail1",config);
    Helper.checkForCorrectException(new whatToRun() { @SuppressWarnings("unused") public @Override void run() {
      new PairOfPaths(gr,new PairScore(gr.findVertex(VertexID.parseID("D")), gr.findVertex(VertexID.parseID("C")),1,2));
    }},IllegalArgumentException.class,"failed to find paths");
  }
View Full Code Here
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
  @Test
  public void testWritePairsToXML1()
  {
    ByteArrayOutputStream outputStream = new ByteArrayOutputStream();
    LearnerGraph gr = buildLearnerGraph("A-a->A-b->B-c->C", "testWritePairsToXML1",config);
    PairOfPaths pair = new PairOfPaths(gr,new PairScore(gr.findVertex(VertexID.parseID("A")), gr.findVertex(VertexID.parseID("C")),1,2));
    List<PairOfPaths> list = new LinkedList<PairOfPaths>();list.add(pair);
    PairOfPaths.writePairs(list, config, outputStream);
   
    // Now load this.
    System.out.println(outputStream);
    List<PairOfPaths> loaded = PairOfPaths.readPairs(new StringReader(outputStream.toString()), config);
    Assert.assertEquals(1,loaded.size());
   
    PairOfPaths r=loaded.get(0);
    Assert.assertEquals("A",gr.getVertex(r.getQ()).getID().toString());Assert.assertEquals("C",gr.getVertex(r.getR()).getID().toString());
  }
View Full Code Here
723
724
725
726
727
728
729
730
   
    LearnerGraph gr = buildLearnerGraph("A-a->A-b->B-c->C", "testWritePairsToXML1",config);
    List<PairOfPaths> loaded = PairOfPaths.readPairs(new StringReader(xmlString), config);
    Assert.assertEquals(1,loaded.size());
   
    PairOfPaths r=loaded.get(0);
    Assert.assertEquals("A",gr.getVertex(r.getQ()).getID().toString());Assert.assertEquals("C",gr.getVertex(r.getR()).getID().toString());
  }
View Full Code Here
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
  @Test
  public void testWritePairsToXML2()
  {
    ByteArrayOutputStream outputStream = new ByteArrayOutputStream();
    LearnerGraph gr = buildLearnerGraph("A-a->A-b->B-c->C", "testWritePairsToXML1",config);
    PairOfPaths pair1 = new PairOfPaths(gr,new PairScore(gr.findVertex(VertexID.parseID("A")), gr.findVertex(VertexID.parseID("C")),1,2)),
        pair2 = new PairOfPaths(gr,new PairScore(gr.findVertex(VertexID.parseID("B")), gr.findVertex(VertexID.parseID("C")),1,2));
    List<PairOfPaths> list = new LinkedList<PairOfPaths>();list.add(pair1);list.add(pair2);
    PairOfPaths.writePairs(list, config, outputStream);
   
    // Now load this.
    System.out.println(outputStream);
    List<PairOfPaths> loaded = PairOfPaths.readPairs(new StringReader(outputStream.toString()), config);
    Assert.assertEquals(2,loaded.size());
   
    PairOfPaths r=loaded.get(0);
    Assert.assertEquals("A",gr.getVertex(r.getQ()).getID().toString());Assert.assertEquals("C",gr.getVertex(r.getR()).getID().toString());
    r=loaded.get(1);
    Assert.assertEquals("B",gr.getVertex(r.getQ()).getID().toString());Assert.assertEquals("C",gr.getVertex(r.getR()).getID().toString());
  }
View Full Code Here
786
787
788
789
790
791
792
793
794
795
796
797
798
 
  @Test
  public void testRebuildStack1()
  {
    LearnerGraph gr = buildLearnerGraph("A-a->A-b->B-c->C", "testWritePairsToXML1",config);
    PairOfPaths pair1 = new PairOfPaths(gr,new PairScore(gr.findVertex(VertexID.parseID("A")), gr.findVertex(VertexID.parseID("C")),1,2));
    Stack<PairScore> stack=new Stack<PairScore>();
    stack.push(new PairScore(gr.findVertex(VertexID.parseID("A")), gr.findVertex(VertexID.parseID("C")),1,2));
    pair1.rebuildStack(gr, stack);
    Assert.assertEquals(1,stack.size());
    PairScore r = stack.pop();
    Assert.assertEquals("A",r.getQ().getID().toString());Assert.assertEquals("C",r.getR().getID().toString());
  } 
View Full Code Here
TOP

Related Classes of statechum.analysis.learning.PairOfPaths

  • statechum.analysis.learning.experiments.PaperUAS$RPNIBlueFringe
  • statechum.analysis.learning.experiments.PaperUAS$RPNIBlueFringeTestVariability
  • statechum.analysis.learning.experiments.TestPaperUAS
  • statechum.DeterministicDirectedSparseGraph.CmpVertex
  • javax.xml.parsers.DocumentBuilderFactory
  • javax.xml.transform.stream.StreamResult
  • org.w3c.dom.NodeList
  • javax.xml.transform.dom.DOMSource
  • javax.xml.transform.Transformer
  • org.w3c.dom.Document
    • 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.