HomeSort by relevance Sort by last modified time
    Searched full:firstpt (Results 1 - 4 of 4) sorted by null

  /external/skia/experimental/StrokePathRenderer/
GrStrokePathRenderer.cpp 126 SkPoint *firstPt = verts, *lastPt = NULL;
243 firstPt[idx0] = miterPt[0];
244 firstPt[idx1] = miterPt[1];
274 firstPt[0] -= firstDir;
275 firstPt[1] -= firstDir;
  /external/skia/tests/
PathOpsExtendedTest.cpp 56 SkPoint firstPt = {0, 0}, lastPt = {0, 0};
62 if (firstPtSet && lastPtSet && firstPt != lastPt) {
64 firstPt.fX, firstPt.fY);
67 firstPt = pts[0];
97 if (firstPtSet && lastPtSet && firstPt != lastPt) {
99 firstPt.fX, firstPt.fY);
108 if (firstPtSet && lastPtSet && firstPt != lastPt) {
110 firstPt.fX, firstPt.fY)
    [all...]
  /external/fonttools/Lib/fontTools/ttLib/tables/
_g_l_y_f.py 633 if hasattr(compo, "firstPt"):
635 x1,y1 = allCoords[compo.firstPt]
797 # XXX Ignoring self.firstPt & self.lastpt for now: I need to implement
822 self.firstPt, self.secondPt = int(x), int(y)
829 self.firstPt, self.secondPt = int(x), int(y)
865 if hasattr(self, "firstPt"):
866 if (0 <= self.firstPt <= 255) and (0 <= self.secondPt <= 255):
867 data = data + struct.pack(">BB", self.firstPt, self.secondPt)
869 data = data + struct.pack(">HH", self.firstPt, self.secondPt)
900 if not hasattr(self, "firstPt")
    [all...]
  /external/skia/src/core/
SkPath.cpp 229 SkPoint firstPt;
244 firstPt = prevPt = pts[0];
291 return check_edge_against_rect(prevPt, firstPt, rect, direction);
    [all...]

Completed in 325 milliseconds