| /external/icu/icu4c/source/data/sprep/ |
| rfc4011.txt | 18 # This table contains code points from Table A.1 from RFC 3454
417 # Total code points 3653
419 # This table contains code points from Table B.1 from RFC 3454
449 # Total code points 27
451 # code points from Table C.2.1
456 # Total code points 18
458 # code points from Table C.2.2
477 # Total code points 30
479 # code points from Table C.3
485 # Total code points 205
[all...] |
| /external/icu/icu4c/source/test/testdata/ |
| nfs4_mixed_prep_p.txt | 10 # This table contains code points from Table A.1 from RFC 3454
409 # Total code points 3653
411 # This table contains code points from Table B.1 from RFC 3454
441 # Total code points 27
443 # code points from Table C.1.2
463 # Total code points 17
465 # code points from Table C.2.2
484 # Total code points 30
486 # code points from Table C.3
492 # Total code points 205
[all...] |
| /external/ceres-solver/examples/ |
| bundle_adjuster.cc | 40 // problem in computer vision. Given a set of 3d points X_1, ..., X_n,
77 "automatic, cameras, points, cameras,points, points,cameras");
144 double* points = bal_problem->mutable_points(); local
157 } else if (FLAGS_blocks_for_inner_iterations == "points") {
161 options->inner_iteration_ordering->AddElementToGroup(points + point_block_size * i, 0);
163 } else if (FLAGS_blocks_for_inner_iterations == "cameras,points") {
170 options->inner_iteration_ordering->AddElementToGroup(points + point_block_size * i, 1);
172 } else if (FLAGS_blocks_for_inner_iterations == "points,cameras")
253 double* points = bal_problem->mutable_points(); local
[all...] |
| /external/freetype/src/pshinter/ |
| pshalgo.c | 39 #define COMPUTE_INFLEXS /* compute inflection points to optimize `S' */
886 /***** POINTS INTERPOLATION ROUTINES *****/
1019 /* compute all inflex points in a given glyph */
1034 /* we need at least 4 points to create an inflection point */
1137 FT_FREE( glyph->points );
1178 FT_Vector* vec = glyph->outline->points;
1179 PSH_Point point = glyph->points;
1273 PSH_Point points = glyph->points; local
1312 PSH_Point points = glyph->points; local
1879 PSH_Point points = glyph->points; local
[all...] |
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/pshinter/ |
| pshalgo.c | 39 #define COMPUTE_INFLEXS /* compute inflection points to optimize `S' */
886 /***** POINTS INTERPOLATION ROUTINES *****/
925 /* compute all inflex points in a given glyph */
940 /* we need at least 4 points to create an inflection point */
1043 FT_FREE( glyph->points );
1084 FT_Vector* vec = glyph->outline->points;
1085 PSH_Point point = glyph->points;
1119 PSH_Point point = glyph->points;
1120 FT_Vector* vec = glyph->outline->points;
1169 /* allocate and setup points + contours arrays *
1179 PSH_Point points = glyph->points; local
1218 PSH_Point points = glyph->points; local
1785 PSH_Point points = glyph->points; local
[all...] |
| /external/pdfium/third_party/freetype/src/pshinter/ |
| pshalgo.c | 39 #define COMPUTE_INFLEXS /* compute inflection points to optimize `S' */
886 /***** POINTS INTERPOLATION ROUTINES *****/
925 /* compute all inflex points in a given glyph */
940 /* we need at least 4 points to create an inflection point */
1043 FT_FREE( glyph->points );
1084 FT_Vector* vec = glyph->outline->points;
1085 PSH_Point point = glyph->points;
1119 PSH_Point point = glyph->points;
1120 FT_Vector* vec = glyph->outline->points;
1169 /* allocate and setup points + contours arrays *
1179 PSH_Point points = glyph->points; local
1218 PSH_Point points = glyph->points; local
1785 PSH_Point points = glyph->points; local
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/integration/ |
| LegendreGaussIntegrator.java | 33 * Legendre-Gauss integrator using an n-points quadrature formula can
56 /** Abscissas for the 2 points method. */
62 /** Weights for the 2 points method. */
68 /** Abscissas for the 3 points method. */
75 /** Weights for the 3 points method. */
82 /** Abscissas for the 4 points method. */
90 /** Weights for the 4 points method. */
98 /** Abscissas for the 5 points method. */
107 /** Weights for the 5 points method. */
124 * @param n number of points desired (must be between 2 and 5 inclusive
[all...] |
| /external/chromium-trace/catapult/tracing/tracing/ui/tracks/ |
| chart_track_test.html | 130 track.series[0].points[1].modelItem.selectionState =
132 track.series[1].points[1].modelItem.selectionState =
134 track.series[2].points[3].modelItem.selectionState =
170 assert.equal(sel[0], track.series[0].points[1].modelItem);
171 assert.equal(sel[1], track.series[1].points[1].modelItem);
172 assert.equal(sel[2], track.series[2].points[3].modelItem);
181 track.series[0].points[0].modelItem, -1, sel));
187 track.series[1].points[1].modelItem, 1, sel));
189 assert.equal(sel[0], track.series[1].points[2].modelItem);
198 assert.equal(sel[0], track.series[0].points[2].modelItem)
[all...] |
| /external/skia/experimental/SimpleCocoaApp/ |
| SimpleApp.mm | 163 int points = path.countPoints();
171 if (rectPointsMin > points) {
172 rectPointsMin = points;
174 if (rectPointsMax < points) {
175 rectPointsMax = points;
186 if (pointsMin > points) {
187 pointsMin = points;
189 if (pointsMax < points) {
190 pointsMax = points;
273 SkDebugf("points min=%d max=%d verbs min=%d max=%d\n", canvas.pointsMin, canvas.pointsMax
[all...] |
| /external/opencv3/modules/imgproc/src/ |
| min_enclosing_triangle.cpp | 134 static void createConvexHull(cv::InputArray points, std::vector<cv::Point2f> &polygon);
147 static void findMinEnclosingTriangle(cv::InputArray points,
296 //! Find the minimum enclosing triangle for the given set of points and return its area
298 * @param points Set of points
299 * @param triangle Minimum area triangle enclosing the given set of points
301 double cv::minEnclosingTriangle(cv::InputArray points, CV_OUT cv::OutputArray triangle) {
304 minEnclosingTriangle::findMinEnclosingTriangle(points, triangle, area);
317 * @param points Set of points
[all...] |
| /external/freetype/src/base/ |
| ftoutln.c | 96 limit = outline->points + last;
98 v_start = outline->points[first];
102 v_last = outline->points[last];
108 point = outline->points + first;
128 /* if both first and last points are conic, */
318 if ( FT_NEW_ARRAY( anoutline->points, numPoints ) ||
417 FT_ARRAY_COPY( target->points, source->points, source->n_points );
446 FT_FREE( outline->points );
491 FT_Vector* vec = outline->points;
909 FT_Vector* points; local
1034 FT_Vector* points; local
[all...] |
| /external/opencv3/doc/py_tutorials/py_calib3d/py_calibration/ |
| py_calibration.markdown | 54 find some specific points in it ( square corners in chess board). We know its coordinates in real
65 calibration is a set of 3D real world points and its corresponding 2D image points. 2D image points
66 are OK which we can easily find from the image. (These image points are locations where two black
69 What about the 3D points from real world space? Those images are taken from a static camera and
73 values, we can simply pass the points as (0,0), (1,0), (2,0), ... which denotes the location of
74 points. In this case, the results we get will be in the scale of size of chess board square. But if
79 3D points are called **object points** and 2D image points are called **image points.*
[all...] |
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/truetype/ |
| ttgload.c | 350 /* reading the contours' endpoints & number of points */
385 /* note that we will add four phantom points later */
467 vec = outline->points;
506 vec = gloader->current.outline.points;
714 zone->cur = load->outline.points + start_point;
729 /* the zone is supposed to include four phantom points. */
781 /* round phantom points */
818 /* save glyph phantom points */
861 /* set phantom points */
863 outline->points[n_points ] = loader->pp1
1538 FT_Vector points[4]; local
1694 FT_Vector* points = NULL; local
[all...] |
| /external/pdfium/third_party/freetype/src/truetype/ |
| ttgload.c | 349 /* reading the contours' endpoints & number of points */
384 /* note that we will add four phantom points later */
466 vec = outline->points;
505 vec = gloader->current.outline.points;
712 zone->cur = load->outline.points + start_point;
727 /* the zone is supposed to include four phantom points. */
779 /* round phantom points */
816 /* save glyph phantom points */
859 /* set phantom points */
861 outline->points[n_points ] = loader->pp1
1531 FT_Vector points[4]; local
1658 FT_Vector* points = NULL; local
[all...] |
| /external/freetype/src/truetype/ |
| ttgload.c | 372 /* reading the contours' endpoints & number of points */
407 /* note that we will add four phantom points later */
489 vec = outline->points;
528 vec = gloader->current.outline.points;
735 zone->cur = load->outline.points + start_point;
750 /* the zone is supposed to include four phantom points. */
804 /* round phantom points */
841 /* save glyph phantom points */
884 /* set phantom points */
886 outline->points[n_points ] = loader->pp1
1559 FT_Vector points[4]; local
1686 FT_Vector* points = NULL; local
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/ |
| package.html | 24 whose graph <code>y=f(x)</code> should pass through sample points, and
26 <code>f(x<sub>i</sub>)-y<sub>i</sub></code> for observed points
|
| /external/boringssl/src/ssl/test/runner/curve25519/ |
| doc.go | 13 // coordinates of group points and all values are in little-endian form.
19 // coordinates of group points, base is the standard generator and all values
|
| /external/chromium-trace/catapult/third_party/graphy/graphy/ |
| line_chart.py | 92 def __init__(self, points=None):
94 if points is not None:
95 self.AddLine(points)
97 def AddLine(self, points, label=None, color=None,
104 points: List of equally-spaced y-values for the line
119 series = common.DataSeries(points, label=label, style=style,
124 def AddSeries(self, points, color=None, style=LineStyle.solid, markers=None,
129 return self.AddLine(points, color=color, width=style.width,
|
| /external/eigen/unsupported/test/ |
| splines.cpp | 207 ControlPointVectorType points = ControlPointVectorType::Random(2,100); local
210 Eigen::ChordLengths(points, chord_lengths);
214 const Spline2d spline = SplineFitting<Spline2d>::Interpolate(points,3);
216 for (Eigen::DenseIndex i=0; i<points.cols(); ++i)
219 PointType ref = points.col(i);
226 const Spline2d spline = SplineFitting<Spline2d>::Interpolate(points,3,chord_lengths);
228 for (Eigen::DenseIndex i=0; i<points.cols(); ++i)
231 PointType ref = points.col(i);
|
| /external/icu/icu4c/source/common/ |
| bmpset.h | 27 * optimized for BMP code points. Structured to be UTF-8-friendly.
77 * binary search is restricted for finding code points in a certain range.
106 * The bits are organized vertically; consecutive code points
119 * One bit per 64 BMP code points.
127 * for all code points in the 64-block.
140 * U+0800 is the first 3-byte-UTF-8 code point. Code points below U+0800 are
142 * The last pair of indexes is for finding supplementary code points.
148 * for mixed BMP blocks and for supplementary code points.
|
| /external/icu/icu4c/source/common/unicode/ |
| usprep.h | 36 * <li> Unassinged Table: Contains code points that are unassigned
39 * <li> Prohibited Table: Contains code points that are prohibted from
72 * Option to prohibit processing of unassigned code points in the input
80 * Option to allow processing of unassigned code points in the input
241 * - USPREP_DEFAULT Prohibit processing of unassigned code points in the input
243 * - USPREP_ALLOW_UNASSIGNED Treat the unassigned code points are in the input
244 * as normal Unicode code points.
252 * too many code points.
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/Gimpact/ |
| btTriangleShapeEx.cpp | 29 btScalar margin, const btVector3 * points, int point_count)
40 btScalar _dist = - bt_distance_point_plane(plane,points[_k]) + margin;
60 m_points[_k] = points[point_indices[_k]];
68 // classify points on other triangle
77 // classify points on this triangle
133 // plane v vs U points
197 // classify points on other triangle
206 // classify points on this triangle
|
| /external/opencv3/samples/gpu/ |
| pyrlk_optical_flow.cpp | 90 "{ points | 4000 | specify points count [GoodFeatureToTrack] }"
91 "{ min_dist | 0 | specify minimal distance between points [GoodFeatureToTrack] }";
115 int points = cmd.get<int>("points"); local
131 cout << "Points count : " << points << endl;
145 Ptr<cuda::CornersDetector> detector = cuda::createGoodFeaturesToTrackDetector(d_frame0Gray.type(), points, 0.01, minDist);
|
| /external/opencv3/samples/python2/ |
| texture_flow.py | 38 points = np.dstack( np.mgrid[d/2:w:d, d/2:h:d] ).reshape(-1, 2) variable
39 for x, y in points:
|
| /external/pdfium/xfa/src/fxbarcode/pdf417/ |
| BC_PDF417DetectorResult.cpp | 28 CFX_PtrArray* points) {
30 m_points = points;
|
