Application: gvSIG desktop

//	/** THIS VERSION FAILURES IN SOME PARTICULAR SITUATIONS

//	 * This method should be used when is wanted distinguish small letters from capital letters during the search, and the comparation of items

//	 *   done according an algorithm we define.

//	 *   

//	 * And it's also necessary that the value returned by the <i>toString()</i> method of each item (supposing 

//	 *   they inherit from Object) would be the expected value user saw (that would be used to compare the items).

//	 *   

//	 * @param text java.lang.String

//	 * @param sortOrderedItems java.util.Vector

//	 * @param comp An Comparator object which implements the <i><b>compareTo()</b><i>  method.

//	 */

//	public synchronized static List doSearchConsideringCaseSensitive(String text, Vector sortOrderedItems, Comparator comp) {

//		int currentIteration = 0;

//		int size = sortOrderedItems.size();

//		int maxNumberOfIterations = (int) MathExtension.log2(size);

//		int lowIndex = 0;

//		int highIndex = sortOrderedItems.size() - 1;

//		int mIndx;

//

//

//		while ((lowIndex <= highIndex) && (currentIteration <= maxNumberOfIterations)) {

//			mIndx = ( lowIndex + highIndex ) / 2;

//

//			if ( sortOrderedItems.get( mIndx ).toString().startsWith( text ) ) {

//				lowIndex = highIndex = mIndx;

//				highIndex ++;

//

//				// Expand the rank to up

//				while ( ( highIndex < size ) && ( sortOrderedItems.get( highIndex ).toString().startsWith( text ) ) ) {

//					highIndex ++;

//				}

//

//				// Expand the rank to down

//				while ( ( (lowIndex - 1) > -1 ) && ( sortOrderedItems.get( (lowIndex - 1) ).toString().startsWith( text ) ) ) {

//					lowIndex --;

//				}

//

//				// It's possible that items with different case, should be between the same case, then this item will be added individually:

//				List list = new Vector(sortOrderedItems.subList(lowIndex, highIndex));

//				

//

//				// Expand to down

//				lowIndex --;

//				while ( ( lowIndex > -1 ) && ( sortOrderedItems.get( (lowIndex ) ).toString().toLowerCase().startsWith( text.toLowerCase() ) ) ) {

//					if (sortOrderedItems.get( lowIndex ).toString().startsWith( text )) {

//						list.add(0, sortOrderedItems.get( lowIndex ));

//					}

//					

//					lowIndex --;

//				}

//				

//				// Expand to up

//				while ( ( highIndex < size ) && ( sortOrderedItems.get( highIndex ).toString().toLowerCase().startsWith( text.toLowerCase() ) ) ) {

//					if (sortOrderedItems.get( highIndex ).toString().startsWith( text )) {						

//						list.add(list.size(), sortOrderedItems.get( highIndex ));

//					}

//					

//					highIndex ++;

//				}

//				

//				// Returns all items in the rank

//				return list; // Breaks the loop

//			}

//			else {

//				if ( comp.compare(sortOrderedItems.get( mIndx ), text ) > 0 ) {

//					highIndex = mIndx - 1;

//				}

//				else {

//					lowIndex = mIndx + 1;

//				}

//			}

//

//			currentIteration ++;

//		}

//

//		// If no item has been found -> return null

//		return null;

//	}

		List results_list = doSearchIgnoringCaseSensitive(text, sortOrderedItems, comp);

		if (results_list == null)

			return null;

		List results = new ArrayList();

		for (int i = 0; i < (results_list.size()); i++) {

			if (results_list.get(i).toString().startsWith(text)) {

				results.add(results_list.get(i));

		return results;