3 writes to bits
System.Xml (3)
System\Xml\Schema\BitSet.cs (3)
25
bits
= new uint[Subscript(count + bitSlotMask)];
172
newset.
bits
= (uint[])bits.Clone();
210
bits
= newBits;
35 references to bits
System.Xml (35)
System\Xml\Schema\BitSet.cs (35)
39
int bitsLength =
bits
.Length;
41
bits
[i] = 0;
48
bits
[nBitSlot] &= ~((uint)1 << (index & bitSlotMask));
54
bits
[nBitSlot] |= (uint)1 << (index & bitSlotMask);
62
fResult = ((
bits
[nBitSlot] & (1 << (index & bitSlotMask))) != 0);
75
uint word =
bits
[nBitSlot] >> offset;
78
if ((++ nBitSlot) ==
bits
.Length ) {
82
word =
bits
[nBitSlot];
102
int bitsLength =
bits
.Length;
103
int setLength = other.
bits
.Length;
106
bits
[i] &= other.
bits
[i];
109
bits
[n] = 0;
118
int setLength = other.
bits
.Length;
121
bits
[i] |= other.
bits
[i];
127
for (int i =
bits
.Length; --i >= 0;) {
128
h ^= (int)
bits
[i] * (i + 1);
142
int bitsLength =
bits
.Length;
143
int setLength = other.
bits
.Length;
146
if (
bits
[i] != other.
bits
[i]) {
152
if (
bits
[i] != 0) {
159
if (other.
bits
[i] != 0) {
172
newset.bits = (uint[])
bits
.Clone();
180
for (int i = 0; i <
bits
.Length; i++) {
181
k |=
bits
[i];
188
int i = Math.Min(this.
bits
.Length, other.
bits
.Length);
190
if ((this.
bits
[i] & other.
bits
[i]) != 0) {
203
if (nRequiredLength >
bits
.Length) {
205
int request = 2 *
bits
.Length;
209
Array.Copy(
bits
, newBits,
bits
.Length);