| /external/ceres-solver/internal/ceres/ |
| block_sparse_matrix.cc | 67 const vector<Cell>& cells = block_structure_->rows[i].cells; local
68 for (int j = 0; j < cells.size(); ++j) {
69 int col_block_id = cells[j].block_id;
95 const vector<Cell>& cells = block_structure_->rows[i].cells; local
96 for (int j = 0; j < cells.size(); ++j) {
97 int col_block_id = cells[j].block_id;
101 values_.get() + cells[j].position, row_block_size, col_block_size,
115 const vector<Cell>& cells = block_structure_->rows[i].cells local
133 const vector<Cell>& cells = block_structure_->rows[i].cells; local
150 const vector<Cell>& cells = block_structure_->rows[i].cells; local
172 const vector<Cell>& cells = block_structure_->rows[i].cells; local
195 const vector<Cell>& cells = block_structure_->rows[i].cells; local
225 const vector<Cell>& cells = block_structure_->rows[i].cells; local
[all...] |
| partitioned_matrix_view.cc | 64 const vector<Cell>& cells = bs->rows[r].cells; local
65 if (cells[0].block_id < num_col_blocks_a) {
101 const Cell& cell = bs->rows[r].cells[0];
118 // multiply by all the cells except the first one which is of type
120 // num_row_blocks - num_row_blocks_e row blocks), then all the cells
126 const vector<Cell>& cells = bs->rows[r].cells; local
127 for (int c = (r < num_row_blocks_e_) ? 1 : 0; c < cells.size(); ++c) {
128 const int col_block_id = cells[c].block_id
171 const vector<Cell>& cells = bs->rows[r].cells; local
284 const vector<Cell>& cells = bs->rows[r].cells; local
[all...] |
| schur_eliminator_impl.h | 109 const int chunk_block_id = bs->rows[r].cells.front().block_id;
125 if (row.cells.front().block_id != chunk_block_id) {
131 for (int c = 1; c < row.cells.size(); ++c) {
132 const Cell& cell = row.cells[c];
228 const int e_block_id = bs->rows[chunk.start].cells.front().block_id;
310 const int e_block_id = bs->rows[chunk.start].cells.front().block_id;
329 const Cell& e_cell = row.cells.front();
338 for (int c = 1; c < row.cells.size(); ++c) {
339 const int f_block_id = row.cells[c].block_id;
344 values + row.cells[c].position, row.block.size, f_block_size
[all...] |
| visibility_test.cc | 66 row.cells.push_back(Cell(0, 0));
67 row.cells.push_back(Cell(5, 0));
76 row.cells.push_back(Cell(0, 1));
77 row.cells.push_back(Cell(3, 1));
86 row.cells.push_back(Cell(1, 2));
87 row.cells.push_back(Cell(2, 2));
96 row.cells.push_back(Cell(1, 3));
97 row.cells.push_back(Cell(4, 3));
146 row.cells.push_back(Cell(0, 0));
155 row.cells.push_back(Cell(0, 1))
[all...] |
| block_random_access_dense_matrix.h | 46 // column block structure. All cells are stored in the same single
50 // This class is NOT thread safe. Since all n^2 cells are stored,
58 // blocks.size() * blocks.size() cells.
62 // modifying any cells when the matrix is being destroyed.
82 // The underlying matrix storing the cells.
|
| linear_least_squares_problems.cc | 315 row.cells.push_back(Cell(0, 0));
316 row.cells.push_back(Cell(2, 1));
328 row.cells.push_back(Cell(0, 2));
329 row.cells.push_back(Cell(3, 3));
341 row.cells.push_back(Cell(1, 4));
342 row.cells.push_back(Cell(4, 5));
354 row.cells.push_back(Cell(1, 6));
355 row.cells.push_back(Cell(2, 7));
367 row.cells.push_back(Cell(1, 8));
368 row.cells.push_back(Cell(2, 9))
[all...] |
| block_jacobi_preconditioner.cc | 78 const vector<Cell>& cells = bs->rows[r].cells; local
79 for (int c = 0; c < cells.size(); ++c) {
80 const int col_block_size = bs->cols[cells[c].block_id].size;
81 ConstMatrixRef m(values + cells[c].position,
85 MatrixRef(blocks_[cells[c].block_id],
95 // MatrixRef(blocks_[cells[c].block_id],
|
| /external/clang/test/CodeGenOpenCL/ |
| addr-space-struct-arg.cl | 4 int cells[9];
8 int cells[16];
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/ |
| atm_idt77105.h | 20 __u32 tx_cells; /* cells transmitted */
21 __u32 rx_cells; /* cells received */
|
| atm_zatm.h | 44 #define ZATM_OAM_POOL 0 /* free buffer pool for OAM cells */
45 #define ZATM_AAL0_POOL 1 /* free buffer pool for AAL0 cells */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| atm_idt77105.h | 20 __u32 tx_cells; /* cells transmitted */
21 __u32 rx_cells; /* cells received */
|
| atm_zatm.h | 44 #define ZATM_OAM_POOL 0 /* free buffer pool for OAM cells */
45 #define ZATM_AAL0_POOL 1 /* free buffer pool for AAL0 cells */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| atm_idt77105.h | 20 __u32 tx_cells; /* cells transmitted */
21 __u32 rx_cells; /* cells received */
|
| atm_zatm.h | 44 #define ZATM_OAM_POOL 0 /* free buffer pool for OAM cells */
45 #define ZATM_AAL0_POOL 1 /* free buffer pool for AAL0 cells */
|
| /external/chromium/chrome/browser/resources/shared/js/cr/ui/table/ |
| table_list.js | 41 var cells = this.querySelectorAll('.table-row-cell');
42 if (cells.length % cm.size != 0) {
46 var rowsCount = cells.length / cm.size;
50 cells[row * cm.size + i].style.width = cm.getWidth(i) + '%';
|
| /external/chromium/chrome/browser/ui/cocoa/bookmarks/ |
| bookmark_menu.mm | 13 // cells have a BookmarkNode as their represented object. This object
|
| /external/chromium_org/chrome/browser/extensions/api/braille_display_private/ |
| stub_braille_controller.cc | 18 void StubBrailleController::WriteDots(const std::string& cells) {
|
| stub_braille_controller.h | 19 virtual void WriteDots(const std::string& cells) OVERRIDE;
|
| braille_controller_stub.cc | 21 virtual void WriteDots(const std::string& cells) OVERRIDE;
59 void BrailleControllerImpl::WriteDots(const std::string& cells) {
|
| /frameworks/rs/java/tests/RsTest/src/com/android/rs/test/ |
| check_dims.rs | 7 // This test checks to see that we only work on the cells specified for the
|
| /external/chromium_org/third_party/eyesfree/src/android/java/src/com/googlecode/eyesfree/braille/translate/ |
| BrailleTranslator.java | 31 * Translates the braille {@code cells} into the corresponding text, which
34 String backTranslate(byte[] cells);
|
| ITranslatorService.aidl | 43 * Translates braille cells into text according to the given table
46 String backTranslate(in byte[] cells, String tableName);
|
| /external/markdown/markdown/extensions/ |
| tables.py | 59 """ Given a row of text, build table cells. """
64 cells = self._split_row(row, border)
65 # We use align here rather than cells to ensure every row
70 c.text = cells[i].strip()
77 """ split a row of text into list of cells. """
|
| /external/chromium_org/chrome/browser/resources/net_internals/ |
| logs_view.js | 81 * be shown in. Each row has 4 cells.
91 var cells = [];
94 cells.push(rowCell);
98 cells[0].className = LOG_CELL_TEXT_CLASSNAME;
99 cells[0].textContent = logKey;
102 cells[2].className = LOG_CELL_TEXT_CLASSNAME;
107 cells[2].appendChild(logDiv);
118 cells[1].appendChild(expandButton);
119 cells[1].className = LOG_TABLE_BUTTON_COLUMN_CLASSNAME;
184 * cells
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderTableSection.h | 89 Vector<RenderTableCell*, 1> cells; member in struct:WebCore::FINAL::CellStruct
99 return hasCells() ? cells[cells.size() - 1] : 0;
104 return hasCells() ? cells[cells.size() - 1] : 0;
107 bool hasCells() const { return cells.size() > 0; }
298 // This HashSet holds the overflowing cells for faster painting.
299 // If we have more than gMaxAllowedOverflowingCellRatio * total cells, it will be empty
306 // This map holds the collapsed border values for cells with collapsed borders.
307 // It is held at RenderTableSection level to spare memory consumption by table cells
[all...] |
