/*******************************************************************************
* Copyright (c) 2000, 2006 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.rubypeople.rdt.internal.core.search.matching;
import java.io.IOException;
import org.rubypeople.rdt.core.IMethod;
import org.rubypeople.rdt.core.search.SearchPattern;
import org.rubypeople.rdt.internal.core.index.EntryResult;
import org.rubypeople.rdt.internal.core.index.Index;
import org.rubypeople.rdt.internal.core.search.indexing.IIndexConstants;
import org.rubypeople.rdt.internal.core.util.CharOperation;
public class ConstructorPattern extends RubySearchPattern implements IIndexConstants {
protected boolean findDeclarations;
protected boolean findReferences;
public char[] declaringQualification;
public char[] declaringSimpleName;
public char[][] parameterNames;
public int parameterCount;
public boolean varargs = false;
boolean constructorParameters = false;
protected static char[][] REF_CATEGORIES = { CONSTRUCTOR_REF };
protected static char[][] REF_AND_DECL_CATEGORIES = { CONSTRUCTOR_REF, CONSTRUCTOR_DECL };
protected static char[][] DECL_CATEGORIES = { CONSTRUCTOR_DECL };
/**
* Constructor entries are encoded as TypeName '/' Arity:
* e.g. 'X/0'
*/
public static char[] createIndexKey(char[] typeName, int argCount) {
char[] countChars = argCount < 10
? COUNTS[argCount]
: ("/" + String.valueOf(argCount)).toCharArray(); //$NON-NLS-1$
return CharOperation.concat(typeName, countChars);
}
ConstructorPattern(int matchRule) {
super(CONSTRUCTOR_PATTERN, matchRule);
}
public ConstructorPattern(
boolean findDeclarations,
boolean findReferences,
char[] declaringSimpleName,
char[] declaringQualification,
char[][] parameterNames,
int matchRule) {
this(matchRule);
this.findDeclarations = findDeclarations;
this.findReferences = findReferences;
this.declaringQualification = isCaseSensitive() ? declaringQualification : CharOperation.toLowerCase(declaringQualification);
this.declaringSimpleName = (isCaseSensitive() || isCamelCase()) ? declaringSimpleName : CharOperation.toLowerCase(declaringSimpleName);
if (parameterNames != null) {
this.parameterCount = parameterNames.length;
int offset = 0;
this.parameterNames = new char[this.parameterCount][];
for (int i = 0; i < this.parameterCount; i++) {
this.parameterNames[i] = isCaseSensitive() ? parameterNames[i+offset] : CharOperation.toLowerCase(parameterNames[i+offset]);
}
} else {
this.parameterCount = -1;
}
((InternalSearchPattern)this).mustResolve = mustResolve();
}
/*
* Instanciate a method pattern with signatures for generics search
*/
public ConstructorPattern(
boolean findDeclarations,
boolean findReferences,
char[] declaringSimpleName,
char[] declaringQualification,
char[][] parameterNames,
IMethod method,
// boolean varargs,
int matchRule) {
this(findDeclarations,
findReferences,
declaringSimpleName,
declaringQualification,
parameterNames,
matchRule);
this.varargs = true; // XXX We need to know whetehr there are optional arguments!
}
public void decodeIndexKey(char[] key) {
int last = key.length - 1;
this.parameterCount = 0;
this.declaringSimpleName = null;
int power = 1;
for (int i=last; i>=0; i--) {
if (key[i] == SEPARATOR) {
System.arraycopy(key, 0, this.declaringSimpleName = new char[i], 0, i);
break;
}
if (i == last) {
this.parameterCount = key[i] - '0';
} else {
power *= 10;
this.parameterCount += power * (key[i] - '0');
}
}
}
public SearchPattern getBlankPattern() {
return new ConstructorPattern(R_EXACT_MATCH | R_CASE_SENSITIVE);
}
public char[][] getIndexCategories() {
if (this.findReferences)
return this.findDeclarations ? REF_AND_DECL_CATEGORIES : REF_CATEGORIES;
if (this.findDeclarations)
return DECL_CATEGORIES;
return CharOperation.NO_CHAR_CHAR;
}
boolean hasConstructorParameters() {
return constructorParameters;
}
public boolean matchesDecodedKey(SearchPattern decodedPattern) {
ConstructorPattern pattern = (ConstructorPattern) decodedPattern;
return (this.parameterCount == pattern.parameterCount || this.parameterCount == -1 || this.varargs)
&& matchesName(this.declaringSimpleName, pattern.declaringSimpleName);
}
protected boolean mustResolve() {
if (this.declaringQualification != null) return true;
return this.findReferences; // need to check resolved default constructors and explicit constructor calls
}
EntryResult[] queryIn(Index index) throws IOException {
char[] key = this.declaringSimpleName; // can be null
int matchRule = getMatchRule();
switch(getMatchMode()) {
case R_EXACT_MATCH :
if (this.isCamelCase) break;
if (this.declaringSimpleName != null && this.parameterCount >= 0 && !this.varargs)
key = createIndexKey(this.declaringSimpleName, this.parameterCount);
else { // do a prefix query with the declaringSimpleName
matchRule &= ~R_EXACT_MATCH;
matchRule |= R_PREFIX_MATCH;
}
break;
case R_PREFIX_MATCH :
// do a prefix query with the declaringSimpleName
break;
case R_PATTERN_MATCH :
if (this.parameterCount >= 0 && !this.varargs)
key = createIndexKey(this.declaringSimpleName == null ? ONE_STAR : this.declaringSimpleName, this.parameterCount);
else if (this.declaringSimpleName != null && this.declaringSimpleName[this.declaringSimpleName.length - 1] != '*')
key = CharOperation.concat(this.declaringSimpleName, ONE_STAR, SEPARATOR);
// else do a pattern query with just the declaringSimpleName
break;
case R_REGEXP_MATCH :
// TODO (frederic) implement regular expression match
break;
}
return index.query(getIndexCategories(), key, matchRule); // match rule is irrelevant when the key is null
}
protected StringBuffer print(StringBuffer output) {
if (this.findDeclarations) {
output.append(this.findReferences
? "ConstructorCombinedPattern: " //$NON-NLS-1$
: "ConstructorDeclarationPattern: "); //$NON-NLS-1$
} else {
output.append("ConstructorReferencePattern: "); //$NON-NLS-1$
}
if (declaringQualification != null)
output.append(declaringQualification).append('.');
if (declaringSimpleName != null)
output.append(declaringSimpleName);
else if (declaringQualification != null)
output.append("*"); //$NON-NLS-1$
output.append('(');
if (parameterNames == null) {
output.append("..."); //$NON-NLS-1$
} else {
for (int i = 0, max = parameterNames.length; i < max; i++) {
if (i > 0) output.append(", "); //$NON-NLS-1$
if (parameterNames[i] == null) output.append('*'); else output.append(parameterNames[i]);
}
}
output.append(')');
return super.print(output);
}
}