Searched refs:fVertex (Results 1 – 3 of 3) sorted by relevance
| /external/skqp/modules/skottie/src/ |
| D | SkottieValue.cpp | 200 lerp_point(v0.fVertices[i].fVertex , v1.fVertices[i].fVertex , t2f) in Lerp()
214 path.moveTo(shape.fVertices.front().fVertex); in As()
218 const auto c0 = shape.fVertices[from].fVertex + shape.fVertices[from].fOutPoint, in As()
219 c1 = shape.fVertices[to].fVertex + shape.fVertices[to].fInPoint; in As()
221 if (c0 == shape.fVertices[from].fVertex && in As()
222 c1 == shape.fVertices[to].fVertex) { in As()
226 path.lineTo(shape.fVertices[to].fVertex); in As()
228 path.cubicTo(c0, c1, shape.fVertices[to].fVertex); in As()
|
| D | SkottieValue.h | 45 fVertex; member
50 && fVertex == other.fVertex;
|
| /external/skia/src/gpu/ |
| D | GrAATriangulator.cpp | 39 SSVertex(Vertex* v) : fVertex(v), fPrev(nullptr), fNext(nullptr) {} in SSVertex()
40 Vertex* fVertex; member
65 Vertex* prev = e->fPrev->fVertex; in makeEvent()
66 Vertex* next = e->fNext->fVertex; in makeEvent()
128 edge->fPrev->fVertex->fID, in dump_skel()
129 edge->fNext->fVertex->fID); in dump_skel()
250 Vertex* prev = fEdge->fPrev->fVertex; in apply()
251 Vertex* next = fEdge->fNext->fVertex; in apply()
281 triangulator->connectSSEdge(prevEdge->fPrev->fVertex, dest, c); in apply()
290 triangulator->makeEvent(prevEdge, prevEdge->fPrev->fVertex, nextEdge, dest, events, c); in apply()
[all …]
|