/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/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...] |
detect_structure.cc | 54 if (row.cells.front().block_id >= num_eliminate_blocks) { 57 const int e_block_id = row.cells.front().block_id; 81 if (row.cells.size() > 1) { 82 const int f_block_id = row.cells[1].block_id; 86 for (int c = 1; c < row.cells.size(); ++c) { 87 if (*f_block_size != bs.cols[row.cells[c].block_id].size) { 90 << bs.cols[row.cells[c].block_id].size;
|
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...] |
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],
|
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...] |
visibility.cc | 60 const vector<Cell>& cells = block_structure.rows[i].cells; local 61 int block_id = cells[0].block_id; 67 for (int j = 1; j < cells.size(); ++j) { 68 int camera_block_id = cells[j].block_id - num_eliminate_blocks;
|
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...] |
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...] |
schur_complement_solver.cc | 194 int e_block_id = bs->rows[r].cells.front().block_id; 204 if (row.cells.front().block_id != e_block_id) { 210 for (int c = 1; c < row.cells.size(); ++c) { 211 const Cell& cell = row.cells[c]; 229 CHECK_GE(row.cells.front().block_id, num_eliminate_blocks); 230 for (int i = 0; i < row.cells.size(); ++i) { 231 int r_block1_id = row.cells[i].block_id - num_eliminate_blocks; 232 for (int j = 0; j < row.cells.size(); ++j) { 233 int r_block2_id = row.cells[j].block_id - num_eliminate_blocks;
|
block_jacobian_writer.cc | 165 // Construct the cells in each row. 186 row->cells.resize(num_active_parameter_blocks); 193 Cell& cell = row->cells[k]; 203 sort(row->cells.begin(), row->cells.end(), CellLessThan);
|
block_structure.h | 76 vector<Cell> cells; member in struct:ceres::internal::CompressedList
|
visibility_based_preconditioner.cc | 247 // of non-zero cells contibuted by this e_block. 253 int e_block_id = bs.rows[r].cells.front().block_id; 262 if (row.cells.front().block_id != e_block_id) { 269 for (int c = 1; c < row.cells.size(); ++c) { 270 const Cell& cell = row.cells[c]; 293 CHECK_GE(row.cells.front().block_id, num_eliminate_blocks); 294 for (int i = 0; i < row.cells.size(); ++i) { 295 const int block1 = row.cells[i].block_id - num_eliminate_blocks; 296 for (int j = 0; j < row.cells.size(); ++j) { 297 const int block2 = row.cells[j].block_id - num_eliminate_blocks [all...] |
/external/chromium_org/third_party/WebKit/Source/core/html/ |
HTMLTableRowElement.h | 49 PassRefPtr<HTMLCollection> cells();
|
HTMLTableRowElement.idl | 24 readonly attribute HTMLCollection cells;
|
HTMLTableRowElement.cpp | 123 RefPtr<HTMLCollection> children = cells(); 146 RefPtr<HTMLCollection> children = cells(); 158 PassRefPtr<HTMLCollection> HTMLTableRowElement::cells() function in class:WebCore::HTMLTableRowElement
|
/external/chromium_org/chrome/common/extensions/docs/server2/ |
subversion_file_system.py | 53 cells = row.getElementsByTagName('td') 64 if len(cells) == 2 and _InnerText(cells[0]) == 'Directory revision:': 65 links = cells[1].getElementsByTagName('a') 69 _InnerText(cells[1])) 78 # The version of each file is a list of rows with 5 cells: name, version, 81 if len(cells) != 5: 83 name_element, version_element, _, __, ___ = cells
|
/external/chromium_org/third_party/WebKit/PerformanceTests/DOM/resources/dom-perf/ |
gridsort.js | 88 var numCells = row.cells.length; 90 this.nodes[i] = row.cells[i].firstChild; 113 // now place all cells in their new position 119 var columnCount = table.rows[i].cells.length; 121 var cell = table.rows[i].cells[j];
|
/external/chromium_org/third_party/WebKit/Source/core/accessibility/ |
AccessibilityTable.h | 71 // all the cells in the table 72 void cells(AccessibilityChildrenVector&);
|
/external/iproute2/tc/ |
tc_core.c | 70 * The align to ATM cells is used for determining the (ATM) SAR 81 int linksize, cells; local 82 cells = size / ATM_CELL_PAYLOAD; 84 cells++; 86 linksize = cells * ATM_CELL_SIZE; /* Use full cell size to add ATM tax */
|
/external/valgrind/main/memcheck/tests/ |
leak-pool.c | 101 struct cell **cells = static_roots ? cells_static : cells_local; local 114 cells[i] = allocate_from_pool(p, sizeof(struct cell));
|
/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; } 291 // This HashSet holds the overflowing cells for faster painting. 292 // If we have more than gMaxAllowedOverflowingCellRatio * total cells, it will be empty 299 // This map holds the collapsed border values for cells with collapsed borders. 300 // It is held at RenderTableSection level to spare memory consumption by table cells [all...] |
/external/guava/guava/src/com/google/common/collect/ |
ImmutableTable.java | 133 * <p>By default, the order in which cells are added to the builder determines 149 private final List<Cell<R, C, V>> cells = Lists.newArrayList(); field in class:ImmutableTable.Builder 182 cells.add(cellOf(rowKey, columnKey, value)); 199 cells.add(immutableCell); 227 int size = cells.size(); 233 Iterables.getOnlyElement(cells)); 236 cells, rowComparator, columnComparator);
|
/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. """
|