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

  /external/chromium_org/third_party/skia/experimental/Intersection/
LineIntersection.cpp 19 double bxLen = b[1].x - b[0].x;
21 double denom = byLen * axLen - ayLen * bxLen;
25 p.x = (term1 * bxLen - axLen * term2) / denom;
46 double bxLen = b[1].x - b[0].x;
49 axLen / ayLen == bxLen / byLen
50 (ayLen * byLen) * axLen / ayLen == (ayLen * byLen) * bxLen / byLen
51 byLen * axLen == ayLen * bxLen
52 byLen * axLen - ayLen * bxLen == 0 ( == denom )
54 double denom = byLen * axLen - ayLen * bxLen;
57 double numerA = ab0y * bxLen - byLen * ab0x
    [all...]
  /external/skia/experimental/Intersection/
LineIntersection.cpp 19 double bxLen = b[1].x - b[0].x;
21 double denom = byLen * axLen - ayLen * bxLen;
25 p.x = (term1 * bxLen - axLen * term2) / denom;
46 double bxLen = b[1].x - b[0].x;
49 axLen / ayLen == bxLen / byLen
50 (ayLen * byLen) * axLen / ayLen == (ayLen * byLen) * bxLen / byLen
51 byLen * axLen == ayLen * bxLen
52 byLen * axLen - ayLen * bxLen == 0 ( == denom )
54 double denom = byLen * axLen - ayLen * bxLen;
57 double numerA = ab0y * bxLen - byLen * ab0x
    [all...]
  /external/chromium_org/third_party/skia/src/pathops/
SkDLineIntersection.cpp 17 double bxLen = b[1].fX - b[0].fX;
19 double denom = byLen * axLen - ayLen * bxLen;
24 p.fX = (term1 * bxLen - axLen * term2) / denom;
70 axLen / ayLen == bxLen / byLen
71 (ayLen * byLen) * axLen / ayLen == (ayLen * byLen) * bxLen / byLen
72 byLen * axLen == ayLen * bxLen
73 byLen * axLen - ayLen * bxLen == 0 ( == denom )
131 double bxLen = b[1].fX - b[0].fX;
134 axLen / ayLen == bxLen / byLen
135 (ayLen * byLen) * axLen / ayLen == (ayLen * byLen) * bxLen / byLe
    [all...]
  /external/skia/src/pathops/
SkDLineIntersection.cpp 17 double bxLen = b[1].fX - b[0].fX;
19 double denom = byLen * axLen - ayLen * bxLen;
24 p.fX = (term1 * bxLen - axLen * term2) / denom;
70 axLen / ayLen == bxLen / byLen
71 (ayLen * byLen) * axLen / ayLen == (ayLen * byLen) * bxLen / byLen
72 byLen * axLen == ayLen * bxLen
73 byLen * axLen - ayLen * bxLen == 0 ( == denom )
131 double bxLen = b[1].fX - b[0].fX;
134 axLen / ayLen == bxLen / byLen
135 (ayLen * byLen) * axLen / ayLen == (ayLen * byLen) * bxLen / byLe
    [all...]

Completed in 453 milliseconds