| /system/media/audio_utils/include/audio_utils/ |
| resampler.h | 48 * buffer->raw points to data returned
55 * buffer->raw points to data released
|
| /external/opencv/cvaux/src/ |
| cvcalibfilter.cpp | 63 memset( points, 0, sizeof(points));
96 int pointCount, CvPoint2D32f* points )
129 if( !points || pointCount < 4 )
179 memcpy( etalonPoints, points, arrSize );
193 int* pointCount, const CvPoint2D32f** points ) const
204 if( points )
205 *points = etalonPoints;
219 cvFree( points + i );
285 imgSize, points[i], buffer
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| ECAlgorithms.java | 101 * Input: The points P, Q, scalar k = (km?, ... , k1, k0)
230 ECPoint[] points = new ECPoint[]{ Q, PsubQ, P, PaddQ }; local
231 curve.normalizeAll(points);
234 points[3].negate(), points[2].negate(), points[1].negate(),
235 points[0].negate(), infinity, points[0],
236 points[1], points[2], points[3] }
[all...] |
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/autofit/ |
| aflatin.c | 258 /* Find all blue zones. Flat segments give the reference points, */
357 FT_Pos best_y; /* same as points.y */
359 FT_Vector* points; local
383 points = outline.points;
404 /* In some fonts, they correspond to mark attachment points */
413 if ( best_point < 0 || points[pp].y > best_y )
416 best_y = points[pp].y;
420 descender = FT_MIN( descender, points[pp].y + y_offset );
427 if ( best_point < 0 || points[pp].y < best_y
[all...] |
| /external/skia/src/core/ |
| SkGeometry.h | 64 /** Given 3 points on a quadratic bezier, chop it into 1, 2 beziers such that
73 /** Given 3 points on a quadratic bezier, if the point of maximum
79 /** Given 3 points on a quadratic bezier, divide it into 2 quadratics
88 /** Given 3 points on a quadratic bezier, use degree elevation to
132 /** Given 4 points on a cubic bezier, chop it into 1, 2, 3 beziers such that
144 inflection points.
149 inflection point, 3 for having chopped at 2 inflection points.
372 * Given a conic and a tolerance, return the array of points for the
374 * represented in these points.
376 * The quads are allocated to share end-points. e.g. if there are 4 quads
[all...] |
| /frameworks/av/services/audioflinger/ |
| LinearMap.h | 26 continuous set of line segments with shared (x, y) end-points.
27 The (x, y) points must be added in order, monotonically increasing in both x and y;
30 A limited history of (x, y) points is kept for space reasons (See general usage notes).
42 We update the (track frame, sink frame) points in the LinearMap each time we write data
87 5) When called with no points in the map, findX() returns the start value (default 0).
95 exactly at the sample points pushed into the LinearMap, the returned values
107 2) Points must monotonically increase in x and y. The increment between adjacent
108 points cannot be greater than signed 32 bits. Wrap in the x, y coordinates are supported,
163 // "step" or differences between adjacent points less than 32 bits.
176 // history by removing redundant points
[all...] |
| /prebuilts/misc/windows/sdl2/test/ |
| testautomation_rect.c | 963 SDL_Point points[16]; local
1034 SDL_Point points[8]; local
1109 SDL_Point points[16]; local
1206 SDL_Point points[1]; local
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/exception/util/ |
| LocalizedFormats.java | 122 INSUFFICIENT_OBSERVED_POINTS_IN_SAMPLE("sample contains {0} observed points, at least {1} are required"),
164 NOT_DECREASING_NUMBER_OF_POINTS("points {0} and {1} are not decreasing ({2} < {3})"),
165 NOT_DECREASING_SEQUENCE("points {3} and {2} are not decreasing ({1} < {0})"), /* keep */
167 NOT_ENOUGH_POINTS_IN_SPLINE_PARTITION("spline partition must have at least {0} points, got {1}"),
168 NOT_INCREASING_NUMBER_OF_POINTS("points {0} and {1} are not increasing ({2} > {3})"),
169 NOT_INCREASING_SEQUENCE("points {3} and {2} are not increasing ({1} > {0})"), /* keep */
200 NOT_STRICTLY_DECREASING_NUMBER_OF_POINTS("points {0} and {1} are not strictly decreasing ({2} <= {3})"),
201 NOT_STRICTLY_DECREASING_SEQUENCE("points {3} and {2} are not strictly decreasing ({1} <= {0})"), /* keep */
203 NOT_STRICTLY_INCREASING_NUMBER_OF_POINTS("points {0} and {1} are not strictly increasing ({2} >= {3})"),
204 NOT_STRICTLY_INCREASING_SEQUENCE("points {3} and {2} are not strictly increasing ({1} >= {0})"), /* keep *
[all...] |
| /external/icu/icu4c/source/common/unicode/ |
| utf16.h | 155 * The result is undefined if the offset points to a single, unpaired surrogate.
186 * If the offset points to a single, unpaired surrogate, then that itself
225 * If the offset points to a trail surrogate, then that itself
227 * The result is undefined if the offset points to a single, unpaired lead surrogate.
253 * If the offset points to a trail surrogate or
277 * The offset points to the current end of the string contents
299 * The offset points to the current end of the string contents
362 * i.e., move forward by n code points.
368 * @param n number of code points to skip
382 * i.e., move forward by n code points
[all...] |
| /external/pdfium/xfa/src/fdp/src/fde/ |
| fde_gdidevice.cpp | 260 const CFX_PointsF& points,
272 pGdiPen, (const Gdiplus::PointF*)points.GetData(),
273 points.GetSize(), fTension)
275 (const Gdiplus::PointF*)points.GetData(),
276 points.GetSize(), fTension);
298 const CFX_PointsF& points,
306 pGdiPen, (const Gdiplus::PointF*)points.GetData(), points.GetSize());
379 const CFX_PointsF& points,
387 pGdiPen, (const Gdiplus::PointF*)points.GetData(), points.GetSize());
[all...] |
| /frameworks/base/libs/hwui/ |
| PathTessellator.cpp | 155 // always use 2 points for hairline
165 * Outset the bounds of point data (for line endpoints or points) to account for stroke
188 // zig zag between all previous points on the inside of the hull to create a
351 // generate alpha points - fill Alpha vertex gaps in between each point with
384 // zig zag between all previous points on the inside of the hull to create a
487 //copy most recent two points to first two points
551 * 'middlePts' is (number of points in the unclosed input vertex list, minus 2) times two
794 const float* points, int count, Rect& bounds) {
795 bounds.set(points[0], points[1], points[0], points[1])
[all...] |
| /external/skia/include/core/ |
| SkMatrix.h | 379 /** Set the matrix such that the specified src points would map to the
380 specified dst points. count must be within [0..4].
381 @param src The array of src points
382 @param dst The array of dst points
383 @param count The number of points to use for the transformation
422 /** Apply this matrix to the array of points specified by src, and write
423 the transformed points into the array of points specified by dst.
429 @param count The number of points in src to read, and then transform
439 /** Apply this matrix to the array of points, overwriting it with th
[all...] |
| /external/autotest/client/site_tests/firmware_TouchMTB/ |
| validators.py | 76 # Define the ratio of points taken at both ends of a line for edge tests.
269 points = self.packets.get_ordered_finger_path(self.finger, 'point')
270 list_x = [p.x for p in points]
271 list_y = [p.y for p in points]
295 points = self.packets.get_ordered_finger_path(0, 'point')
298 for t, pt in zip(times, points)]
399 It calculates the simple linear regression line for the points
400 in the middle segment of the line. This exclude the points at
402 calculates the fitting errors of the points at the specified segments
445 # If there are less than 2 data points, it is not a line at all
[all...] |
| /external/icu/icu4c/source/common/ |
| utrie2.h | 36 * Unicode code points (0..0x10ffff). (A map from code points to integers.)
40 * - Still splitting BMP code points 11:5 bits for index and data table lookups.
43 * for data lookup for supplementary code points.
47 * in the lead surrogate data for the associated supplementary code points.
50 * - For supplementary code points U+10000..highStart-1 a three-table lookup
111 * or the errorValue for out-of-range code points and illegal UTF-8.
116 * @param initialValue the initial value that is set for all code points
117 * @param errorValue the value for out-of-range code points and illegal UTF-8
157 * of code points with the same value as retrieved from the trie an
[all...] |
| /frameworks/base/docs/image_sources/gcm/ |
| CCS-ack.graffle | 208 <key>Points</key>
254 <key>Points</key>
298 <key>Points</key>
330 <key>Points</key>
369 <key>Points</key>
503 <key>Points</key>
526 <key>Points</key>
549 <key>Points</key>
671 <key>Points</key>
1046 <key>Points</key
[all...] |
| /art/tools/dexfuzz/src/dexfuzz/rawdex/ |
| OpcodeInfo.java | 22 * Every Instruction points to an OpcodeInfo object that holds useful information
|
| /cts/tests/tests/os/src/android/os/cts/ |
| EnvironmentTest.java | 34 * something OS-defined. If TMPDIR points to a global shared directory,
|
| /developers/build/prebuilts/gradle/XYZTouristAttractions/Application/src/main/res/values/ |
| base-strings.xml | 31 notable points of interest.
|
| /development/samples/browseable/XYZTouristAttractions/Application/res/values/ |
| base-strings.xml | 31 notable points of interest.
|
| /external/ImageMagick/www/Magick++/ |
| ImageDesign.html | 13 The class Magick::Image is a simple handle which points to a reference-counted image representation. This allows multiple Magick::Image instances to share the same image and attributes. At the point in time that the image data, or image attributes are modified and the current reference count is greater than one, the image data and attributes are copied to create a new image with a reference count of one and the reference count on the old image is decremented. If the reference count on the old image becomes zero, then the associated reference and data are deleted. This strategy represents a simple (but effective) form of garbage collection
|
| /external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/xy/ |
| LineAndPointRenderer.java | 28 * Renders a point as a line with the vertices marked. Requires 2 or more points to
87 ArrayList<Pair<PointF, Integer>> points = new ArrayList<Pair<PointF, Integer>>(series.size());
local
101 points.add(new Pair<PointF, Integer>(thisPoint, i));
139 for (Pair<PointF, Integer> p : points) {
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/ |
| MultivariateMatrixFunction.java | 35 * @exception IllegalArgumentException if points dimension is wrong
|
| MultivariateRealFunction.java | 34 * @exception IllegalArgumentException if points dimension is wrong
|
| MultivariateVectorialFunction.java | 34 * @exception IllegalArgumentException if points dimension is wrong
|
| /external/autotest/client/cros/camera/ |
| camera_utils.py | 8 # Dimension padding/unpadding function for converting points matrices to
|
