4 writes to _nodeTime
PresentationCore (4)
Core\CSharp\System\Windows\Media\Animation\TimeIntervalCollection.cs (4)
120_nodeTime = null; 231_nodeTime = null; 1784_nodeTime = new TimeSpan[requiredCapacity]; 1806_nodeTime = newNodeTime;
65 references to _nodeTime
PresentationCore (65)
Core\CSharp\System\Windows\Media\Animation\TimeIntervalCollection.cs (65)
143_nodeTime[0] = point; 184_nodeTime[0] = from; 205_nodeTime[1] = to; 210_nodeTime[0] = to; 214_nodeTime[1] = from; 229if (_nodeTime != null && _nodeTime.Length > _minimumCapacity) 258return _nodeTime[0]; 279if (_count < 2 || slipTime > _nodeTime[1] - _nodeTime[0]) 288slippedCollection = new TimeIntervalCollection(_nodeTime[0] + slipTime, _nodeIsPoint[0], 289_nodeTime[1] , _nodeIsPoint[1]); 309return new TimeIntervalCollection(_nodeTime[0], _nodeIsPoint[0], 314Debug.Assert(beginTime <= _nodeTime[1]); 316_nodeTime[1], _nodeIsPoint[1]); 412else if (_nodeTime[index] == time) // Queried time falls exactly onto a node 418Debug.Assert(_nodeTime[index] < time); 564return (to > _nodeTime[toIndex]) || (fromIndex >= 0 && _nodeIsInterval[fromIndex]); 826this._nodeTime[0] < other._nodeTime[0]) // Neither TIC is empty, and we start first; this means the inverted "other" by necessity 1011TimeSpan lastNodeTime = _nodeTime[_count - 1]; 1166Debug.Assert(!endTime.HasValue || endTime >= _nodeTime[0]); // EndTime must come at or after our first node (it can be infinite) 1167Debug.Assert(_nodeTime[_count - 1] >= beginTime); // Our last node must come at least at begin time (since we must intersect the active period) 1177|| _nodeTime[0] < beginTime // If we intersect space before beginTime, or... 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... 1247projection.EnsureAllocatedCapacity(this._nodeTime.Length); 1507projection._nodeTime[0] = TimeSpan.Zero; 1511projection._nodeTime[1] = TimeSpan.FromTicks(periodInTicks); 1562if (index >= 0 && _nodeTime[index] == point) // Point coincides with an existing node 1575_nodeTime[n] = _nodeTime[n + 1]; 1585Debug.Assert(index == -1 || _nodeTime[index] < point); 1592_nodeTime[n + 1] = _nodeTime[n]; 1596_nodeTime[index + 1] = point; // Insert the node 1620_nodeTime[0] = from; 1624_nodeTime[1] = to; 1632Debug.Assert(_nodeTime.Length >= _minimumCapacity); // Assert that we indeed have memory allocated 1658if (fromIndex == -1 || _nodeTime[fromIndex] < from) // We don't fall exactly onto a preexisting node 1670Debug.Assert(_nodeTime[fromIndex] == from); 1688if (toIndex == -1 || _nodeTime[toIndex] < to) // We don't fall exactly onto a preexisting node 1701Debug.Assert(_nodeTime[toIndex] == to); 1740_nodeTime[n + netIncreaseInNodes] = _nodeTime[n]; 1750_nodeTime[n + netIncreaseInNodes] = _nodeTime[n]; // Note that netIncreaseInNodes is negative here 1760_nodeTime[nextInsertionIndex] = from; 1769_nodeTime[nextInsertionIndex] = to; 1779if (_nodeTime == null) 1788else if (_nodeTime.Length < requiredCapacity) // We may need to grow by up to 2 units 1793int newCapacity = _nodeTime.Length << 1; // Dynamically grow by a factor of 2 1801newNodeTime[n] = _nodeTime[n]; 1839t = (double)_nodeTime[_current].Ticks; 1840_nodeTime[_current] = TimeSpan.FromTicks((long)(halfMaxRate * inversePeriod * t * t / accelRatio)); 1847t = (double)_nodeTime[_current].Ticks; 1848_nodeTime[_current] = TimeSpan.FromTicks((long)(halfMaxRate * (2 * t - (accelRatio * dpPeriod)))); 1855t = (double)(periodInTicks - _nodeTime[_current].Ticks); // We actually use the complement from 100% progress 1856_nodeTime[_current] = TimeSpan.FromTicks(periodInTicks - (long)(halfMaxRate * inversePeriod * t * t / decelRatio)); 2131if (_count == 0 || time < _nodeTime[0]) 2147if (time < _nodeTime[current]) 2157if (time < _nodeTime[right]) 2209return _nodeTime[_current]; 2214_nodeTime[_current] = value; 2251return _nodeTime[_current + 1];