Recently I feel like sometimes ArrayList<Integer> or HashSet<Integer> is just...too slow. If we implement the datas tructures in primitive types and offer some functions to fit the common interfaces, I really think that can help. Sorry for my poor english, but you can get what I mean at https://github.com/XenoAmess/commonx/tree/master/src/main/java/com/xenoamess/commons/collections/list/primitive_array_lists
*LongArrayList score : 12399758ArrayList<Long> score : 27851927* According to the test result, sometimes it will run more than 1 times faster when we use primitive such data structures... I just wonder: 1. Is this thing done by some libraries before? 2. Are there any guys who are as interested with such things as me? (as I don't think I can fo this translation of codes completely by myself.) 3. If 1->false , then will there be any possibility that apache do such things?(either clean room implementations or translation?) Thx.. -----XenoAmess.
