1 write to _vertices
PresentationCore (1)
Core\CSharp\MS\Internal\Ink\StrokeNodeOperations.cs (1)
53_vertices = nodeShape.GetVerticesAsVectors();
56 references to _vertices
PresentationCore (56)
Core\CSharp\MS\Internal\Ink\StrokeNodeOperations.cs (56)
72for (i = 0; (i + 1) < _vertices.Length; i += 2) 74_shapeBounds.Union(new Rect((Point)_vertices[i], (Point)_vertices[i + 1])); 76if (i < _vertices.Length) 78_shapeBounds.Union((Point)_vertices[i]); 105for (int i = 0; i < _vertices.Length; i++) 107pointBuffer.Add(node.Position + _vertices[i]); 112for (int i = 0; i < _vertices.Length; i++) 114pointBuffer.Add(node.Position + (_vertices[i] * pressureFactor)); 133Point vertex = node.Position + (_vertices[_vertices.Length - 1] * node.PressureFactor); 134for (int i = 0; i < _vertices.Length; i++) 136Point nextVertex = node.Position + (_vertices[i] * node.PressureFactor); 145for (int i = 0, count = _vertices.Length; i < count; i++) 147Point vertex = node.Position + (_vertices[i] * node.PressureFactor); 153Point nextVertex = node.Position + (_vertices[i] * node.PressureFactor); 214int count = _vertices.Length; 218Vector connection = spine + _vertices[i] * pressureDelta; 233HitResult goingTo = WhereIsVectorAboutVector(connection, _vertices[(i + 1) % count] - _vertices[i]); 240HitResult comingFrom = WhereIsVectorAboutVector(_vertices[i] - _vertices[j], connection); 244quad.A = beginNode.Position + _vertices[i] * beginNode.PressureFactor; 245quad.B = endNode.Position + _vertices[i] * endNode.PressureFactor; 259HitResult comingFrom = WhereIsVectorAboutVector(_vertices[i] - _vertices[j], connection); 263quad.C = endNode.Position + _vertices[i] * endNode.PressureFactor; 264quad.D = beginNode.Position + _vertices[i] * beginNode.PressureFactor; 331return HitTestPolygonSegment(_vertices, hitBegin, hitEnd); 361int i = 0, count = _vertices.Length; 365vertex = _vertices[i] * pressureFactor; 386count = _vertices.Length; 389i = (i + 1) % _vertices.Length; 390Vector nextVertex = (pressureFactor == 1) ? _vertices[i] : (_vertices[i] * pressureFactor); 420count = _vertices.Length; 421while (((endNode.Position + _vertices[i] * pressureFactor) != quad.B) && (count != 0)) 423i = (i + 1) % _vertices.Length; 498if (true == HitTestPolygonSegment(_vertices, hitBegin, hitEnd)) 711Vector lastVertex = _vertices[_vertices.Length - 1]; 721for (int k = 0, count = _vertices.Length; k < count || (k == count && testNextEdge); k++) 723Vector vertex = _vertices[k % count]; 933return _vertices; 983if (true == HitTestPolygonCircle(_vertices, hitCenter, hitRadius)) 1008if (true == HitTestPolygonSegment(_vertices, hitBegin, hitEnd)) 1095int i = 0, count = _vertices.Length; 1099vertex = _vertices[i] * pressureFactor; 1110count = _vertices.Length; 1121i = (i + 1) % _vertices.Length; 1122Vector nextVertex = _vertices[i] * pressureFactor; 1161count = _vertices.Length; 1162while (!DoubleUtil.AreClose((endNode.Position + _vertices[i] * pressureFactor), quad.B) && (count != 0)) 1164i = (i + 1) % _vertices.Length; 1246? HitTestPolygonCircle(_vertices, hitBegin, hitEnd) 1247: HitTestPolygonSegment(_vertices, hitBegin, hitEnd))