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; 1256projection._count++; 1269projection._count++; 1287projection._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)
189Debug.Assert(_count == 0); // The boolean constructor already did the job for us 242return (_count < 2) || (_count == 2 && _nodeIsInterval[0]); 251Debug.Assert(_count > 0); 273if (_count < 2 || slipTime > _nodeTime[1] - _nodeTime[0]) 299Debug.Assert(0 < _count && _count <= 2); 301if (_count == 1) 902while (_current < _count) 986if (_count < 2 // If we have 0-1 real points, no intersection with multiple periods is possible 1005TimeSpan lastNodeTime = _nodeTime[_count - 1]; 1038Debug.Assert(!_nodeIsInterval[_count - 1]); // We should not have an infinite domain set 1161Debug.Assert(_nodeTime[_count - 1] >= beginTime); // Our last node must come at least at begin time (since we must intersect the active period) 1164Debug.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 1265while(_current < _count && (!endTime.HasValue || CurrentNodeTime < endTime)) // Copy the main set of segments, transforming them 1279if (_current < _count // We have an interval reaching beyond the active zone, clip that interval 1334} while (!quitFlag && (_current < _count)); 1566for (int n = index; n + 1 < _count; n++) // Shift over the contents 1581EnsureAllocatedCapacity(_count + 1); 1583for (int n = _count - 1; n > index; n--) // Shift over the contents 1726Debug.Assert(_count + netIncreaseInNodes >= 2); // We should never shrink past size 2 1730EnsureAllocatedCapacity(_count + netIncreaseInNodes); // Make sure we have enough space allocated 1731for (int n = _count - 1; n > lastNodeToDelete; n--) 1741for (int n = lastNodeToDelete + 1; n < _count; n++) 1792for (int n = 0; n < _count; n++) 1830while (_current < _count && CurrentNodeTime < accelEnd) 1838while (_current < _count && CurrentNodeTime <= decelStart) // We bias the edge points towards the simpler linear computation, which yields the same result 1846while (_current < _count) 2124if (_count == 0 || time < _nodeTime[0]) 2130Debug.Assert(_count > 0); // Count cannot be negative 2134int right = _count - 1; 2156Debug.Assert(right == _count - 1); 2166return (_count == 0); 2174return (_count == 0 && !_containsNullPoint); 2186Debug.Assert(_current <= _count); 2193return (_current + 1 == _count); 2201Debug.Assert(_current < _count); 2206Debug.Assert(_current < _count); 2215Debug.Assert(_current < _count); 2220Debug.Assert(_current < _count); 2229Debug.Assert(_current < _count); 2234Debug.Assert(_current < _count); 2243Debug.Assert(_current + 1 < _count); 2252Debug.Assert(_current + 1 < _count); 2261Debug.Assert(_current + 1 < _count);