/*******************************************************************************
* 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.corext.refactoring;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Set;
import org.eclipse.core.resources.IResource;
import org.eclipse.core.runtime.CoreException;
import org.eclipse.core.runtime.IProgressMonitor;
import org.eclipse.ltk.core.refactoring.IRefactoringStatusEntryComparator;
import org.eclipse.ltk.core.refactoring.RefactoringStatus;
import org.eclipse.ltk.core.refactoring.RefactoringStatusEntry;
import org.eclipse.wst.jsdt.core.IJavaScriptUnit;
import org.eclipse.wst.jsdt.core.IJavaScriptElement;
import org.eclipse.wst.jsdt.core.JavaScriptCore;
import org.eclipse.wst.jsdt.core.JavaScriptModelException;
import org.eclipse.wst.jsdt.core.WorkingCopyOwner;
import org.eclipse.wst.jsdt.core.search.IJavaScriptSearchScope;
import org.eclipse.wst.jsdt.core.search.SearchEngine;
import org.eclipse.wst.jsdt.core.search.SearchMatch;
import org.eclipse.wst.jsdt.core.search.SearchPattern;
import org.eclipse.wst.jsdt.core.search.SearchRequestor;
import org.eclipse.wst.jsdt.internal.corext.util.SearchUtils;
/**
* Convenience wrapper for {@link SearchEngine} - performs searching and sorts the results by {@link IResource}.
* TODO: throw CoreExceptions from search(..) methods instead of wrapped JavaModelExceptions.
*/
public class RefactoringSearchEngine {
private RefactoringSearchEngine(){
//no instances
}
//TODO: throw CoreException
public static IJavaScriptUnit[] findAffectedCompilationUnits(SearchPattern pattern,
IJavaScriptSearchScope scope, final IProgressMonitor pm, RefactoringStatus status, final boolean tolerateInAccurateMatches) throws JavaScriptModelException {
boolean hasNonCuMatches= false;
class ResourceSearchRequestor extends SearchRequestor{
boolean hasPotentialMatches= false ;
Set resources= new HashSet(5);
private IResource fLastResource;
public void acceptSearchMatch(SearchMatch match) {
if (!tolerateInAccurateMatches && match.getAccuracy() == SearchMatch.A_INACCURATE) {
hasPotentialMatches= true;
}
if (fLastResource != match.getResource()) {
fLastResource= match.getResource();
resources.add(fLastResource);
}
}
}
ResourceSearchRequestor requestor = new ResourceSearchRequestor();
try {
new SearchEngine().search(pattern, SearchUtils.getDefaultSearchParticipants(), scope, requestor, pm);
} catch (CoreException e) {
throw new JavaScriptModelException(e);
}
List result= new ArrayList(requestor.resources.size());
for (Iterator iter= requestor.resources.iterator(); iter.hasNext(); ) {
IResource resource= (IResource) iter.next();
IJavaScriptElement element= JavaScriptCore.create(resource);
if (element instanceof IJavaScriptUnit) {
result.add(element);
} else {
hasNonCuMatches= true;
}
}
addStatusErrors(status, requestor.hasPotentialMatches, hasNonCuMatches);
return (IJavaScriptUnit[]) result.toArray(new IJavaScriptUnit[result.size()]);
}
//TODO: throw CoreException
public static IJavaScriptUnit[] findAffectedCompilationUnits(SearchPattern pattern,
IJavaScriptSearchScope scope, final IProgressMonitor pm, RefactoringStatus status) throws JavaScriptModelException {
return findAffectedCompilationUnits(pattern, scope, pm, status, false);
}
/**
* Performs a search and groups the resulting {@link SearchMatch}es by
* {@link SearchResultGroup#getCompilationUnit()}.
* @param pattern the search pattern
* @param scope the search scope
* @param monitor the progress monitor
* @param status an error is added here if inaccurate or non-cu matches have been found
* @return a {@link SearchResultGroup}[], where each {@link SearchResultGroup}
* has a different {@link SearchMatch#getResource() getResource()}s.
* @see SearchMatch
* @throws JavaScriptModelException when the search failed
*/
//TODO: throw CoreException
public static SearchResultGroup[] search(SearchPattern pattern, IJavaScriptSearchScope scope, IProgressMonitor monitor, RefactoringStatus status)
throws JavaScriptModelException {
return internalSearch(new SearchEngine(), pattern, scope, new CollectingSearchRequestor(), monitor, status);
}
//TODO: throw CoreException
public static SearchResultGroup[] search(SearchPattern pattern, WorkingCopyOwner owner, IJavaScriptSearchScope scope, IProgressMonitor monitor, RefactoringStatus status)
throws JavaScriptModelException {
return internalSearch(owner != null ? new SearchEngine(owner) : new SearchEngine(), pattern, scope, new CollectingSearchRequestor(), monitor, status);
}
//TODO: throw CoreException
public static SearchResultGroup[] search(SearchPattern pattern, IJavaScriptSearchScope scope, CollectingSearchRequestor requestor,
IProgressMonitor monitor, RefactoringStatus status) throws JavaScriptModelException {
return internalSearch(new SearchEngine(), pattern, scope, requestor, monitor, status);
}
//TODO: throw CoreException
public static SearchResultGroup[] search(SearchPattern pattern, WorkingCopyOwner owner, IJavaScriptSearchScope scope,
CollectingSearchRequestor requestor, IProgressMonitor monitor, RefactoringStatus status) throws JavaScriptModelException {
return internalSearch(owner != null ? new SearchEngine(owner) : new SearchEngine(), pattern, scope, requestor, monitor, status);
}
//TODO: throw CoreException
private static SearchResultGroup[] internalSearch(SearchEngine searchEngine, SearchPattern pattern, IJavaScriptSearchScope scope,
CollectingSearchRequestor requestor, IProgressMonitor monitor, RefactoringStatus status) throws JavaScriptModelException {
try {
searchEngine.search(pattern, SearchUtils.getDefaultSearchParticipants(), scope, requestor, monitor);
} catch (CoreException e) {
throw new JavaScriptModelException(e);
}
return groupByCu(requestor.getResults(), status);
}
public static SearchResultGroup[] groupByCu(SearchMatch[] matches, RefactoringStatus status) {
return groupByCu(Arrays.asList(matches), status);
}
/**
* @param matchList a List of SearchMatch
* @param status the status to report errors.
* @return a SearchResultGroup[], grouped by SearchMatch#getResource()
*/
public static SearchResultGroup[] groupByCu(List matchList, RefactoringStatus status) {
Map/*<IResource, List<SearchMatch>>*/ grouped= new HashMap();
boolean hasPotentialMatches= false;
boolean hasNonCuMatches= false;
for (Iterator iter= matchList.iterator(); iter.hasNext();) {
SearchMatch searchMatch= (SearchMatch) iter.next();
if (searchMatch.getAccuracy() == SearchMatch.A_INACCURATE)
hasPotentialMatches= true;
if (! grouped.containsKey(searchMatch.getResource()))
grouped.put(searchMatch.getResource(), new ArrayList(1));
((List) grouped.get(searchMatch.getResource())).add(searchMatch);
}
for (Iterator iter= grouped.keySet().iterator(); iter.hasNext();) {
IResource resource= (IResource) iter.next();
IJavaScriptElement element= JavaScriptCore.create(resource);
if (! (element instanceof IJavaScriptUnit)) {
iter.remove();
hasNonCuMatches= true;
}
}
SearchResultGroup[] result= new SearchResultGroup[grouped.keySet().size()];
int i= 0;
for (Iterator iter= grouped.keySet().iterator(); iter.hasNext();) {
IResource resource= (IResource) iter.next();
List searchMatches= (List) grouped.get(resource);
SearchMatch[] matchArray= (SearchMatch[]) searchMatches.toArray(new SearchMatch[searchMatches.size()]);
result[i]= new SearchResultGroup(resource, matchArray);
i++;
}
addStatusErrors(status, hasPotentialMatches, hasNonCuMatches);
return result;
}
public static SearchPattern createOrPattern(IJavaScriptElement[] elements, int limitTo) {
if (elements == null || elements.length == 0)
return null;
Set set= new HashSet(Arrays.asList(elements));
Iterator iter= set.iterator();
IJavaScriptElement first= (IJavaScriptElement)iter.next();
SearchPattern pattern= SearchPattern.createPattern(first, limitTo, SearchUtils.GENERICS_AGNOSTIC_MATCH_RULE);
if (pattern == null) // check for bug 90138
throw new IllegalArgumentException("Invalid java element: " + first.getHandleIdentifier() + "\n" + first.toString()); //$NON-NLS-1$ //$NON-NLS-2$
while(iter.hasNext()){
IJavaScriptElement each= (IJavaScriptElement)iter.next();
SearchPattern nextPattern= SearchPattern.createPattern(each, limitTo, SearchUtils.GENERICS_AGNOSTIC_MATCH_RULE);
if (nextPattern == null) // check for bug 90138
throw new IllegalArgumentException("Invalid java element: " + each.getHandleIdentifier() + "\n" + each.toString()); //$NON-NLS-1$ //$NON-NLS-2$
pattern= SearchPattern.createOrPattern(pattern, nextPattern);
}
return pattern;
}
private static boolean containsStatusEntry(final RefactoringStatus status, final RefactoringStatusEntry other) {
return status.getEntries(new IRefactoringStatusEntryComparator() {
public final int compare(final RefactoringStatusEntry entry1, final RefactoringStatusEntry entry2) {
return entry1.getMessage().compareTo(entry2.getMessage());
}
}, other).length > 0;
}
private static void addStatusErrors(RefactoringStatus status, boolean hasPotentialMatches, boolean hasNonCuMatches) {
if (hasPotentialMatches) {
final RefactoringStatusEntry entry= new RefactoringStatusEntry(RefactoringStatus.ERROR, RefactoringCoreMessages.RefactoringSearchEngine_potential_matches);
if (!containsStatusEntry(status, entry))
status.addEntry(entry);
}
if (hasNonCuMatches) {
final RefactoringStatusEntry entry= new RefactoringStatusEntry(RefactoringStatus.ERROR, RefactoringCoreMessages.RefactoringSearchEngine_non_cu_matches);
if (!containsStatusEntry(status, entry))
status.addEntry(entry);
}
}
}