1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
|
/*******************************************************************************
* Copyright (c) 2004, 2009 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.core.search.matching;
import org.eclipse.wst.jsdt.core.IFunction;
import org.eclipse.wst.jsdt.core.IJavaScriptElement;
import org.eclipse.wst.jsdt.core.IType;
import org.eclipse.wst.jsdt.core.search.SearchPattern;
import org.eclipse.wst.jsdt.internal.core.search.indexing.IIndexConstants;
public class JavaSearchPattern extends SearchPattern implements IIndexConstants {
/*
* Whether this pattern is case sensitive.
*/
boolean isCaseSensitive;
/*
* Whether this pattern is camel case.
*/
boolean isCamelCase;
/**
* One of following pattern value:
* <ul>
* <li>{@link #R_EXACT_MATCH}</li>
* <li>{@link #R_PREFIX_MATCH}</li>
* <li>{@link #R_PATTERN_MATCH}</li>
* <li>{@link #R_REGEXP_MATCH}</li>
* <li>{@link #R_CAMELCASE_MATCH}</li>
* </ul>
*/
int matchMode;
/**
* One of {@link #R_ERASURE_MATCH}, {@link #R_EQUIVALENT_MATCH}, {@link #R_FULL_MATCH}.
*/
int matchCompatibility;
/**
* Mask used on match rule for match mode.
*/
public static final int MATCH_MODE_MASK = R_EXACT_MATCH | R_PREFIX_MATCH | R_PATTERN_MATCH | R_REGEXP_MATCH;
/**
* Mask used on match rule for generic relevance.
*/
public static final int MATCH_COMPATIBILITY_MASK = R_EQUIVALENT_MATCH | R_FULL_MATCH;
// Signatures and arguments for parameterized types search
char[][] typeSignatures;
private char[][][] typeArguments;
private int flags = 0;
static final int HAS_TYPE_ARGUMENTS = 1;
protected JavaSearchPattern(int patternKind, int matchRule) {
super(matchRule);
((InternalSearchPattern)this).kind = patternKind;
// Use getMatchRule() instead of matchRule as super constructor may modify its value
// see bug https://bugs.eclipse.org/bugs/show_bug.cgi?id=81377
int rule = getMatchRule();
this.isCaseSensitive = (rule & R_CASE_SENSITIVE) != 0;
this.isCamelCase = (rule & R_CAMELCASE_MATCH) != 0;
this.matchCompatibility = rule & MATCH_COMPATIBILITY_MASK;
this.matchMode = rule & MATCH_MODE_MASK;
}
public SearchPattern getBlankPattern() {
return null;
}
int getMatchMode() {
return this.matchMode;
}
boolean isCamelCase() {
return this.isCamelCase;
}
boolean isCaseSensitive () {
return this.isCaseSensitive;
}
boolean isEquivalentMatch() {
return (this.matchCompatibility & R_EQUIVALENT_MATCH) != 0;
}
/*
* Extract method arguments using unique key for parameterized methods
* and type parameters for non-generic ones.
*/
char[][] extractMethodArguments(IFunction method) {
return null;
}
/**
* @return Returns the typeArguments.
*/
final char[][][] getTypeArguments() {
return typeArguments;
}
/**
* Returns whether the pattern has signatures or not.
* If pattern {@link #typeArguments} field, this field shows that it was built
* on a generic source type.
* @return true if {@link #typeSignatures} field is not null and has a length greater than 0.
*/
public final boolean hasSignatures() {
return this.typeSignatures != null && this.typeSignatures.length > 0;
}
/**
* Returns whether the pattern includes type arguments information or not.
* @return default is false
*/
public final boolean hasTypeArguments() {
return (this.flags & HAS_TYPE_ARGUMENTS) != 0;
}
/**
* Returns whether the pattern includes type parameters information or not.
* @return true if {@link #typeArguments} contains type parameters instead
* type arguments signatures.
*/
public final boolean hasTypeParameters() {
return !hasSignatures() && hasTypeArguments();
}
/**
* Return whether two suffixes are compatible.
*
* Note that obvious compatibility values as equals and {@link IIndexConstants#TYPE_SUFFIX}
* has to be tested by caller to avoid unnecessary method call...
*
* @param typeSuffix
* @param patternSuffix
* @return true if suffixes are compatible, false otherwise
*/
boolean matchDifferentTypeSuffixes(int typeSuffix, int patternSuffix) {
switch(typeSuffix) {
case CLASS_SUFFIX :
return false;
case INTERFACE_SUFFIX :
return false;
case ENUM_SUFFIX :
return false;
case ANNOTATION_TYPE_SUFFIX :
return false;
}
// Default behavior is to match suffixes
return true;
}
protected StringBuffer print(StringBuffer output) {
output.append(", "); //$NON-NLS-1$
if (hasTypeArguments() && hasSignatures()) {
output.append("signature:\""); //$NON-NLS-1$
output.append(this.typeSignatures[0]);
output.append("\", "); //$NON-NLS-1$
}
if (this.isCamelCase) {
output.append("camel case + "); //$NON-NLS-1$
}
switch(getMatchMode()) {
case R_EXACT_MATCH :
output.append("exact match,"); //$NON-NLS-1$
break;
case R_PREFIX_MATCH :
output.append("prefix match,"); //$NON-NLS-1$
break;
case R_PATTERN_MATCH :
output.append("pattern match,"); //$NON-NLS-1$
break;
case R_REGEXP_MATCH :
output.append("regexp match, "); //$NON-NLS-1$
break;
}
if (isCaseSensitive())
output.append(" case sensitive"); //$NON-NLS-1$
else
output.append(" case insensitive"); //$NON-NLS-1$
if ((this.matchCompatibility & R_EQUIVALENT_MATCH) != 0) {
output.append(", equivalent oronly"); //$NON-NLS-1$
}
return output;
}
/**
* @param typeArguments The typeArguments to set.
*/
final void setTypeArguments(char[][][] typeArguments) {
this.typeArguments = typeArguments;
// update flags
if (this.typeArguments != null) {
int length = this.typeArguments.length;
for (int i=0; i<length; i++) {
if (this.typeArguments[i] != null && this.typeArguments[i].length > 0) {
this.flags |= HAS_TYPE_ARGUMENTS;
break;
}
}
}
}
/*
* Extract and store type signatures and arguments using unique key for parameterized types
* and type parameters for non-generic ones
*/
void storeTypeSignaturesAndArguments(IType type) {
// Scan hierachy to store type arguments at each level
char[][][] typeParameters = new char[10][][];
int ptr = -1;
boolean hasParameters = false;
IJavaScriptElement parent = type;
while (parent != null && parent.getElementType() == IJavaScriptElement.TYPE) {
if (++ptr > typeParameters.length) {
System.arraycopy(typeParameters, 0, typeParameters = new char[typeParameters.length+10][][], 0, ptr);
}
parent = parent.getParent();
}
// Store type arguments if any
if (hasParameters) {
if (++ptr < typeParameters.length)
System.arraycopy(typeParameters, 0, typeParameters = new char[ptr][][], 0, ptr);
setTypeArguments(typeParameters);
}
}
public final String toString() {
return print(new StringBuffer(30)).toString();
}
}
|
