Searched refs:row (Results 201 - 225 of 1435) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/opus/src/silk/
H A Dmacros.h95 #define matrix_ptr(Matrix_base_adr, row, column, N) \
96 (*((Matrix_base_adr) + ((row)*(N)+(column))))
97 #define matrix_adr(Matrix_base_adr, row, column, N) \
98 ((Matrix_base_adr) + ((row)*(N)+(column)))
102 # define matrix_c_ptr(Matrix_base_adr, row, column, M) \
103 (*((Matrix_base_adr) + ((row)+(M)*(column))))
/external/chromium_org/third_party/skia/include/core/
H A DSkMask.h85 uint16_t* row = (uint16_t*)(fImage + (y - fBounds.fTop) * fRowBytes); local
86 return row + (x - fBounds.fLeft);
98 uint32_t* row = (uint32_t*)(fImage + (y - fBounds.fTop) * fRowBytes); local
99 return row + (x - fBounds.fLeft);
111 uint32_t* row = (uint32_t*)(fImage + (y - fBounds.fTop) * fRowBytes); local
112 return row + (x - fBounds.fLeft);
/external/chromium_org/ui/file_manager/file_manager/foreground/css/
H A Dtable.css15 .table-row {
21 .table-row-cell {
26 .table-row-cell > * {
/external/eigen/test/
H A Djacobi.cpp43 VERIFY_IS_APPROX(b.row(p), c * a.row(p) + numext::conj(s) * a.row(q));
44 VERIFY_IS_APPROX(b.row(q), -s * a.row(p) + numext::conj(c) * a.row(q));
H A Dproduct_syrk.cpp103 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.row(c),s1)._expression()),
104 ((s1 * m1.row(c).transpose() * m1.row(c).transpose().adjoint()).eval().template triangularView<Lower>().toDenseMatrix()));
106 VERIFY_IS_APPROX((rm2.template selfadjointView<Lower>().rankUpdate(m1.row(c),s1)._expression()),
107 ((s1 * m1.row(c).transpose() * m1.row(c).transpose().adjoint()).eval().template triangularView<Lower>().toDenseMatrix()));
109 VERIFY_IS_APPROX((m2.template triangularView<Lower>() += s1 * m3.row(c).transpose() * m1.row(c).transpose().adjoint()).nestedExpression(),
110 ((s1 * m3.row(c).transpose() * m1.row(
[all...]
H A Dvectorwiseop.cpp46 VERIFY_IS_APPROX(m2.row(r), m1.row(r) + rowvec);
64 VERIFY_IS_APPROX(m2.row(r), m1.row(r) - rowvec);
82 VERIFY_IS_APPROX(m2.row(r), m1.row(r) * rowvec);
100 VERIFY_IS_APPROX(m2.row(r), m1.row(r) / rowvec);
153 VERIFY_IS_APPROX(m2.row(r), m1.row(
[all...]
/external/libopus/silk/
H A Dmacros.h95 #define matrix_ptr(Matrix_base_adr, row, column, N) \
96 (*((Matrix_base_adr) + ((row)*(N)+(column))))
97 #define matrix_adr(Matrix_base_adr, row, column, N) \
98 ((Matrix_base_adr) + ((row)*(N)+(column)))
102 # define matrix_c_ptr(Matrix_base_adr, row, column, M) \
103 (*((Matrix_base_adr) + ((row)+(M)*(column))))
/external/qemu/distrib/sdl-1.2.15/test/
H A Dtestcursor.c109 int i, row, col; local
115 for ( row=0; row<32; ++row ) {
124 switch (arrow[4+row][col]) {
137 sscanf(arrow[4+row], "%d,%d", &hot_x, &hot_y);
/external/skia/include/core/
H A DSkMask.h85 uint16_t* row = (uint16_t*)(fImage + (y - fBounds.fTop) * fRowBytes); local
86 return row + (x - fBounds.fLeft);
98 uint32_t* row = (uint32_t*)(fImage + (y - fBounds.fTop) * fRowBytes); local
99 return row + (x - fBounds.fLeft);
111 uint32_t* row = (uint32_t*)(fImage + (y - fBounds.fTop) * fRowBytes); local
112 return row + (x - fBounds.fLeft);
/external/zxing/qr_scanner/src/com/google/zxing/client/android/
H A DPlanarYUVLuminanceSource.java60 public byte[] getRow(int y, byte[] row) { argument
62 throw new IllegalArgumentException("Requested row is outside the image: " + y);
65 if (row == null || row.length < width) {
66 row = new byte[width];
69 System.arraycopy(yuvData, offset, row, 0, width);
70 return row;
94 // Otherwise copy one cropped row at a time.
/external/chromium_org/chrome/browser/history/
H A Dscored_history_match_unittest.cc66 URLRow row(GURL(url), 0);
67 row.set_title(ASCIIToUTF16(title));
68 row.set_visit_count(visit_count);
69 row.set_typed_count(typed_count);
70 row.set_last_visit(base::Time::NowFromSystemTime() -
72 return row;
116 // to calculate last visit time when building a row.
186 // to calculate last visit time when building a row.
191 URLRow row(MakeURLRow(url_string.c_str(), "abcd bcd", 8, 3, 1));
193 PopulateWordStarts(row,
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkAAClip.cpp93 return segments * 2; // each segment is row[0] + row[1] (n + alpha)
104 uint8_t* row = head->data(); local
107 row[0] = n;
108 row[1] = 0xFF;
110 row += 2;
177 static size_t compute_row_length(const uint8_t row[], int width) { argument
178 const uint8_t* origRow = row;
180 int n = row[0];
183 row
213 const uint8_t* row = head->data() + yoff->fOffset; local
223 dump_one_row(const uint8_t* SK_RESTRICT row, int width, int leading_num) argument
268 count_left_right_zeros(const uint8_t* row, int width, int* leftZ, int* riteZ) argument
339 trim_row_left_right(uint8_t* row, int width, int leftZ, int riteZ) argument
385 assert_row_width(const uint8_t* row, int width) argument
490 uint8_t* row = base + yoff->fOffset; local
499 row_is_all_zeros(const uint8_t* row, int width) argument
741 const uint8_t* row = head->data() + yoff->fOffset; local
921 const uint8_t* row = this->findRow(top, &lastY); local
968 Row* row = fRows.begin(); local
986 Row* row = fCurrRow; local
1074 const Row* row = fRows.begin(); local
1128 const Row& row = fRows[y]; local
1149 const Row& row = fRows[i]; local
1175 flushRowH(Row* row) argument
1456 RowIter(const uint8_t* row, const SkIRect& bounds) argument
1824 expand_row_to_mask(uint8_t* SK_RESTRICT mask, const uint8_t* SK_RESTRICT row, int width) argument
1917 const uint8_t* row = fAAClip->findRow(y); local
1938 merge(const uint8_t* SK_RESTRICT row, int rowN, const SkAlpha* SK_RESTRICT srcAA, const int16_t* SK_RESTRICT srcRuns, SkAlpha* SK_RESTRICT dstAA, int16_t* SK_RESTRICT dstRuns, int width) argument
1985 const uint8_t* row = fAAClip->findRow(y); local
2003 const uint8_t* row = fAAClip->findRow(y, &lastY); local
2068 mergeT(const T* SK_RESTRICT src, int srcN, const uint8_t* SK_RESTRICT row, int rowN, T* SK_RESTRICT dst) argument
2219 const uint8_t* row = fAAClip->findRow(y, &localStopY); local
[all...]
/external/chromium_org/third_party/angle/src/compiler/translator/
H A DVariablePacker.cpp94 int row = topRow + r; local
95 ASSERT((rows_[row] & columnFlags) == 0);
96 rows_[row] |= columnFlags;
122 for (int row = topNonFullRow_; row <= bottomRow; ++row) {
123 bool rowEmpty = row < bottomRow ? ((rows_[row] & columnFlags) == 0) : false;
126 topGoodRow = row;
131 int size = row
[all...]
/external/qemu/distrib/sdl-1.2.15/src/video/
H A DSDL_yuv_sw.c180 /* Now, do second row. */
258 /* Now, do second row. */
334 /* Now, do second row. */
410 /* Now, do second row. */
496 /* Now, do second row. */
583 /* Now, do second row. */
617 unsigned short* row; local
624 row = (unsigned short*) out;
641 *row++ = (unsigned short)(rgb_2_pix[ L + cr_r ] |
646 *row
662 unsigned char* row; local
711 unsigned int* row; local
759 unsigned int* row = (unsigned int*) out; local
804 unsigned char* row = out; local
859 unsigned int* row = (unsigned int*) out; local
[all...]
/external/ceres-solver/internal/ceres/
H A Dblock_jacobian_writer.cc165 // Construct the cells in each row.
172 CompressedRow* row = &bs->rows[i]; local
174 row->block.size = residual_block->NumResiduals();
175 row->block.position = row_block_position;
176 row_block_position += row->block.size;
178 // Size the row by the number of active parameters in this residual.
186 row->cells.resize(num_active_parameter_blocks);
188 // Add layout information for the active parameters in this row.
193 Cell& cell = row->cells[k];
203 sort(row
[all...]
H A Dblock_random_access_dense_matrix.cc68 int* row,
72 *row = block_layout_[row_block_id];
66 GetCell(const int row_block_id, const int col_block_id, int* row, int* col, int* row_stride, int* col_stride) argument
/external/chromium-trace/trace-viewer/src/cc/
H A Dlayer_tree_host_impl_view.css7 -webkit-flex-direction: row;
/external/chromium-trace/trace-viewer/src/ui/
H A Dlist_and_associated_view.css7 -webkit-flex-direction: row;
/external/chromium_org/chrome/browser/history/android/
H A Dandroid_cache_database.h32 // Adds a row to the bookmark_cache table. Returns true on success.
49 // Add a row in the search_term table with the given |term| and
50 // |last_visit_time|. Return the new row's id on success, otherwise 0 is
55 // Updates the |id|'s row with the given |row|; returns true on success.
56 bool UpdateSearchTerm(SearchTermID id, const SearchTermRow& row);
58 // Get SearchTermRow of the given |term|; return the row id on success.
60 // The found row is return in |row| if it is not NULL.
61 SearchTermID GetSearchTerm(const base::string16& term, SearchTermRow* row);
[all...]
H A Dvisit_sql_handler.h25 virtual bool Update(const HistoryAndBookmarkRow& row,
27 virtual bool Insert(HistoryAndBookmarkRow* row) OVERRIDE;
31 // Add a row in visit table with the given |url_id| and |visit_time|.
34 // Add the given |visit_count| rows for |url_id|. The visit time of each row
/external/chromium_org/chrome/browser/resources/quota_internals/
H A Dmain.css22 .tree-item:not([may-have-children]) > .tree-row > .tree-label {
/external/chromium_org/content/browser/resources/accessibility/
H A Daccessibility.css22 .row {
/external/chromium_org/media/cast/test/utility/
H A Dbarcode.cc72 // Now replicate this one row into all rows in kYPlane.
73 for (int row = 0; row < output_frame->rows(VideoFrame::kYPlane); row++) {
75 output_frame->stride(VideoFrame::kYPlane) * row,
93 for (int row = min_row; row < max_row; row++) {
95 frame->stride(VideoFrame::kYPlane) * row + pos];
/external/chromium_org/net/spdy/
H A Dspdy_test_utils.cc36 for (const unsigned char* row = data; length > 0;
37 row += kColumns, length -= kColumns) {
38 for (const unsigned char *p = row; p < row + 4; ++p) {
39 if (p < row + length) {
52 for (const unsigned char *p = row; p < row + 4 && p < row + length; ++p)
/external/chromium_org/third_party/libjpeg_turbo/
H A Djquant1.c114 * We can get away with a single array (holding one row's worth of errors)
115 * by using it to store the current row's errors at pixel columns not yet
116 * processed, but the next row's errors at columns already processed. We
161 int row_index; /* cur row's vertical index in dither matrix */
166 boolean on_odd_row; /* flag to remember which row we are on */
297 /* The colors are ordered in the map in standard row-major order, */
472 int row; local
477 for (row = 0; row < num_rows; row
502 int row; local
532 int row; local
585 int row; local
635 int row; local
[all...]

Completed in 459 milliseconds

1234567891011>>