HomeSort by relevance Sort by last modified time
    Searched refs:col (Results 26 - 50 of 887) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/libvpx/libvpx/vp8/common/
mv.h 23 short col; member in struct:__anon4401
  /external/libvpx/libvpx/vp9/common/
vp9_mv.h 24 int16_t col; member in struct:mv
34 int32_t col; member in struct:mv32
39 mv->col = clamp(mv->col, min_col, max_col);
  /external/libhevc/common/x86/
ihevc_padding_ssse3_intr.c 168 WORD32 col; local
184 for(col = 0; col < pad_size; col += 8)
186 _mm_storel_epi64((__m128i *)(pu1_dst + col), src_temp0_16x8b);
240 WORD32 col; local
254 for(col = 0; col < pad_size; col += 8)
256 _mm_storel_epi64((__m128i *)(pu1_dst + col), src_temp0_16x8b)
310 WORD32 col; local
    [all...]
  /external/eigen/doc/examples/
Tutorial_BlockOperations_colrow.cpp 14 m.col(2) += 3 * m.col(0);
  /external/eigen/doc/snippets/
LLT_solve.cpp 4 VectorXf elevations = 2*samples.col(0) + 3*samples.col(1) + VectorXf::Random(12)*0.1;
Tutorial_solve_multiple_rhs.cpp 8 cout << X.col(0) << endl;
10 cout << X.col(1) << endl;
MatrixBase_eval.cpp 6 cout << "If we do m.col(1) = m.row(0), then m becomes:" << endl;
7 m.col(1) = m.row(0);
9 cout << "Now let us instead do m.col(1) = m.row(0).eval(). Then m becomes" << endl;
11 m.col(1) = m.row(0).eval();
  /external/eigen/Eigen/src/Eigen2Support/
Minor.h 62 Index row, Index col)
63 : m_matrix(matrix), m_row(row), m_col(col)
66 && col >= 0 && col < matrix.cols());
74 inline Scalar& coeffRef(Index row, Index col)
76 return m_matrix.const_cast_derived().coeffRef(row + (row >= m_row), col + (col >= m_col));
79 inline const Scalar coeff(Index row, Index col) const
81 return m_matrix.coeff(row + (row >= m_row), col + (col >= m_col))
    [all...]
  /external/eigen/unsupported/Eigen/src/Skyline/
