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.SetAll(Boolean) method is used to set all bits in the BitArray to the specified value.
- 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.
public void SetAll (bool value);
Here, value is the Boolean value to assign to all bits.
Note: This method is an O(n) operation, where n is Count.
Below programs illustrate the use of BitArray.SetAll(Boolean) method:
Initially the bits are as : False False False False False Finally the bits are as : True True True True True
Initially the bits are as : False True True False True Finally the bits are as : False False False False False
- C# | BitArray Class
- C# | Bitwise AND between the elements of BitArray
- C# | Get value of the bit at a specific position in BitArray
- C# | Inverting all bit values in BitArray
- C# | Get or set the number of elements in the BitArray
- C# | Enumerator that iterates through the BitArray
- C# | Set the bit at a specific position in the BitArray to the specified value
- C# | Check if the BitArray is read-only
- C# | Check if two BitArray objects are equal
- C# | Number of elements contained in the BitArray
- C# | Gets or sets the value of the bit at a specific position in the BitArray
- BitArray.RightShift() Method in C# with Examples
- C# | How to create a shallow copy of the BitArray
- BitArray.LeftShift() Method in C# with Examples
- How to create a shallow copy of BitArray in C#
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.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.