HomeSort by relevance Sort by last modified time
    Searched refs:row (Results 276 - 300 of 1110) sorted by null

<<11121314151617181920>>

  /external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/
LODGeomap.java 168 for (int r = lod; r < getWidth() - (2 * lod); r += lod) { // row
199 for (int row = getWidth() - lod; row >= 1 + lod; row -= 2 * lod) {
200 int idx = (row) * getWidth() - 1 - lod;
202 idx = (row - lod) * getWidth() - 1;
204 if (row > lod + 1) { //if not the last one
205 idx = (row - lod) * getWidth() - 1 - lod;
207 idx = (row - lod) * getWidth() - 1;
214 for (int row = getWidth() - lod; row > lod; row -= lod) {
    [all...]
  /external/chromium/chrome/browser/sync/resources/
gaia_login.js 69 setElementDisplay("errormsg-1-password", 'table-row');
73 setElementDisplay("errormsg-0-connection", 'table-row');
107 setElementDisplay("password-row", "none");
108 setElementDisplay("email-row", "none");
112 setElementDisplay("access-code-label-row", "table-row");
113 setElementDisplay("access-code-input-row", "table-row");
114 setElementDisplay("access-code-help-row", "table-row");
    [all...]
  /external/eigen/Eigen/src/SparseCore/
SparseMatrix.h 21 * This class implements a more versatile variants of the common \em compressed row/column storage format.
22 * Each colmun's (resp. row) non zeros are stored as a pair of value with associated row (resp. colmiun) index.
123 /** \returns the number of rows (resp. columns) of the matrix if the storage order column major (resp. row major) */
125 /** \returns the number of columns (resp. rows) of the matrix if the storage order column major (resp. row major) */
171 inline Scalar coeff(Index row, Index col) const
173 const Index outer = IsRowMajor ? row : col;
174 const Index inner = IsRowMajor ? col : row;
187 inline Scalar& coeffRef(Index row, Index col)
189 const Index outer = IsRowMajor ? row : col
952 inline Index row() const { return IsRowMajor ? m_outer : index(); } function in class:Eigen::SparseMatrix::InnerIterator
985 inline Index row() const { return IsRowMajor ? m_outer : index(); } function in class:Eigen::SparseMatrix::ReverseInnerIterator
    [all...]
CoreIterators.h 47 inline Index row() const { return IsRowMajor ? m_outer : index(); } function in class:Eigen::DenseBase::InnerIterator
SparseTriangularView.h 104 inline Index row() const { return Base::row(); } function in class:Eigen::SparseTriangularView::InnerIterator
145 inline Index row() const { return Base::row(); } function in class:Eigen::SparseTriangularView::ReverseInnerIterator
SparseVector.h 88 inline Scalar coeff(Index row, Index col) const
90 eigen_assert((IsColVector ? col : row)==0);
91 return coeff(IsColVector ? row : col);
95 inline Scalar& coeffRef(Index row, Index col)
97 eigen_assert((IsColVector ? col : row)==0);
98 return coeff(IsColVector ? row : col);
140 inline Scalar& insert(Index row, Index col)
142 Index inner = IsColVector ? row : col;
143 Index outer = IsColVector ? col : row;
353 inline Index row() const { return IsColVector ? index() : 0; function in class:Eigen::SparseVector::InnerIterator
385 inline Index row() const { return IsColVector ? index() : 0; } function in class:Eigen::SparseVector::ReverseInnerIterator
    [all...]
  /packages/apps/Gallery/src/com/android/camera/
GridViewSpecial.java 503 int row = pos / mColumns; local
504 int col = pos - (row * mColumns);
508 int top = row * mBlockHeight;
523 int row = (mScrollY + y - spacing) / (mSpec.mCellHeight + spacing); local
526 return (row * mColumns) + col;
696 int row = mCurrentSelection / mColumns; local
697 int col = mCurrentSelection - (row * mColumns);
702 int yTop = spacing + (row * mBlockHeight);
720 // mCache maps from row number to the ImageBlock.
725 private final Runnable mRedrawCallback; // Called after a row is loaded
794 int row = pos \/ mColumns; local
880 int row = index \/ mColumns; local
    [all...]
  /device/google/accessory/arduino/USB_Host_Shield/
Max_LCD.cpp 167 void Max_LCD::setCursor(uint8_t col, uint8_t row)
170 if ( row > _numlines ) {
171 row = _numlines-1; // we count rows starting w/0
174 command(LCD_SETDDRAMADDR | (col + row_offsets[row]));
  /external/ceres-solver/internal/ceres/
block_random_access_sparse_matrix.h 69 int* row,
93 // row/column block sizes.
  /external/chromium/chrome/browser/history/
history_notifications.h 34 URLRow row; member in struct:history::URLVisitedDetails
  /external/chromium/chrome/browser/
language_order_table_model.h 50 virtual string16 GetText(int row, int column_id) OVERRIDE;
  /external/eigen/Eigen/src/Core/
CwiseUnaryView.h 112 EIGEN_STRONG_INLINE CoeffReturnType coeff(Index row, Index col) const
114 return derived().functor()(derived().nestedExpression().coeff(row, col));
122 EIGEN_STRONG_INLINE Scalar& coeffRef(Index row, Index col)
124 return derived().functor()(const_cast_derived().nestedExpression().coeffRef(row, col));
  /external/eigen/bench/btl/libs/blitz/
blitz_LU_solve_interface.hh 54 static inline real matrix_vector_product_sliced(const gene_matrix & A, gene_vector B, int row, int col_start, int col_end)
61 somme+=A(row,j)*B(j);
72 static inline real matrix_matrix_product_sliced(gene_matrix & A, int row, int col_start, int col_end, gene_matrix & B, int row_shift, int col )
79 somme+=A(row,j)*B(j+row_shift,col);
  /external/eigen/bench/btl/libs/gmm/
gmm_LU_solve_interface.hh 54 static inline real matrix_vector_product_sliced(const gene_matrix & A, gene_vector B, int row, int col_start, int col_end)
61 somme+=A(row,j)*B(j);
72 static inline real matrix_matrix_product_sliced(gene_matrix & A, int row, int col_start, int col_end, gene_matrix & B, int row_shift, int col )
79 somme+=A(row,j)*B(j+row_shift,col);
  /external/eigen/bench/btl/libs/mtl4/
mtl4_LU_solve_interface.hh 54 static inline real matrix_vector_product_sliced(const gene_matrix & A, gene_vector B, int row, int col_start, int col_end)
61 somme+=A(row,j)*B(j);
72 static inline real matrix_matrix_product_sliced(gene_matrix & A, int row, int col_start, int col_end, gene_matrix & B, int row_shift, int col )
79 somme+=A(row,j)*B(j+row_shift,col);
  /external/eigen/test/
geo_orthomethods.cpp 51 VERIFY_IS_APPROX(mcross.row(i), mat3.row(i).cross(vec3));
103 VERIFY_IS_APPROX(mcrossN3.row(i), matN3.row(i).cross(vec3));
  /external/openssh/
session.h 42 u_int row, col, xpixel, ypixel; member in struct:Session
  /external/webkit/Source/WebCore/accessibility/
AccessibilityTable.h 76 virtual AccessibilityTableCell* cellForColumnAndRow(unsigned column, unsigned row);
  /external/webkit/Source/WebCore/rendering/mathml/
RenderMathMLFraction.cpp 103 RenderBlock* row = new (renderArena()) RenderMathMLBlock(node()); local
116 row->setStyle(rowStyle.release());
117 RenderBlock::addChild(row, beforeChild);
118 row->addChild(child);
  /sdk/testapps/testSensors/src/com/android/tests/testsensors/
TestSensorsActivity.java 61 // Add a row representing this sensor on the display
63 final TableRow row = (TableRow) inflater.inflate(R.layout.one_row, mTableLayout, false); local
64 mTableLayout.addView(row);
68 mName = (TextView) row.findViewById(R.id.row_textview_name);
71 mVal = (TextView) row.findViewById(R.id.row_textview_value);
  /external/eigen/Eigen/src/IterativeLinearSolvers/
IncompleteLUT.h 20 * by the average magnitude of all the original elements in the current row.
21 * 2) After the elimination of the row, only the @p fill largest elements in
130 int QuickSplit(VectorV &row, VectorI &ind, int ncut);
135 inline bool operator() (const Index& row, const Index& col, const Scalar&) const
137 return row!=col;
166 * \param fillfactor This is used to compute the number @p fill_in of largest elements to keep on each row.
177 * On output, the vector row is permuted such that its elements satisfy
178 * abs(row(i)) >= abs(row(ncut)) if i<ncut
179 * abs(row(i)) <= abs(row(ncut)) if i>ncut
    [all...]
  /frameworks/base/core/java/com/android/internal/view/menu/
IconMenuView.java 56 /** Height of each row */
62 /** Maximum number of items per row */
112 * The layout to use for menu items. Each index is the row number (0 is the
113 * top-most). Each value contains the number of items in that row.
218 * @return int[] Where the value of index i contains the number of items for row i
227 * the last row.
256 for (int row = 0; row < numRows; row++) {
257 int numItemsOnRow = layout[row];
    [all...]
  /frameworks/native/opengl/tests/hwc/
hwcStress.cpp 40 * of vectors. The array is accessed in row major order, so each
41 * row is a vector of smart pointers. All the pointers of a single
42 * row point to graphic buffers which use the same pixel format and
47 * graphic buffer within the same row. Since the graphic buffers
48 * in a particular row have the same pixel format and dimension,
225 * such that there is a unique row to be used for each
229 * selected from any of the columns of the selected row.
546 * vectors. All the graphic buffers in a particular row are of the same
549 * in the same row, will be filled with a unique color.
565 for (unsigned int row = 0; row < rows; row++)
    [all...]
  /packages/apps/Browser/src/com/android/browser/view/
BookmarkExpandableView.java 274 int mRowCount = 1; // assume at least 1 child fits in a row
320 LinearLayout row = (LinearLayout) convertView; local
321 if (row.getChildCount() > rowCount) {
322 row.removeViews(rowCount, row.getChildCount() - rowCount);
326 if (row.getChildCount() > i) {
327 cv = row.getChildAt(i);
331 View v = childAdapter.getView(realChildPosition, cv, row);
337 row.addView(v);
339 row.removeViewAt(i)
    [all...]
  /cts/tests/tests/provider/src/android/provider/cts/
MediaStore_VideoTest.java 45 for (Uri row : mRowsAdded) {
46 mContentResolver.delete(row, null, null);

Completed in 757 milliseconds

<<11121314151617181920>>