protected TypeNameMatch[] getSearchResult(Set filteredHistory, ProgressMonitor monitor) throws CoreException { List result= new ArrayList(2048); for (int i= 0; i < fLastResult.length; i++) { TypeNameMatch type= fLastResult[i]; if (filteredHistory.contains(type)) continue; if (fFilter.matchesCachedResult(type)) result.add(type); } // we have to sort if the filter is a camel case filter. TypeNameMatch[] types= (TypeNameMatch[])result.toArray(new TypeNameMatch[result.size()]); if (fFilter.isCamelCasePattern()) { Arrays.sort(types, new TypeInfoComparator(fLabelProvider, fFilter)); } return types; } }
@Override protected TypeNameMatch[] getSearchResult(Set filteredHistory, ProgressMonitor monitor) throws CoreException { List result= new ArrayList(2048); for (int i= 0; i < fLastResult.length; i++) { TypeNameMatch type= fLastResult[i]; if (filteredHistory.contains(type)) continue; if (fFilter.matchesCachedResult(type)) result.add(type); } // we have to sort if the filter is a camel case filter. TypeNameMatch[] types= (TypeNameMatch[])result.toArray(new TypeNameMatch[result.size()]); if (fFilter.isCamelCasePattern()) { Arrays.sort(types, new TypeInfoComparator(fLabelProvider, fFilter)); } return types; } }
protected TypeNameMatch[] getSearchResult(Set filteredHistory, ProgressMonitor monitor) throws CoreException { List result= new ArrayList(2048); for (int i= 0; i < fLastResult.length; i++) { TypeNameMatch type= fLastResult[i]; if (filteredHistory.contains(type)) continue; if (fFilter.matchesCachedResult(type)) result.add(type); } // we have to sort if the filter is a camel case filter. TypeNameMatch[] types= (TypeNameMatch[])result.toArray(new TypeNameMatch[result.size()]); if (fFilter.isCamelCasePattern()) { Arrays.sort(types, new TypeInfoComparator(fLabelProvider, fFilter)); } return types; } }
@Override protected TypeNameMatch[] getSearchResult(Set filteredHistory, ProgressMonitor monitor) throws CoreException { List result= new ArrayList(2048); for (int i= 0; i < fLastResult.length; i++) { TypeNameMatch type= fLastResult[i]; if (filteredHistory.contains(type)) continue; if (fFilter.matchesCachedResult(type)) result.add(type); } // we have to sort if the filter is a camel case filter. TypeNameMatch[] types= (TypeNameMatch[])result.toArray(new TypeNameMatch[result.size()]); if (fFilter.isCamelCasePattern()) { Arrays.sort(types, new TypeInfoComparator(fLabelProvider, fFilter)); } return types; } }