Package statechum.analysis.learning

Examples of statechum.analysis.learning.PairOfPaths

822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
  @Test
  public void testWritePairsToXML2()
  {
    ByteArrayOutputStream outputStream = new ByteArrayOutputStream();
    LearnerGraph gr = buildLearnerGraph("A-a->A-b->B-c->C", "testWritePairsToXML1",mainConfiguration,converter);
    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, mainConfiguration, outputStream);
   
    // Now load this.
    List<PairOfPaths> loaded = PairOfPaths.readPairs(new StringReader(outputStream.toString()), mainConfiguration,converter);
    Assert.assertEquals(2,loaded.size());
   
    PairOfPaths r=loaded.get(0);
    Assert.assertEquals("A",gr.getVertex(r.getQ()).getStringId());Assert.assertEquals("C",gr.getVertex(r.getR()).getStringId());
    r=loaded.get(1);
    Assert.assertEquals("B",gr.getVertex(r.getQ()).getStringId());Assert.assertEquals("C",gr.getVertex(r.getR()).getStringId());
  }
View Full Code Here
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
  @Test
  public void testWritePairsToXML3()
  {
    ByteArrayOutputStream outputStream = new ByteArrayOutputStream();
    LearnerGraph gr = buildLearnerGraph("A-a->A-b->B-c->C", "testWritePairsToXML1",mainConfiguration,converter);
    PairOfPaths pair1 = new PairOfPaths(gr,new PairScore(null, 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, mainConfiguration, outputStream);
   
    // Now load this.
    List<PairOfPaths> loaded = PairOfPaths.readPairs(new StringReader(outputStream.toString()), mainConfiguration,converter);
    Assert.assertEquals(2,loaded.size());
   
    PairOfPaths r=loaded.get(0);
    Assert.assertNull(r.getQ());Assert.assertEquals("C",gr.getVertex(r.getR()).getStringId());
    r=loaded.get(1);
    Assert.assertEquals("B",gr.getVertex(r.getQ()).getStringId());Assert.assertEquals("C",gr.getVertex(r.getR()).getStringId());
  }
View Full Code Here
862
863
864
865
866
867
868
869
870
871
872
873
874
 
  @Test
  public void testRebuildStack1()
  {
    LearnerGraph gr = buildLearnerGraph("A-a->A-b->B-c->C", "testWritePairsToXML1",mainConfiguration,converter);
    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().getStringId());Assert.assertEquals("C",r.getR().getStringId());
  } 
View Full Code Here
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
 
  @Test
  public void testRebuildStack2()
  {
    LearnerGraph gr = buildLearnerGraph("A-a->A-b->B-c->C", "testWritePairsToXML1",mainConfiguration,converter);
    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("A")),1,2));
    stack.push(new PairScore(gr.findVertex(VertexID.parseID("C")), 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("C")),1,2));
    pair1.rebuildStack(gr, stack);
    Assert.assertEquals(1,stack.size());
    PairScore r = stack.pop();
    Assert.assertEquals("A",r.getQ().getStringId());Assert.assertEquals("C",r.getR().getStringId());
  }
View Full Code Here
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
 
  @Test
  public void testRebuildStack3()
  {
    LearnerGraph gr = buildLearnerGraph("A-a->A-b->B-c->C", "testWritePairsToXML1",mainConfiguration,converter);
    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("C")), 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("C")),1,2));
    stack.push(new PairScore(gr.findVertex(VertexID.parseID("A")), gr.findVertex(VertexID.parseID("A")),1,2));
    pair1.rebuildStack(gr, stack);
    Assert.assertEquals(1,stack.size());
    PairScore r = stack.pop();
    Assert.assertEquals("A",r.getQ().getStringId());Assert.assertEquals("C",r.getR().getStringId());
  } 
View Full Code Here
907
908
909
910
911
912
913
914
915
916
917
 
  @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
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
 
  @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
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
 
  @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
948
949
950
951
952
953
954
955
956
957
958
959
 
  @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
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
            {
              CmpVertex redVertex = null;
              if (listOfPairsToWrite != null)
              {
                redVertex = tentativeRedNodes.iterator().next();
                listOfPairsToWrite.add(new PairOfPaths(coregraph, new PairScore(null, redVertex, 0, 0)));
              }
             
              if(listOfPairsToCheckAgainstIterator != null)
              {
                PairOfPaths pair = listOfPairsToCheckAgainstIterator.next();
                Assert.assertNull(pair.getQ());
                redVertex = coregraph.getVertex(pair.getR());
              }
              return redVertex;
            }

            @SuppressWarnings("unused")
            @Override
            public CmpVertex resolveDeadEnd(LearnerGraph coregraph,
                Collection<CmpVertex> reds,
                Collection<PairScore> pairs) {
              return null;
            }});
          if (!outcome.isEmpty())
          {
            if (listOfPairsToWrite != null)
            {
              //System.out.println("Optimized: "+useOptimizedMerge+", matrix: "+graph.config.getTransitionMatrixImplType()+", pair : "+outcome.peek());
              listOfPairsToWrite.add(new PairOfPaths(graph, outcome.peek()));
            }
           
            if(listOfPairsToCheckAgainstIterator != null)
            {
              PairOfPaths pair = listOfPairsToCheckAgainstIterator.next();
              //System.out.println("chosen "+outcome.peek()+", expected "+new PairScore(graph.getVertex(pair.getQ()),graph.getVertex(pair.getR()),0,0));
              pair.rebuildStack(graph, outcome);
            }
          }
         
          return outcome;
        }
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.