13 writes to _count
PresentationCore (13)
Core\CSharp\System\Windows\Media\Animation\TimeIntervalCollection.cs (13)
116_count = 0; 148_count = 1; 191_count = 1; 218_count = 2; 238_count = 0; 1262projection._count++; 1275projection._count++; 1293projection._count++; 1515_count = 2; 1579_count--; 1600_count++; 1628_count = 2; 1756_count += netIncreaseInNodes; // Update the array size
48 references to _count
PresentationCore (48)
Core\CSharp\System\Windows\Media\Animation\TimeIntervalCollection.cs (48)
195Debug.Assert(_count == 0); // The boolean constructor already did the job for us 248return (_count < 2) || (_count == 2 && _nodeIsInterval[0]); 257Debug.Assert(_count > 0); 279if (_count < 2 || slipTime > _nodeTime[1] - _nodeTime[0]) 305Debug.Assert(0 < _count && _count <= 2); 307if (_count == 1) 908while (_current < _count) 992if (_count < 2 // If we have 0-1 real points, no intersection with multiple periods is possible 1011TimeSpan lastNodeTime = _nodeTime[_count - 1]; 1044Debug.Assert(!_nodeIsInterval[_count - 1]); // We should not have an infinite domain set 1167Debug.Assert(_nodeTime[_count - 1] >= beginTime); // Our last node must come at least at begin time (since we must intersect the active period) 1170Debug.Assert(!_nodeIsInterval[_count - 1]); // We should not have an infinite domain set 1180&& (_nodeTime[_count - 1] > endTime.Value + fillDuration.TimeSpan // ...we intersect space after endTime+fill, or... 1181|| (_nodeTime[_count - 1] == endTime.Value + fillDuration.TimeSpan // ...as we fall right onto the end of fill zone... 1182&& _nodeIsPoint[_count - 1] && (endTime > beginTime || fillDuration.TimeSpan > TimeSpan.Zero)))); // ...we may have a point intersection with the stopped zone 1271while(_current < _count && (!endTime.HasValue || CurrentNodeTime < endTime)) // Copy the main set of segments, transforming them 1285if (_current < _count // We have an interval reaching beyond the active zone, clip that interval 1341} while (!quitFlag && (_current < _count)); 1573for (int n = index; n + 1 < _count; n++) // Shift over the contents 1588EnsureAllocatedCapacity(_count + 1); 1590for (int n = _count - 1; n > index; n--) // Shift over the contents 1733Debug.Assert(_count + netIncreaseInNodes >= 2); // We should never shrink past size 2 1737EnsureAllocatedCapacity(_count + netIncreaseInNodes); // Make sure we have enough space allocated 1738for (int n = _count - 1; n > lastNodeToDelete; n--) 1748for (int n = lastNodeToDelete + 1; n < _count; n++) 1799for (int n = 0; n < _count; n++) 1837while (_current < _count && CurrentNodeTime < accelEnd) 1845while (_current < _count && CurrentNodeTime <= decelStart) // We bias the edge points towards the simpler linear computation, which yields the same result 1853while (_current < _count) 2131if (_count == 0 || time < _nodeTime[0]) 2137Debug.Assert(_count > 0); // Count cannot be negative 2141int right = _count - 1; 2163Debug.Assert(right == _count - 1); 2173return (_count == 0); 2181return (_count == 0 && !_containsNullPoint); 2193Debug.Assert(_current <= _count); 2200return (_current + 1 == _count); 2208Debug.Assert(_current < _count); 2213Debug.Assert(_current < _count); 2222Debug.Assert(_current < _count); 2227Debug.Assert(_current < _count); 2236Debug.Assert(_current < _count); 2241Debug.Assert(_current < _count); 2250Debug.Assert(_current + 1 < _count); 2259Debug.Assert(_current + 1 < _count); 2268Debug.Assert(_current + 1 < _count);