Searched defs:segments (Results 1 - 25 of 48) sorted by relevance

12

/external/webkit/LayoutTests/fast/url/resources/
H A Dutilities.js29 function segments(url) function
/external/icu4c/i18n/
H A Drbt_rule.h43 * <p>A rule may contain segments in its input string and segment
99 * segments. If there are no segments this is null. N.B. This is
106 UnicodeFunctor** segments; member in class:TransliterationRule
109 * The number of elements in segments[] or zero if segments is NULL.
142 * lookup services for matchers and segments.
170 * segments, or null if there are none. The array itself is adopted,
/external/icu4c/layout/
H A DLookupTables.cpp27 const LookupSegment *BinarySearchLookupTable::lookupSegment(const LookupSegment *segments, LEGlyphID glyph) const argument
33 const LookupSegment *entry = segments;
H A DSegmentArrayProcessor.cpp38 const LookupSegment *segments = segmentArrayLookupTable->segments; local
44 const LookupSegment *lookupSegment = segmentArrayLookupTable->lookupSegment(segments, thisGlyph);
H A DSegmentSingleProcessor.cpp38 const LookupSegment *segments = segmentSingleLookupTable->segments; local
44 const LookupSegment *lookupSegment = segmentSingleLookupTable->lookupSegment(segments, thisGlyph);
H A DLookupTables.h57 const LookupSegment *lookupSegment(const LookupSegment *segments, LEGlyphID glyph) const;
69 LookupSegment segments[ANY_NUMBER]; member in struct:SegmentSingleLookupTable
74 LookupSegment segments[ANY_NUMBER]; member in struct:SegmentArrayLookupTable
/external/skia/src/utils/
H A DSkUnitMappers.cpp10 SkDiscreteMapper::SkDiscreteMapper(int segments) { argument
11 if (segments < 2) {
15 if (segments > 0xFFFF) {
16 segments = 0xFFFF;
18 fSegments = segments;
19 fScale = SK_Fract1 / (segments - 1);
/external/opencv/cvaux/src/
H A Dcvbgfg_common.cpp46 // segments - pointer to result of segmentation (for example MeanShiftSegmentation)
48 CV_IMPL void cvRefineForegroundMaskBySegm( CvSeq* segments, CvBGStatModel* bg_model ) argument
52 for( ; segments; segments = ((CvSeq*)segments)->h_next )
54 CvSeq seq = *segments;
/external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/xpath/
H A DXMPPath.java46 /** stores the segments of an XMPPath */
47 private List segments = new ArrayList(5); field in class:XMPPath
57 segments.add(segment);
67 return (XMPPathSegment) segments.get(index);
76 return segments.size();
/external/e2fsprogs/intl/
H A Dgmo.h95 /* The number of system dependent segments. */
97 /* Offset of table describing system dependent segments. */
130 /* Offset of static string segments in file. */
132 /* Alternating sequence of static and system dependent segments.
140 } segments[1]; member in struct:sysdep_string
143 /* Marker for the end of the segments[] array. This has the value 0xFFFFFFFF,
/external/libxslt/libxslt/
H A Dattrvt.c40 int nb_seg; /* Number of segments */
51 void *segments[MAX_AVT_SEG]; member in struct:_xsltAttrVT
102 if (avt->segments[i] != NULL)
103 xmlFree((xmlChar *) avt->segments[i]);
105 xmlXPathFreeCompExpr((xmlXPathCompExprPtr) avt->segments[i]);
108 xmlXPathFreeCompExpr((xmlXPathCompExprPtr) avt->segments[i]);
110 if (avt->segments[i] != NULL)
111 xmlFree((xmlChar *) avt->segments[i]);
140 * needs to be added to the 'segments' array within the xsltAttrVT
154 memset(&avt->segments[av
[all...]
/external/webkit/Source/WebCore/platform/
H A DSharedBuffer.cpp130 // No need to use segments for small resource data
239 unsigned segments = m_segments.size(); local
241 ASSERT(segment < segments);
245 return segment == segments - 1 ? segmentedSize - position : segmentSize - positionInSegment;
/external/freetype/src/autofit/
H A Dafwarp.c21 * within a single dimension so that as much of its segments are aligned
66 /* Score segments for a given `scale' and `delta' in the range */
78 AF_Segment segments,
122 FT_Pos len = segments[nn].max_coord - segments[nn].min_coord;
123 FT_Pos y0 = FT_MulFix( segments[nn].pos, scale ) + delta;
128 /* score the length of the segments for the given range */
179 AF_Segment segments; local
200 segments = axis->segments;
72 af_warper_compute_line_best( AF_Warper warper, FT_Fixed scale, FT_Pos delta, FT_Pos xx1, FT_Pos xx2, AF_WarpScore base_distort, AF_Segment segments, FT_UInt num_segments ) argument
[all...]
H A Dafhints.c52 if ( FT_RENEW_ARRAY( axis->segments, old_max, new_max ) )
58 segment = axis->segments + axis->num_segments++;
235 /* Dump the array of linked segments. */
249 AF_Segment segments = axis->segments; local
250 AF_Segment limit = segments + axis->num_segments;
254 printf ( "Table of %s segments:\n",
259 for ( seg = segments; seg < limit; seg++ )
262 seg - segments,
266 AF_INDEX_NUM( seg->link, segments ),
818 AF_Segment segments = axis->segments; local
[all...]
H A Dafhints.h36 /* i.e., vertical segments & edges */
38 /* i.e., horizontal segments & edges */
71 * find segments in an outline. A segment is a series of consecutive
76 * `fake' segments that are generated to hint metrics appropriately,
82 * As soon as segments are defined, the auto-hinter groups them into
84 * dimension that collects one or more segments (allowing for a small
88 * segments on the edges unless it detects that they form a serif.
111 * A stem is made of two segments that face each other in opposite
113 * vocabulary from the TrueType specification, stem segments form a
116 * In the above ASCII drawing, the horizontal segments ar
317 AF_Segment segments; /* segments array */ member in struct:AF_AxisHintsRec_
[all...]
H A Dafcjk.c73 /* scan the array of segments in each direction */
131 seg = axhints->segments;
138 /* we only consider stem segments there! */
686 AF_Segment segments = axis->segments; local
687 AF_Segment segment_limit = segments + axis->num_segments;
698 for ( seg = segments; seg < segment_limit; seg++ )
730 AF_Segment segments = axis->segments; local
731 AF_Segment segment_limit = segments
899 AF_Segment segments = axis->segments; local
[all...]
H A Daflatin.c51 /* Find segments and links, compute all stem widths, and initialize */
59 /* scan the array of segments in each direction */
119 seg = axhints->segments;
126 /* we only consider stem segments there! */
183 /* Find all blue zones. Flat segments give the reference points, */
184 /* round segments the overshoot positions. */
723 /* Walk over all contours and compute its segments. */
887 /* now slightly increase the height of segments when this makes */
890 AF_Segment segments = axis->segments; local
950 AF_Segment segments = axis->segments; local
1047 AF_Segment segments = axis->segments; local
[all...]
/external/webkit/Source/WebCore/svg/
H A DSVGPathParser.cpp460 int segments = ceilf(fabsf(thetaArc / (piOverTwoFloat + 0.001f))); local
461 for (int i = 0; i < segments; ++i) {
462 float startTheta = theta1 + i * thetaArc / segments;
463 float endTheta = theta1 + (i + 1) * thetaArc / segments;
/external/elfutils/src/
H A Dfindtextrel.c48 struct segments struct
99 static void check_rel (size_t nsegments, struct segments segments[nsegments],
311 /* Get the address ranges for the loaded segments. */
314 struct segments *segments local
315 = (struct segments *) malloc (nsegments_max * sizeof (segments[0]));
316 if (segments == NULL)
337 segments
491 check_rel(size_t nsegments, struct segments segments[nsegments], GElf_Addr addr, Elf *elf, Elf_Scn *symscn, Dwarf *dw, const char *fname, bool more_than_one, void **knownsrcs) argument
[all...]
/external/skia/src/gpu/
H A DGrAAConvexPathRenderer.cpp49 void center_of_mass(const SegmentArray& segments, SkPoint* c) { argument
53 int count = segments.count();
59 p0 = segments[0].endPt();
65 pj = segments[1].endPt() - p0;
68 const SkPoint pj = segments[i + 1].endPt() - p0;
83 const SkPoint& pt = segments[i].endPt();
101 void compute_vectors(SegmentArray* segments, argument
106 center_of_mass(*segments, fanPt);
107 int count = segments->count();
121 const Segment& sega = (*segments)[
199 get_segments(const GrPath& path, SegmentArray* segments, SkPoint* fanPt, int* vCount, int* iCount) argument
275 create_vertices(const SegmentArray& segments, const SkPoint& fanPt, QuadVertex* verts, uint16_t* idxs) argument
463 SegmentArray segments; local
[all...]
/external/webkit/Source/WebKit2/Platform/
H A DRegion.cpp93 // Check if both spans have an equal number of segments.
101 // Since the segments are equal the second segment can just be ignored.
140 // Check if this span has any segments.
152 // Check if this span has any segments.
282 Vector<int> segments; local
284 // Now iterate over the segments in each span and construct a new vector of segments.
301 segments.append(x);
306 // Add any remaining segments.
308 segments
[all...]
/external/replicaisland/src/com/replica/replicaisland/
H A DCollisionSystem.java26 * world. This version is based on a collision world of line segments, organized into an array of
30 * This class also provides a system for runtime-generated collision segments. These temporary
31 * segments are cleared each frame, and consequently must be constantly re-submitted if they are
32 * intended to persist. Temporary segments are useful for dynamic solid objects, such as moving
37 * implementations to executeRay. Provided is TileTestVisitor, a visitor that compares the segments
100 * @param movementDirection If set, only segments with normals that oppose this direction will
101 * be counted as valid intersections. If null, all intersecting segments will be
206 boolean hit = testBoxAgainstList(mCollisionTiles[tileIndex].segments,
220 // temporary segments
258 // frame execution order. So each frame we queue up inserted segments an
431 testSegmentAgainstList(FixedSizeArray<LineSegment> segments, Vector2 startPoint, Vector2 endPoint, Vector2 hitPoint, Vector2 hitNormal, Vector2 movementDirection, GameObject excludeObject) argument
475 testBoxAgainstList(FixedSizeArray<LineSegment> segments, float left, float right, float top, float bottom, Vector2 movementDirection, GameObject excludeObject, Vector2 outputOffset, FixedSizeArray<HitPoint> outputHitPoints) argument
842 public FixedSizeArray<LineSegment> segments; field in class:CollisionSystem.CollisionTile
[all...]
/external/webkit/Tools/android/flex-2.5.4a/MISC/
H A Dalloca.c230 long shsize:32; /* Current size of stack (all segments). */
292 long segments; /* Current number of stack segments. */ member in struct:stk_stat
293 long maxs; /* Maximum number of stack segments so far. */
343 /* We want to iterate through all of the segments. The first
362 /* Discard segments that do not contain our argument address. */
376 of all predecessor segments. */
442 a stack overflow. Discard stack segments which do not
/external/libogg/src/
H A Dframing.c384 /* decide how many segments to include */
521 /* This constructs pages from buffered packet segments. The pointers
765 into packet segments here as well. */
780 int segments=header[26]; local
815 if(_os_lacing_expand(os,segments+1)) return -1;
834 some segments */
839 for(;segptr<segments;segptr++){
859 while(segptr<segments){
938 segments. Now we need to group them into packets (or return the
1091 fprintf(stderr," checksum: %02x:%02x:%02x:%02x\n segments
[all...]
/external/webkit/Source/WebCore/platform/graphics/wince/
H A DPlatformPathWinCE.cpp39 static void quadCurve(int segments, Vector<PathPoint>& pts, const PathPoint* control) argument
41 const float step = 1.0 / segments;
53 pts.resize(offset + segments);
58 for (int i = 1; i < segments; ++i) {
74 pts[offset + segments - 1] = pp;
77 static inline void bezier(int segments, Vector<PathPoint>& pts, const PathPoint* control) argument
79 const float step = 1.0 / segments;
93 pts.resize(offset + segments);
98 for (int i = 1; i < segments; ++i) {
117 pts[offset + segments
[all...]

Completed in 676 milliseconds

12