| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| QuadraticLineSegments.cpp | 26 // The number of line segments required to approximate the quad
32 double segments = sqrt(dist / (8 * FLT_EPSILON)); local
33 return segments;
|
| CubicLineSegments.cpp | 28 // The number of line segments required to approximate the cubic
36 double segments = sqrt(dist / (8 * FLT_EPSILON)); local
37 return segments;
|
| EdgeWalkerRectangles_Test.cpp | 176 int count = 0, segments = 0; local
200 ++segments;
217 SkASSERT(segments == 8);
|
| /external/icu/icu4c/source/layout/ |
| SegmentSingleProcessor.cpp | 37 const LookupSegment *segments = segmentSingleLookupTable->segments; local
43 const LookupSegment *lookupSegment = segmentSingleLookupTable->lookupSegment(segmentSingleLookupTable, segments, thisGlyph, success);
|
| SegmentSingleProcessor2.cpp | 38 const LookupSegment *segments = segmentSingleLookupTable->segments; local
44 const LookupSegment *lookupSegment = segmentSingleLookupTable->lookupSegment(segmentSingleLookupTable, segments, thisGlyph, success);
|
| SegmentArrayProcessor.cpp | 37 const LookupSegment *segments = segmentArrayLookupTable->segments; local
43 const LookupSegment *lookupSegment = segmentArrayLookupTable->lookupSegment(segmentArrayLookupTable, segments, thisGlyph, success);
|
| SegmentArrayProcessor2.cpp | 37 const LookupSegment *segments = segmentArrayLookupTable->segments; local
43 const LookupSegment *lookupSegment = segmentArrayLookupTable->lookupSegment(segmentArrayLookupTable, segments, thisGlyph, success);
|
| LookupTables.h | 58 const LookupSegment *lookupSegment(const LETableReference &base, const LookupSegment *segments, LEGlyphID glyph, LEErrorCode &success) const;
71 LookupSegment segments[ANY_NUMBER]; member in struct:SegmentSingleLookupTable
73 LE_VAR_ARRAY(SegmentSingleLookupTable, segments)
77 LookupSegment segments[ANY_NUMBER]; member in struct:SegmentArrayLookupTable
79 LE_VAR_ARRAY(SegmentArrayLookupTable, segments)
|