Examples of SimpleTree

ca.odell.glazedlists.impl.adt.barcode2.SimpleTree

Our second generation tree class.

Currently the API for this class is fairly low-level, particularly the use of bytes as color values. This is an implementation detail, exposed to maximize performance. Wherever necessary, consider creating a facade around this Tree class that provides methods more appropriate for your particular application.

This is a prototype replacement for the Barcode class that adds support for up to seven different colors. As well, this supports values in the node. It will hopefully also replace our IndexedTree class. This class is designed after those two classes and hopefully improves upon them in a few interesting ways:

Avoid recursion wherever possible to increase performance

Be generic to simplify handling of black/white values. These can be handled in one case rather than one case for each.

Make the node class a dataholder only and put most of the logic in the tree class. This allows us to share different Node classes with different memory requirements, while using the same logic class

This class came into being so we could use a tree to replace ListEventBlocks, which has only mediocre performance, particularly due to having to sort elements. As well, we might be able to keep a moved value in the tree, to support moved elements in ListEvents. @author Jesse Wilson

   * 
   * It uses the method getSurroundingTree in a somewhat clever way to do the additional annotation
   * on the output string instead of the tree object.
   */
  public static SimpleTree getSurroundingTreeWithAnnotation(TreebankNode node, String string) {
    SimpleTree inner = getSimpleClone(node);
    SimpleTree outer = getSurroundingTree(node);
    
    String innerString = inner.toString();
    String outerString = outer.toString();
    
    String fullString = outerString.replace(innerString, "(" + string + " " + innerString + ")");
    return SimpleTree.fromString(fullString);    
  }

   * @return labelled graph that is a tree
   */
  public SimpleTree generateRandomTree(int numOfNodes,
      int approxNumberOfChildren) {


    SimpleTree tree = new SimpleTree(numOfNodes);
    tree.turnTreeCheckOff();


    int actualNodeNum = 1;
    double randomNumber = 0.0;


    ArrayList<Integer> nodesOnLevel = new ArrayList<>();
    nodesOnLevel.add(0);


    while (actualNodeNum < numOfNodes && nodesOnLevel.size() > 0) {


      ArrayList<Integer> oldLevel = nodesOnLevel;
      nodesOnLevel = new ArrayList<>();
      int randomParent =
          ((Double) (Math.floor(rand.nextDouble() * (oldLevel.size()))))
              .intValue();
      addEdge(tree, actualNodeNum, oldLevel.get(randomParent));
      nodesOnLevel.add(actualNodeNum);
      actualNodeNum++;
      AbstractNormalDistribution normDist =
          new NormalDistribution(rand, 0., 1.);


      for (int i : oldLevel) {


        randomNumber =
            approxNumberOfChildren + 0.25 * approxNumberOfChildren
                * normDist.getRandomNumber();


        while (randomNumber > 0.5 && actualNodeNum < numOfNodes) {
          addEdge(tree, actualNodeNum, i);
          nodesOnLevel.add(actualNodeNum);
          actualNodeNum++;
          randomNumber--;
        }
      }


    }


    for (int i = 0; i < numOfNodes; i++) {
      tree.setLabel(i, rand.nextDouble() * 10);
    }


    if (!tree.turnTreeCheckOn()) {
      throw new IllegalStateException("Problem with random tree creation");
    }


    tree.setTreeRoot(0);


    return tree;
  }

Examples of SimpleTree

Examples of org.apache.ctakes.utils.tree.SimpleTree

Examples of org.jamesii.core.util.graph.trees.SimpleTree