HomeSort by relevance Sort by last modified time
    Searched defs:num_segments (Results 1 - 10 of 10) sorted by null

  /external/ceres-solver/examples/
ellipse_approximation.cc 274 PointToLineSegmentContourCostFunction(const int num_segments,
276 : num_segments_(num_segments), y_(y) {
325 static ceres::CostFunction* Create(const int num_segments,
327 return new PointToLineSegmentContourCostFunction(num_segments, y);
379 const int num_segments = 151; local
394 VectorXd w(num_segments + 1);
395 w.setLinSpaced(num_segments + 1, 0.0, 2.0 * M_PI);
396 w.conservativeResize(num_segments);
397 MatrixXd X(num_segments, 2);
414 std::vector<double*> parameter_blocks(1 + num_segments);
    [all...]
  /external/freetype/src/autofit/
afwarp.c 79 FT_Int num_segments )
120 for ( nn = 0; nn < num_segments; nn++ )
174 FT_Int nn, num_points, num_segments; local
201 num_segments = axis->num_segments;
209 if ( num_segments < 1 )
226 for ( nn = 1; nn < num_segments; nn++ )
349 segments, num_segments );
afhints.h 307 FT_Int num_segments; /* number of used segments */ member in struct:AF_AxisHintsRec_
  /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/autofit/
afwarp.c 79 FT_Int num_segments )
120 for ( nn = 0; nn < num_segments; nn++ )
174 FT_Int nn, num_points, num_segments; local
201 num_segments = axis->num_segments;
209 if ( num_segments < 1 )
226 for ( nn = 1; nn < num_segments; nn++ )
349 segments, num_segments );
afhints.h 305 FT_Int num_segments; /* number of used segments */ member in struct:AF_AxisHintsRec_
  /system/extras/f2fs_utils/
f2fs_sparseblock.c 314 u64 num_segments = (info->total_blocks - info->main_blkaddr local
316 u64 num_sit_blocks = (num_segments + SIT_ENTRY_PER_BLOCK - 1) / SIT_ENTRY_PER_BLOCK;
  /external/mesa3d/src/gallium/state_trackers/vega/
path.c 57 VGint num_segments; member in struct:path
255 VGint old_segments = p->num_segments;
260 p->num_segments += numSegments;
274 return p->num_segments;
390 if (p->num_segments)
393 for (i = 0; i < p->num_segments; ++i) {
650 p->num_segments);
685 for (i = 0; i < path->num_segments; ++i) {
883 path->num_segments);
914 dst->num_segments = dst->segments->num_elements
    [all...]
  /external/opencv3/3rdparty/libwebp/enc/
quant.c 167 const int num_segments = enc->segment_hdr_.num_segments_; local
168 for (i = 0; i < num_segments; ++i) {
269 const int num_segments = enc->segment_hdr_.num_segments_; local
272 for (s1 = 1; s1 < num_segments; ++s1) { // find similar segments
291 if (num_final_segments < num_segments) { // Remap
296 for (i = num_final_segments; i < num_segments; ++i) {
305 const int num_segments = enc->segment_hdr_.num_segments_; local
311 for (i = 0; i < num_segments; ++i) {
325 for (i = num_segments; i < NUM_MB_SEGMENTS; ++i) {
352 if (num_segments > 1) SimplifySegments(enc)
    [all...]
  /external/webp/src/enc/
quant.c 244 const int num_segments = enc->segment_hdr_.num_segments_; local
245 for (i = 0; i < num_segments; ++i) {
351 const int num_segments = enc->segment_hdr_.num_segments_; local
354 for (s1 = 1; s1 < num_segments; ++s1) { // find similar segments
373 if (num_final_segments < num_segments) { // Remap
378 for (i = num_final_segments; i < num_segments; ++i) {
387 const int num_segments = enc->segment_hdr_.num_segments_; local
393 for (i = 0; i < num_segments; ++i) {
407 for (i = num_segments; i < NUM_MB_SEGMENTS; ++i) {
434 if (num_segments > 1) SimplifySegments(enc)
    [all...]
  /toolchain/binutils/binutils-2.25/bfd/
elf.c 5287 unsigned int num_segments = elf_elfheader (abfd)->e_phnum; local
5604 unsigned int num_segments; local
6264 unsigned int num_segments; local
6441 unsigned int i, num_segments; local
6518 unsigned int num_segments = elf_elfheader (ibfd)->e_phnum; local
    [all...]

Completed in 258 milliseconds