HomeSort by relevance Sort by last modified time
    Searched refs:contours (Results 1 - 25 of 91) sorted by null

1 2 3 4

  /external/chromium_org/third_party/skia/src/pathops/
SkPathOpsDebug.h 173 static void DumpCoincidence(const SkTArray<class SkOpContour, true>& contours);
174 static void DumpCoincidence(const SkTArray<class SkOpContour* , true>& contours);
175 static void DumpContours(const SkTArray<class SkOpContour, true>& contours);
176 static void DumpContours(const SkTArray<class SkOpContour* , true>& contours);
177 static void DumpContourAngles(const SkTArray<class SkOpContour, true>& contours);
178 static void DumpContourAngles(const SkTArray<class SkOpContour* , true>& contours);
179 static void DumpContourPt(const SkTArray<class SkOpContour, true>& contours, int id);
180 static void DumpContourPt(const SkTArray<class SkOpContour* , true>& contours, int id);
181 static void DumpContourPts(const SkTArray<class SkOpContour, true>& contours);
182 static void DumpContourPts(const SkTArray<class SkOpContour* , true>& contours);
    [all...]
SkOpEdgeBuilder.h 16 SkOpEdgeBuilder(const SkPathWriter& path, SkTArray<SkOpContour>& contours)
18 , fContours(contours)
23 SkOpEdgeBuilder(const SkPath& path, SkTArray<SkOpContour>& contours)
25 , fContours(contours)
SkPathOpsCommon.h 23 void MakeContourList(SkTArray<SkOpContour>& contours, SkTArray<SkOpContour*, true>& list,
SkPathOpsSimplify.cpp 167 SkTArray<SkOpContour> contours; local
168 SkOpEdgeBuilder builder(path, contours);
173 MakeContourList(contours, contourList, false, false);
196 // construct closed contours
  /external/skia/src/pathops/
SkPathOpsDebug.h 173 static void DumpCoincidence(const SkTArray<class SkOpContour, true>& contours);
174 static void DumpCoincidence(const SkTArray<class SkOpContour* , true>& contours);
175 static void DumpContours(const SkTArray<class SkOpContour, true>& contours);
176 static void DumpContours(const SkTArray<class SkOpContour* , true>& contours);
177 static void DumpContourAngles(const SkTArray<class SkOpContour, true>& contours);
178 static void DumpContourAngles(const SkTArray<class SkOpContour* , true>& contours);
179 static void DumpContourPt(const SkTArray<class SkOpContour, true>& contours, int id);
180 static void DumpContourPt(const SkTArray<class SkOpContour* , true>& contours, int id);
181 static void DumpContourPts(const SkTArray<class SkOpContour, true>& contours);
182 static void DumpContourPts(const SkTArray<class SkOpContour* , true>& contours);
    [all...]
SkOpEdgeBuilder.h 16 SkOpEdgeBuilder(const SkPathWriter& path, SkTArray<SkOpContour>& contours)
18 , fContours(contours)
23 SkOpEdgeBuilder(const SkPath& path, SkTArray<SkOpContour>& contours)
25 , fContours(contours)
SkPathOpsCommon.h 23 void MakeContourList(SkTArray<SkOpContour>& contours, SkTArray<SkOpContour*, true>& list,
  /external/chromium_org/third_party/skia/tests/
PathOpsDebug.cpp 387 void SkPathOpsDebug::DumpCoincidence(const SkTArray<SkOpContour, true>& contours) {
388 int count = contours.count();
390 contours[index].dumpCoincidences();
394 void SkPathOpsDebug::DumpCoincidence(const SkTArray<SkOpContour* , true>& contours) {
395 int count = contours.count();
397 contours[index]->dumpCoincidences();
401 void SkPathOpsDebug::DumpContours(const SkTArray<SkOpContour, true>& contours) {
402 int count = contours.count();
404 contours[index].dump();
408 void SkPathOpsDebug::DumpContours(const SkTArray<SkOpContour* , true>& contours) {
    [all...]
  /external/skia/tests/
PathOpsDebug.cpp 387 void SkPathOpsDebug::DumpCoincidence(const SkTArray<SkOpContour, true>& contours) {
388 int count = contours.count();
390 contours[index].dumpCoincidences();
394 void SkPathOpsDebug::DumpCoincidence(const SkTArray<SkOpContour* , true>& contours) {
395 int count = contours.count();
397 contours[index]->dumpCoincidences();
401 void SkPathOpsDebug::DumpContours(const SkTArray<SkOpContour, true>& contours) {
402 int count = contours.count();
404 contours[index].dump();
408 void SkPathOpsDebug::DumpContours(const SkTArray<SkOpContour* , true>& contours) {
    [all...]
  /external/chromium_org/third_party/skia/experimental/Intersection/
SimplifyFindNext_Test.cpp 22 SkTArray<SimplifyFindNextTest::Contour>& contours) {
24 makeContourList(contours, contourList, false, false);
26 if (contours.count() > 1) {
27 SkASSERT(contours.count() == 2);
32 SimplifyFindNextTest::Segment& segment = contours[0].debugSegments()[0];
47 SkTArray<SimplifyFindNextTest::Contour> contours; local
48 SimplifyFindNextTest::EdgeBuilder builder(path, contours);
53 testCommon(contourWinding, spanWinding, start, end, contours);
57 SkTArray<SimplifyFindNextTest::Contour> contours; local
58 SimplifyFindNextTest::EdgeBuilder builder(path, contours);
    [all...]
SimplifyFindTop_Test.cpp 19 SkTArray<SimplifyFindTopTest::Contour>& contours,
22 makeContourList(contours, contourList, false, false);
24 if (contours.count() > 1) {
25 SkASSERT(contours.count() == 2);
44 SkTArray<SimplifyFindTopTest::Contour> contours; local
45 SimplifyFindTopTest::EdgeBuilder builder(path, contours);
47 testCommon(contours, index, end);
53 SkTArray<SimplifyFindTopTest::Contour> contours; local
54 SimplifyFindTopTest::EdgeBuilder builder(path, contours);
57 testCommon(contours, index, end)
    [all...]
  /external/skia/experimental/Intersection/
SimplifyFindNext_Test.cpp 22 SkTArray<SimplifyFindNextTest::Contour>& contours) {
24 makeContourList(contours, contourList, false, false);
26 if (contours.count() > 1) {
27 SkASSERT(contours.count() == 2);
32 SimplifyFindNextTest::Segment& segment = contours[0].debugSegments()[0];
47 SkTArray<SimplifyFindNextTest::Contour> contours; local
48 SimplifyFindNextTest::EdgeBuilder builder(path, contours);
53 testCommon(contourWinding, spanWinding, start, end, contours);
57 SkTArray<SimplifyFindNextTest::Contour> contours; local
58 SimplifyFindNextTest::EdgeBuilder builder(path, contours);
    [all...]
SimplifyFindTop_Test.cpp 19 SkTArray<SimplifyFindTopTest::Contour>& contours,
22 makeContourList(contours, contourList, false, false);
24 if (contours.count() > 1) {
25 SkASSERT(contours.count() == 2);
44 SkTArray<SimplifyFindTopTest::Contour> contours; local
45 SimplifyFindTopTest::EdgeBuilder builder(path, contours);
47 testCommon(contours, index, end);
53 SkTArray<SimplifyFindTopTest::Contour> contours; local
54 SimplifyFindTopTest::EdgeBuilder builder(path, contours);
57 testCommon(contours, index, end)
    [all...]
  /external/chromium_org/third_party/brotli/src/woff2/
glyph.cc 96 glyph->contours.resize(num_contours);
106 glyph->contours[i].resize(num_points);
124 flags[i].resize(glyph->contours[i].size());
125 for (int j = 0; j < glyph->contours[i].size(); ++j) {
139 glyph->contours[i][j].on_curve = flag & kFLAG_ONCURVE;
146 for (int j = 0; j < glyph->contours[i].size(); ++j) {
155 glyph->contours[i][j].x = prev_x + sign * x_delta;
164 glyph->contours[i][j].x = prev_x + x_delta;
166 prev_x = glyph->contours[i][j].x;
173 for (int j = 0; j < glyph->contours[i].size(); ++j)
    [all...]
glyph.h 51 std::vector<std::vector<Point> > contours; member in class:woff2::Glyph
transform.cc 87 } else if (glyph.contours.size() > 0) {
124 int num_contours = glyph.contours.size();
131 Write255UShort(&n_points_stream_, glyph.contours[i].size());
136 int num_points = glyph.contours[i].size();
138 int x = glyph.contours[i][j].x;
139 int y = glyph.contours[i][j].y;
142 WriteTriplet(glyph.contours[i][j].on_curve, dx, dy);
normalize.cc 43 if (glyph->contours.empty() || glyph->contours[0].empty()) {
46 int16_t x_min = glyph->contours[0][0].x;
47 int16_t y_min = glyph->contours[0][0].y;
50 for (const auto& contour : glyph->contours) {
  /external/opencv/cvaux/src/
cvbgfg_common.cpp 77 CvSeq *contours, *c; local
85 // find contours around only bigger regions
106 contours = cvEndFindContours( &scanner );
110 for( c=contours; c != 0; c = c->h_next )
117 contours = 0;
120 return contours;
extendededges.cpp 50 //create lists of segments of all contours from image
55 CvSeq* contours = 0; local
56 cvFindContours( image, tmp_storage, &contours, sizeof(CvContour), CV_RETR_LIST, CV_CHAIN_APPROX_NONE );
59 //iterate through contours
61 CvSeq* current = contours;
114 //free temporary memstorage with initial contours
123 //iplSet(image, 0 ); // this can cause double edges if two contours have common edge
  /external/chromium_org/third_party/freetype/src/base/
ftgloadr.c 112 FT_FREE( loader->base.outline.contours );
151 current->contours = base->contours + base->n_contours;
246 /* check contours */
257 if ( FT_RENEW_ARRAY( base->contours, old_max, new_max ) )
350 /* adjust contours count in newest outline */
352 current->outline.contours[n] =
353 (short)( current->outline.contours[n] + n_base_points );
380 FT_ARRAY_COPY( out->contours, in->contours,
    [all...]
ftoutln.c 90 last = outline->contours[n];
317 FT_NEW_ARRAY( anoutline->contours, numContours ) )
374 end = outline->contours[n];
376 /* note that we don't accept empty contours */
416 FT_ARRAY_COPY( target->contours, source->contours, source->n_contours );
439 FT_FREE( outline->contours );
556 last = outline->contours[n];
726 (outline)->contours[c - 1] + 1 \
728 (last) = (outline)->points + (outline)->contours[c];
    [all...]
  /external/freetype/src/base/
ftgloadr.c 112 FT_FREE( loader->base.outline.contours );
151 current->contours = base->contours + base->n_contours;
246 /* check contours */
257 if ( FT_RENEW_ARRAY( base->contours, old_max, new_max ) )
353 /* adjust contours count in newest outline */
355 current->outline.contours[n] =
356 (short)( current->outline.contours[n] + n_base_points );
383 FT_ARRAY_COPY( out->contours, in->contours,
    [all...]
ftoutln.c 90 last = outline->contours[n];
317 FT_NEW_ARRAY( anoutline->contours, numContours ) )
374 end = outline->contours[n];
376 /* note that we don't accept empty contours */
416 FT_ARRAY_COPY( target->contours, source->contours, source->n_contours );
439 FT_FREE( outline->contours );
556 last = outline->contours[n];
729 (outline)->contours[c - 1] + 1 \
731 (last) = (outline)->points + (outline)->contours[c];
    [all...]
  /external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/base/
ftgloadr.c 112 FT_FREE( loader->base.outline.contours );
151 current->contours = base->contours + base->n_contours;
246 /* check contours */
257 if ( FT_RENEW_ARRAY( base->contours, old_max, new_max ) )
353 /* adjust contours count in newest outline */
355 current->outline.contours[n] =
356 (short)( current->outline.contours[n] + n_base_points );
383 FT_ARRAY_COPY( out->contours, in->contours,
    [all...]
ftoutln.c 90 last = outline->contours[n];
317 FT_NEW_ARRAY( anoutline->contours, numContours ) )
374 end = outline->contours[n];
376 /* note that we don't accept empty contours */
416 FT_ARRAY_COPY( target->contours, source->contours, source->n_contours );
439 FT_FREE( outline->contours );
556 last = outline->contours[n];
726 (outline)->contours[c - 1] + 1 \
728 (last) = (outline)->points + (outline)->contours[c];
    [all...]

Completed in 5613 milliseconds

1 2 3 4