protected int binarySearch(String[] array, String str) {
		// No longer a binary search because we don't want the list to be sorted as this distrubs the priority
		for (int i = 0; i < array.length; i++) {
			if(array[i].equals(str)) {
				return i;
			}
		}
		return -1;
	}
protected int binarySearch(String[] array, String str) {
		
		for (int i = 0; i < array.length; i++) {
			if(array[i].equals(str)) {
				return i;
			}
		}
		return -1;
	}
protected int binarySearch ( String [ ] array , String str ) { // No longer a binary search because we don't want the list to be sorted as this distrubs the priority for ( int i = 0 ; i < array . length ; i ++ ) { if ( array [ i ] . equals ( str ) ) { return i ; } } return - 1 ; }
So we can mock
So we can mock