13 writes to _count
PresentationCore (13)
System\Windows\Media\Animation\TimeIntervalCollection.cs (13)
109_count = 0; 141_count = 1; 184_count = 1; 211_count = 2; 231_count = 0; 1255projection._count++; 1268projection._count++; 1286projection._count++; 1507_count = 2; 1571_count--; 1592_count++; 1620_count = 2; 1748_count += netIncreaseInNodes; // Update the array size
48 references to _count
PresentationCore (48)
System\Windows\Media\Animation\TimeIntervalCollection.cs (48)
188Debug.Assert(_count == 0); // The boolean constructor already did the job for us 241return (_count < 2) || (_count == 2 && _nodeIsInterval[0]); 250Debug.Assert(_count > 0); 272if (_count < 2 || slipTime > _nodeTime[1] - _nodeTime[0]) 298Debug.Assert(0 < _count && _count <= 2); 300if (_count == 1) 901while (_current < _count) 985if (_count < 2 // If we have 0-1 real points, no intersection with multiple periods is possible 1004TimeSpan lastNodeTime = _nodeTime[_count - 1]; 1037Debug.Assert(!_nodeIsInterval[_count - 1]); // We should not have an infinite domain set 1160Debug.Assert(_nodeTime[_count - 1] >= beginTime); // Our last node must come at least at begin time (since we must intersect the active period) 1163Debug.Assert(!_nodeIsInterval[_count - 1]); // We should not have an infinite domain set 1173&& (_nodeTime[_count - 1] > endTime.Value + fillDuration.TimeSpan // ...we intersect space after endTime+fill, or... 1174|| (_nodeTime[_count - 1] == endTime.Value + fillDuration.TimeSpan // ...as we fall right onto the end of fill zone... 1175&& _nodeIsPoint[_count - 1] && (endTime > beginTime || fillDuration.TimeSpan > TimeSpan.Zero)))); // ...we may have a point intersection with the stopped zone 1264while(_current < _count && (!endTime.HasValue || CurrentNodeTime < endTime)) // Copy the main set of segments, transforming them 1278if (_current < _count // We have an interval reaching beyond the active zone, clip that interval 1333} while (!quitFlag && (_current < _count)); 1565for (int n = index; n + 1 < _count; n++) // Shift over the contents 1580EnsureAllocatedCapacity(_count + 1); 1582for (int n = _count - 1; n > index; n--) // Shift over the contents 1725Debug.Assert(_count + netIncreaseInNodes >= 2); // We should never shrink past size 2 1729EnsureAllocatedCapacity(_count + netIncreaseInNodes); // Make sure we have enough space allocated 1730for (int n = _count - 1; n > lastNodeToDelete; n--) 1740for (int n = lastNodeToDelete + 1; n < _count; n++) 1791for (int n = 0; n < _count; n++) 1829while (_current < _count && CurrentNodeTime < accelEnd) 1837while (_current < _count && CurrentNodeTime <= decelStart) // We bias the edge points towards the simpler linear computation, which yields the same result 1845while (_current < _count) 2123if (_count == 0 || time < _nodeTime[0]) 2129Debug.Assert(_count > 0); // Count cannot be negative 2133int right = _count - 1; 2155Debug.Assert(right == _count - 1); 2165return (_count == 0); 2173return (_count == 0 && !_containsNullPoint); 2185Debug.Assert(_current <= _count); 2192return (_current + 1 == _count); 2200Debug.Assert(_current < _count); 2205Debug.Assert(_current < _count); 2214Debug.Assert(_current < _count); 2219Debug.Assert(_current < _count); 2228Debug.Assert(_current < _count); 2233Debug.Assert(_current < _count); 2242Debug.Assert(_current + 1 < _count); 2251Debug.Assert(_current + 1 < _count); 2260Debug.Assert(_current + 1 < _count);