Andreas Huber 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
2017-09-26 19:30:58 +02:00
2017-09-26 19:30:58 +02:00
2017-09-26 19:30:58 +02:00
2017-09-26 19:30:58 +02:00
2017-02-04 09:10:28 +01:00

Java collections for primitives (currently only int) released under MIT license.

IntList is an implementation of a list to store primitive integers. You can add, insert, replace and remove elements in the list. The ints are stored in an int array and the class takes care of growing the array as needed. You can trim the list to reduce the memory overhead.

Description
No description provided
Readme MIT 667 KiB
Languages
Java 99.9%
Shell 0.1%