ImportReference.java

/*******************************************************************************
 * Copyright (c) 2000, 2008 IBM Corporation and others.
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License v1.0
 * which accompanies this distribution, and is available at
 * http://www.eclipse.org/legal/epl-v10.html
 *
 * Contributors:
 *     IBM Corporation - initial API and implementation
 *******************************************************************************/
package org.eclipse.wst.jsdt.internal.compiler.ast;

import org.eclipse.wst.jsdt.core.ast.IImportReference;
import org.eclipse.wst.jsdt.core.compiler.CharOperation;
import org.eclipse.wst.jsdt.internal.compiler.ASTVisitor;
import org.eclipse.wst.jsdt.internal.compiler.lookup.CompilationUnitScope;

public class ImportReference extends ASTNode implements IImportReference {

	public char[][] tokens;
	public long[] sourcePositions; //each entry is using the code : (start<<32) + end
	public int declarationEnd; // doesn't include an potential trailing comment
	public int declarationSourceStart;
	public int declarationSourceEnd;

	public ImportReference(
			char[][] tokens, long[] sourcePositions, boolean onDemand) {

		this.tokens = tokens;
		this.sourcePositions = sourcePositions;
		if (onDemand) {
			this.bits |= ASTNode.OnDemand;
		}
		
		this.sourceEnd = (int) (sourcePositions[sourcePositions.length-1] & 0x00000000FFFFFFFF);
		this.sourceStart = (int) (sourcePositions[0] >>> 32);
	}

	public ImportReference(		// for internal imports
			char[] name, int startPosition, int endPosition, int nameStartPosition) {

		this.tokens = CharOperation.splitOn('.', name);
		this.sourcePositions = new long[tokens.length];
		for (int i = 0; i < tokens.length; i++) {
			this.sourcePositions[i] =
				(((long) nameStartPosition) << 32) + (nameStartPosition+tokens[i].length - 1);
			nameStartPosition+=tokens[i].length + 1;
		}
		this.bits |= ASTNode.IsFileImport;
		this.bits |= ASTNode.OnDemand;
		this.declarationSourceStart=this.sourceStart = startPosition;
		this.declarationSourceEnd=this.declarationEnd=this.sourceEnd = endPosition;
	}

	/**
	 * @return char[][]
	 */
	public char[][] getImportName() {
		return tokens;
	}

	public StringBuffer print(int indent, StringBuffer output) {
		return print(indent, output, true);
	}

	public StringBuffer print(int tab, StringBuffer output, boolean withOnDemand) {

		/* when withOnDemand is false, only the name is printed */
		for (int i = 0; i < tokens.length; i++) {
			if (i > 0) output.append('.');
			output.append(tokens[i]);
		}
		if (withOnDemand && ((this.bits & ASTNode.OnDemand) != 0)) {
			output.append(".*"); //$NON-NLS-1$
		}
		return output;
	}

	/**
	 * Traverse the node
	 * @param visitor
	 * @param scope
	 */
	public void traverse(ASTVisitor visitor, CompilationUnitScope scope) {
		visitor.visit(this, scope);
		visitor.endVisit(this, scope);
	}
	
	/**
	 * Returns true if this is an internal import.
	 * @return true if an internal import.
	 */
	public boolean isInternal() {
	  return (this.bits & ASTNode.IsFileImport) != 0;
	}
	
	/**
	 * Returns true if this is a file import.
	 * @return true if a file import.
	 */
	public boolean isFileImport() {
	  return (this.bits & ASTNode.IsFileImport) != 0;
	}

}