/external/ImageMagick/Magick++/demo/ |
H A D | piddle.cpp | 72 std::vector<Magick::Coordinate> points; local 73 points.push_back(Coordinate(20,20)); 74 points.push_back(Coordinate(100,50)); 75 points.push_back(Coordinate(50,100)); 76 points.push_back(Coordinate(160,160)); 77 drawList.push_back(DrawableBezier(points)); 120 std::vector<Magick::Coordinate> points; local 121 points.push_back(Coordinate(160,120)); 122 points.push_back(Coordinate(130,190)); 123 points [all...] |
/external/skia/gm/ |
H A D | testgradient.cpp | 40 SkPoint points[2] = { variable 47 points, colors, nullptr, 2,
|
H A D | drawregionmodes.cpp | 67 SkPoint points[] = { SkPoint::Make(50.0f, 50.0f), SkPoint::Make(150.0f, 150.0f) }; variable 69 paint.setShader(SkGradientShader::MakeLinear(points, colors, nullptr, 2,
|
/external/skqp/gm/ |
H A D | testgradient.cpp | 40 SkPoint points[2] = { variable 47 points, colors, nullptr, 2,
|
H A D | drawregionmodes.cpp | 67 SkPoint points[] = { SkPoint::Make(50.0f, 50.0f), SkPoint::Make(150.0f, 150.0f) }; variable 69 paint.setShader(SkGradientShader::MakeLinear(points, colors, nullptr, 2,
|
/external/universal-tween-engine/java/api/src/aurelienribon/tweenengine/ |
H A D | TweenPath.java | 17 * @param points The waypoints of the tween, from start to target values. 18 * @param pointsCnt The number of valid points in the array. 21 public float compute(float t, float[] points, int pointsCnt); argument
|
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue177/ |
H A D | Points.java | 21 public Map<String, PointBean> points; field in class:Points
|
/external/universal-tween-engine/java/api/src/aurelienribon/tweenengine/paths/ |
H A D | Linear.java | 10 public float compute(float t, float[] points, int pointsCnt) { argument 17 return points[segment] + t * (points[segment+1] - points[segment]);
|
H A D | CatmullRom.java | 10 public float compute(float t, float[] points, int pointsCnt) { argument 18 return catmullRomSpline(points[0], points[0], points[1], points[2], t); 22 return catmullRomSpline(points[pointsCnt-3], points[pointsCnt-2], points[pointsCnt-1], points[pointsCnt-1], t); 25 return catmullRomSpline(points[segmen [all...] |
/external/ImageMagick/tests/ |
H A D | drawtest.c | 143 const PointInfo points[37] = 167 DrawPolygon(picasso,37,points); 187 const PointInfo points[48] = 213 DrawPolygon(picasso,48,points); 247 const PointInfo points[6] = 263 DrawPolygon(picasso,6,points); 268 const PointInfo points[11] = 285 DrawPolygon(picasso,11,points); 290 const PointInfo points[15] = 308 DrawPolygon(picasso,15,points); 142 const PointInfo points[37] = local 186 const PointInfo points[48] = local 246 const PointInfo points[6] = local 267 const PointInfo points[11] = local 289 const PointInfo points[15] = local 312 const PointInfo points[7] = local 333 const PointInfo points[193] = local [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/clustering/ |
H A D | Cluster.java | 25 * Cluster holding a set of {@link Clusterable} points. 26 * @param <T> the type of points that can be clustered 35 /** The points contained in this cluster. */ 36 private final List<T> points; field in class:Cluster 47 points = new ArrayList<T>(); 55 points.add(point); 59 * Get the points contained in the cluster. 60 * @return points contained in the cluster 63 return points;
|
H A D | EuclideanIntegerPoint.java | 26 * A simple implementation of {@link Clusterable} for points with integer coordinates. 61 public EuclideanIntegerPoint centroidOf(final Collection<EuclideanIntegerPoint> points) { argument 63 for (EuclideanIntegerPoint p : points) { 69 centroid[i] /= points.size();
|
H A D | KMeansPlusPlusClusterer.java | 31 * @param <T> type of the points to cluster 44 /** Split the cluster with largest number of points. */ 86 * @param points the points to cluster 90 * @return a list of clusters containing the points 92 public List<Cluster<T>> cluster(final Collection<T> points, argument 95 List<Cluster<T>> clusters = chooseInitialCenters(points, k, random); 96 assignPointsToClusters(clusters, points); 131 assignPointsToClusters(newClusters, points); 138 * Adds the given points t 145 assignPointsToClusters(final Collection<Cluster<T>> clusters, final Collection<T> points) argument 162 chooseInitialCenters(final Collection<T> points, final int k, final Random random) argument [all...] |
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/ |
H A D | CRLDistPoint.java | 45 DistributionPoint[] points) 49 for (int i = 0; i != points.length; i++) 51 v.add(points[i]); 58 * Return the distribution points making up the sequence. 44 CRLDistPoint( DistributionPoint[] points) argument
|
/external/skia/bench/ |
H A D | HardStopGradientBench_ScaleNumColors.cpp | 57 SkPoint points[2] = { variable 85 fPaint.setShader(SkGradientShader::MakeLinear(points,
|
H A D | HardStopGradientBench_ScaleNumHardStops.cpp | 39 SkPoint points[2] = { variable 71 fPaint.setShader(SkGradientShader::MakeLinear(points,
|
H A D | HardStopGradientBench_SpecialHardStops.cpp | 55 SkPoint points[2] = { variable 92 fPaint.setShader(SkGradientShader::MakeLinear(points,
|
/external/skia/src/gpu/ |
H A D | GrQuad.h | 16 * GrQuad is a collection of 4 points which can be used to represent an arbitrary quadrilateral. The 17 * points make a triangle strip with CCW triangles (top-left, bottom-left, top-right, bottom-right). 49 SkPoint* points() { function in class:GrQuad 53 const SkPoint* points() const { function in class:GrQuad
|
/external/skqp/bench/ |
H A D | HardStopGradientBench_ScaleNumColors.cpp | 57 SkPoint points[2] = { variable 85 fPaint.setShader(SkGradientShader::MakeLinear(points,
|
H A D | HardStopGradientBench_ScaleNumHardStops.cpp | 39 SkPoint points[2] = { variable 71 fPaint.setShader(SkGradientShader::MakeLinear(points,
|
/external/skqp/src/gpu/ |
H A D | GrQuad.h | 16 * GrQuad is a collection of 4 points which can be used to represent an arbitrary quadrilateral. The 17 * points make a triangle strip with CCW triangles (top-left, bottom-left, top-right, bottom-right). 49 SkPoint* points() { function in class:GrQuad 53 const SkPoint* points() const { function in class:GrQuad
|
/external/libmojo/ui/gfx/geometry/ |
H A D | point.cc | 24 POINTS points = MAKEPOINTS(point); local 25 x_ = points.x; 26 y_ = points.y;
|
/external/mesa3d/src/glx/ |
H A D | eval.c | 41 const GLfloat * points, GLubyte * pc) 45 __GLX_PUT_FLOAT_ARRAY(0, points, order * k); 51 __GLX_PUT_FLOAT_ARRAY(0, points, k); 52 points += stride; 60 const GLdouble * points, GLubyte * pc) 64 __GLX_PUT_DOUBLE_ARRAY(0, points, order * k); 69 __GLX_PUT_DOUBLE_ARRAY(0, points, k); 70 points += stride; 79 const GLfloat * points, GLfloat * data) 85 __GLX_MEM_COPY(data, points, majorOrde 40 __glFillMap1f(GLint k, GLint order, GLint stride, const GLfloat * points, GLubyte * pc) argument 59 __glFillMap1d(GLint k, GLint order, GLint stride, const GLdouble * points, GLubyte * pc) argument 77 __glFillMap2f(GLint k, GLint majorOrder, GLint minorOrder, GLint majorStride, GLint minorStride, const GLfloat * points, GLfloat * data) argument 102 __glFillMap2d(GLint k, GLint majorOrder, GLint minorOrder, GLint majorStride, GLint minorStride, const GLdouble * points, GLdouble * data) argument [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/ |
H A D | GaussianParametersGuesser.java | 32 * points. 39 /** Observed points. */ 46 * Constructs instance with the specified observed points. 48 * @param observations observed points upon which should base guess 61 * Guesses the parameters based on the observed points. 73 * Guesses the parameters based on the specified observed points. 75 * @param points observed points upon which should base guess 79 private double[] basicGuess(WeightedObservedPoint[] points) { argument 80 Arrays.sort(points, createWeightedObservedPointComparato 111 findMinY(WeightedObservedPoint[] points) argument 128 findMaxY(WeightedObservedPoint[] points) argument 154 interpolateXAtY(WeightedObservedPoint[] points, int startIdx, int idxStep, double y) argument 189 getInterpolationPointsForY(WeightedObservedPoint[] points, int startIdx, int idxStep, double y) argument [all...] |
/external/eigen/unsupported/test/ |
H A D | 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); 246 ArrayXXd points = ArrayXXd::Random(dimension, numPoints); local 249 Eigen::ChordLengths(points, knot [all...] |