| /libcore/ojluni/src/main/java/java/lang/ |
| ThreadLocal.java | 588 * Heuristically scan some cells looking for stale entries.
599 * @param n scan control: <tt>log2(n)</tt> cells are scanned,
601 * <tt>log2(table.length)-1</tt> additional cells are scanned.
|
| /packages/apps/Launcher2/src/com/android/launcher2/ |
| CellLayout.java | 634 // Generate an id for each view, this assumes we have at most 256x256 cells
[all...] |
| /prebuilts/clang/darwin-x86/host/3.6/tools/scan-build/ |
| sorttable.js | 78 headrow = table.tHead.rows[0].cells;
148 row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
170 text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]);
|
| /prebuilts/clang/host/darwin-x86/3.8/tools/scan-build/ |
| sorttable.js | 78 headrow = table.tHead.rows[0].cells;
148 row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
170 text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]);
|
| /prebuilts/clang/host/darwin-x86/clang-2629532/tools/scan-build/share/scan-build/ |
| sorttable.js | 78 headrow = table.tHead.rows[0].cells;
148 row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
170 text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]);
|
| /prebuilts/clang/host/darwin-x86/clang-2658975/tools/scan-build/share/scan-build/ |
| sorttable.js | 78 headrow = table.tHead.rows[0].cells;
148 row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
170 text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]);
|
| /prebuilts/clang/host/darwin-x86/clang-2690385/tools/scan-build/share/scan-build/ |
| sorttable.js | 78 headrow = table.tHead.rows[0].cells;
148 row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
170 text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]);
|
| /prebuilts/clang/host/linux-x86/3.8/tools/scan-build/ |
| sorttable.js | 78 headrow = table.tHead.rows[0].cells;
148 row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
170 text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]);
|
| /prebuilts/clang/host/linux-x86/clang-2629532/tools/scan-build/share/scan-build/ |
| sorttable.js | 78 headrow = table.tHead.rows[0].cells;
148 row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
170 text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]);
|
| /prebuilts/clang/host/linux-x86/clang-2658975/tools/scan-build/share/scan-build/ |
| sorttable.js | 78 headrow = table.tHead.rows[0].cells;
148 row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
170 text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]);
|
| /prebuilts/clang/host/linux-x86/clang-2690385/tools/scan-build/share/scan-build/ |
| sorttable.js | 78 headrow = table.tHead.rows[0].cells;
148 row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
170 text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]);
|
| /prebuilts/clang/linux-x86/host/3.6/tools/scan-build/ |
| sorttable.js | 78 headrow = table.tHead.rows[0].cells;
148 row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
170 text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]);
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| heapq.py | 60 over the two cells it tops, and we can trace the winner down the tree
65 that a cell and the two cells it tops contain three different items,
66 but the top cell "wins" over the two topped cells.
|
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| heapq.py | 60 over the two cells it tops, and we can trace the winner down the tree
65 that a cell and the two cells it tops contain three different items,
66 but the top cell "wins" over the two topped cells.
|
| /prebuilts/misc/darwin-x86/analyzer/tools/scan-build/ |
| sorttable.js | 78 headrow = table.tHead.rows[0].cells;
148 row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
170 text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]);
|
| /prebuilts/misc/linux-x86/analyzer/tools/scan-build/ |
| sorttable.js | 78 headrow = table.tHead.rows[0].cells;
148 row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
170 text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| heapq.py | 60 over the two cells it tops, and we can trace the winner down the tree
65 that a cell and the two cells it tops contain three different items,
66 but the top cell "wins" over the two topped cells.
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| heapq.py | 60 over the two cells it tops, and we can trace the winner down the tree
65 that a cell and the two cells it tops contain three different items,
66 but the top cell "wins" over the two topped cells.
|
| /external/chromium-trace/catapult/tracing/tracing/ui/analysis/ |
| memory_dump_sub_view_util_test.html | [all...] |
| memory_dump_sub_view_util.html | 144 * Construct columns from cells in a hierarchy of rows and a list of rules.
198 // Recursively find the names of all cells of the rows (and their sub-rows).
669 // cells and the timestamp count.
|
| /external/llvm/lib/Target/Hexagon/ |
| BitTracker.cpp | 43 // queried for the cells for each virtual register.
408 // register cells that can be used to implement target-specific instructions
859 // cells accordingly.
[all...] |
| /frameworks/base/core/java/android/widget/ |
| GridLayout.java | 56 * viewing area into <em>cells</em>. Throughout the API, grid lines are referenced
66 * Children occupy one or more contiguous cells, as defined
70 * occupied; and how children should be aligned within the resulting group of cells.
71 * Although cells do not normally overlap in a GridLayout, GridLayout does
72 * not prevent children being defined to occupy the same cell or group of cells.
721 // Logic to avert infinite loops by ensuring that the cells can be placed somewhere.
731 // install default indices for cells that don't define them
[all...] |
| /frameworks/support/v7/gridlayout/src/android/support/v7/widget/ |
| GridLayout.java | 55 * viewing area into <em>cells</em>. Throughout the API, grid lines are referenced
65 * Children occupy one or more contiguous cells, as defined
69 * occupied; and how children should be aligned within the resulting group of cells.
70 * Although cells do not normally overlap in a GridLayout, GridLayout does
71 * not prevent children being defined to occupy the same cell or group of cells.
712 // Logic to avert infinite loops by ensuring that the cells can be placed somewhere.
722 // install default indices for cells that don't define them
[all...] |
| /external/chromium-trace/catapult/third_party/py_vulcanize/third_party/rjsmin/bench/ |
| markermanager.js | 12 * When the user moves the viewport, it computes which grid cells have
14 * cells.
815 * Use the rectangleDiffCoords_ function to process all grid cells
|
| /external/jacoco/org.jacoco.report.test/src/org/jacoco/report/internal/html/ |
| xhtml1-strict.dtd | 830 The rules attribute defines which rules to draw between cells:
894 col elements define the alignment properties for cells in
953 <!-- th is for headers, td for data and for cells acting as both -->
|
