| /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/ |
| b2Collision.h | 26 /// Structures and functions used for computing contact points, distance
61 /// of the contact points.
102 b2ManifoldPoint points[b2_maxManifoldPoints]; ///< the points of contact member in struct:b2Manifold
106 int32 pointCount; ///< the number of manifold points
121 b2Vec2 points[b2_maxManifoldPoints]; ///< world contact point (point of intersection)
member in struct:b2WorldManifold
125 /// This is used for determining the state of contact points.
|
| b2Distance.cpp | 331 // - points[2]
332 // - edge points[0]-points[2]
333 // - edge points[1]-points[2]
501 // If we have 3 points, then the origin is in the corresponding triangle.
533 // Compute a tentative new simplex vertex using support points.
546 // Check for duplicate support points. This is the main termination criteria.
586 // Move the witness points to the outer surface.
596 // Move the witness points to the middle
[all...] |
| /external/mesa3d/src/gallium/state_trackers/vega/ |
| vgu.c | 81 const VGfloat * points,
94 if (!points || count <= 0 || !is_aligned(points)) {
107 coords[0] = points[0];
108 coords[1] = points[1];
111 coords[2*i + 0] = points[2*i + 0];
112 coords[2*i + 1] = points[2*i + 1];
|
| /external/opencv3/modules/calib3d/test/ |
| test_undistort.cpp | 198 test_array[INPUT].push_back(NULL); // points matrix
203 test_array[OUTPUT].push_back(NULL); // distorted dst points
204 test_array[TEMP].push_back(NULL); // dst points
274 vector<Point2d> points(N_POINTS);
279 Mat _points(test_mat[INPUT][0].size(), CV_64FC2, &points[0]);
283 //Generating points
286 points[i].x = cvtest::randReal(rng)*img_size.width;
287 points[i].y = cvtest::randReal(rng)*img_size.height;
388 double* points = new double[N_POINTS*2]; local
396 CvMat _points= cvMat(test_mat[TEMP][0].rows,test_mat[TEMP][0].cols,CV_64FC2,points);
847 double* points = new double[N_POINTS*2]; local
[all...] |
| /frameworks/base/libs/hwui/tests/unit/ |
| BakedOpDispatcherTests.cpp | 145 const float points[4] = {0.5, 0.5, 1.0, 1.0}; local
146 PointsOp antiAliasedPointsOp(bounds, Matrix4::identity(), nullptr, &aaPaint, points, 4);
148 << "Expect no offset for AA points.";
149 PointsOp pointsOp(bounds, Matrix4::identity(), nullptr, &paint, points, 4);
151 << "Expect an offset for non-AA points.";
153 LinesOp antiAliasedLinesOp(bounds, Matrix4::identity(), nullptr, &aaPaint, points, 4);
156 LinesOp linesOp(bounds, Matrix4::identity(), nullptr, &paint, points, 4);
|
| /frameworks/base/packages/SettingsLib/src/com/android/settingslib/ |
| BatteryInfo.java | 51 SparseIntArray points = new SparseIntArray();
63 points.put((int) time, record.batteryLevel);
68 if (points.size() > 1) {
69 view.addPath(points);
71 points.clear();
76 if (points.size() > 1) {
77 view.addPath(points);
|
| /libcore/ojluni/src/main/java/java/net/ |
| JarURLConnection.java | 201 * connection points to a JAR file and not a JAR file entry.
241 * connection points to a JAR file and not a JAR file entry.
244 * the JAR URL for this connection points to a JAR file.
258 * for it points to a JAR file entry, null otherwise.
261 * for it points to a JAR file entry, null otherwise.
293 * for it points to a JAR file entry, null otherwise. This method
300 * for it points to a JAR file entry, null otherwise.
|
| /external/freetype/src/autofit/ |
| aflatin.c | 254 /* Find all blue zones. Flat segments give the reference points, */
347 FT_Pos best_y; /* same as points.y */
349 FT_Vector* points; local
373 points = outline.points;
394 /* In some fonts, they correspond to mark attachment points */
402 if ( best_point < 0 || points[pp].y > best_y )
405 best_y = points[pp].y;
411 if ( best_point < 0 || points[pp].y < best_y )
414 best_y = points[pp].y
[all...] |
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/stringprep/ |
| PunycodeReference.java | 150 /* Handle the basic code points: */
159 /* (not needed for Punycode with unsigned code points) */
164 /* h is the number of code points that have been handled, b is the */
165 /* number of basic code points, and out is the number of characters */
173 /* All non-basic code points < n have been */
311 /* Handle the basic code points: Let b be the number of input code */
312 /* points before the last delimiter, or 0 if there is none, then */
313 /* copy the first b code points to the output. */
329 /* basic code points were copied; start at the beginning otherwise. */
334 /* out is the number of code points in the output array. *
[all...] |
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/stringprep/ |
| PunycodeReference.java | 149 /* Handle the basic code points: */
158 /* (not needed for Punycode with unsigned code points) */
163 /* h is the number of code points that have been handled, b is the */
164 /* number of basic code points, and out is the number of characters */
172 /* All non-basic code points < n have been */
310 /* Handle the basic code points: Let b be the number of input code */
311 /* points before the last delimiter, or 0 if there is none, then */
312 /* copy the first b code points to the output. */
328 /* basic code points were copied; start at the beginning otherwise. */
333 /* out is the number of code points in the output array. *
[all...] |
| /external/libgdx/gdx/src/com/badlogic/gdx/maps/tiled/ |
| BaseTmxMapLoader.java | 184 String[] points = child.getAttribute("points").split(" "); local
185 float[] vertices = new float[points.length * 2];
186 for (int i = 0; i < points.length; i++) {
187 String[] point = points[i].split(",");
195 String[] points = child.getAttribute("points").split(" "); local
196 float[] vertices = new float[points.length * 2];
197 for (int i = 0; i < points.length; i++) {
198 String[] point = points[i].split(",")
[all...] |
| /external/zlib/src/examples/ |
| zran.c | 14 its entirety, and an index built with access points about every SPAN bytes
27 grows as needed to accommodate the points.
49 not be constrained to have access points at block boundaries, but requires
62 #define SPAN 1048576L /* desired distance between access points */
97 /* if list is empty, create it (start with eight points) */
137 access points about every span bytes of uncompressed output -- span is
141 returns the number of access points on success (>= 1), Z_MEM_ERROR for out
143 file read error. On success, *built points to the resulting index. */
149 struct access *index; /* access points being generated */
392 fprintf(stderr, "zran: built index with %d access points\n", len)
[all...] |
| /external/ImageMagick/MagickCore/ |
| draw.c | 110 *points;
405 if ((p->points[0].y-DrawEpsilon) > q->points[0].y)
407 if ((p->points[0].y+DrawEpsilon) < q->points[0].y)
409 if ((p->points[0].x-DrawEpsilon) > q->points[0].x)
411 if ((p->points[0].x+DrawEpsilon) < q->points[0].x)
413 if (((p->points[1].x-p->points[0].x)*(q->points[1].y-q->points[0].y)
107 *points; member in struct:_EdgeInfo
470 *points; local
5128 points[3], local
5258 *points; local
5451 points[4] = { {0.0,0.0}, {0.0,0.0}, {0.0,0.0}, {0.0,0.0} }, local
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/ |
| MicrosphereInterpolatingFunction.java | 130 * @param xval the arguments for the interpolation points.
136 * @param yval the values for the interpolation points
142 * {@code xval} (equal to {@code n}, the number of interpolation points)
197 // Compute contribution of each sample points to the microsphere elements illumination
206 // actually (very close to) one of the sampled points.
|
| /external/autotest/client/cros/netprotos/ |
| cros_p2p.py | 113 # The PTR record points to a SRV name.
119 # The SRV points to a hostname, port, etc.
155 # The PTR record points to a SRV name.
159 # The SRV points to a hostname, port, etc.
164 # Each service points to a hostname (srvname).
|
| /external/curl/lib/ |
| http.h | 155 points to an allocated send_buffer struct */
172 char *mem; /* points to a buffer in memory to store received data */
173 size_t len; /* size of the buffer 'mem' points to */
176 const uint8_t *upload_mem; /* points to a buffer to read from */
177 size_t upload_len; /* size of the buffer 'upload_mem' points to */
|
| /external/guava/guava/src/com/google/common/escape/ |
| ArrayBasedUnicodeEscaper.java | 31 * determines whether code points without specific replacements are to be
68 * points are considered safe.
90 * points are considered safe. This initializer is useful when explicit
133 // The safe range is empty or the all safe code points lie in or above the
200 * this method to provide generalized escaping for code points if required.
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| Trie2_16.java | 23 * code points (values ranging from 0 to 0x10ffff) to a 16 or 32 bit value.
84 // lead surrogate code units and code points.
88 // surrogate code points will be so rare in practice that it's not worth it.
173 * Given a starting code point, find the last in a range of code points,
229 // a number of code points equal to the length of the block.
|
| Trie2_32.java | 22 * code points (values ranging from 0 to 0x10ffff) to a 16 or 32 bit value.
83 // lead surrogate code units and code points.
87 // surrogate code points will be so rare in practice that it's not worth it.
170 * Given a starting code point, find the last in a range of code points,
226 // a number of code points equal to the length of the block.
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| Trie2_16.java | 22 * code points (values ranging from 0 to 0x10ffff) to a 16 or 32 bit value.
82 // lead surrogate code units and code points.
86 // surrogate code points will be so rare in practice that it's not worth it.
171 * Given a starting code point, find the last in a range of code points,
227 // a number of code points equal to the length of the block.
|
| Trie2_32.java | 21 * code points (values ranging from 0 to 0x10ffff) to a 16 or 32 bit value.
81 // lead surrogate code units and code points.
85 // surrogate code points will be so rare in practice that it's not worth it.
168 * Given a starting code point, find the last in a range of code points,
224 // a number of code points equal to the length of the block.
|
| /external/libgdx/gdx/src/com/badlogic/gdx/math/ |
| Polygon.java | 35 /** Constructs a new polygon from a float array of parts of vertex points.
40 * @throws IllegalArgumentException if less than 6 elements, representing 3 points, are provided */
42 if (vertices.length < 6) throw new IllegalArgumentException("polygons must contain at least 3 points.");
115 * @throws IllegalArgumentException if less than 6 elements, representing 3 points, are provided */
117 if (vertices.length < 6) throw new IllegalArgumentException("polygons must contain at least 3 points.");
|
| /external/llvm/include/llvm/CodeGen/ |
| GCStrategy.h | 24 // - Safe points
25 // Garbage collection is generally only possible at certain points in code.
26 // GCStrategy can request that the collector insert such points:
88 unsigned NeededSafePoints; ///< Bitmask of required safe points.
135 /// True if safe points of any kind are required. By default, none are
|
| /external/mesa3d/src/mesa/vbo/ |
| vbo_exec_eval.c | 154 _math_horner_bezier_curve(map->Points, data, uu,
173 _math_horner_bezier_curve(map->Points, vertex, uu,
200 _math_horner_bezier_surf(map->Points,
226 _math_de_casteljau_surf(map->Points, vertex, du, dv, uu, vv,
251 _math_horner_bezier_surf(map->Points, vertex, uu, vv,
|
| /external/opencv3/doc/py_tutorials/py_feature2d/py_fast/ |
| py_fast.markdown | 49 First 3 points are addressed with a machine learning approach. Last one is addressed using
55 2. Run FAST algorithm in every images to find feature points.
73 Detecting multiple interest points in adjacent locations is another problem. It is solved by using
76 -# Compute a score function, \f$V\f$ for all the detected feature points. \f$V\f$ is the sum of absolute
95 simple code on how to detect and draw the FAST feature points.
|
