Searched defs:segments (Results 1 - 25 of 84) sorted by path

1234

/external/chromium_org/chrome/browser/chromeos/input_method/
H A Dinput_method_engine.cc123 const std::vector<SegmentInfo>& segments,
142 for (std::vector<SegmentInfo>::const_iterator segment = segments.begin();
143 segment != segments.end(); ++segment) {
117 SetComposition( int context_id, const char* text, int selection_start, int selection_end, int cursor, const std::vector<SegmentInfo>& segments, std::string* error) argument
/external/chromium_org/chrome/browser/extensions/api/input_ime/
H A Dinput_ime_api.cc431 std::vector<InputMethodEngineInterface::SegmentInfo> segments; local
432 if (params.segments) {
435 segments_args = *params.segments;
440 segments.push_back(InputMethodEngineInterface::SegmentInfo());
441 segments.back().start = segments_args[i]->start;
442 segments.back().end = segments_args[i]->end;
445 segments.back().style =
448 segments.back().style =
462 segments, &error_)));
/external/chromium_org/ppapi/examples/ime/
H A Dime.cc235 const std::vector< std::pair<uint32_t, uint32_t> >& segments,
241 segments_ = segments;
233 SetComposition( const std::string& text, const std::vector< std::pair<uint32_t, uint32_t> >& segments, int32_t target_segment, const std::pair<uint32_t, uint32_t>& selection) argument
/external/chromium_org/ppapi/examples/mouse_cursor/
H A Dmouse_cursor.cc58 int segments = 3; local
59 if (point.y() < height_ / segments) {
62 } else if (point.y() < (height_ / segments) * 2) {
/external/chromium_org/ppapi/tests/
H A Dtest_ime_input_event.cc151 const std::vector<uint32_t>& segments,
159 segments,
319 std::vector<uint32_t> segments; local
320 segments.push_back(0U);
321 segments.push_back(3U);
322 segments.push_back(7U);
323 segments.push_back(11U);
325 kCompositionText, segments, 1, std::make_pair(3U, 7U));
348 std::vector<uint32_t> segments; local
349 segments
149 CreateImeCompositionUpdateEvent( const std::string& text, const std::vector<uint32_t>& segments, int32_t target_segment, const std::pair<uint32_t, uint32_t>& selection) argument
377 std::vector<uint32_t> segments; local
407 std::vector<uint32_t> segments; local
[all...]
/external/chromium_org/remoting/base/
H A Dcompound_buffer_unittest.cc154 // Determine how many segments to split kTestData. We split the data in
156 int segments = (kTestData.length() / 3) * 2; local
160 ++segments;
162 segments += 2;
167 for (int i = 0; i < segments; ++i) {
/external/chromium_org/third_party/WebKit/Source/core/html/ime/
H A DInputMethodContext.cpp146 const Vector<unsigned>& InputMethodContext::segments() function in class:WebCore::InputMethodContext
/external/chromium_org/third_party/WebKit/Source/core/rendering/
H A DRenderBlockFlow.cpp1997 SegmentList segments = shapeInsideInfo->computeSegmentsForLine(logicalTopOffset, floatLogicalSize.height()); local
1998 // FIXME: Add support for shapes with multiple segments.
1999 if (segments.size() == 1) {
2001 logicalRightOffset = logicalLeftOffset + segments[0].logicalRight;
2002 logicalLeftOffset += segments[0].logicalLeft;
H A DRenderBlockLineLayout.cpp647 const SegmentList& segments = shapeInsideInfo->segments(); local
648 float logicalLeft = max<float>(segments[0].logicalLeft, lineLogicalLeft);
649 float logicalRight = min<float>(segments[0].logicalRight, lineLogicalRight);
655 for (size_t i = 0; i < segments.size(); i++) {
657 logicalLeft = max<float>(segments[i].logicalLeft, lineLogicalLeft);
658 logicalRight = min<float>(segments[i].logicalRight, lineLogicalRight);
986 // Do not collapse midpoints between segments
1254 // If the last line overlaps with the shape, we don't need the segments anymore
1276 // FIXME: Bug 95361: It is possible for a line to grow beyond lineHeight, in which case these segments ma
2154 const SegmentList& segments = shapeInsideInfo->segments(); local
[all...]
/external/chromium_org/third_party/WebKit/Source/core/rendering/shapes/
H A DShapeInfo.cpp87 SegmentList segments; local
89 getIntervals((lineTop - logicalTopOffset()), std::min(lineHeight, shapeLogicalBottom() - lineTop), segments);
91 for (size_t i = 0; i < segments.size(); i++) {
92 segments[i].logicalLeft += logicalLeftOffset();
93 segments[i].logicalRight += logicalLeftOffset();
96 return segments;
H A DShapeInsideInfo.h76 const SegmentList& segments() const function in class:WebCore::FINAL
105 virtual void getIntervals(LayoutUnit lineTop, LayoutUnit lineHeight, SegmentList& segments) const OVERRIDE
107 return computedShape()->getIncludedIntervals(lineTop, lineHeight, segments);
H A DShapeOutsideInfo.cpp71 SegmentList segments = computeSegmentsForLine(floatRelativeLineTop, lineHeight); local
72 if (segments.size()) {
73 LayoutUnit rawLeftMarginBoxDelta = segments.first().logicalLeft + containingBlock->marginStartForChild(m_renderer);
76 LayoutUnit rawRightMarginBoxDelta = segments.last().logicalRight - containingBlock->logicalWidthForChild(m_renderer) - containingBlock->marginEndForChild(m_renderer);
/external/chromium_org/third_party/WebKit/Source/core/svg/
H A DSVGPathParser.cpp469 int segments = ceilf(fabsf(thetaArc / (piOverTwoFloat + 0.001f))); local
470 for (int i = 0; i < segments; ++i) {
471 float startTheta = theta1 + i * thetaArc / segments;
472 float endTheta = theta1 + (i + 1) * thetaArc / segments;
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/
H A Dcompiler.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/debugging/ com/google/debugging/sourcemap/ ...
/external/chromium_org/third_party/freetype/src/autofit/
H A Dafcjk.c72 /* scan the array of segments in each direction */
131 seg = axhints->segments;
138 /* we only consider stem segments there! */
690 AF_Segment segments = axis->segments; local
691 AF_Segment segment_limit = segments + axis->num_segments;
702 for ( seg = segments; seg < segment_limit; seg++ )
734 AF_Segment segments = axis->segments; local
735 AF_Segment segment_limit = segments
903 AF_Segment segments = axis->segments; local
[all...]
H A Dafhints.c63 if ( FT_RENEW_ARRAY( axis->segments, old_max, new_max ) )
69 segment = axis->segments + axis->num_segments++;
244 /* Dump the array of linked segments. */
260 AF_Segment segments = axis->segments; local
261 AF_Segment limit = segments + axis->num_segments;
265 FT_TRACE7(( "Table of %s segments:\n",
275 for ( seg = segments; seg < limit; seg++ )
279 seg - segments,
286 AF_INDEX_NUM( seg->link, segments ),
840 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 Daflatin.c52 /* Find segments and links, compute all stem widths, and initialize */
59 /* scan the array of segments in each direction */
126 seg = axhints->segments;
133 /* we only consider stem segments there! */
212 /* Find all blue zones. Flat segments give the reference points, */
213 /* round segments the overshoot positions. */
790 /* Walk over all contours and compute its segments. */
954 /* now slightly increase the height of segments if this makes */
957 AF_Segment segments = axis->segments; local
1017 AF_Segment segments = axis->segments; local
1114 AF_Segment segments = axis->segments; local
[all...]
H A Daflatin2.c62 /* scan the array of segments in each direction */
119 seg = axhints->segments;
126 /* we only consider stem segments there! */
876 /* now slightly increase the height of segments when this makes */
879 AF_Segment segments = axis->segments; local
880 AF_Segment segments_end = segments + axis->num_segments;
883 for ( segment = segments; segment < segments_end; segment++ )
923 /* place all segments with a negative direction to the start
927 AF_Segment segments local
968 AF_Segment segments = axis->segments; local
1072 AF_Segment segments = axis->segments; local
[all...]
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...]
/external/chromium_org/third_party/icu/source/i18n/
H A Dmsgfmt.cpp575 // The pattern is broken up into segments. Each time a subformat
576 // is encountered, 4 segments are recorded. For example, consider
579 // The first set of segments is:
580 // segments[0] = "There "
581 // segments[1] = "0"
582 // segments[2] = "choice"
583 // segments[3] = "0.0#are no files|1.0#is one file|1.0<are {0, number} files"
585 // During parsing, the plain text is accumulated into segments[0].
590 // segments[0].
593 // Quotes may not occur in segments
598 UnicodeString segments[4]; local
1497 makeFormat(int32_t formatNumber, UnicodeString* segments, UParseError& parseError, UErrorCode& ec) argument
[all...]
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/chromium_org/third_party/libwebp/webp/
H A Dencode.h103 int segments; // maximum number of segments to use, in [1..4] member in struct:WebPConfig
185 // DC/AC/uv coefficients for each (0..3) segments.
186 int segment_size[4]; // number of macroblocks in each segments
187 int segment_quant[4]; // quantizer values for each segments
188 int segment_level[4]; // filtering strength for each segments [0..63]
/external/chromium_org/third_party/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/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/
H A Dpath.c59 struct array * segments; member in struct:path
201 path->segments = array_create(size_for_datatype(VG_PATH_DATATYPE_S_8));
229 array_destroy(p->segments);
257 array_append_data(p->segments, pathSegments, numSegments);
394 VGubyte segment = ((VGubyte*)(p->segments->data))[i];
649 return num_elements_for_segments((VGubyte*)p->segments->data,
658 VGubyte *segments = (VGubyte*)(p->segments->data); local
659 VGint count = num_elements_for_segments(&segments[startIndex], numSegments);
660 VGint start_cp = num_elements_for_segments(segments, startInde
809 struct array *segments; member in struct:transform_data
[all...]

Completed in 1374 milliseconds

1234