-
Notifications
You must be signed in to change notification settings - Fork 6
Expand file tree
/
Copy pathArray.java
More file actions
1450 lines (1171 loc) · 33.1 KB
/
Array.java
File metadata and controls
1450 lines (1171 loc) · 33.1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
package javasabr.rlib.common.util.array;
import static javasabr.rlib.common.util.ClassUtils.unsafeCast;
import static javasabr.rlib.common.util.ClassUtils.unsafeNNCast;
import java.io.Serializable;
import java.util.Arrays;
import java.util.Collection;
import java.util.Objects;
import java.util.Optional;
import java.util.RandomAccess;
import java.util.function.Consumer;
import java.util.function.Function;
import java.util.function.Predicate;
import java.util.stream.Stream;
import javasabr.rlib.common.function.BiIntPredicate;
import javasabr.rlib.common.function.NotNullBiConsumer;
import javasabr.rlib.common.function.NotNullBiPredicate;
import javasabr.rlib.common.function.NotNullConsumer;
import javasabr.rlib.common.function.NotNullFloatBiObjectConsumer;
import javasabr.rlib.common.function.NotNullFunction;
import javasabr.rlib.common.function.NotNullFunctionInt;
import javasabr.rlib.common.function.NotNullIntBiObjectConsumer;
import javasabr.rlib.common.function.NotNullIntObjectPredicate;
import javasabr.rlib.common.function.NotNullLongBiObjectConsumer;
import javasabr.rlib.common.function.NotNullLongObjectPredicate;
import javasabr.rlib.common.function.NotNullPredicate;
import javasabr.rlib.common.function.NotNullSupplier;
import javasabr.rlib.common.function.NotNullTripleConsumer;
import javasabr.rlib.common.function.NotNullTriplePredicate;
import javasabr.rlib.common.util.ArrayUtils;
import javasabr.rlib.common.util.ClassUtils;
import javasabr.rlib.common.util.array.impl.DefaultArrayIterator;
import org.jspecify.annotations.NullMarked;
import org.jspecify.annotations.Nullable;
/**
* Interface to implement dynamic arrays.
* <p> To create to use {@link ArrayFactory}.
*
* @param <E> the element's type.
* @author JavaSaBr
*/
@NullMarked
@Deprecated
public interface Array<E> extends Collection<E>, Serializable, Cloneable, RandomAccess {
/**
* Create an empty read only array.
*
* @param <T> the result element's type.
* @return the empty array.
*/
static <T> ReadOnlyArray<T> empty() {
return unsafeNNCast(ArrayFactory.EMPTY_ARRAY);
}
/**
* Create a new array for the element's type.
*
* @param type the element's type.
* @param <T> the element's type.
* @return the new array.
*/
static <T> Array<T> ofType(Class<? super T> type) {
return ArrayFactory.newArray(type);
}
/**
* Create a new array for the element's type.
*
* @param type the element's type.
* @param capacity the start capacity of this array.
* @param <T> the element's type.
* @return the new array.
*/
static <T> Array<T> ofType(Class<? super T> type, int capacity) {
return ArrayFactory.newArray(type, capacity);
}
/**
* Copy an array to a read only array.
*
* @param another the another array.
* @param <T> the element's type.
* @return the new read only array.
*/
static <T> ReadOnlyArray<T> of(Array<T> another) {
return ArrayFactory.newReadOnlyArray(ArrayUtils.copyOfRange(another.array(), 0, another.size()));
}
/**
* Creates a single element read only array.
*
* @param element the element.
* @param <T> the element's type.
* @return the read only array.
*/
static <T> ReadOnlyArray<T> of(T element) {
T[] newArray = ArrayUtils.create(element.getClass(), 1);
newArray[0] = element;
return ArrayFactory.newReadOnlyArray(newArray);
}
@SafeVarargs
static <T> ReadOnlyArray<T> of(T... elements) {
return ArrayFactory.newReadOnlyArray(ArrayUtils.copyOf(elements));
}
@SafeVarargs
static <T> ReadOnlyArray<T> optionals(Class<? super T> type, Optional<T>... elements) {
return ArrayFactory.newReadOnlyArray(Arrays
.stream(elements)
.filter(Optional::isPresent)
.map(Optional::get)
.toArray(value -> ArrayUtils.create(type, value)));
}
static <T, A extends Array<T>> A append(A first, A second) {
first.addAll(second);
return first;
}
static <T> ReadOnlyArray<T> combine(Array<T> first, Array<T> second) {
var componentType = ClassUtils.<Class<T>>unsafeNNCast(first
.array()
.getClass()
.getComponentType());
var newArray = ArrayUtils.combine(first.toArray(componentType), second.toArray(componentType));
return ArrayFactory.newReadOnlyArray(newArray);
}
/**
* Create a supplier which creates new arrays.
*
* @param type the element's type.
* @param <T> the element's type.
* @return the supplier.
*/
static <T> NotNullSupplier<Array<T>> supplier(Class<? super T> type) {
return () -> ArrayFactory.newConcurrentStampedLockArray(type);
}
/**
* Create a function which creates new arrays.
*
* @param type the element's type.
* @param <T> the element's type.
* @return the supplier.
*/
static <T> NotNullFunction<Class<? super T>, Array<T>> function(Class<? super T> type) {
return ArrayFactory::newConcurrentStampedLockArray;
}
/**
* Copy all elements from this array to a target array.
*
* @param target the target array.
*/
default void copyTo(Array<? super E> target) {
target.addAll(this);
}
/**
* Adds all elements from the array to this array.
*
* @param array the array with new elements.
* @return true if this array was changed.
*/
boolean addAll(Array<? extends E> array);
/**
* Adds all elements from the array to this array.
*
* @param array the array with new elements.
* @return true if this array was changed.
*/
boolean addAll(E[] array);
/**
* Applies this function to each element of this array with replacing to result element from thia function.
*
* @param function the function.
*/
default void apply(Function<? super E, ? extends E> function) {
E[] array = array();
for (int i = 0, length = size(); i < length; i++) {
array[i] = function.apply(array[i]);
}
}
/**
* Get the wrapped array.
*
* @return the wrapped array.
*/
E [] array();
@Override
default Stream<E> stream() {
return Arrays.stream(array(), 0, size());
}
@Override
default Stream<E> parallelStream() {
return stream().parallel();
}
@Override
default boolean contains(Object object) {
for (E element : array()) {
if (element == null) {
break;
} else if (element.equals(object)) {
return true;
}
}
return false;
}
/**
* Returns true if this array contains all of the elements in the specified array.
*
* @param array the array to be checked for containment in this array
* @return true if this array contains all of the elements in the specified array.
*/
default boolean containsAll(Array<?> array) {
if (array.isEmpty()) {
return false;
}
for (var element : array.array()) {
if (element == null) {
break;
} else if (!contains(element)) {
return false;
}
}
return true;
}
@Override
default boolean containsAll(Collection<?> array) {
if (array.isEmpty()) {
return false;
}
for (var element : array) {
if (element == null) {
break;
} else if (!contains(element)) {
return false;
}
}
return true;
}
/**
* Returns true if this array contains all of the elements in the specified array.
*
* @param array the array to be checked for containment in this array
* @return true if this array contains all of the elements in the specified array.
*/
default boolean containsAll(Object[] array) {
if (array.length < 1) {
return false;
}
for (Object element : array) {
if (!contains(element)) {
return false;
}
}
return true;
}
/**
* Removes the element at index possible with reordering.
*
* @param index the index of removing the element.
* @return the removed element.
*/
E fastRemove(int index);
/**
* Removes an element without saving original ordering of other elements.
*
* @param object the element to remove.
* @return <code>true</code> if the element was removed.
*/
default boolean fastRemove(Object object) {
int index = indexOf(object);
if (index >= 0) {
fastRemove(index);
}
return index >= 0;
}
/**
* Removes the each element from the array.
*
* @param array the array with elements to remove.
* @return count of removed elements.
*/
default int fastRemoveAll(E[] array) {
int count = 0;
for (var object : array) {
if (fastRemove(object)) {
count++;
}
}
return count;
}
/**
* Try to get the first element of this array.
*
* @return the first element or null.
*/
default @Nullable E first() {
return isEmpty() ? null : get(0);
}
/**
* Get an element by an index.
*
* @param index the index of the element.
* @return the element.
*/
E get(int index);
/**
* Find an index of the object in this array.
*
* @param object the object to find.
* @return the index of the object or -1.
*/
default int indexOf(Object object) {
int index = 0;
for (E element : array()) {
if (element == null) {
break;
} else if (Objects.equals(object, element)) {
return index;
}
index++;
}
return -1;
}
@Override
default ArrayIterator<E> iterator() {
return new DefaultArrayIterator<>(this);
}
/**
* Try to get the last element.
*
* @return the last element or null.
*/
default @Nullable E last() {
int size = size();
if (size < 1) {
return null;
}
return get(size - 1);
}
/**
* Find the last index of the object in this array.
*
* @param object the object.
* @return the last index or -1.
*/
default int lastIndexOf(Object object) {
E[] array = array();
int last = -1;
for (int i = 0, length = size(); i < length; i++) {
E element = array[i];
if (element.equals(object)) {
last = i;
}
}
return last;
}
/**
* Get and remove the first element from this array.
*
* @return the first element or null.
*/
default @Nullable E poll() {
return isEmpty() ? null : remove(0);
}
/**
* Get and remove the last element of this array.
*
* @return the last element or null.
*/
default @Nullable E pop() {
return isEmpty() ? null : fastRemove(size() - 1);
}
/**
* Removes all of this target's elements that are also contained in the specified array (optional operation).
*
* @param target array containing elements to be removed from this array.
* @return true if this array changed as a result of the call.
*/
default boolean removeAll(Array<?> target) {
if (target.isEmpty()) {
return false;
}
int count = 0;
for (var element : target.array()) {
if (element == null) {
break;
} else if (remove(element)) {
count++;
}
}
return count > 0;
}
/**
* Removes all of this target's elements that are also contained in the specified array (optional operation) with
* reordering.
*
* @param target array containing elements to be removed from this array.
* @return true if this array changed as a result of the call.
*/
default boolean fastRemoveAll(Array<?> target) {
if (target.isEmpty()) {
return false;
}
var count = 0;
var array = array();
for (int i = 0, length = size(); i < length; i++) {
var element = array[i];
if (!target.contains(element)) {
continue;
}
fastRemove(i);
i--;
length--;
count++;
}
return count > 0;
}
@Override
default boolean removeAll(Collection<?> target) {
if (target.isEmpty()) {
return false;
}
int count = 0;
for (var element : target) {
if (remove(element)) {
count++;
}
}
return count == target.size();
}
/**
* Retains only the elements in this array that are contained in the specified array (optional operation). In other
* words, removes from this array all of its elements that are not contained in the specified array.
*
* @param target array containing elements to be retained in this array.
* @return true if this array changed as a result of the call.
*/
default boolean retainAll(Array<?> target) {
E[] array = array();
for (int i = 0, length = size(); i < length; i++) {
if (!target.contains(array[i])) {
fastRemove(i--);
length--;
}
}
return true;
}
@Override
default boolean retainAll(Collection<?> target) {
E[] array = array();
for (int i = 0, length = size(); i < length; i++) {
if (!target.contains(array[i])) {
fastRemove(i--);
length--;
}
}
return true;
}
/**
* Replace an element by an index.
*
* @param index the element's index.
* @param element the new element.
*/
void replace(int index, E element);
/**
* Removes the element at index.
*
* @param index the index of removing the element.
* @return the removed element.
*/
E remove(int index);
@Override
default boolean remove(Object object) {
var index = indexOf(object);
if (index >= 0) {
remove(index);
}
return index >= 0;
}
/**
* Sort this array using the comparator.
*
* @param comparator the comparator.
* @return the array
*/
default Array<E> sort(ArrayComparator<E> comparator) {
ArrayUtils.sort(array(), 0, size(), comparator);
return this;
}
@Override
default <T> T[] toArray(T[] newArray) {
E[] array = array();
if (newArray.length >= size()) {
for (int i = 0, j = 0, length = array.length, newLength = newArray.length; i < length && j < newLength; i++) {
if (array[i] == null) {
continue;
}
newArray[j++] = unsafeCast(array[i]);
}
return newArray;
}
Class<T[]> arrayClass = unsafeCast(newArray.getClass());
Class<T> componentType = unsafeCast(arrayClass.getComponentType());
return toArray(componentType);
}
/**
* Copy this array to the new array.
*
* @param <T> the type parameter
* @param componentType the type of the new array.
* @return the copied array.
*/
default <T> T[] toArray(Class<T> componentType) {
T[] newArray = ArrayUtils.create(componentType, size());
E[] array = array();
System.arraycopy(array, 0, newArray, 0, size());
return newArray;
}
/**
* Get the unsafe interface of this array.
*
* @return the unsafe interface of this array.
*/
default UnsafeArray<E> asUnsafe() {
if (this instanceof UnsafeArray) {
return (UnsafeArray<E>) this;
} else {
throw new UnsupportedOperationException();
}
}
@Override
default boolean isEmpty() {
return size() < 1;
}
@Override
default E[] toArray() {
var array = array();
return Arrays.copyOf(array, size(), (Class<E[]>) array.getClass());
}
String toString(Function<E, String> toString);
@Override
default boolean removeIf(Predicate<? super E> filter) {
var array = array();
var removed = 0;
for (int i = 0, length = size(); i < length; i++) {
var element = array[i];
if (filter.test(element)) {
remove(i);
i--;
length--;
removed++;
}
}
return removed > 0;
}
/**
* Removes all of the elements of this collection that satisfy the given predicate.
*
* @param argument the additional argument.
* @param filter the predicate which returns {@code true} for elements to be removed.
* @param <A> the argument's type.
* @return {@code true} if any elements were removed.
*/
default <A> boolean removeIf(A argument, NotNullBiPredicate<A, ? super E> filter) {
var array = array();
var removed = 0;
for (int i = 0, length = size(); i < length; i++) {
var element = array[i];
if (filter.test(argument, element)) {
remove(i);
i--;
length--;
removed++;
}
}
return removed > 0;
}
/**
* Removes all of the elements of this collection that satisfy the given predicate.
*
* @param argument the additional argument.
* @param converter the converter of the argument.
* @param filter the predicate which returns {@code true} for elements to be removed.
* @param <A> the argument's type.
* @param <B> the argument converted type.
* @return {@code true} if any elements were removed.
*/
default <A, B> boolean removeIf(
A argument,
NotNullFunction<A, B> converter,
NotNullBiPredicate<B, ? super E> filter) {
var array = array();
var removed = 0;
for (int i = 0, length = size(); i < length; i++) {
var element = array[i];
if (filter.test(converter.apply(argument), element)) {
remove(i);
i--;
length--;
removed++;
}
}
return removed > 0;
}
/**
* Removes all of the elements of this collection that satisfy the given predicate.
*
* @param argument the additional argument.
* @param converter the converter of the elements.
* @param filter the predicate which returns {@code true} for elements to be removed.
* @param <A> the argument's type.
* @param <B> the element converted type.
* @return {@code true} if any elements were removed.
* @since 9.6.0
*/
default <A, B> boolean removeIfConverted(
A argument,
NotNullFunction<? super E, B> converter,
NotNullBiPredicate<A, B> filter) {
var array = array();
var removed = 0;
for (int i = 0, length = size(); i < length; i++) {
var element = array[i];
if (filter.test(argument, converter.apply(element))) {
remove(i);
i--;
length--;
removed++;
}
}
return removed > 0;
}
/**
* Return true if there is at least an element for the condition.
*
* @param argument the argument.
* @param filter the condition.
* @param <T> the argument's type.
* @return true if there is at least an element for the condition.
*/
default <T> boolean anyMatch(T argument, NotNullBiPredicate<T, ? super E> filter) {
return findAny(argument, filter) != null;
}
/**
* Return true if there is at least a converted element for the condition.
*
* @param argument the argument.
* @param converter the converter element to another type.
* @param filter the condition.
* @param <T> the argument's type.
* @param <C> the converted element's type.
* @return true if there is at least an element for the condition.
* @since 9.7.0
*/
default <T, C> boolean anyMatchConverted(
T argument,
NotNullFunction<? super E, C> converter,
NotNullBiPredicate<T, C> filter) {
return findAnyConverted(argument, converter, filter) != null;
}
/**
* Return true if there is at least an element for the condition.
*
* @param argument the argument.
* @param filter the condition.
* @return true if there is at least an element for the condition.
*/
default boolean anyMatch(int argument, NotNullIntObjectPredicate<? super E> filter) {
return findAny(argument, filter) != null;
}
/**
* Return true if there is at least an element for the condition.
*
* @param <T> the argument's type.
* @param argument the argument.
* @param filter the condition.
* @return true if there is at least an element for the condition.
*/
default <T> boolean anyMatchR(T argument, NotNullBiPredicate<? super E, T> filter) {
return findAnyR(argument, filter) != null;
}
/**
* Find an element using the condition.
*
* @param filter the condition.
* @return the found element or null.
*/
default @Nullable E findAny(NotNullPredicate<E> filter) {
if (isEmpty()) {
return null;
}
var array = array();
for (int i = 0, length = size(); i < length; i++) {
var element = array[i];
if (filter.test(element)) {
return element;
}
}
return null;
}
/**
* Search an element using the condition.
*
* @param argument the argument.
* @param filter the condition.
* @param <T> the argument's type.
* @return the found element or null.
*/
default <T> @Nullable E findAny(T argument, NotNullBiPredicate<T, ? super E> filter) {
if (isEmpty()) {
return null;
}
var array = array();
for (int i = 0, length = size(); i < length; i++) {
var element = array[i];
if (filter.test(argument, element)) {
return element;
}
}
return null;
}
/**
* Search an element using the condition by converted value.
*
* @param argument the argument.
* @param converter the converted an element to another type.
* @param filter the condition.
* @param <T> the argument's type.
* @param <C> the converted element's type.
* @return the found element or null.
* @since 9.7.0
*/
default <T, C> @Nullable E findAnyConverted(
T argument,
NotNullFunction<? super E, C> converter,
NotNullBiPredicate<T, C> filter) {
if (isEmpty()) {
return null;
}
var array = array();
for (int i = 0, length = size(); i < length; i++) {
var element = array[i];
if (filter.test(argument, converter.apply(element))) {
return element;
}
}
return null;
}
/**
* Find an element for the condition.
*
* @param <T> the argument's type.
* @param argument the argument.
* @param filter the condition.
* @return the found element or null.
*/
default <T> @Nullable E findAnyR(T argument, NotNullBiPredicate<? super E, T> filter) {
if (isEmpty()) {
return null;
}
var array = array();
for (int i = 0, length = size(); i < length; i++) {
var element = array[i];
if (filter.test(element, argument)) {
return element;
}
}
return null;
}
/**
* Search an element using the condition.
*
* @param argument the argument.
* @param filter the condition.
* @return the found element or null.
*/
default @Nullable E findAny(int argument, NotNullIntObjectPredicate<? super E> filter) {
if (isEmpty()) {
return null;
}
var array = array();
for (int i = 0, length = size(); i < length; i++) {
var element = array[i];
if (filter.test(argument, element)) {
return element;
}
}
return null;
}
/**
* Search an element using the condition.
*
* @param argument the argument.
* @param filter the condition.
* @return the found element or null.
*/
default @Nullable E findAnyL(long argument, NotNullLongObjectPredicate<E> filter) {
if (isEmpty()) {
return null;
}
var array = array();
for (int i = 0, length = size(); i < length; i++) {
var element = array[i];
if (filter.test(argument, element)) {
return element;
}
}
return null;
}
/**
* Search an element using the condition.
*
* @param first the first argument.
* @param second the second argument.