4 writes to _nodeTime
PresentationCore (4)
System\Windows\Media\Animation\TimeIntervalCollection.cs (4)
119_nodeTime = null; 230_nodeTime = null; 1782_nodeTime = new TimeSpan[requiredCapacity]; 1804_nodeTime = newNodeTime;
65 references to _nodeTime
PresentationCore (65)
System\Windows\Media\Animation\TimeIntervalCollection.cs (65)
142_nodeTime[0] = point; 183_nodeTime[0] = from; 204_nodeTime[1] = to; 209_nodeTime[0] = to; 213_nodeTime[1] = from; 228if (_nodeTime != null && _nodeTime.Length > _minimumCapacity) 257return _nodeTime[0]; 278if (_count < 2 || slipTime > _nodeTime[1] - _nodeTime[0]) 287slippedCollection = new TimeIntervalCollection(_nodeTime[0] + slipTime, _nodeIsPoint[0], 288_nodeTime[1] , _nodeIsPoint[1]); 308return new TimeIntervalCollection(_nodeTime[0], _nodeIsPoint[0], 313Debug.Assert(beginTime <= _nodeTime[1]); 315_nodeTime[1], _nodeIsPoint[1]); 411else if (_nodeTime[index] == time) // Queried time falls exactly onto a node 417Debug.Assert(_nodeTime[index] < time); 563return (to > _nodeTime[toIndex]) || (fromIndex >= 0 && _nodeIsInterval[fromIndex]); 825this._nodeTime[0] < other._nodeTime[0]) // Neither TIC is empty, and we start first; this means the inverted "other" by necessity 1010TimeSpan lastNodeTime = _nodeTime[_count - 1]; 1165Debug.Assert(!endTime.HasValue || endTime >= _nodeTime[0]); // EndTime must come at or after our first node (it can be infinite) 1166Debug.Assert(_nodeTime[_count - 1] >= beginTime); // Our last node must come at least at begin time (since we must intersect the active period) 1176|| _nodeTime[0] < beginTime // If we intersect space before beginTime, or... 1179&& (_nodeTime[_count - 1] > endTime.Value + fillDuration.TimeSpan // ...we intersect space after endTime+fill, or... 1180|| (_nodeTime[_count - 1] == endTime.Value + fillDuration.TimeSpan // ...as we fall right onto the end of fill zone... 1246projection.EnsureAllocatedCapacity(this._nodeTime.Length); 1505projection._nodeTime[0] = TimeSpan.Zero; 1509projection._nodeTime[1] = TimeSpan.FromTicks(periodInTicks); 1560if (index >= 0 && _nodeTime[index] == point) // Point coincides with an existing node 1573_nodeTime[n] = _nodeTime[n + 1]; 1583Debug.Assert(index == -1 || _nodeTime[index] < point); 1590_nodeTime[n + 1] = _nodeTime[n]; 1594_nodeTime[index + 1] = point; // Insert the node 1618_nodeTime[0] = from; 1622_nodeTime[1] = to; 1630Debug.Assert(_nodeTime.Length >= _minimumCapacity); // Assert that we indeed have memory allocated 1656if (fromIndex == -1 || _nodeTime[fromIndex] < from) // We don't fall exactly onto a preexisting node 1668Debug.Assert(_nodeTime[fromIndex] == from); 1686if (toIndex == -1 || _nodeTime[toIndex] < to) // We don't fall exactly onto a preexisting node 1699Debug.Assert(_nodeTime[toIndex] == to); 1738_nodeTime[n + netIncreaseInNodes] = _nodeTime[n]; 1748_nodeTime[n + netIncreaseInNodes] = _nodeTime[n]; // Note that netIncreaseInNodes is negative here 1758_nodeTime[nextInsertionIndex] = from; 1767_nodeTime[nextInsertionIndex] = to; 1777if (_nodeTime == null) 1786else if (_nodeTime.Length < requiredCapacity) // We may need to grow by up to 2 units 1791int newCapacity = _nodeTime.Length << 1; // Dynamically grow by a factor of 2 1799newNodeTime[n] = _nodeTime[n]; 1837t = (double)_nodeTime[_current].Ticks; 1838_nodeTime[_current] = TimeSpan.FromTicks((long)(halfMaxRate * inversePeriod * t * t / accelRatio)); 1845t = (double)_nodeTime[_current].Ticks; 1846_nodeTime[_current] = TimeSpan.FromTicks((long)(halfMaxRate * (2 * t - (accelRatio * dpPeriod)))); 1853t = (double)(periodInTicks - _nodeTime[_current].Ticks); // We actually use the complement from 100% progress 1854_nodeTime[_current] = TimeSpan.FromTicks(periodInTicks - (long)(halfMaxRate * inversePeriod * t * t / decelRatio)); 2129if (_count == 0 || time < _nodeTime[0]) 2145if (time < _nodeTime[current]) 2155if (time < _nodeTime[right]) 2207return _nodeTime[_current]; 2212_nodeTime[_current] = value; 2249return _nodeTime[_current + 1];