Examples of edu.stanford.nlp.trees.Tree.indexOf()

edu.stanford.nlp.trees.Tree.indexOf()
Returns the position of a Tree in the children list, if present, or -1 if it is not present. Trees are checked for presence with equals(). @param tree The tree to look for in children list @return Its index in the list or -1

    AuxiliaryTree ft = adjunctionTree.copy(this);
    ft.foot.setChildren(targetNode.getChildrenAsList());
    if (parent==null) {
      return ft.tree;
    } else {
      int i = parent.indexOf(targetNode);
      parent.setChild(i,ft.tree);
      return t;
    }
  }

View Full Code Here

        private void initializeHelper(Stack<Tree> stack, Tree node, Tree root) {
          if (node==root) {
            return;
          }
          Tree parent = node.parent(root);
          int i = parent.indexOf(node);
          while (i == parent.children().length-1 && parent != root) {
            node = parent;
            parent = parent.parent(root);
            i = parent.indexOf(node);
          }

View Full Code Here

          Tree parent = node.parent(root);
          int i = parent.indexOf(node);
          while (i == parent.children().length-1 && parent != root) {
            node = parent;
            parent = parent.parent(root);
            i = parent.indexOf(node);
          }
          Tree followingNode;
          if (i+1 < parent.children().length) {
            followingNode = parent.children()[i+1];
          } else {

View Full Code Here

        private void initializeHelper(Stack<Tree> stack, Tree node, Tree root) {
          if (node==root) {
            return;
          }
          Tree parent = node.parent(root);
          int i = parent.indexOf(node);
          while (i == 0 && parent != root) {
            node = parent;
            parent = parent.parent(root);
            i = parent.indexOf(node);
          }

View Full Code Here

          Tree parent = node.parent(root);
          int i = parent.indexOf(node);
          while (i == 0 && parent != root) {
            node = parent;
            parent = parent.parent(root);
            i = parent.indexOf(node);
          }
          Tree precedingNode;
          if (i > 0) {
            precedingNode = parent.children()[i-1];
          } else {

View Full Code Here

  private static Tree findFootNode(Tree t) {
    Tree footNode = findFootNodeHelper(t);
    Tree result = footNode;
    if (footNode != null) {
      Tree parent = footNode.parent(t);
      int i = parent.indexOf(footNode);
      Tree newFootNode = footNode.treeFactory().newTreeNode(footNode.label(), new ArrayList<Tree>());
      parent.setChild(i, newFootNode);
      result = newFootNode;
    }
    return result;

View Full Code Here

    Tree parentOfFoot = ft.foot.parent(ft.tree);
    if(parentOfFoot == null) {
      System.err.println("Warning: adjoin to foot for depth-1 auxiliary tree has no effect.");
      return t;
    }
    int i = parentOfFoot.indexOf(ft.foot);
    if(parent==null) {
      parentOfFoot.setChild(i,targetNode);
      return ft.tree;
    }
    else {

View Full Code Here

    Tree oldNode = children[0].evaluate(t,m);
    Tree newNode = children[1].evaluate(t,m);
    if(oldNode==t)
      return newNode;
    Tree parent = oldNode.parent(t);
    int i = parent.indexOf(oldNode);
    parent.removeChild(i);
    parent.insertDtr(newNode,i);
    return t;
  }
}

View Full Code Here

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.