Examples of DeterministicVertex

statechum.DeterministicDirectedSparseGraph.DeterministicVertex

Examples of statechum.DeterministicDirectedSparseGraph.DeterministicVertex

  @Test
  public final void testVertexClone3()
  {
    Configuration conf = Configuration.getDefaultConfiguration();conf.setAllowedToCloneNonCmpVertex(false);
    conf.setLearnerUseStrings(false);conf.setLearnerCloneGraph(false);
    CmpVertex vA = new DeterministicVertex("test vertex");vA.setColour(JUConstants.RED);
    Assert.assertSame(vA, LearnerGraph.cloneCmpVertex(vA, conf));
  }

View Full Code Here

Examples of statechum.DeterministicDirectedSparseGraph.DeterministicVertex

  @Test
  public final void testVertexClone4()
  {
    Configuration conf = Configuration.getDefaultConfiguration();conf.setAllowedToCloneNonCmpVertex(false);
    conf.setLearnerUseStrings(true);conf.setLearnerCloneGraph(false);
    CmpVertex vA = new DeterministicVertex("test vertex");vA.setColour(JUConstants.RED);
    Assert.assertSame(vA, LearnerGraph.cloneCmpVertex(vA, conf));
  }

View Full Code Here

Examples of statechum.DeterministicDirectedSparseGraph.DeterministicVertex

  }


  @Test
  public void testDeterministicVertexComparison1()
  {
    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

Examples of statechum.DeterministicDirectedSparseGraph.DeterministicVertex

  }
    
  @Test
  public void testDeterministicVertexComparison2()
  {
    DeterministicVertex p = new DeterministicVertex(), q= new DeterministicVertex();
    p.addUserDatum(JUConstants.LABEL, "A", UserData.SHARED);
    q.addUserDatum(JUConstants.LABEL, "B", UserData.SHARED);
    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

Examples of statechum.DeterministicDirectedSparseGraph.DeterministicVertex

  }


  @Test
  public void testDeterministicVertexComparison3()
  {
    DeterministicVertex p = new DeterministicVertex("P"), q= new DeterministicVertex("P");
    assertFalse(p.equals(q));
    assertTrue(p.compareTo(q)==0);
  }

View Full Code Here

Examples of statechum.DeterministicDirectedSparseGraph.DeterministicVertex

  }


  @Test
  public void testDeterministicVertexComparison1()
  {
    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

Examples of statechum.DeterministicDirectedSparseGraph.DeterministicVertex

  }
    
  @Test
  public void testDeterministicVertexComparison2()
  {
    DeterministicVertex p = new DeterministicVertex(), q= new DeterministicVertex();
    p.addUserDatum(JUConstants.LABEL, "A", UserData.SHARED);
    q.addUserDatum(JUConstants.LABEL, "B", UserData.SHARED);
    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

Examples of statechum.DeterministicDirectedSparseGraph.DeterministicVertex

  }


  @Test
  public void testDeterministicVertexComparison3()
  {
    DeterministicVertex p = new DeterministicVertex("P"), q= new DeterministicVertex("P");
    assertFalse(p.equals(q));
    assertTrue(p.compareTo(q)==0);
  }

View Full Code Here

Examples of statechum.DeterministicDirectedSparseGraph.DeterministicVertex

      Map<CmpVertex,DeterministicVertex> oldToNew = new HashMapWithSearch<CmpVertex,DeterministicVertex>(coregraph.getStateNumber());
      // add states
      for(Entry<CmpVertex,Map<CmpVertex,Set<Label>>> entry:coregraph.learnerCache.getFlowgraph().entrySet())
      {
        CmpVertex source = entry.getKey();
        DeterministicVertex vert = (DeterministicVertex)AbstractLearnerGraph.cloneCmpVertex(source,cloneConfig);
        if (coregraph.getInit() == source)
          vert.addUserDatum(JUConstants.INITIAL, true, UserData.SHARED);
        result.addVertex(vert);
        oldToNew.put(source,vert);
      }
      
      // now add transitions
      for(Entry<CmpVertex,Map<CmpVertex,Set<Label>>> entry:coregraph.learnerCache.getFlowgraph().entrySet())
      {
        DeterministicVertex source = oldToNew.get(entry.getKey());
        for(Entry<CmpVertex,Set<Label>> tgtEntry:entry.getValue().entrySet())
        {
          CmpVertex targetOld = tgtEntry.getKey();
          assert coregraph.findVertex(targetOld) == targetOld : "was looking for vertex with name "+targetOld+", got "+coregraph.findVertex(targetOld);
          DeterministicVertex target = oldToNew.get(targetOld);
          DeterministicEdge e = new DeterministicEdge(source,target);
          e.addUserDatum(JUConstants.LABEL, tgtEntry.getValue(), UserData.CLONE);
          result.addEdge(e);
        }
      }

View Full Code Here

Examples of statechum.DeterministicDirectedSparseGraph.DeterministicVertex

  {
    synchronized(syncObj)
    {
      return conf.isLearnerUseStrings()? 
          new StringVertex(name):
          new DeterministicVertex(name);      
    }    
  }

View Full Code Here

0 1 2 3 4 5

TOP

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.