| /external/pdfium/third_party/freetype/src/base/ |
| ftbbox.c | 156 /* the bbox that contains all on-points. It finds a local extremum */
293 /* at least one of its control off-points above 0. */
351 /* the bbox that contains all on-points. So at least one of the */
464 /* all `on' points in the outline. Then, if the two boxes */
467 vec = outline->points;
|
| /external/protobuf/src/google/protobuf/io/ |
| zero_copy_stream.h | 44 // So, the stream can return a buffer which actually points directly into
137 // * Otherwise, "size" points to the actual number of bytes read and "data"
138 // points to a pointer to a buffer containing these bytes.
196 // * Otherwise, "size" points to the actual number of bytes in the buffer
197 // and "data" points to the buffer.
|
| /external/skia/src/core/ |
| SkRecorder.cpp | 106 // This measured around 2x faster for copying code points,
251 const int points = paint.countText(text, byteLength); local
256 this->copy(pos, points));
261 const int points = paint.countText(text, byteLength); local
267 this->copy(xpos, points));
|
| /external/skia/tools/debugger/ |
| SkObjectParser.cpp | 190 SkPoint points[4]; local
192 for(verb = iter.next(points, false);
194 verb = iter.next(points, false)) {
201 mPath->appendScalar(points[gPtOffsetPerVerb[verb]+i].fX);
203 mPath->appendScalar(points[gPtOffsetPerVerb[verb]+i].fY);
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/layout/ |
| proximity_info_state.cpp | 73 // Setup touch points
82 // Previous two points are never skipped. Thus, we pop 2 input point data here.
103 AKLOGI("Init ProximityInfoState: reused points = %d, last input size = %d",
131 // updates probabilities of skipping or mapping each key for all points.
162 AKLOGI("ProximityState init finished: %d points out of %d", mSampledInputSize, inputSize);
|
| /prebuilts/go/darwin-x86/src/image/ |
| geom.go | 77 // A Rectangle contains the points with Min.X <= X < Max.X, Min.Y <= Y < Max.Y.
78 // It is well-formed if Min.X <= Max.X and likewise for Y. Points are always
83 // returns color.Opaque for points in the rectangle and color.Transparent
193 // Empty reports whether the rectangle contains no points.
198 // Eq reports whether r and s contain the same set of points. All empty
|
| /prebuilts/go/linux-x86/src/image/ |
| geom.go | 77 // A Rectangle contains the points with Min.X <= X < Max.X, Min.Y <= Y < Max.Y.
78 // It is well-formed if Min.X <= Max.X and likewise for Y. Points are always
83 // returns color.Opaque for points in the rectangle and color.Transparent
193 // Empty reports whether the rectangle contains no points.
198 // Eq reports whether r and s contain the same set of points. All empty
|
| /prebuilts/misc/darwin-x86_64/protobuf2.5/include/google/protobuf/io/ |
| zero_copy_stream.h | 44 // So, the stream can return a buffer which actually points directly into
137 // * Otherwise, "size" points to the actual number of bytes read and "data"
138 // points to a pointer to a buffer containing these bytes.
196 // * Otherwise, "size" points to the actual number of bytes in the buffer
197 // and "data" points to the buffer.
|
| /prebuilts/misc/linux-x86_64/protobuf2.5/include/google/protobuf/io/ |
| zero_copy_stream.h | 44 // So, the stream can return a buffer which actually points directly into
137 // * Otherwise, "size" points to the actual number of bytes read and "data"
138 // points to a pointer to a buffer containing these bytes.
196 // * Otherwise, "size" points to the actual number of bytes in the buffer
197 // and "data" points to the buffer.
|
| /prebuilts/misc/windows/protobuf2.5/include/google/protobuf/io/ |
| zero_copy_stream.h | 44 // So, the stream can return a buffer which actually points directly into
137 // * Otherwise, "size" points to the actual number of bytes read and "data"
138 // points to a pointer to a buffer containing these bytes.
196 // * Otherwise, "size" points to the actual number of bytes in the buffer
197 // and "data" points to the buffer.
|
| /prebuilts/tools/darwin-x86_64/protoc/include/google/protobuf/io/ |
| zero_copy_stream.h | 44 // So, the stream can return a buffer which actually points directly into
137 // * Otherwise, "size" points to the actual number of bytes read and "data"
138 // points to a pointer to a buffer containing these bytes.
196 // * Otherwise, "size" points to the actual number of bytes in the buffer
197 // and "data" points to the buffer.
|
| /prebuilts/tools/linux-x86_64/protoc/include/google/protobuf/io/ |
| zero_copy_stream.h | 44 // So, the stream can return a buffer which actually points directly into
137 // * Otherwise, "size" points to the actual number of bytes read and "data"
138 // points to a pointer to a buffer containing these bytes.
196 // * Otherwise, "size" points to the actual number of bytes in the buffer
197 // and "data" points to the buffer.
|
| /external/icu/icu4c/source/data/sprep/ |
| rfc4518.txt | 18 # This table contains code points from Table A.1 from RFC 3454
417 # Total code points 3653
419 # code points from Table C.3
425 # Total code points 2051
427 # code points from Table C.4
448 # Total code points 18
450 # code points from Table C.5
454 # Total code points 0
456 # code points from Table C.8
474 # Total code points 1
[all...] |
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/ |
| Distance.java | 362 * - points[2]<br/>
363 * - edge points[0]-points[2]<br/>
364 * - edge points[1]-points[2]<br/>
611 * Compute the closest points between two shapes. Supports any combination of: CircleShape and
668 // If we have 3 points, then the origin is in the corresponding triangle.
704 // Compute a tentative new simplex vertex using support points.
720 // Check for duplicate support points. This is the main termination criteria.
755 // Move the witness points to the outer surface
[all...] |
| /external/libvorbis/lib/ |
| mdct.c | 219 int points){
221 DATA_TYPE *x1 = x + points - 8;
222 DATA_TYPE *x2 = x + (points>>1) - 8;
266 int points,
269 DATA_TYPE *x1 = x + points - 8;
270 DATA_TYPE *x2 = x + (points>>1) - 8;
319 int points){
326 mdct_butterfly_first(T,x,points);
331 mdct_butterfly_generic(T,x+(points>>i)*j,points>>i,4<<i)
[all...] |
| /external/llvm/lib/CodeGen/ |
| ShrinkWrap.cpp | 19 // For instance, the following points are safe:
26 // And the following points are not:
37 // This pass also ensures that the safe points are 3) cheaper than the regular
43 // points must be in the same loop.
46 // If this pass found points matching all these properties, then
112 /// Use to check the profitability of the new points.
151 /// \brief Update the Save and Restore points such that \p MBB is in
178 /// Check whether or not Save and Restore points are still interesting for
336 // For now, just push the restore/save points outside of loops.
428 // If the points are not interesting at this point, then they must be nul
[all...] |
| /external/opencv3/modules/imgproc/src/ |
| generalized_hough.cpp | 603 void getContourPoints(const Mat& edges, const Mat& dx, const Mat& dy, std::vector<ContourPoint>& points);
689 std::vector<ContourPoint> points; local
690 getContourPoints(edges, dx, dy, points);
696 for (size_t i = 0; i < points.size(); ++i)
698 ContourPoint p1 = points[i];
700 for (size_t j = 0; j < points.size(); ++j)
702 ContourPoint p2 = points[j];
731 void GeneralizedHoughGuilImpl::getContourPoints(const Mat& edges, const Mat& dx, const Mat& dy, std::vector<ContourPoint>& points)
737 points.clear();
738 points.reserve(edges.size().area())
[all...] |
| /external/piex/src/image_type_recognition/ |
| image_type_recognition_lite.cc | 154 // Check multiple points:
211 // Check multiple points:
309 // Check multiple points:
361 // Check two points:
397 // Check two points:
477 // Check multiple points:
515 // Check multiple points:
551 // Check multiple points:
586 // Check multiple points:
677 // Check two points: 1. valid endianness at the beginning of th
[all...] |
| /external/valgrind/exp-dhat/docs/ |
| dh-manual.xml | 41 <listitem><para>for allocation points which always allocate blocks
48 points with the following characteristics:</para>
56 <listitem><para>excessive turnover: points which chew through a lot
59 <listitem><para>excessively transient: points which allocate very
271 <para>For allocation points that always allocate blocks of the same
358 allocation points according to some metric, and shows the
372 allocation points according to some metric, and shows the
378 <para>This controls the order in which allocation points are
379 displayed. You can choose to look at allocation points with
383 by maximum live blocks tends to show up allocation points
[all...] |
| /frameworks/base/libs/hwui/tests/unit/ |
| VectorDrawableTests.cpp | 45 // Points
66 // Points
170 // Points
191 // Extreme case with numbers and decimal points crunched together
200 // Points
331 for (size_t i = 0; i < toPathData.points.size(); i++) {
332 toPathData.points[i]++;
341 for (size_t i = 0; i < outData.points.size(); i++) {
342 float expectedResult = fromPathData.points[i] * (1.0 - fraction) +
343 toPathData.points[i] * fraction
[all...] |
| /external/boringssl/src/include/openssl/ |
| ec.h | 107 /* EC_GROUP_free frees |group| and the data that it points to. */
149 /* Points on elliptic curves. */
155 /* EC_POINT_free frees |point| and the data that it points to. */
158 /* EC_POINT_clear_free clears the data that |point| points to, frees it and
196 /* EC_POINTs_make_affine converts |num| points from |points| to affine form,
200 EC_POINT *points[], BN_CTX *ctx);
|
| /external/fonttools/Lib/fontTools/misc/ |
| bezierTools.py | 26 pt1 and pt3 are the "anchor" points, pt2 is the "handle".
41 points = [(ax*t*t + bx*t + cx, ay*t*t + by*t + cy) for t in roots if 0 <= t < 1] + [pt1, pt3]
42 return calcBounds(points)
47 pt1 and pt4 are the "anchor" points, pt2 and pt3 are the "handles".
66 points = [(ax*t*t*t + bx*t*t + cx * t + dx, ay*t*t*t + by*t*t + cy * t + dy) for t in roots] + [pt1, pt4]
67 return calcBounds(points)
327 # Conversion routines for points to parameters and vice versa
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/Gimpact/ |
| gim_tri_collision.cpp | 255 // closest points
289 // closest points
340 // plane v vs U points
392 // plane U vs V points
472 if(bl == 0) //clip U points against V
478 else //clip V points against U
571 // plane v vs U points
|
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/pfr/ |
| pfrgload.c | 99 FT_Vector* p1 = outline->points + first;
100 FT_Vector* p2 = outline->points + last;
149 outline->points[n] = *to;
182 FT_Vector* vec = outline->points + outline->n_points;
784 /* translate and eventually scale the new glyph points */
787 FT_Vector* vec = base->points + old_points;
800 FT_Vector* vec = loader->base.outline.points + old_points;
|
| /external/libgdx/tests/gdx-tests/src/com/badlogic/gdx/tests/ |
| Box2DTest.java | 183 // ManifoldPoint[] points = oldManifold.getPoints();
187 // ", #points: " + pointCount +
188 // ", [" + points[0] + ", " + points[1] + "]");
272 // finally we render all contact points
281 // contact points. A manifold can have 0, 1 or 2
282 // contact points.
|
