Home
last modified time | relevance | path

Searched refs:num_points (Results 1 – 25 of 59) sorted by relevance

123

/external/libaom/libaom/av1/encoder/
Dcorner_detect.c26 int num_points; in av1_fast_corner_detect() local
28 FAST_BARRIER, &num_points); in av1_fast_corner_detect()
29 num_points = (num_points <= max_points ? num_points : max_points); in av1_fast_corner_detect()
30 if (num_points > 0 && frm_corners_xy) { in av1_fast_corner_detect()
31 memcpy(points, frm_corners_xy, sizeof(*frm_corners_xy) * num_points); in av1_fast_corner_detect()
33 return num_points; in av1_fast_corner_detect()
/external/tensorflow/tensorflow/core/kernels/
Dclustering_ops.cc101 const int64 num_points = points_tensor.dim_size(0); in Compute() local
111 OP_REQUIRES(context, num_points > 0, in Compute()
115 OP_REQUIRES(context, num_to_sample <= num_points, in Compute()
117 num_to_sample, " vs ", num_points, ".")); in Compute()
126 points_tensor.matrix<float>().data(), num_points, point_dimensions); in Compute()
139 from = std::min(from, num_points - 1); in Compute()
146 Eigen::VectorXf min_distances(num_points); in Compute()
148 Eigen::VectorXf min_distances_cumsum(num_points); in Compute()
151 if (sampled_indices.empty()) return rng.Uniform64(num_points); in Compute()
159 min_distances_cumsum.data() + num_points, in Compute()
[all …]
Dclustering_ops_test.cc50 Graph* SetUpKmeansPlusPlusInitialization(int num_dims, int num_points, in SetUpKmeansPlusPlusInitialization() argument
54 Tensor points(DT_FLOAT, TensorShape({num_points, num_dims})); in SetUpKmeansPlusPlusInitialization()
73 template <int num_points, int num_to_sample, int num_dims,
77 num_dims, num_points, num_to_sample, retries_per_sample); in BM_KmeansPlusPlusInitialization()
79 state.SetItemsProcessed(static_cast<int64>(state.iterations()) * num_points * in BM_KmeansPlusPlusInitialization()
118 Graph* SetUpKMC2Initialization(int num_points) { in SetUpKMC2Initialization() argument
120 Tensor distances(DT_FLOAT, TensorShape({num_points})); in SetUpKMC2Initialization()
133 template <int num_points, int num_to_sample, int num_dims>
135 Graph* g = SetUpKMC2Initialization(num_points); in BM_KMC2Initialization()
137 state.SetItemsProcessed(static_cast<int64>(state.iterations()) * num_points * in BM_KMC2Initialization()
[all …]
Disotonic_regression_op.cc47 int num_points() const { return col_limit_ - col_start_; } in num_points() function in __anon111a768a0111::Segment
82 minimum_ = y_sum_ / static_cast<T>(num_points()); in merge_with()
/external/webrtc/modules/audio_processing/agc2/
Dagc2_testing_common.cc21 size_t num_points) { in LinSpace() argument
22 RTC_CHECK(num_points >= 2); in LinSpace()
23 std::vector<double> points(num_points); in LinSpace()
24 const double step = (r - l) / (num_points - 1.0); in LinSpace()
26 for (size_t i = 1; i < num_points - 1; i++) { in LinSpace()
29 points[num_points - 1] = r; in LinSpace()
Dagc2_testing_common.h34 std::vector<double> LinSpace(const double l, const double r, size_t num_points);
/external/freetype/src/base/
Dftstroke.c314 FT_UInt num_points; member
331 FT_UInt new_max = border->num_points + new_points; in ft_stroke_border_grow()
361 FT_UInt count = border->num_points; in ft_stroke_border_close()
368 border->num_points = start; in ft_stroke_border_close()
373 border->num_points = --count; in ft_stroke_border_close()
436 border->points[border->num_points - 1] = *to; in ft_stroke_border_lineto()
441 if ( border->num_points > (FT_UInt)border->start && in ft_stroke_border_lineto()
442 FT_IS_SMALL( border->points[border->num_points - 1].x - to->x ) && in ft_stroke_border_lineto()
443 FT_IS_SMALL( border->points[border->num_points - 1].y - to->y ) ) in ft_stroke_border_lineto()
450 FT_Vector* vec = border->points + border->num_points; in ft_stroke_border_lineto()
[all …]
/external/flac/src/libFLAC/
Dmetadata_object.c169 object->length = object->data.seek_table.num_points * FLAC__STREAM_METADATA_SEEKPOINT_LENGTH; in seektable_calculate_length_()
172 static FLAC__StreamMetadata_SeekPoint *seekpoint_array_new_(uint32_t num_points) in seekpoint_array_new_() argument
176 FLAC__ASSERT(num_points > 0); in seekpoint_array_new_()
178 object_array = safe_malloc_mul_2op_p(num_points, /*times*/sizeof(FLAC__StreamMetadata_SeekPoint)); in seekpoint_array_new_()
182 for (i = 0; i < num_points; i++) { in seekpoint_array_new_()
548 to->data.seek_table.num_points = object->data.seek_table.num_points; in FLAC__metadata_object_clone()
549 …if (to->data.seek_table.num_points > UINT32_MAX / sizeof(FLAC__StreamMetadata_SeekPoint)) { /* ove… in FLAC__metadata_object_clone()
553 …, (FLAC__byte*)object->data.seek_table.points, object->data.seek_table.num_points * sizeof(FLAC__S… in FLAC__metadata_object_clone()
739 if (block1->num_points != block2->num_points) in compare_block_data_seektable_()
743 for (i = 0; i < block1->num_points; i++) { in compare_block_data_seektable_()
[all …]
Dformat.c243 for(i = 0; i < seek_table->num_points; i++) { in FLAC__format_seektable_is_legal()
278 if (seek_table->num_points == 0) in FLAC__format_seektable_sort()
282 …qsort(seek_table->points, seek_table->num_points, sizeof(FLAC__StreamMetadata_SeekPoint), (int (*)… in FLAC__format_seektable_sort()
286 for(i = j = 0; i < seek_table->num_points; i++) { in FLAC__format_seektable_sort()
297 for(i = j; i < seek_table->num_points; i++) { in FLAC__format_seektable_sort()
/external/fonttools/Tests/pens/
DquartzPen_test.py37 num_points = 0
40 num_points = PATH_ELEMENTS[element.type][1]
42 elements.append((elem_type, element.points.as_tuple(num_points)))
/external/webrtc/modules/audio_processing/aec3/
Dsubband_erle_estimator.cc110 if (accum_spectra_.num_points[ch] == kPointsToAccumulate && in UpdateBands()
173 accum_spectra_.num_points[ch] = 0; in ResetAccumulatedSpectra()
195 if (st.num_points[ch] == kPointsToAccumulate) { in UpdateAccumulatedSpectra()
196 st.num_points[ch] = 0; in UpdateAccumulatedSpectra()
212 ++st.num_points[ch]; in UpdateAccumulatedSpectra()
Dsubband_erle_estimator.h62 num_points(num_capture_channels) {} in AccumulatedSpectra()
66 std::vector<int> num_points; member
/external/freetype/src/autofit/
Dafwarp.c173 FT_Int nn, num_points, num_segments; in af_warper_compute() local
202 num_points = hints->num_points; in af_warper_compute()
213 for ( nn = 1; nn < num_points; nn++ ) in af_warper_compute()
Dafhints.c321 AF_Point limit = points + hints->num_points; in af_glyph_hints_dump_points()
329 if ( hints->num_points ) in af_glyph_hints_dump_points()
741 hints->num_points = 0; in af_glyph_hints_done()
775 hints->num_points = 0; in af_glyph_hints_reload()
837 hints->num_points = outline->n_points; in af_glyph_hints_reload()
862 if ( hints->num_points == 0 ) in af_glyph_hints_reload()
867 AF_Point point_limit = points + hints->num_points; in af_glyph_hints_reload()
1188 AF_Point limit = point + hints->num_points; in af_glyph_hints_save()
1298 AF_Point point_limit = points + hints->num_points; in af_glyph_hints_align_strong_points()
1572 AF_Point point_limit = points + hints->num_points; in af_glyph_hints_align_weak_points()
[all …]
/external/freetype/src/pshinter/
Dpshalgo.c1045 glyph->num_points = 0; in psh_glyph_done()
1085 FT_UInt count = glyph->num_points; in psh_glyph_load_points()
1123 for ( n = 0; n < glyph->num_points; n++ ) in psh_glyph_save_points()
1173 glyph->num_points = (FT_UInt)outline->n_points; in psh_glyph_init()
1223 for ( n = 0; n < glyph->num_points; n++, point++ ) in psh_glyph_init()
1361 for ( n = 0; n < glyph->num_points; n++ ) in psh_glyph_compute_extrema()
1586 if ( num_masks > 1 && glyph->num_points > 0 ) in psh_glyph_find_strong_points()
1589 first = mask->end_point > glyph->num_points in psh_glyph_find_strong_points()
1590 ? glyph->num_points in psh_glyph_find_strong_points()
1595 FT_UInt next = FT_MIN( mask->end_point, glyph->num_points ); in psh_glyph_find_strong_points()
[all …]
/external/tensorflow/tensorflow/python/ops/
Dclustering_ops_test.py155 num_points = 1000
161 assert num_points % points_per_tile == 0
183 np.tile(x, (int(num_points / points_per_tile), 1))
/external/libaom/libaom/aom_dsp/
Dnoise_model.c215 int aom_noise_strength_lut_init(aom_noise_strength_lut_t *lut, int num_points) { in aom_noise_strength_lut_init() argument
217 lut->num_points = 0; in aom_noise_strength_lut_init()
218 lut->points = (double(*)[2])aom_malloc(num_points * sizeof(*lut->points)); in aom_noise_strength_lut_init()
220 lut->num_points = num_points; in aom_noise_strength_lut_init()
221 memset(lut->points, 0, sizeof(*lut->points) * num_points); in aom_noise_strength_lut_init()
236 for (i = 0; i < lut->num_points - 1; ++i) { in aom_noise_strength_lut_eval()
244 return lut->points[lut->num_points - 1][1]; in aom_noise_strength_lut_eval()
350 for (int i = AOMMAX(start, 1); i < AOMMIN(end, lut->num_points - 1); ++i) { in update_piecewise_linear_residual()
397 while (lut->num_points > 2) { in aom_noise_strength_solver_fit_piecewise()
399 for (int j = 1; j < lut->num_points - 1; ++j) { in aom_noise_strength_solver_fit_piecewise()
[all …]
Dnoise_model.h38 int num_points; member
42 int aom_noise_strength_lut_init(aom_noise_strength_lut_t *lut, int num_points);
/external/flac/src/test_libs_common/
Dmetadata_utils.c161 if(blockcopy->num_points != block->num_points) { in mutils__compare_block_data_seektable()
162 …tf("FAILED, num_points mismatch, expected %u, got %u\n", block->num_points, blockcopy->num_points); in mutils__compare_block_data_seektable()
165 for(i = 0; i < block->num_points; i++) { in mutils__compare_block_data_seektable()
477 seektable->data.seek_table.num_points = 2; in mutils__init_metadata_blocks()
478 seektable->length = seektable->data.seek_table.num_points * FLAC__STREAM_METADATA_SEEKPOINT_LENGTH; in mutils__init_metadata_blocks()
479 …seektable->data.seek_table.points = malloc_or_die_(seektable->data.seek_table.num_points * sizeof(… in mutils__init_metadata_blocks()
/external/freetype/src/type1/
Dt1load.c215 axis->maximum = map->design_points[map->num_points - 1]; in T1_Get_Multi_Master()
240 for ( j = 1; j < axismap->num_points; j++ ) in mm_axis_unmap()
250 return INT_TO_FIXED( axismap->design_points[axismap->num_points - 1] ); in mm_axis_unmap()
609 design = ( designs[map->num_points - 1] - designs[0] ) / 2; in T1_Set_MM_Design()
611 for ( p = 0; p < (FT_UInt)map->num_points; p++ ) in T1_Set_MM_Design()
637 the_blend = blends[map->num_points - 1]; in T1_Set_MM_Design()
779 dmap->num_points = 0; in T1_Done_Blend()
1020 FT_Int p, num_points; in parse_blend_design_map() local
1028 T1_MAX_MM_MAP_POINTS, &num_points ); in parse_blend_design_map()
1032 if ( num_points <= 0 || num_points > T1_MAX_MM_MAP_POINTS ) in parse_blend_design_map()
[all …]
/external/grpc-grpc/examples/php/route_guide/
Droute_guide_client.php116 $num_points = 10;
117 for ($i = 0; $i < $num_points; ++$i) {
/external/grpc-grpc/examples/node/dynamic_codegen/route_guide/
Droute_guide_client.js121 var num_points = 10;
156 for (var i = 0; i < num_points; i++) {
/external/freetype/src/pfr/
Dpfrgload.c767 FT_Int i, old_points, num_points; in pfr_glyph_load_rec() local
784 num_points = base->n_points - old_points; in pfr_glyph_load_rec()
792 for ( i = 0; i < num_points; i++, vec++ ) in pfr_glyph_load_rec()
805 for ( i = 0; i < num_points; i++, vec++ ) in pfr_glyph_load_rec()
/external/grpc-grpc/examples/node/static_codegen/route_guide/
Droute_guide_client.js119 var num_points = 10;
150 for (var i = 0; i < num_points; i++) {
/external/harfbuzz_ng/src/
Dhb-ot-glyf-table.hh575 unsigned int num_points = endPtsOfContours[num_contours - 1] + 1; in get_contour_points() local
577 points_.resize (num_points + PHANTOM_COUNT); in get_contour_points()
592 for (unsigned int i = 0; i < num_points; i++) in get_contour_points()
601 while ((repeat_count-- > 0) && (++i < num_points)) in get_contour_points()
657 unsigned int num_points = hb_len (get_iterator ()); in get_contour_points() local
658 points_.resize (num_points + PHANTOM_COUNT); in get_contour_points()

123