Jump to content
  • 0

Question

2 answers to this question

Recommended Posts

  • 0
Posted (edited)

Depends what's the container is supposed to do. If the order of insertion must be kept, it can be also a LinkedList. If it must be concurrent and ordered, ConcurrentSkipListSet.

 

If it's only concurrent, then CopyOnWriteArrayList got shitty performance, avoid to use it at any cost. Use ConcurrentHashMap.newKeySet() instead (which feed one column with boolean) in order to benefit from performance boost of CHMap.

 

All in one, it can be replaced in most of cases by a simple ArrayList (it's pretty rare to need concurrent or order, and even rarer to need both).

 

Once again, it depends what does your container.

Edited by Tryskell

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now


×
×
  • Create New...

AdBlock Extension Detected!

Our website is made possible by displaying online advertisements to our members.

Please disable AdBlock browser extension first, to be able to use our community.

I've Disabled AdBlock