13 writes to _count
PresentationCore (13)
System\Windows\Media\Animation\TimeIntervalCollection.cs (13)
110
_count
= 0;
142
_count
= 1;
185
_count
= 1;
212
_count
= 2;
232
_count
= 0;
1256
projection.
_count
++;
1269
projection.
_count
++;
1287
projection.
_count
++;
1508
_count
= 2;
1572
_count
--;
1593
_count
++;
1621
_count
= 2;
1749
_count
+= netIncreaseInNodes; // Update the array size
48 references to _count
PresentationCore (48)
System\Windows\Media\Animation\TimeIntervalCollection.cs (48)
189
Debug.Assert(
_count
== 0); // The boolean constructor already did the job for us
242
return (
_count
< 2) || (
_count
== 2 && _nodeIsInterval[0]);
251
Debug.Assert(
_count
> 0);
273
if (
_count
< 2 || slipTime > _nodeTime[1] - _nodeTime[0])
299
Debug.Assert(0 <
_count
&&
_count
<= 2);
301
if (
_count
== 1)
902
while (_current <
_count
)
986
if (
_count
< 2 // If we have 0-1 real points, no intersection with multiple periods is possible
1005
TimeSpan lastNodeTime = _nodeTime[
_count
- 1];
1038
Debug.Assert(!_nodeIsInterval[
_count
- 1]); // We should not have an infinite domain set
1161
Debug.Assert(_nodeTime[
_count
- 1] >= beginTime); // Our last node must come at least at begin time (since we must intersect the active period)
1164
Debug.Assert(!_nodeIsInterval[
_count
- 1]); // We should not have an infinite domain set
1174
&& (_nodeTime[
_count
- 1] > endTime.Value + fillDuration.TimeSpan // ...we intersect space after endTime+fill, or...
1175
|| (_nodeTime[
_count
- 1] == endTime.Value + fillDuration.TimeSpan // ...as we fall right onto the end of fill zone...
1176
&& _nodeIsPoint[
_count
- 1] && (endTime > beginTime || fillDuration.TimeSpan > TimeSpan.Zero)))); // ...we may have a point intersection with the stopped zone
1265
while(_current <
_count
&& (!endTime.HasValue || CurrentNodeTime < endTime)) // Copy the main set of segments, transforming them
1279
if (_current <
_count
// We have an interval reaching beyond the active zone, clip that interval
1334
} while (!quitFlag && (_current <
_count
));
1566
for (int n = index; n + 1 <
_count
; n++) // Shift over the contents
1581
EnsureAllocatedCapacity(
_count
+ 1);
1583
for (int n =
_count
- 1; n > index; n--) // Shift over the contents
1726
Debug.Assert(
_count
+ netIncreaseInNodes >= 2); // We should never shrink past size 2
1730
EnsureAllocatedCapacity(
_count
+ netIncreaseInNodes); // Make sure we have enough space allocated
1731
for (int n =
_count
- 1; n > lastNodeToDelete; n--)
1741
for (int n = lastNodeToDelete + 1; n <
_count
; n++)
1792
for (int n = 0; n <
_count
; n++)
1830
while (_current <
_count
&& CurrentNodeTime < accelEnd)
1838
while (_current <
_count
&& CurrentNodeTime <= decelStart) // We bias the edge points towards the simpler linear computation, which yields the same result
1846
while (_current <
_count
)
2124
if (
_count
== 0 || time < _nodeTime[0])
2130
Debug.Assert(
_count
> 0); // Count cannot be negative
2134
int right =
_count
- 1;
2156
Debug.Assert(right ==
_count
- 1);
2166
return (
_count
== 0);
2174
return (
_count
== 0 && !_containsNullPoint);
2186
Debug.Assert(_current <=
_count
);
2193
return (_current + 1 ==
_count
);
2201
Debug.Assert(_current <
_count
);
2206
Debug.Assert(_current <
_count
);
2215
Debug.Assert(_current <
_count
);
2220
Debug.Assert(_current <
_count
);
2229
Debug.Assert(_current <
_count
);
2234
Debug.Assert(_current <
_count
);
2243
Debug.Assert(_current + 1 <
_count
);
2252
Debug.Assert(_current + 1 <
_count
);
2261
Debug.Assert(_current + 1 <
_count
);