Jump to content
  • 0

FastSet


l2jkain

Question

2 answers to this question

Recommended Posts

  • 0

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
Link to comment
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Answer this question...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.



×
×
  • 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