primitive-collections

Go to file

Andreas Huber 45dd73d8f3 update isSorted after shuffling

A list can be sorted after shuffling. The trivial cases are
the empty list and a list with only one element or lists 
with only identical elements. Lists with only a few elements 
have a non-negligible chance to be sorted after shuffling.

2017-12-18 20:10:27 +01:00

gradle/wrapper

update gradle to 4.4

2017-12-13 20:44:49 +01:00

primitiveCollections

update isSorted after shuffling

2017-12-18 20:10:27 +01:00

.gitignore

Add IntList a list implementation for primitive integers.

2017-02-03 20:31:58 +01:00

build.gradle

update gradle to 4.4

2017-12-13 20:44:49 +01:00

gradlew

update to gradle 4.3.1

2017-11-10 10:09:53 +01:00

gradlew.bat

update gradle to 4.2

2017-09-26 19:30:58 +02:00

gradlew.sh

Add IntList a list implementation for primitive integers.

2017-02-03 20:31:58 +01:00

LICENSE

Replace license with MIT.

2017-02-04 09:10:28 +01:00

README.md

README.md edited online with Bitbucket

2017-02-04 08:15:29 +00:00

settings.gradle

Add IntList a list implementation for primitive integers.

2017-02-03 20:31:58 +01:00

README.md

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.