C# | Check if the BitArray is synchronized (thread safe)

The BitArray class manages a compact array of bit values, which are represented as Booleans, where true indicates that the bit is on i.e, 1 and false indicates the bit is off i.e, 0. This class is contained in System.Collections namespace.
BitArray.IsSynchronized property is used to get a value indicating whether access to the BitArray is synchronized (thread safe) or not.

Properties:

  • The BitArray class is a collection class in which the capacity is always the same as the count.
  • Elements are added to a BitArray by increasing the Length property.
  • Elements are deleted by decreasing the Length property.
  • Elements in this collection can be accessed using an integer index. Indexes in this collection are zero-based.

Syntax:

public bool IsSynchronized { get; }

Return Value: This property is always false.

Example:

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# code to check if the BitArray
// is synchronized (thread safe)
using System;
using System.Collections;
  
class GFG {
  
    // Driver code
    public static void Main()
    {
  
        // Creating a BitArray
        BitArray myBitArr = new BitArray(7, true);
  
        // The following code example shows how
        // to lock the collection using the SyncRoot
        // during the entire enumeration.
        lock(myBitArr.SyncRoot)
        {
            foreach(object item in myBitArr)
            {
                // Insert your code here.
                Console.WriteLine("GeeksforGeeks");
            }
        }
    }
}

chevron_right


Output:

GeeksforGeeks
GeeksforGeeks
GeeksforGeeks
GeeksforGeeks
GeeksforGeeks
GeeksforGeeks
GeeksforGeeks

Note: This method is an O(1) operation.

Reference:



My Personal Notes arrow_drop_up

In love with a semicolon because sometimes i miss it so badly)

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.