Searched defs:num_points (Results 1 - 18 of 18) sorted by relevance

/external/freetype/src/base/
H A Dftgloadr.c369 FT_UInt num_points = (FT_UInt)source->base.outline.n_points; local
373 error = FT_GlyphLoader_CheckPoints( target, num_points, num_contours );
381 num_points );
383 num_points );
391 num_points );
393 num_points );
396 out->n_points = (short)num_points;
H A Dftstroke.c314 FT_UInt num_points; member in struct:FT_StrokeBorderRec_
331 FT_UInt new_max = border->num_points + new_points;
361 FT_UInt count = border->num_points;
368 border->num_points = start;
373 border->num_points = --count;
435 border->points[border->num_points - 1] = *to;
440 if ( border->num_points > 0 &&
441 FT_IS_SMALL( border->points[border->num_points - 1].x - to->x ) &&
442 FT_IS_SMALL( border->points[border->num_points - 1].y - to->y ) )
449 FT_Vector* vec = border->points + border->num_points;
665 FT_UInt num_points = 0; local
1989 FT_UInt num_points = 0, num_contours = 0; local
2019 FT_UInt count1, count2, num_points = 0; local
2336 FT_UInt num_points, num_contours; local
2417 FT_UInt num_points, num_contours; local
[all...]
/external/freetype/src/autofit/
H A Dafwarp.c173 FT_Int nn, num_points, num_segments; local
202 num_points = hints->num_points;
213 for ( nn = 1; nn < num_points; nn++ )
H A Dafhints.h345 FT_Int num_points; /* number of used points */ member in struct:AF_GlyphHintsRec_
/external/freetype/src/pfr/
H A Dpfrgload.c767 FT_Int i, old_points, num_points; local
784 num_points = base->n_points - old_points;
792 for ( i = 0; i < num_points; i++, vec++ )
805 for ( i = 0; i < num_points; i++, vec++ )
/external/tensorflow/tensorflow/contrib/factorization/kernels/
H A Dclustering_ops_test.cc50 Graph* SetUpKmeansPlusPlusInitialization(int num_dims, int num_points, argument
54 Tensor points(DT_FLOAT, TensorShape({num_points, num_dims}));
73 template <int num_points, int num_to_sample, int num_dims,
77 testing::ItemsProcessed(static_cast<int64>(iters) * num_points * num_dims *
81 num_dims, num_points, num_to_sample, retries_per_sample);
119 Graph* SetUpKMC2Initialization(int num_points) { argument
121 Tensor distances(DT_FLOAT, TensorShape({num_points}));
134 template <int num_points, int num_to_sample, int num_dims>
137 testing::ItemsProcessed(static_cast<int64>(iters) * num_points * num_dims *
140 Graph* g = SetUpKMC2Initialization(num_points);
175 SetUpNearestNeighbors(int num_dims, int num_points, int num_centers, int k) argument
[all...]
H A Dclustering_ops.cc100 const int64 num_points = points_tensor.dim_size(0); variable
110 OP_REQUIRES(context, num_points > 0,
114 OP_REQUIRES(context, num_to_sample <= num_points,
116 num_to_sample, " vs ", num_points, "."));
125 points_tensor.matrix<float>().data(), num_points, point_dimensions);
138 from = std::min(from, num_points - 1);
145 Eigen::VectorXf min_distances(num_points);
147 Eigen::VectorXf min_distances_cumsum(num_points);
150 if (sampled_indices.empty()) return rng.Uniform64(num_points);
158 min_distances_cumsum.data() + num_points,
243 const int64 num_points = distances_tensor.dim_size(0); variable
301 const int64 num_points = points_tensor.dim_size(0); variable
454 const int64 num_points = points.rows(); local
500 const int64 num_points = points.rows(); local
[all...]
/external/freetype/src/psaux/
H A Dt1decode.c882 FT_UInt num_points, nn, mm; local
894 num_points = (FT_UInt)subr_no - 13 + ( subr_no == 18 );
895 if ( arg_cnt != (FT_Int)( num_points * blend->num_designs ) )
918 delta = top + num_points;
920 for ( nn = 0; nn < num_points; nn++ )
933 known_othersubr_result_cnt = (FT_Int)num_points;
H A Dpsintrp.c1810 FT_UInt num_points, nn, mm; local
1824 num_points = (FT_UInt)subr_no - 13 +
1826 if ( arg_cnt != (FT_Int)( num_points *
1852 delta = opIdx + num_points;
1854 for ( nn = 0; nn < num_points; nn++ )
1870 (CF2_UInt)arg_cnt - num_points );
1872 known_othersubr_result_cnt = (FT_Int)num_points;
/external/opencv/cvaux/src/
H A Dcv3dtracker.cpp80 const int num_points = etalon_size.width * etalon_size.height; local
127 CV_CALL(object_points = (CvPoint3D32f *)cvAlloc(num_points * sizeof(CvPoint3D32f)));
128 CV_CALL(points = (CvPoint2D32f *)cvAlloc(num_points * sizeof(CvPoint2D32f)));
170 int count = num_points;
176 // If found is true, it means all the points were found (count = num_points).
/external/flac/libFLAC/
H A Dmetadata_object.c169 object->length = object->data.seek_table.num_points * FLAC__STREAM_METADATA_SEEKPOINT_LENGTH;
172 static FLAC__StreamMetadata_SeekPoint *seekpoint_array_new_(unsigned num_points) argument
176 FLAC__ASSERT(num_points > 0);
178 object_array = safe_malloc_mul_2op_p(num_points, /*times*/sizeof(FLAC__StreamMetadata_SeekPoint));
182 for (i = 0; i < num_points; i++) {
459 object->data.seek_table.num_points = 0;
548 to->data.seek_table.num_points = object->data.seek_table.num_points;
549 if (to->data.seek_table.num_points > UINT32_MAX / sizeof(FLAC__StreamMetadata_SeekPoint)) { /* overflow check */
553 if (!copy_bytes_((FLAC__byte**)&to->data.seek_table.points, (FLAC__byte*)object->data.seek_table.points, object->data.seek_table.num_points * sizeo
[all...]
/external/freetype/src/pshinter/
H A Dpshalgo.h191 FT_UInt num_points; member in struct:PSH_GlyphRec_
/external/freetype/src/truetype/
H A Dttgload.c1111 FT_UInt num_points = (FT_UInt)gloader->base.outline.n_points; local
1125 l >= num_points )
1986 FT_UInt num_points = start_point; local
2043 num_points = (FT_UInt)gloader->base.outline.n_points;
2045 if ( num_points == num_base_points )
2071 num_points > start_point )
/external/freetype/src/type1/
H A Dt1load.c215 axis->maximum = map->design_points[map->num_points - 1];
240 for ( j = 1; j < axismap->num_points; j++ )
250 return INT_TO_FIXED( axismap->design_points[axismap->num_points - 1] );
512 design = ( designs[map->num_points - 1] - designs[0] ) / 2;
514 for ( p = 0; p < (FT_UInt)map->num_points; p++ )
540 the_blend = blends[map->num_points - 1];
682 dmap->num_points = 0;
908 FT_Int p, num_points; local
916 T1_MAX_MM_MAP_POINTS, &num_points );
918 if ( num_points <
[all...]
/external/flac/include/FLAC/
H A Dformat.h613 unsigned num_points; member in struct:__anon7233
/external/freetype/include/freetype/
H A Dt1tables.h288 FT_Byte num_points; member in struct:PS_DesignMap_
/external/syslinux/gpxe/src/drivers/net/ath5k/
H A Dath5k_phy.c1535 u8 num_points,
1542 if (num_points < 2)
1563 if ((pwr_i > pwr[idx[1]]) && (idx[1] < num_points - 1)) {
1533 ath5k_create_power_curve(s16 pmin, s16 pmax, const s16 *pwr, const u8 *vpd, u8 num_points, u8 *vpd_table, u8 type) argument
/external/opencv/cv/include/
H A Dcvcompat.h382 CV_INLINE void cvConvexHull( CvPoint* points, int num_points, argument
386 CvMat points1 = cvMat( 1, num_points, CV_32SC2, points );
387 CvMat hull1 = cvMat( 1, num_points, CV_32SC1, hull );
398 #define cvConvexHullApprox( points, num_points, bound_rect, bandwidth, \
400 cvConvexHull( points, num_points, bound_rect, orientation, hull, hullsize )

Completed in 836 milliseconds