andi
ecf1a62c95
do not copy array twice when inserting
2017-11-10 10:42:47 +01:00
andi
88e0179dd5
add method removeIf
2017-11-10 10:35:51 +01:00
andi
a59db6cfe8
add method retainAll
2017-11-10 10:03:10 +01:00
andi
81e1d1f131
add method removeAll
2017-11-09 14:32:15 +01:00
andi
db6ca1387d
add replaceAll
2017-11-09 09:33:19 +01:00
andi
6df2553fae
add indexOf(value) and indexOf(value, offset)
2017-10-13 17:02:01 +02:00
andi
cbe468cae8
add toArray(int[])
2017-10-07 10:01:38 +02:00
andi
56779368b8
make class final
...
We haven't designed the class for extension.
2017-09-29 18:59:02 +02:00
andi
e7d88babb4
add stream() and parallelStream()
...
Both methods return an IntStream.
2017-09-29 18:57:43 +02:00
andi
fc1ca26d52
use fromIndex and toIndex for remove instead of from and length
...
The new API is consistent with the internal API of ArrayList.
2017-09-29 18:12:58 +02:00
andi
5112fcdfa0
do not create empty array in clone
2017-09-29 17:46:00 +02:00
andi
235565bfe4
make IntList cloneable
2017-09-28 20:25:56 +02:00
andi
a178086dfa
make IntList serializable
2017-09-28 19:02:43 +02:00
andi
4a762f39b9
add special implementation for add
...
The special implementation does not need to allocate an array for the
varargs of addAll
2017-09-28 18:22:16 +02:00
andi
4da0726185
added todos with features that could be added
2017-09-26 20:22:52 +02:00
andi
d00ab6533d
use a static final empty array if list is empty
2017-09-26 20:10:54 +02:00
andi
ab7d554d52
grow the array only by 50%
...
The old implementation grew the array by 100% with each resize.
The new implementation reduces the memory usage for, especially
for large lists.
The new algorithm is overflow-concious.
2017-09-26 19:59:50 +02:00
andi
f7870a15a7
add sort (ascending) method
2017-02-05 14:18:47 +01:00
andi
145c2152d0
Add IntList a list implementation for primitive integers.
2017-02-03 20:31:58 +01:00
andi