Skip to content

Commit f0f2153

Browse files
dongwqpaulk-asert
dongwq
authored and
paulk-asert
committed
add partitionPoint to Groovy Array and List - fix comment
1 parent 9c6a0a9 commit f0f2153

2 files changed

Lines changed: 24 additions & 16 deletions

File tree

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

Lines changed: 21 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -6599,8 +6599,9 @@ public static <T> T[] minus(T[] self, Object removeMe) {
65996599
* assert arr.partitionPoint(0..arr.size()) { it <= 4 } == 6
66006600
* //for all match condition
66016601
* assert arr.partitionPoint(0..arr.size()) { it <= 100 } == arr.size()
6602-
* //for all match condition
6602+
* //for none match condition
66036603
* assert arr.partitionPoint(0..arr.size()) { it <= 0 } == 0
6604+
* //for none match condition with range
66046605
* assert arr.partitionPoint(2..arr.size()) { it <= 0 } == 2
66056606
* </pre>
66066607
*
@@ -6642,9 +6643,9 @@ public static <T> int partitionPoint(T[] self, IntRange intRange, @ClosureParams
66426643
* //usage case as upperBound(cpp), bisect_right(python)
66436644
* assert arr.partitionPoint{ it <= 4 } == 6
66446645
* //for all match condition
6645-
* assert arr.partitionPoint{ it <= 100 } == arr.size()
6646-
* //for all match condition
6647-
* assert arr.partitionPoint{ it <= 0 } == 0
6646+
* assert arr.partitionPoint(0..arr.size()) { it <= 100 } == arr.size()
6647+
* //for none match condition
6648+
* assert arr.partitionPoint(0..arr.size()) { it <= 0 } == 0
66486649
* </pre>
66496650
*
66506651
* @param self a groovy arr
@@ -6673,8 +6674,9 @@ public static <T> int partitionPoint(T[] self, @ClosureParams(FirstParam.FirstGe
66736674
* assert arr.partitionPoint(0..arr.size()) { it <= 4 } == 6
66746675
* //for all match condition
66756676
* assert arr.partitionPoint(0..arr.size()) { it <= 100 } == arr.size()
6676-
* //for all match condition
6677+
* //for none match condition
66776678
* assert arr.partitionPoint(0..arr.size()) { it <= 0 } == 0
6679+
* //for none match condition with range
66786680
* assert arr.partitionPoint(2..arr.size()) { it <= 0 } == 2
66796681
* </pre>
66806682
*
@@ -6716,7 +6718,7 @@ public static int partitionPoint(char[] self, IntRange intRange, IntPredicate co
67166718
* assert arr.partitionPoint{ it <= 4 } == 6
67176719
* //for all match condition
67186720
* assert arr.partitionPoint{ it <= 100 } == arr.size()
6719-
* //for all match condition
6721+
* //for none match condition
67206722
* assert arr.partitionPoint{ it <= 0 } == 0
67216723
* </pre>
67226724
*
@@ -6746,8 +6748,9 @@ public static int partitionPoint(char[] self, IntPredicate condition) {
67466748
* assert arr.partitionPoint(0..arr.size()) { it <= 4 } == 6
67476749
* //for all match condition
67486750
* assert arr.partitionPoint(0..arr.size()) { it <= 100 } == arr.size()
6749-
* //for all match condition
6751+
* //for none match condition
67506752
* assert arr.partitionPoint(0..arr.size()) { it <= 0 } == 0
6753+
* //for none match condition with range
67516754
* assert arr.partitionPoint(2..arr.size()) { it <= 0 } == 2
67526755
* </pre>
67536756
*
@@ -6789,7 +6792,7 @@ public static int partitionPoint(short[] self, IntRange intRange, IntPredicate c
67896792
* assert arr.partitionPoint{ it <= 4 } == 6
67906793
* //for all match condition
67916794
* assert arr.partitionPoint{ it <= 100 } == arr.size()
6792-
* //for all match condition
6795+
* //for none match condition
67936796
* assert arr.partitionPoint{ it <= 0 } == 0
67946797
* </pre>
67956798
*
@@ -6821,6 +6824,7 @@ public static int partitionPoint(short[] self, IntPredicate condition) {
68216824
* assert arr.partitionPoint(0..arr.size()) { it <= 100 } == arr.size()
68226825
* //for all match condition
68236826
* assert arr.partitionPoint(0..arr.size()) { it <= 0 } == 0
6827+
* //for none match condition with range
68246828
* assert arr.partitionPoint(2..arr.size()) { it <= 0 } == 2
68256829
* </pre>
68266830
*
@@ -6862,7 +6866,7 @@ public static int partitionPoint(int[] self, IntRange intRange, IntPredicate con
68626866
* assert arr.partitionPoint{ it <= 4 } == 6
68636867
* //for all match condition
68646868
* assert arr.partitionPoint{ it <= 100 } == arr.size()
6865-
* //for all match condition
6869+
* //for none match condition
68666870
* assert arr.partitionPoint{ it <= 0 } == 0
68676871
* </pre>
68686872
*
@@ -6892,8 +6896,9 @@ public static int partitionPoint(int[] self, IntPredicate condition) {
68926896
* assert arr.partitionPoint(0..arr.size()) { it <= 4 } == 6
68936897
* //for all match condition
68946898
* assert arr.partitionPoint(0..arr.size()) { it <= 100 } == arr.size()
6895-
* //for all match condition
6899+
* //for none match condition
68966900
* assert arr.partitionPoint(0..arr.size()) { it <= 0 } == 0
6901+
* //for none match condition with range
68976902
* assert arr.partitionPoint(2..arr.size()) { it <= 0 } == 2
68986903
* </pre>
68996904
*
@@ -6935,7 +6940,7 @@ public static int partitionPoint(long[] self, IntRange intRange, LongPredicate c
69356940
* assert arr.partitionPoint{ it <= 4 } == 6
69366941
* //for all match condition
69376942
* assert arr.partitionPoint{ it <= 100 } == arr.size()
6938-
* //for all match condition
6943+
* //for none match condition
69396944
* assert arr.partitionPoint{ it <= 0 } == 0
69406945
* </pre>
69416946
*
@@ -6965,8 +6970,9 @@ public static int partitionPoint(long[] self, LongPredicate condition) {
69656970
* assert arr.partitionPoint(0..arr.size()) { it <= 4 } == 6
69666971
* //for all match condition
69676972
* assert arr.partitionPoint(0..arr.size()) { it <= 100 } == arr.size()
6968-
* //for all match condition
6973+
* //for none match condition
69696974
* assert arr.partitionPoint(0..arr.size()) { it <= 0 } == 0
6975+
* //for none match condition with range
69706976
* assert arr.partitionPoint(2..arr.size()) { it <= 0 } == 2
69716977
* </pre>
69726978
*
@@ -7008,7 +7014,7 @@ public static int partitionPoint(float[] self, IntRange intRange, DoublePredicat
70087014
* assert arr.partitionPoint{ it <= 4 } == 6
70097015
* //for all match condition
70107016
* assert arr.partitionPoint{ it <= 100 } == arr.size()
7011-
* //for all match condition
7017+
* //for none match condition
70127018
* assert arr.partitionPoint{ it <= 0 } == 0
70137019
* </pre>
70147020
*
@@ -7040,6 +7046,7 @@ public static int partitionPoint(float[] self, DoublePredicate condition) {
70407046
* assert arr.partitionPoint(0..arr.size()) { it <= 100 } == arr.size()
70417047
* //for all match condition
70427048
* assert arr.partitionPoint(0..arr.size()) { it <= 0 } == 0
7049+
* //for none match condition with range
70437050
* assert arr.partitionPoint(2..arr.size()) { it <= 0 } == 2
70447051
* </pre>
70457052
*
@@ -7081,7 +7088,7 @@ public static int partitionPoint(double[] self, IntRange intRange, DoublePredica
70817088
* assert arr.partitionPoint{ it <= 4 } == 6
70827089
* //for all match condition
70837090
* assert arr.partitionPoint{ it <= 100 } == arr.size()
7084-
* //for all match condition
7091+
* //for none match condition
70857092
* assert arr.partitionPoint{ it <= 0 } == 0
70867093
* </pre>
70877094
*

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

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -11068,8 +11068,9 @@ public static <T> SortedSet<T> or(SortedSet<T> left, Iterable<T> right) {
1106811068
* assert list.partitionPoint(0..list.size()) { it <= 4 } == 6
1106911069
* //for all match condition
1107011070
* assert list.partitionPoint(0..list.size()) { it <= 100 } == list.size()
11071-
* //for all match condition
11071+
* //for none match condition
1107211072
* assert list.partitionPoint(0..list.size()) { it <= 0 } == 0
11073+
* //for none match condition with range
1107311074
* assert list.partitionPoint(2..list.size()) { it <= 0 } == 2
1107411075
* </pre>
1107511076
*
@@ -11111,7 +11112,7 @@ public static <T> int partitionPoint(List<T> self, IntRange intRange, Predicate<
1111111112
* assert list.partitionPoint{ it <= 4 } == 6
1111211113
* //for all match condition
1111311114
* assert list.partitionPoint{ it <= 100 } == list.size()
11114-
* //for all match condition
11115+
* //for none match condition
1111511116
* assert list.partitionPoint{ it <= 0 } == 0
1111611117
* </pre>
1111711118
*

0 commit comments

Comments
 (0)