Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 924325
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 15, 20262026-05-15T19:20:03+00:00 2026-05-15T19:20:03+00:00

Is List<T> or HashSet<T> or anything else built in threadsafe for addition only? My

  • 0

Is List<T> or HashSet<T> or anything else built in threadsafe for addition only?

My question is similar to Threadsafe and generic arraylist? but I’m only looking for safety to cover adding to this list threaded, not removal or reading from it.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-15T19:20:04+00:00Added an answer on May 15, 2026 at 7:20 pm

    .NET 4.0 you could use the BlockingCollection<T>, but that is still designed to be thread safe for all operations, not just addition.

    In general, it’s uncommon to design a data structure that guarantees certain operations to be safe for concurrency and other to not be so. If you’re concerned that there is an overhead when accessing a collection for reading, you should do some benchmarking before you go out of your way to look for specialized collections to deal with that.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Good night, I was trying to benchmark the performance of HashSet and List datatypes
I've got a list defined like this... var sets = new List<HashSet<int>>(numSets); Why isn't
I've got a HashSet, var universe = new HashSet<int>(); And a bunch of subsets,
I'm having an unsorted list and want to know, whether all items in it
I have this list: private List<Set<Address>> scanList; So my list contains multiple scans as
This question is asked many a time in this forum. I know solution for
How do I convert an array to a hash set ? string[] BlockedList =
I'm wondering if there are any downsides to locking over a collection such as
I have a task to play with Java Collections framework. I need to obtain
I have a Java EE application and I use Hibernate. The domain objects, I

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.