| /external/eigen/Eigen/src/SVD/ |
| UpperBidiagonalization.h | 118 m_householder.row(k).tail(remainingCols)
123 .applyHouseholderOnTheRight(m_householder.row(k).tail(remainingCols-1).transpose(),
|
| /external/eigen/test/eigen2/ |
| eigen2_basicstuff.cpp | 70 // now test copying a row-vector into a (column-)vector and conversely.
71 square.col(r) = square.row(r).eval();
74 rv = square.row(r);
|
| /external/eigen/test/ |
| sparse_basic.cpp | 72 // VERIFY_IS_APPROX(m.block(i,j,h,w).row(r), refMat.block(i,j,h,w).row(r));
75 // VERIFY_IS_APPROX(m.block(i,j,h,w).row(r).coeff(c), refMat.block(i,j,h,w).row(r).coeff(c));
88 VERIFY_IS_APPROX(m.row(r) + m.row(r), (m + m).row(r));
89 VERIFY_IS_APPROX(m.row(r) + m.row(r), refMat.row(r) + refMat.row(r))
[all...] |
| product_notemporary.cpp | 82 VERIFY_EVALUATION_COUNT( rm3.col(c0).noalias() = (s1 * m1.adjoint()).template triangularView<UnitUpper>() * (s2*m2.row(c0)).adjoint(), 1);
92 VERIFY_EVALUATION_COUNT( m3.col(c0).noalias() = (s1 * m1).adjoint().template selfadjointView<Lower>() * (-m2.row(c0)*s3).adjoint(), 1);
93 VERIFY_EVALUATION_COUNT( m3.col(c0).noalias() -= (s1 * m1).adjoint().template selfadjointView<Upper>() * (-m2.row(c0)*s3).adjoint(), 1);
122 VERIFY_EVALUATION_COUNT( cvres.noalias() -= m1 * m2.row(0).transpose(), 0 );
|
| /external/eigen/unsupported/Eigen/src/KroneckerProduct/ |
| KroneckerTensorProduct.h | 66 const unsigned int iA = itA.row(),
68 iB = itB.row(),
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| dogleg.h | 40 x[j] = (qtb[j] - qrfac.row(j).tail(n-j-1).dot(x.tail(n-j-1))) / temp;
55 wa1.tail(n-j) += qrfac.row(j).tail(n-j) * qtb[j];
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| AbstractTableReadTest.java | 41 * @param data the table data, repeating the sequence row key, column key,
157 assertEquals(ImmutableMap.of(1, 'a', 3, 'c'), table.row("foo"));
164 table.row(null);
|
| EmptyImmutableTableTest.java | 97 assertEquals(ImmutableMap.of(), INSTANCE.row('a'));
|
| ForwardingTableTest.java | 121 forward.row("String");
122 assertEquals("[row(Object)]", getCalls());
|
| /external/libvpx/libvpx/vp8/common/ |
| findnearmv.c | 142 inv->as_mv.row = src->as_mv.row * -1;
|
| /external/linux-tools-perf/util/ui/browsers/ |
| map.c | 53 static void map_browser__write(struct ui_browser *self, void *nd, int row)
57 bool current_entry = ui_browser__is_current_entry(self, row);
|
| /external/llvm/lib/DebugInfo/ |
| DWARFDebugLine.h | 87 struct Row {
88 Row(bool default_is_stmt = false) { reset(default_is_stmt); }
89 /// Called after a row is appended to the matrix.
94 static bool orderByAddress(const Row& LHS, const Row& RHS) {
167 void appendRow(const DWARFDebugLine::Row &state) { Rows.push_back(state); }
177 // Returns the index of the row with file/line info for a given address,
178 // or -1 if there is no such row.
194 typedef std::vector<Row> RowVector;
202 struct State : public Row, public Sequence, public LineTable
221 unsigned row; member in struct:llvm::DWARFDebugLine::State
[all...] |
| /external/skia/legacy/src/utils/ |
| SkMatrix44.cpp | 25 SkMScalar SkMatrix44::get(int row, int col) const {
26 SkASSERT(row <= 3 && row >= 0);
28 return fMat[col][row];
31 void SkMatrix44::set(int row, int col, const SkMScalar& value) {
32 SkASSERT(row <= 3 && row >= 0);
34 fMat[col][row] = value;
|
| /external/smack/src/org/jivesoftware/smackx/ |
| ReportedData.java | 41 private List<Row> rows = new ArrayList<Row>();
91 rows.add(new Row(fieldList));
104 * Adds a new <code>Row</code>.
105 * @param row the new row to add.
107 public void addRow(Row row){
108 rows.add(row);
125 public Iterator<Row> getRows()
[all...] |
| /external/smack/src/org/jivesoftware/smackx/search/ |
| SimpleUserSearch.java | 112 ReportedData.Row row = new ReportedData.Row(fields); local
113 data.addRow(row);
|
| /external/webkit/Source/WebCore/inspector/front-end/ |
| ShortcutsHelp.js | 71 var row = table.createChild("tr");
76 var td = row.createChild("td");
|
| /external/ceres-solver/internal/ceres/ |
| partitioned_matrix_view.cc | 56 // Compute the number of row blocks in E. The number of row blocks
57 // in E maybe less than the number of row blocks in the input matrix
58 // as some of the row blocks at the bottom may not have any
96 // Iterate over the first num_row_blocks_e_ row blocks, and multiply
97 // by the first cell in each row block.
119 // Iterate over row blocks, and if the row block is in E, then
121 // E. If the row block is not in E (i.e its in the bottom
122 // num_row_blocks - num_row_blocks_e row blocks), then all the cell
220 CompressedRow& row = block_diagonal_structure->rows.back(); local
[all...] |
| /external/chromium/chrome/browser/resources/net_internals/ |
| serviceprovidersview.js | 108 // Add a table row for each service provider.
130 // Add a table row for each namespace provider.
|
| /external/eigen/Eigen/src/Geometry/ |
| Homogeneous.h | 78 inline Scalar coeff(Index row, Index col) const
80 if( (int(Direction)==Vertical && row==m_matrix.rows())
83 return m_matrix.coeff(row, col);
135 * \returns a matrix expression of homogeneous column (or row) vectors
295 dst += m_rhs.row(m_rhs.rows()-1).colwise()
|
| /external/eigen/doc/ |
| tutorial.cpp | 21 m3.row(2) = m4.block<1,3>(2,0);
|
| /external/eigen/unsupported/Eigen/src/AutoDiff/ |
| AutoDiffJacobian.h | 74 jac.row(i) = av[i].derivatives();
|
| /external/guava/guava/src/com/google/common/collect/ |
| EmptyImmutableTable.java | 102 @Override public ImmutableMap<Object, Object> row(Object rowKey) { method in class:EmptyImmutableTable
|
| Table.java | 30 * A collection that associates an ordered pair of keys, called a row key and a
32 * fraction of row key / column key pairs possessing a corresponding value.
34 * <p>The mappings corresponding to a given row key may be viewed as a {@link
36 * column with a row key / value map. Note that, in some implementations, data
38 * than data access by row key.
49 * @param <R> the type of the table row keys
63 * row and column keys.
65 * @param rowKey key of row to search for
72 * row key.
74 * @param rowKey key of row to search fo
176 Map<C, V> row(R rowKey); method in interface:Table
[all...] |
| /external/libpng/contrib/pngminus/ |
| png2pnm.c | 204 int row, col; local
374 for (row = 0; row < height; row++)
420 } /* end for row */
|
| pnm2png.c | 207 int row, col; local
341 for (row = 0; row < height; row++)
378 } /* end for row */
411 /* if needed we will allocate memory for an new array of row-pointers */
|
