final int left= Arrays.binarySearch(fRefactoringStamps, start); if (left >= 0) range[0]= left; else range[0]= Math.max(0, -left - 1); final int right= Arrays.binarySearch(fRefactoringStamps, end); if (right >= 0) range[1]= right; else range[1]= -right - 2; final int temp= fRefactoringStamps.length - range[1] - 1; range[1]= fRefactoringStamps.length - range[0] - 1; range[0]= temp;
range[1]= binarySearch(fRefactoringStamps, start) - 1; range[0]= binarySearch(fRefactoringStamps, end);
	private int[] getRefactoringHistoryRange(final long start, final long end) {		Assert.isTrue(start >= 0);		Assert.isTrue(end >= start);		getRefactoringHistoryDescriptors();		final int[] range= new int[2];		final int left= Arrays.binarySearch(fRefactoringStamps, start);		if (left >= 0)			range[0]= left;		else			range[0]= Math.max(0, -left - 1);		final int right= Arrays.binarySearch(fRefactoringStamps, end);		if (right >= 0)			range[1]= right;		else			range[1]= -right - 2;		final int temp= fRefactoringStamps.length - range[1] - 1;		range[1]= fRefactoringStamps.length - range[0] - 1;		range[0]= temp;		return range;	}