Searched defs:row_end (Results 1 - 9 of 9) sorted by relevance

/external/ceres-solver/internal/ceres/
H A Dincomplete_lq_factorization.cc47 const int row_end = matrix->rows()[row + 1]; local
51 for (int i = row_begin; i < row_end; ++i) {
57 for (int i = row_begin; i < row_end; ++i) {
H A Dcompressed_row_sparse_matrix.cc528 const int row_end = m_rows[r + 1]; local
529 for (int idx1 = row_begin; idx1 < row_end; ++idx1) {
H A Dcovariance_test.cc334 const int row_end = FindOrDie(column_bounds_, block1).second; local
338 Matrix actual(row_end - row_begin, col_end - col_begin);
346 row_end - row_begin,
348 diff_norm /= (row_end - row_begin) * (col_end - col_begin);
352 << "rows: " << row_begin << " " << row_end << " "
356 row_end - row_begin,
H A Dcovariance_impl.cc528 const int row_end = rows[r + 1]; local
529 if (row_end == row_begin) {
547 for (int idx = row_begin; idx < row_end; ++idx) {
717 const int row_end = rows[r + 1]; local
718 if (row_end == row_begin) {
739 for (int idx = row_begin; idx < row_end; ++idx) {
/external/eigen/bench/
H A Dsparse_setter.cpp360 I row_end = Ap[i+1]; local
364 for(I jj = row_start; jj < row_end; jj++){
370 for(I jj = row_start, n = 0; jj < row_end; jj++, n++){
385 I row_end = 0; local
387 I jj = row_end;
388 row_end = Ap[i+1];
389 while( jj < row_end ){
393 while( jj < row_end && Aj[jj] == j ){
/external/libpng/
H A Dpngwrite.c1527 png_uint_16p row_end; local
1552 * above to 'row' means that row_end can actually be beyond the end of the
1555 row_end = output_row + image->width * (channels+1);
1562 while (out_ptr < row_end)
1690 png_bytep row_end; local
1705 /* Use row_end in place of a loop counter: */
1706 row_end = output_row + image->width * (channels+1);
1713 while (out_ptr < row_end)
1734 } /* while out_ptr < row_end */
1744 /* No alpha channel, so the row_end reall
1747 png_bytep row_end = output_row + image->width * channels; local
[all...]
/external/pdfium/core/src/fxge/dib/
H A Dfx_dib_transform.cpp197 int row_end = bXFlip ? m_Height - dest_clip.left : dest_clip.right; local
202 for (int row = row_start; row < row_end; row++) {
224 for (int row = row_start; row < row_end; row++) {
259 for (int row = row_start; row < row_end; row++) {
/external/pdfium/third_party/lpng_v163/
H A Dpngwrite.c1633 png_uint_16p row_end; local
1655 * above to 'row' means that row_end can actually be beyond the end of the
1658 row_end = output_row + image->width * (channels+1);
1665 while (out_ptr < row_end)
1793 png_bytep row_end; local
1806 /* Use row_end in place of a loop counter: */
1807 row_end = output_row + image->width * (channels+1);
1814 while (out_ptr < row_end)
1835 } /* while out_ptr < row_end */
1845 /* No alpha channel, so the row_end reall
1848 png_bytep row_end = output_row + image->width * channels; local
[all...]
/external/webp/src/dsp/
H A Dlossless.c364 int row_start, int row_end,
367 assert(row_start < row_end);
368 assert(row_end <= transform->ysize_);
371 VP8LAddGreenToBlueAndRed(out, (row_end - row_start) * width);
374 PredictorInverseTransform(transform, row_start, row_end, out);
375 if (row_end != transform->ysize_) {
378 memcpy(out - width, out + (row_end - row_start - 1) * width,
383 ColorSpaceInverseTransform(transform, row_start, row_end, out);
392 const int out_stride = (row_end - row_start) * width;
393 const int in_stride = (row_end
363 VP8LInverseTransform(const VP8LTransform* const transform, int row_start, int row_end, const uint32_t* const in, uint32_t* const out) argument
[all...]

Completed in 122 milliseconds