mirror of
https://github.com/eclipse-cdt/cdt
synced 2025-07-17 14:05:23 +02:00
Bug 411605: Fix for regression in resource lookup.
This commit is contained in:
parent
b131e456e4
commit
d7faff7538
1 changed files with 10 additions and 7 deletions
|
@ -115,22 +115,25 @@ public class ResourceLookup {
|
|||
* reaching the next for-loop - that loop is expensive as it might cause the loading of unnecessary
|
||||
* project-descriptions.
|
||||
*/
|
||||
if(preferredProject != null) {
|
||||
for (int i = 0; i < files.length; i++) {
|
||||
IFile file = files[i];
|
||||
if (file.getProject().equals(preferredProject) && file.isAccessible() &&
|
||||
(best == null || best.getFullPath().toString().compareTo(file.getFullPath().toString()) > 0)) {
|
||||
if (preferredProject != null) {
|
||||
for (IFile file : files) {
|
||||
if (file.getProject().equals(preferredProject) && file.isAccessible()) {
|
||||
if (best != null) {
|
||||
// At least two accessible files in preferred project.
|
||||
best = null;
|
||||
break;
|
||||
}
|
||||
best= file;
|
||||
}
|
||||
}
|
||||
}
|
||||
// One accessible file in preferred project.
|
||||
if(best != null)
|
||||
return best;
|
||||
|
||||
int bestRelevance= -1;
|
||||
|
||||
for (int i = 0; i < files.length; i++) {
|
||||
IFile file = files[i];
|
||||
for (IFile file : files) {
|
||||
int relevance= FileRelevance.getRelevance(file, preferredProject);
|
||||
if (best == null || relevance > bestRelevance ||
|
||||
(relevance == bestRelevance &&
|
||||
|
|
Loading…
Add table
Reference in a new issue