SkylineInplaceLU.h 131 const Index& col = row; local
132 for (typename MatrixType::InnerLowerIterator lIt(m_lu, col); lIt; ++lIt) {
137 typename MatrixType::InnerLowerIterator lIt(m_lu, col);
156 typename MatrixType::InnerLowerIterator lIt3(m_lu, col);
169 typename MatrixType::InnerLowerIterator lIt2(m_lu, col);
195 for (Index col = llIt.col(); col < row; col++) {
196 if (m_lu.coeffExistLower(row, col)) {
235 const Index col = row; local
317 Index col = lIt.col(); local
    [all...]
  /cts/tools/dasm/src/java_cup/
parse_reduce_table.java 67 for (int col = 0; col < under_state[row].size(); col++)
70 goto_st = under_state[row].under_non_term[col];
75 result += col + ":";
  /external/chromium_org/third_party/WebKit/Source/modules/webdatabase/sqlite/
SQLiteStatement.h 64 String getColumnName(int col);
65 SQLValue getColumnValue(int col);
66 String getColumnText(int col);
67 int getColumnInt(int col);
68 int64_t getColumnInt64(int col);
  /external/libhevc/common/
ihevc_chroma_intra_pred_filters.c 475 WORD32 row, col; local
499 for(col = 0; col < (2 * nt); col += 2)
501 pu1_dst[row * dst_strd + col] = ((nt - 1 - col / 2)
503 + (col / 2 + 1) * pu1_ref[2 * (three_nt + 1)]
504 + (nt - 1 - row) * pu1_ref[2 * (two_nt + 1) + col]
507 pu1_dst[row * dst_strd + col + 1] = ((nt - 1 - col / 2
566 WORD32 row, col; local
667 WORD32 row, col; local
728 WORD32 row, col; local
788 WORD32 row, col; local
855 WORD32 row, col; local
928 WORD32 row, col; local
1021 WORD32 row, col, k; local
1138 WORD32 row, col, k; local
1245 WORD32 row, col; local
    [all...]
  /external/chromium_org/third_party/libjpeg_turbo/
jccolext.c 40 register JDIMENSION col; local
49 for (col = 0; col < num_cols; col++) {
60 outptr0[col] = (JSAMPLE)
64 outptr1[col] = (JSAMPLE)
68 outptr2[col] = (JSAMPLE)
97 register JDIMENSION col; local
104 for (col = 0; col < num_cols; col++)
131 register JDIMENSION col; local
    [all...]
  /external/chromium_org/third_party/mesa/src/src/mesa/swrast/
s_bitmap.c 54 GLint row, col; local
84 for (col = 0; col < width; col++) {
86 span.array->x[count] = px + col;
106 for (col = 0; col < width; col++) {
108 span.array->x[count] = px + col;
154 GLint row, col;
    [all...]
  /external/mesa3d/src/mesa/swrast/
s_bitmap.c 54 GLint row, col; local
84 for (col = 0; col < width; col++) {
86 span.array->x[count] = px + col;
106 for (col = 0; col < width; col++) {
108 span.array->x[count] = px + col;
154 GLint row, col;
    [all...]
  /external/openfst/src/script/
text-io.cc 47 vector<char *> col; local
48 SplitToVector(line, "\n\t ", &col, true);
49 if (col.size() == 0 || col[0][0] == '\0') // empty line
51 if (col.size() != 2) {
57 ssize_t s = StrToInt64(col[0], filename, nline, false);
58 WeightClass weight(weight_type, col[1]);
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/util/
CollectionStore.java 41 List col = new ArrayList(); local
50 col.add(obj);
54 return col;
  /external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/
vp9_mv.h 24 int16_t col; member in struct:mv
34 int32_t col; member in struct:mv32
47 mv->col = clamp(mv->col, min_col, max_col);
vp9_tile_common.h 25 // initializes 'tile->mi_(row|col)_(start|end)' for (row, col) based on
28 int row, int col);
31 void vp9_tile_set_col(TileInfo *tile, const struct VP9Common *cm, int col);
  /external/deqp/framework/common/
tcuMatrix.hpp 84 inline const T& operator() (int row, int col) const { return m_data[col][row]; }
85 inline T& operator() (int row, int col) { return m_data[col][row]; }
331 for (int col = 0; col < Cols; col++)
332 (*this)(row, col) = (row == col) ? T(1) : T(0);
340 for (int col = 0; col < Cols; col++
    [all...]
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/
CertStoreCollectionSpi.java 38 List col = new ArrayList(); local
49 col.add(obj);
61 col.add(obj);
66 return col;
74 List col = new ArrayList(); local
85 col.add(obj);
97 col.add(obj);
102 return col;
  /external/eigen/Eigen/src/Core/
NestByValue.h 50 inline const CoeffReturnType coeff(Index row, Index col) const
52 return m_expression.coeff(row, col);
55 inline Scalar& coeffRef(Index row, Index col)
57 return m_expression.const_cast_derived().coeffRef(row, col);
71 inline const PacketScalar packet(Index row, Index col) const
73 return m_expression.template packet<LoadMode>(row, col);
77 inline void writePacket(Index row, Index col, const PacketScalar& x)
79 m_expression.const_cast_derived().template writePacket<LoadMode>(row, col, x);
  /external/eigen/bench/btl/generic_bench/init/
init_matrix.hh 57 for (int col=0; col<row ; col++){
58 double x = init_function(row,col);
59 A[row][col] = A[col][row] = x;
  /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/radeon/
radeon_tile.c 43 unsigned col; /* current source column */ local
51 for (col = 0; col < width; col += tile_width, ++k)
53 uint8_t *src2 = (uint8_t *)src + src_pitch * row + col;
60 unsigned columns = MIN2(tile_width, width - col);
74 unsigned col; /* current source column */ local
82 for (col = 0; col < width; col += tile_width, ++k
105 unsigned col; \/* current source column *\/ local
136 unsigned col; \/* current source column *\/ local
167 unsigned col; \/* current source column *\/ local
257 unsigned col; \/* current destination column *\/ local
290 unsigned col; \/* current destination column *\/ local
323 unsigned col; \/* current destination column *\/ local
356 unsigned col; \/* current destination column *\/ local
389 unsigned col; \/* current destination column *\/ local
    [all...]
  /external/eigen/blas/
BandTriangularSolver.h 38 for(int col=0 ; col<other.cols() ; ++col)
47 other.coeffRef(i,col) -= cjLhs.row(i).segment(actual_start,actual_k).transpose()
48 .cwiseProduct(other.col(col).segment(IsLower ? i-actual_k : i+1,actual_k)).sum();
51 other.coeffRef(i,col) /= cjLhs(i,IsLower ? k : 0);
74 for(int col=0 ; col<other.cols() ; ++col)
    [all...]

Completed in 602 milliseconds

12 3 4 5 6 7 8 91011>>