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

  /external/chromium_org/third_party/skia/experimental/Intersection/
QuadraticUtilities.cpp 78 int foundRoots = 0;
87 for (int idx2 = 0; idx2 < foundRoots; ++idx2) {
92 t[foundRoots++] = tValue;
97 return foundRoots;
117 int foundRoots = 0;
126 ++foundRoots;
135 if (foundRoots == 0 || !approximately_negative(ratio - t[0])) {
136 t[foundRoots++] = ratio;
138 t[foundRoots++] = t[0];
145 int foundRoots = add_valid_ts(s, realRoots, t)
    [all...]
CubicUtilities.cpp 163 int foundRoots = add_valid_ts(s, realRoots, t);
164 return foundRoots;
  /external/skia/experimental/Intersection/
QuadraticUtilities.cpp 78 int foundRoots = 0;
87 for (int idx2 = 0; idx2 < foundRoots; ++idx2) {
92 t[foundRoots++] = tValue;
97 return foundRoots;
117 int foundRoots = 0;
126 ++foundRoots;
135 if (foundRoots == 0 || !approximately_negative(ratio - t[0])) {
136 t[foundRoots++] = ratio;
138 t[foundRoots++] = t[0];
145 int foundRoots = add_valid_ts(s, realRoots, t)
    [all...]
CubicUtilities.cpp 163 int foundRoots = add_valid_ts(s, realRoots, t);
164 return foundRoots;
  /external/chromium_org/third_party/skia/src/pathops/
SkPathOpsQuad.cpp 70 int foundRoots = 0;
79 for (int idx2 = 0; idx2 < foundRoots; ++idx2) {
84 t[foundRoots++] = tValue;
89 return foundRoots;
100 int foundRoots = AddValidTs(s, realRoots, t);
101 return foundRoots;
SkPathOpsCubic.cpp 194 int foundRoots = SkDQuad::AddValidTs(s, realRoots, t);
195 return foundRoots;
  /external/skia/src/pathops/
SkPathOpsQuad.cpp 70 int foundRoots = 0;
79 for (int idx2 = 0; idx2 < foundRoots; ++idx2) {
84 t[foundRoots++] = tValue;
89 return foundRoots;
100 int foundRoots = AddValidTs(s, realRoots, t);
101 return foundRoots;
SkPathOpsCubic.cpp 194 int foundRoots = SkDQuad::AddValidTs(s, realRoots, t);
195 return foundRoots;

Completed in 271 milliseconds