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.Not method inverts all the bit values in the current BitArray, so that elements set to true are changed to false, and elements set to false are changed to true.
- 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 System.Collections.BitArray Not ();
Return Value: It returns the current instance with inverted bit values.
Values in BitArray myBitArr1 are : False False True True Values in BitArray myBitArr2 are : False True False True Values in BitArray myBitArr1 are : True True False False Values in BitArray myBitArr2 are : True False True False
Note: This method is an O(n) operation, where n is Count.
- C# | BitArray Class
- C# | Set all bits in the BitArray to the specified value
- C# | Get value of the bit at a specific position in BitArray
- C# | Get or set the number of elements in the BitArray
- C# | Set the bit at a specific position in the BitArray to the specified value
- C# | Enumerator that iterates through the BitArray
- C# | Bitwise AND between the elements of BitArray
- C# | Check if the BitArray is read-only
- C# | Number of elements contained in the BitArray
- BitArray.LeftShift() Method in C# with Examples
- BitArray.RightShift() Method in C# with Examples
- C# | How to create a shallow copy of the BitArray
- How to create a shallow copy of BitArray in C#
- C# | Check if two BitArray objects are equal
- C# | Gets or sets the value of the bit at a specific position in the BitArray
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.