patch

Author: Will-ShaoHua

plugins/amazonq/codewhisperer/jetbrains-community/tst/software/aws/toolkits/jetbrains/services/codewhisperer/CodeWhispererUtilTest.kt

@@ -193,116 +193,3 @@ class CodeWhispererUtilTest {
         assertThat(getTelemetryOptOutPreference()).isEqualTo(OptOutPreference.OPTOUT)
     }
 }
-
-private val codeSample110Lines =
-    """public int runBinarySearchRecursively(int[] sortedArray, int key, int low, int high) {
-       |    int middle = low  + ((high - low) / 2);
-       |    
-       |    if (high < low) {
-       |        return -1;
-       |    }
-       |
-       |    if (key == sortedArray[middle]) {
-       |        return middle;
-       |    } else if (key < sortedArray[middle]) {
-       |        return runBinarySearchRecursively(sortedArray, key, low, middle - 1);
-       |    } else {
-       |        return runBinarySearchRecursively(sortedArray, key, middle + 1, high);
-       |    }
-       |}
-       |
-       |public int runBinarySearchIteratively(int[] sortedArray, int key, int low, int high) {
-       |    int index = Integer.MAX_VALUE;
-       |    
-       |    while (low <= high) {
-       |        int mid = low  + ((high - low) / 2);
-       |        if (sortedArray[mid] < key) {
-       |            low = mid + 1;
-       |        } else if (sortedArray[mid] > key) {
-       |            high = mid - 1;
-       |        } else if (sortedArray[mid] == key) {
-       |            index = mid;
-       |            break;
-       |        }
-       |     }
-       |    
-       |    return index;
-       |}
-       |
-       |public int runBinarySearchIteratively(int[] sortedArray, int key, int low, int high) {
-       |    int index = Integer.MAX_VALUE;
-       |
-       |    while (low <= high) {
-       |        int mid = low  + ((high - low) / 2);
-       |        if (sortedArray[mid] < key) {
-       |            low = mid + 1;
-       |        } else if (sortedArray[mid] > key) {
-       |            high = mid - 1;
-       |        } else if (sortedArray[mid] == key) {
-       |            index = mid;
-       |            break;
-       |        }
-       |     }
-       |
-       |    return index;
-       |}
-       |
-       |public void mergeSort(int[] array) {
-       |    if (array.length > 1) {
-       |        int[] left = Arrays.copyOfRange(array, 0, array.length / 2);
-       |        int[] right = Arrays.copyOfRange(array, array.length / 2, array.length);
-       |
-       |        mergeSort(left);
-       |        mergeSort(right);
-       |
-       |        int i = 0;
-       |        int j = 0;
-       |        int k = 0;
-       |
-       |        while (i < left.length && j < right.length) {
-       |            if (left[i] < right[j]) {
-       |                array[k++] = left[i++];
-       |            } else {
-       |                array[k++] = right[j++];
-       |            }
-       |        }
-       |
-       |        while (i < left.length) {
-       |            array[k++] = left[i++];
-       |        }
-       |
-       |        while (j < right.length) {
-       |            array[k++] = right[j++];
-       |        }
-       |    }
-       |}
-       |
-       |public void bubbleSort(int[] array) {
-       |    boolean isSorted = false;
-       |    int lastUnsorted = array.length - 1;
-       |    while (!isSorted) {
-       |        isSorted = true;
-       |        for (int i = 0; i < lastUnsorted; i++) {
-       |            if (array[i] > array[i + 1]) {
-       |                int temp = array[i];
-       |                array[i] = array[i + 1];
-       |                array[i + 1] = temp;
-       |                isSorted = false;
-       |            }
-       |        }
-       |        lastUnsorted--;
-       |    }
-       |}
-       |
-       |public void insertionSort(int[] array) {
-       |    for (int i = 1; i < array.length; i++) {
-       |        int current = array[i];
-       |        int j = i - 1;
-       |        while (j >= 0 && array[j] > current) {
-       |            array[j + 1] = array[j];
-       |            j--;
-       |        }
-       |        array[j + 1] = current;
-       |    }
-       |}
-    """.trimMargin()