Roman Leventov

Koloboke Obj Maps slowed down with Java 8 VMs

3

See http://stackoverflow.com/a/31994785/648955

Naming: `element()`/`first()`/`getFirst()`.

Currently hash table implementations return ordinary impl, which scan the whole table unsuccessfully, that is rather ineffective in this case. Depends on #12.

``` net.openhft.collect.CharSets { CharSet empty(); // immutable CharSet singleton(char e); // immutable CharCollection asImmutable(Collection ) } net.openhft.collect.map.CharShortMaps { CharShortMap emptyMap(); // immutable asImmutableMap(char[] keys, char[] values); asImmutable(Map map); } ```...

`guava-testlib` doesn't cover this. The easiest way is probably to extend guava library. Or wait when this will be implemented by Guava developers (but ,probably they won't).

Test primitive specializations

1

`guava-testlib` doesn't cover this. This partially could be done by importing tests from [fastutil](http://fastutil.di.unimi.it/) and [HPPC](http://labs.carrotsearch.com/hppc.html). It is OK because both libraries have Apache 2 license.

Optimize immutable containers creation

1

Corrently simply mutable container created first, then it's state moved to immutable. For example: https://github.com/OpenHFT/UntitledCollectionsProject/blob/da3bea76e014fe00aed5f4dcadcbfca14499e4eb/impl/src/main/javaTemplates/net/openhft/collect/impl/hash/HashCharSetFactoryGO.java#L220 This approach cause considerable GC overhead, if someone is going to create many small containers.

The same trick as in rehash is applicable here: we can assume each inserted key is not already present in the set. If keys are objects, equivalences of source and...