alvinalexander.com | career | drupal | java | mac | mysql | perl | scala | uml | unix  

What this is

This file is included in the DevDaily.com "Java Source Code Warehouse" project. The intent of this project is to help you "Learn Java by Example" TM.

Other links

The source code

/*
 *                 Sun Public License Notice
 * 
 * The contents of this file are subject to the Sun Public License
 * Version 1.0 (the "License"). You may not use this file except in
 * compliance with the License. A copy of the License is available at
 * http://www.sun.com/
 * 
 * The Original Code is NetBeans. The Initial Developer of the Original
 * Code is Sun Microsystems, Inc. Portions Copyright 1997-2002 Sun
 * Microsystems, Inc. All Rights Reserved.
 */
/*
 * ASTree.java
 *
 * Created on February 4, 2002, 3:05 PM
 */

package org.netbeans.lib.java.parser;

/**
 *
 * @author  Tomas Hurka
 */
class ASTreeNode extends ASTClass implements ASTreeTypes {
    
    private int firstToken,lastToken;    
    ASTree subTrees[];   
        
    ASTreeNode(ASTContext context,int type, ASTree first, ASTree last, ASTree[] sub) {
        super(context,type);
        firstToken=first.getFirstToken();
        lastToken=last.getLastToken();
        subTrees=sub;
    }

    ASTreeNode(ASTContext context,int type, ASTree first, ASTree last, ASTree sub) {
        this(context,type,first,last,new ASTree[]{sub});
    }
        
    ASTreeNode(ASTContext context,int type, ASTree token) {
        super(context,type);
        subTrees=new ASTree[]{token};
        firstToken=token.getFirstToken();
        lastToken=token.getLastToken();
    }

    ASTreeNode(ASTContext context,int type, ASTree[] sub) {
        super(context,type);
        subTrees=sub;
        computeBounds();
    }
    
    ASTreeNode(ASTContext context,int type, ASTree leftAST, ASTree rightAST) {
        super(context,type);
        subTrees=new ASTree[]{leftAST,rightAST};
        computeBounds();
    }

    private void computeBounds() {
        int i,j;
        
        for (i=0;i=i;j--) {
            if (subTrees[j]!=null) {
                lastToken=subTrees[j].getLastToken();
                break;
            }
        }
    }

    final ASTClass setLastToken(ASTree token) {
        lastToken = token.getLastToken();
        return this;
    }   
    
    final ASTClass setLastToken(int tokenIndex) {
        lastToken = tokenIndex;
        return this;
    }

    /** Getter for property lastToken.
     * @return Value of property lastToken.
     */
    public final int getLastToken() {
        return lastToken;
    }
    
    final ASTClass setFirstToken(ASTree token) {
        firstToken = token.getFirstToken();
        return this;
    }
    
    final ASTClass setFirstToken(int tokenIndex) {
        firstToken = tokenIndex;
        return this;
    }

    public final int getFirstToken() {
        return firstToken;
    }
    
    final ASTClass addSubTree(ASTree sub) {
        if (subTrees!=null) {
            int size=subTrees.length;
            ASTree trees[]=new ASTree[size+1];

            System.arraycopy(subTrees,0,trees,0,size);
            trees[size]=sub;
            subTrees=trees;
        } else
            subTrees=new ASTree[]{sub};
        if (sub!=null)
            lastToken=sub.getLastToken();
        return this;
    }
  
    final ASTClass setFirstAndLastToken(ASTree first, ASTree last) {
        firstToken = first.getFirstToken();
        lastToken=last.getLastToken();
        return this;
    }
        
    public final String toString() {
        String text="ASTreeNode Type:"+getType()+"\n{\n";
        int i;
        
        if (subTrees!=null) {
            for (i=0;i
... this post is sponsored by my books ...

#1 New Release!

FP Best Seller

 

new blog posts

 

Copyright 1998-2021 Alvin Alexander, alvinalexander.com
All Rights Reserved.

A percentage of advertising revenue from
pages under the /java/jwarehouse URI on this website is
paid back to open source projects.