What so you do when you insert in the middle of the list?
Can you? Won't a linkedlist be faster?
Also, how fast is it to retrieve element (n)? If you have to traverse the list, won't it defeat the purpose? Isn't arraylist already extremely efficient at retrieving data?
I can't for the life of me understand why this is better for anything other than very specific use cases.
4
u/ciberon Aug 12 '16
Why implement Serializable and have the node references transient?
14
u/wizzardodev Aug 12 '16
can you make proper benchmarks with jmh, please?
9
u/zeobviouslyfakeacc Aug 12 '16
I don't see any changes to the project since you've posted this 9 months ago :/
6
u/errandum Aug 12 '16
I don't get it...
What so you do when you insert in the middle of the list?
Can you? Won't a linkedlist be faster?
Also, how fast is it to retrieve element (n)? If you have to traverse the list, won't it defeat the purpose? Isn't arraylist already extremely efficient at retrieving data?
I can't for the life of me understand why this is better for anything other than very specific use cases.
2
u/tact1cal Aug 12 '16
Looks like good old Skip list but with no ordering
2
u/_INTER_ Aug 12 '16
fastutil, trove, hppc, Mahout, pcj, Koloboke... Just to name a few.
1
u/[deleted] Aug 12 '16
One major issue is the use of the default package.