if (currMatchLen == newName.length() && currMatchLen == currName.length()) {
if (currMatchLen == newName.length() && currMatchLen == currName.length() && currMatchLen == bestName.length()) {
	private PackageEntry findBestMatch(String newName) {		int bestMatchLen= -1;		PackageEntry bestMatch= null;		String bestName= ""; //$NON-NLS-1$				for (int i= 0; i < fPackageEntries.size(); i++) {			boolean isBetterMatch;						PackageEntry curr= (PackageEntry) fPackageEntries.get(i);			String currName= curr.getName();			int currMatchLen= getMatchLen(currName, newName);						if (currMatchLen > bestMatchLen) {				isBetterMatch= true;			} else if (currMatchLen == bestMatchLen) {						if (currMatchLen == newName.length() && currMatchLen == currName.length()) {					// dulicate entry and complete match					isBetterMatch= curr.getNumberOfImports() > bestMatch.getNumberOfImports();				} else {					isBetterMatch= sameMatchLenTest(newName, bestName, currName, currMatchLen);				}			} else {				isBetterMatch= false;			}						if (isBetterMatch) {				bestMatchLen= currMatchLen;				bestMatch= curr;				bestName= currName;			}		}		return bestMatch;	}