add partitionPoint to Groovy Array and List - fix comment

Author: dongwq

src/main/java/org/codehaus/groovy/runtime/ArrayGroovyMethods.java

@@ -6599,8 +6599,9 @@ public static <T> T[] minus(T[] self, Object removeMe) {
      * assert arr.partitionPoint(0..arr.size()) { it <= 4 } == 6
      * //for all match condition
      * assert arr.partitionPoint(0..arr.size()) { it <= 100 } == arr.size()
-     * //for all match condition
+     * //for none match condition
      * assert arr.partitionPoint(0..arr.size()) { it <= 0 } == 0
+     * //for none match condition with range
      * assert arr.partitionPoint(2..arr.size()) { it <= 0 } == 2
      * </pre>
      *
@@ -6642,9 +6643,9 @@ public static <T> int partitionPoint(T[] self, IntRange intRange, @ClosureParams
      * //usage case as upperBound(cpp), bisect_right(python)
      * assert arr.partitionPoint{ it <= 4 } == 6
      * //for all match condition
-     * assert arr.partitionPoint{ it <= 100 } == arr.size()
-     * //for all match condition
-     * assert arr.partitionPoint{ it <= 0 } == 0
+     * assert arr.partitionPoint(0..arr.size()) { it <= 100 } == arr.size()
+     * //for none match condition
+     * assert arr.partitionPoint(0..arr.size()) { it <= 0 } == 0
      * </pre>
      *
      * @param self      a groovy arr
@@ -6673,8 +6674,9 @@ public static <T> int partitionPoint(T[] self, @ClosureParams(FirstParam.FirstGe
      * assert arr.partitionPoint(0..arr.size()) { it <= 4 } == 6
      * //for all match condition
      * assert arr.partitionPoint(0..arr.size()) { it <= 100 } == arr.size()
-     * //for all match condition
+     * //for none match condition
      * assert arr.partitionPoint(0..arr.size()) { it <= 0 } == 0
+     * //for none match condition with range
      * assert arr.partitionPoint(2..arr.size()) { it <= 0 } == 2
      * </pre>
      *
@@ -6716,7 +6718,7 @@ public static int partitionPoint(char[] self, IntRange intRange, IntPredicate co
      * assert arr.partitionPoint{ it <= 4 } == 6
      * //for all match condition
      * assert arr.partitionPoint{ it <= 100 } == arr.size()
-     * //for all match condition
+     * //for none match condition
      * assert arr.partitionPoint{ it <= 0 } == 0
      * </pre>
      *
@@ -6746,8 +6748,9 @@ public static int partitionPoint(char[] self, IntPredicate condition) {
      * assert arr.partitionPoint(0..arr.size()) { it <= 4 } == 6
      * //for all match condition
      * assert arr.partitionPoint(0..arr.size()) { it <= 100 } == arr.size()
-     * //for all match condition
+     * //for none match condition
      * assert arr.partitionPoint(0..arr.size()) { it <= 0 } == 0
+     * //for none match condition with range
      * assert arr.partitionPoint(2..arr.size()) { it <= 0 } == 2
      * </pre>
      *
@@ -6789,7 +6792,7 @@ public static int partitionPoint(short[] self, IntRange intRange, IntPredicate c
      * assert arr.partitionPoint{ it <= 4 } == 6
      * //for all match condition
      * assert arr.partitionPoint{ it <= 100 } == arr.size()
-     * //for all match condition
+     * //for none match condition
      * assert arr.partitionPoint{ it <= 0 } == 0
      * </pre>
      *
@@ -6821,6 +6824,7 @@ public static int partitionPoint(short[] self, IntPredicate condition) {
      * assert arr.partitionPoint(0..arr.size()) { it <= 100 } == arr.size()
      * //for all match condition
      * assert arr.partitionPoint(0..arr.size()) { it <= 0 } == 0
+     * //for none match condition with range
      * assert arr.partitionPoint(2..arr.size()) { it <= 0 } == 2
      * </pre>
      *
@@ -6862,7 +6866,7 @@ public static int partitionPoint(int[] self, IntRange intRange, IntPredicate con
      * assert arr.partitionPoint{ it <= 4 } == 6
      * //for all match condition
      * assert arr.partitionPoint{ it <= 100 } == arr.size()
-     * //for all match condition
+     * //for none match condition
      * assert arr.partitionPoint{ it <= 0 } == 0
      * </pre>
      *
@@ -6892,8 +6896,9 @@ public static int partitionPoint(int[] self, IntPredicate condition) {
      * assert arr.partitionPoint(0..arr.size()) { it <= 4 } == 6
      * //for all match condition
      * assert arr.partitionPoint(0..arr.size()) { it <= 100 } == arr.size()
-     * //for all match condition
+     * //for none match condition
      * assert arr.partitionPoint(0..arr.size()) { it <= 0 } == 0
+     * //for none match condition with range
      * assert arr.partitionPoint(2..arr.size()) { it <= 0 } == 2
      * </pre>
      *
@@ -6935,7 +6940,7 @@ public static int partitionPoint(long[] self, IntRange intRange, LongPredicate c
      * assert arr.partitionPoint{ it <= 4 } == 6
      * //for all match condition
      * assert arr.partitionPoint{ it <= 100 } == arr.size()
-     * //for all match condition
+     * //for none match condition
      * assert arr.partitionPoint{ it <= 0 } == 0
      * </pre>
      *
@@ -6965,8 +6970,9 @@ public static int partitionPoint(long[] self, LongPredicate condition) {
      * assert arr.partitionPoint(0..arr.size()) { it <= 4 } == 6
      * //for all match condition
      * assert arr.partitionPoint(0..arr.size()) { it <= 100 } == arr.size()
-     * //for all match condition
+     * //for none match condition
      * assert arr.partitionPoint(0..arr.size()) { it <= 0 } == 0
+     * //for none match condition with range
      * assert arr.partitionPoint(2..arr.size()) { it <= 0 } == 2
      * </pre>
      *
@@ -7008,7 +7014,7 @@ public static int partitionPoint(float[] self, IntRange intRange, DoublePredicat
      * assert arr.partitionPoint{ it <= 4 } == 6
      * //for all match condition
      * assert arr.partitionPoint{ it <= 100 } == arr.size()
-     * //for all match condition
+     * //for none match condition
      * assert arr.partitionPoint{ it <= 0 } == 0
      * </pre>
      *
@@ -7040,6 +7046,7 @@ public static int partitionPoint(float[] self, DoublePredicate condition) {
      * assert arr.partitionPoint(0..arr.size()) { it <= 100 } == arr.size()
      * //for all match condition
      * assert arr.partitionPoint(0..arr.size()) { it <= 0 } == 0
+     * //for none match condition with range
      * assert arr.partitionPoint(2..arr.size()) { it <= 0 } == 2
      * </pre>
      *
@@ -7081,7 +7088,7 @@ public static int partitionPoint(double[] self, IntRange intRange, DoublePredica
      * assert arr.partitionPoint{ it <= 4 } == 6
      * //for all match condition
      * assert arr.partitionPoint{ it <= 100 } == arr.size()
-     * //for all match condition
+     * //for none match condition
      * assert arr.partitionPoint{ it <= 0 } == 0
      * </pre>
      *

src/main/java/org/codehaus/groovy/runtime/DefaultGroovyMethods.java

@@ -11068,8 +11068,9 @@ public static <T> SortedSet<T> or(SortedSet<T> left, Iterable<T> right) {
      * assert list.partitionPoint(0..list.size()) { it <= 4 } == 6
      * //for all match condition
      * assert list.partitionPoint(0..list.size()) { it <= 100 } == list.size()
-     * //for all match condition
+     * //for none match condition
      * assert list.partitionPoint(0..list.size()) { it <= 0 } == 0
+     * //for none match condition with range
      * assert list.partitionPoint(2..list.size()) { it <= 0 } == 2
      * </pre>
      *
@@ -11111,7 +11112,7 @@ public static <T> int partitionPoint(List<T> self, IntRange intRange, Predicate<
      * assert list.partitionPoint{ it <= 4 } == 6
      * //for all match condition
      * assert list.partitionPoint{ it <= 100 } == list.size()
-     * //for all match condition
+     * //for none match condition
      * assert list.partitionPoint{ it <= 0 } == 0
      * </pre>
      *