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 8917559
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 15, 20262026-06-15T05:31:11+00:00 2026-06-15T05:31:11+00:00

I have an array of ints that track the completion of 10,000 concurrent tasks,

  • 0

I have an array of ints that track the completion of 10,000 concurrent tasks, where the value is either 1 or 0. I think it would be more efficient if this array was an array of Bits and each concurrent thread used interlocked.CompareExchange (or similar) to alter a single bit.

How should I approach this if Interlocked doesn’t have an overload for “bit”?

  • 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-06-15T05:31:12+00:00Added an answer on June 15, 2026 at 5:31 am

    You can fake it with Interlocked.CompareExchange(ref int, int, int) in a loop, but I don’t think it would be more efficient:

    private static void SetBit(ref int valueToUpdate, int bitToSet)
    {
       while (true)
       {
          int oldValue = valueToUpdate;
          int newValue = oldValue | bitToSet;
          int result = Interlocked.CompareExchange(ref valueToUpdate, newValue, oldValue);
          if (result == oldValue) break;
       }
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have an array of sorted ints with a 1,000 or more values (could
I have an array of ints like this: [32,128,1024,2048,4096] Given a specific value, I
I have a huge array of ints that I need to sort. The catch
I have an array of pointers that point to arrays of ints. I have
I have an array of ints (e.g. 0, 2, 4, 7). Each value from
I have a table that contains an array of ints (we'll call it lineTable).
I have an array of 6 ints that I am interested in getting a
I have an MxN array of ints representing colors (say RGBA format, but that
I have a long array of ints that need to be converted to string.
I have an array of ints called SelectedItems . I have another array that

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.