IDEA-253512: Fixes after review

GitOrigin-RevId: 0c9d42259d6a5169c449b536aa4e7b982446b10a

java/java-tests/testData/codeInsight/daemonCodeAnalyzer/quickFix/slowAbstractSetRemoveAll/afterCollection.java

@@ -0,0 +1,11 @@
+// "Replace with 'getRemovals().forEach(source::remove)'" "true"
+
+import java.util.*;
+
+class Test {
+  native List<String> getRemovals();
+
+  void foo(Set<Integer> source) {
+    getRemovals().forEach(source::remove);
+  }
+}

java/java-tests/testData/codeInsight/daemonCodeAnalyzer/quickFix/slowAbstractSetRemoveAll/afterNonTrivialArg.java

@@ -0,0 +1,9 @@
+// "Replace with '(flag ? removals1 : removals2).forEach(source::remove)'" "true"
+
+import java.util.*;
+
+class Test {
+  void foo(Set<Integer> source, List<Integer> removals1, List<Integer> removals2, boolean flag) {
+    (flag ? removals1 : removals2).forEach(source::remove);
+  }
+}

java/java-tests/testData/codeInsight/daemonCodeAnalyzer/quickFix/slowAbstractSetRemoveAll/beforeArrayList.java

@@ -4,6 +4,6 @@ import java.util.*;
 
 class Test {
   void foo(Set<Integer> source, ArrayList<Integer> removals) {
-    source.removeAll(removals)<caret>;
+    source.removeAll<caret>(removals);
   }
 }

java/java-tests/testData/codeInsight/daemonCodeAnalyzer/quickFix/slowAbstractSetRemoveAll/beforeCollection.java

@@ -0,0 +1,11 @@
+// "Replace with 'getRemovals().forEach(source::remove)'" "true"
+
+import java.util.*;
+
+class Test {
+  native List<String> getRemovals();
+
+  void foo(Set<Integer> source) {
+    source.removeAll<caret>(getRemovals());
+  }
+}

java/java-tests/testData/codeInsight/daemonCodeAnalyzer/quickFix/slowAbstractSetRemoveAll/beforeEmptyList.java

@@ -0,0 +1,11 @@
+// "Fix all 'Call to 'set.removeAll(list)' may work slowly' problems in file" "false"
+
+import java.util.*;
+
+class Test {
+  void foo(Set<Integer> source, List<Integer> removals) {
+    if (removals.isEmpty()) {
+      source.removeAll<caret>(removals);
+    }
+  }
+}

java/java-tests/testData/codeInsight/daemonCodeAnalyzer/quickFix/slowAbstractSetRemoveAll/beforeEmptySet.java

@@ -0,0 +1,11 @@
+// "Fix all 'Call to 'set.removeAll(list)' may work slowly' problems in file" "false"
+
+import java.util.*;
+
+class Test {
+  void foo(Set<Integer> source, List<Integer> removals) {
+    if (source.isEmpty()) {
+      source.removeAll<caret>(removals);
+    }
+  }
+}

java/java-tests/testData/codeInsight/daemonCodeAnalyzer/quickFix/slowAbstractSetRemoveAll/beforeList.java

@@ -4,6 +4,6 @@ import java.util.*;
 
 class Test {
   void foo(Set<Integer> source, List<Integer> removals) {
-    source.removeAll(removals)<caret>;
+    source.removeAll<caret>(removals);
   }
 }

java/java-tests/testData/codeInsight/daemonCodeAnalyzer/quickFix/slowAbstractSetRemoveAll/beforeListWithAtMostTwoElements.java

@@ -0,0 +1,11 @@
+// "Fix all 'Call to 'set.removeAll(list)' may work slowly' problems in file" "false"
+
+import java.util.*;
+
+class Test {
+  void foo(Set<Integer> source, List<Integer> removals) {
+    if (removals.isEmpty() || removals.size() == 1 || removals.size() == 2) {
+      source.removeAll<caret>(removals);
+    }
+  }
+}

java/java-tests/testData/codeInsight/daemonCodeAnalyzer/quickFix/slowAbstractSetRemoveAll/beforeListWithOneElement.java

@@ -0,0 +1,11 @@
+// "Fix all 'Call to 'set.removeAll(list)' may work slowly' problems in file" "false"
+
+import java.util.*;
+
+class Test {
+  void foo(Set<Integer> source, List<Integer> removals) {
+    if (removals.size() == 1) {
+      source.removeAll<caret>(removals);
+    }
+  }
+}

java/java-tests/testData/codeInsight/daemonCodeAnalyzer/quickFix/slowAbstractSetRemoveAll/beforeListWithTwoElement.java

@@ -0,0 +1,11 @@
+// "Fix all 'Call to 'set.removeAll(list)' may work slowly' problems in file" "false"
+
+import java.util.*;
+
+class Test {
+  void foo(Set<Integer> source, List<Integer> removals) {
+    if (removals.size() == 2) {
+      source.removeAll<caret>(removals);
+    }
+  }
+}

java/java-tests/testData/codeInsight/daemonCodeAnalyzer/quickFix/slowAbstractSetRemoveAll/beforeNonTrivialArg.java

@@ -0,0 +1,9 @@
+// "Replace with '(flag ? removals1 : removals2).forEach(source::remove)'" "true"
+
+import java.util.*;
+
+class Test {
+  void foo(Set<Integer> source, List<Integer> removals1, List<Integer> removals2, boolean flag) {
+    source.removeAll<caret>(flag ? removals1 : removals2);
+  }
+}

java/java-tests/testData/codeInsight/daemonCodeAnalyzer/quickFix/slowAbstractSetRemoveAll/beforeNonVoidContext.java

@@ -0,0 +1,9 @@
+// "Replace with 'removals.forEach(source::remove)'" "false"
+
+import java.util.*;
+
+class Test {
+  void foo(Set<Integer> source, List<Integer> removals) {
+    boolean b = source.removeAll<caret>(removals);
+  }
+}

java/java-tests/testData/codeInsight/daemonCodeAnalyzer/quickFix/slowAbstractSetRemoveAll/beforeSetBiggerThanList.java

@@ -0,0 +1,11 @@
+// "Replace with 'removals.forEach(source::remove)'" "false"
+
+import java.util.*;
+
+class Test {
+  void foo(Set<Integer> source, List<Integer> removals) {
+    if (source.size() > removals.size()) {
+      source.removeAll<caret>(removals);
+    }
+  }
+}

java/java-tests/testData/codeInsight/daemonCodeAnalyzer/quickFix/slowAbstractSetRemoveAll/beforeSetWithAtMostOneElement.java

@@ -0,0 +1,11 @@
+// "Fix all 'Call to 'set.removeAll(list)' may work slowly' problems in file" "false"
+
+import java.util.*;
+
+class Test {
+  void foo(Set<Integer> source, List<Integer> removals) {
+    if (source.isEmpty() || source.size() == 1) {
+      source.removeAll<caret>(removals);
+    }
+  }
+}

java/java-tests/testData/codeInsight/daemonCodeAnalyzer/quickFix/slowAbstractSetRemoveAll/beforeSetWithOneElement.java

@@ -0,0 +1,11 @@
+// "Fix all 'Call to 'set.removeAll(list)' may work slowly' problems in file" "false"
+
+import java.util.*;
+
+class Test {
+  void foo(Set<Integer> source, List<Integer> removals) {
+    if (source.size() == 1) {
+      source.removeAll<caret>(removals);
+    }
+  }
+}