| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/ |
| net_dropmon.h | 36 struct net_dm_drop_point points[0]; member in struct:net_dm_alert_msg
|
| /packages/apps/Gallery2/src/com/android/gallery3d/data/ |
| LocationClustering.java | 87 final ArrayList<Point> points = new ArrayList<Point>(); local
93 points.add(new Point(s.lat, s.lng));
105 pointsArray = points.toArray(pointsArray);
201 // Input: n points
204 private static int[] kMeans(Point points[], int[] bestK) {
205 int n = points.length;
212 Point[] groupSum = new Point[maxK]; // sum of points in each group.
213 int[] groupCount = new int[maxK]; // number of points in each group.
233 // step 1: (arbitrarily) pick k points as the initial centers.
236 Point p = points[i * delta]
[all...] |
| /packages/experimental/KBars/app/src/main/java/js/kbars/ |
| TouchTrackingLayout.java | 218 List<float[]> points = new ArrayList(); local
220 points.add(new float[MAX_POINTS]);
222 return points;
|
| /packages/apps/Settings/src/com/android/settings/graph/ |
| UsageGraph.java | 131 public void addPath(SparseIntArray points) {
132 addPathAndUpdate(points, mPaths, mLocalPaths);
135 public void addProjectedPath(SparseIntArray points) {
136 addPathAndUpdate(points, mProjectedPaths, mLocalProjectedPaths);
140 SparseIntArray points, SparseIntArray paths, SparseIntArray localPaths) {
142 for (int i = 0, size = points.size(); i < size; i++) {
143 paths.put(points.keyAt(i), points.valueAt(i));
146 paths.put(points.keyAt(points.size() - 1) + 1, PATH_DELIM)
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/clustering/ |
| 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,
95 List<Cluster<T>> clusters = chooseInitialCenters(points, k, random);
96 assignPointsToClusters(clusters, points);
131 assignPointsToClusters(newClusters, points);
138 * Adds the given points to the closest {@link Cluster}
290 final List<T> points = cluster.getPoints(); local
[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/clang/test/Sema/ |
| flexible-array-init.c | 45 struct point points[]; // expected-note{{initialized flexible array member 'points' is here}} member in struct:polygon
48 .points[2] = { 1, 2} }; // expected-error{{designator into flexible array member subobject}}
|
| /external/deqp/external/openglcts/modules/glesext/tessellation_shader/ |
| esextcTessellationShaderVertexSpacing.hpp | 55 * computed from locations of edge start & end points), t should be
217 _tess_edge_points points; member in struct:glcts::TessellationShaderVertexSpacing::_tess_edge
242 /** Comparator that is used to sort points relative to a certain origin. */
258 /* Tells which of the user-provided points is closer to the instance-specific
|
| /external/deqp/framework/common/ |
| tcuRasterizationVerifier.hpp | 93 std::vector<ScenePoint> points; member in struct:tcu::PointSceneSpec
170 * Verifies points in the surface are rasterized within the bounds given
171 * by RasterizationArguments. Points should not be z-clipped.
|
| /external/dng_sdk/source/ |
| dng_camera_profile.cpp | 1035 uint32 points = profileInfo.fToneCurveCount / 2; local
1037 fToneCurve.fCoord.resize (points);
1039 for (size_t i = 0; i < points; i++)
|
| /external/mesa3d/src/gallium/auxiliary/indices/ |
| u_indices_gen.py | 36 PRIMS=('points',
214 def points(intype, outtype, inpv, outpv, pr): function
215 preamble(intype, outtype, inpv, outpv, pr, prim='points')
429 points(intype, outtype, inpv, outpv, pr)
|
| /external/mesa3d/src/mesa/main/ |
| eval.c | 145 /*** Copy and deallocate control points ***/
150 * Copy 1-parametric evaluator control points from user-specified
151 * memory space to a buffer of contiguous control points.
153 * \return pointer to buffer of contiguous control points or NULL if out
157 const GLfloat *points )
162 if (!points || !size)
168 for (i = 0, p = buffer; i < uorder; i++, points += ustride)
170 *p++ = points[k];
181 const GLdouble *points )
186 if (!points || !size
380 map1(target, (GLfloat) u1, (GLfloat) u2, stride, order, points, GL_DOUBLE); local
484 (GLfloat) v1, (GLfloat) v2, vstride, vorder, points, GL_DOUBLE); local
[all...] |
| /external/mesa3d/src/mesa/tnl_dd/ |
| t_dd_tritmp.h | 42 * DO_UNFILLED: Decompose triangles to lines and points where appropriate.
632 static void TAG(points)( struct gl_context *ctx, GLuint first, GLuint last ) function
669 TAB[IND].points = TAG(points);
|
| /external/skia/gm/ |
| convex_all_line_paths.cpp | 177 const SkPoint* points; local
181 points = ConvexLineOnlyData::gPoints[index];
225 points = data.get();
231 path.moveTo(points[0]);
233 path.lineTo(points[i]);
236 path.moveTo(points[numPts-1]);
238 path.lineTo(points[i]);
|
| gamut.cpp | 71 SkPoint points[2] = { variable
80 paint.setShader(SkGradientShader::MakeLinear(points, colors, nullptr, 4,
83 paint.setShader(SkGradientShader::MakeLinear(points, fColors, nullptr, 2,
|
| /external/skia/src/core/ |
| SkPath_serial.cpp | 120 buffer.write(fPathRef->points(), pts * sizeof(SkPoint));
216 const SkPoint* points = buffer.skipCount<SkPoint>(pts); local
242 tmp.moveTo(*points++);
246 tmp.lineTo(*points++);
250 tmp.quadTo(points[0], points[1]);
251 points += 2;
255 tmp.conicTo(points[0], points[1], *conics++);
256 points += 2
[all...] |
| SkRecorder.cpp | 106 // This measured around 2x faster for copying code points,
258 const int points = paint.countText(text, byteLength); local
263 this->copy(pos, points));
268 const int points = paint.countText(text, byteLength); local
274 this->copy(xpos, points));
|
| /external/skia/tests/ |
| GeometryTest.cpp | 250 SkPoint points[] = {{x1, y1}, {x2, y1}, {x2, y2}, {x1, y2}}; local
253 bezier[0] = points[i];
256 bezier[1] = points[jidx];
261 bezier[2] = points[kidx];
264 bezier[3] = points[l];
273 bezier[0] = points[i];
276 bezier[1] = points[jidx];
277 bezier[2] = points[jidx];
282 bezier[3] = points[kidx];
|
| /external/skia/tools/debugger/ |
| SkObjectParser.cpp | 198 SkPoint points[4]; local
200 for(verb = iter.next(points, false);
202 verb = iter.next(points, false)) {
209 mPath->appendScalar(points[gPtOffsetPerVerb[verb]+i].fX);
211 mPath->appendScalar(points[gPtOffsetPerVerb[verb]+i].fY);
|
| /external/skqp/gm/ |
| convex_all_line_paths.cpp | 177 const SkPoint* points; local
181 points = ConvexLineOnlyData::gPoints[index];
225 points = data.get();
231 path.moveTo(points[0]);
233 path.lineTo(points[i]);
236 path.moveTo(points[numPts-1]);
238 path.lineTo(points[i]);
|
| gamut.cpp | 70 SkPoint points[2] = { variable
79 paint.setShader(SkGradientShader::MakeLinear(points, colors, nullptr, 4,
82 paint.setShader(SkGradientShader::MakeLinear(points, fColors, nullptr, 2,
|
| /external/skqp/src/core/ |
| SkRecorder.cpp | 106 // This measured around 2x faster for copying code points,
258 const int points = paint.countText(text, byteLength); local
263 this->copy(pos, points));
268 const int points = paint.countText(text, byteLength); local
274 this->copy(xpos, points));
|
| /external/skqp/tests/ |
| GeometryTest.cpp | 250 SkPoint points[] = {{x1, y1}, {x2, y1}, {x2, y2}, {x1, y2}}; local
253 bezier[0] = points[i];
256 bezier[1] = points[jidx];
261 bezier[2] = points[kidx];
264 bezier[3] = points[l];
273 bezier[0] = points[i];
276 bezier[1] = points[jidx];
277 bezier[2] = points[jidx];
282 bezier[3] = points[kidx];
|
| /external/skqp/tools/debugger/ |
| SkObjectParser.cpp | 198 SkPoint points[4]; local
200 for(verb = iter.next(points, false);
202 verb = iter.next(points, false)) {
209 mPath->appendScalar(points[gPtOffsetPerVerb[verb]+i].fX);
211 mPath->appendScalar(points[gPtOffsetPerVerb[verb]+i].fY);
|
| /external/zxing/qr_scanner/src/com/google/zxing/client/android/ |
| ViewfinderView.java | 36 * transparency outside it, as well as the laser scanner animation and result points.
172 * Draw a bitmap with the result points highlighted instead of the live scanning display.
182 List<ResultPoint> points = possibleResultPoints; local
184 points.add(point);
185 int size = points.size();
188 points.subList(0, size - MAX_RESULT_POINTS / 2).clear();
|
