HomeSort by relevance Sort by last modified time
    Searched defs:Row (Results 1 - 25 of 239) sorted by null

1 2 3 4 5 6 7 8 910

  /device/linaro/bootloader/edk2/ShellPkg/Library/UefiShellDebug1CommandsLib/
Mode.c 38 UINTN Row;
89 Status = gST->ConOut->QueryMode(gST->ConOut, LoopVar, &Col, &Row);
93 if (Col == NewCol && Row == NewRow) {
117 Status = gST->ConOut->QueryMode(gST->ConOut, LoopVar, &Col, &Row);
121 ShellPrintHiiEx(-1, -1, NULL, STRING_TOKEN (STR_MODE_LIST_ITEM), gShellDebug1HiiHandle, Col, Row, LoopVar == gST->ConOut->Mode->Mode?L'*':L' ');
EditMenuBar.c 80 @param[in] LastRow The last printable row.
94 UINTN Row;
103 Row = (LastRow - 2);
124 Row++;
130 ShellPrintEx ((INT32)(Col) - 1, (INT32)(Row) - 1, L"%E%s%N %H%s%N ", FunctionKeyString, NameString);
  /external/llvm/include/llvm/ADT/
edit_distance.h 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
    [all...]
  /external/llvm/lib/DebugInfo/DWARF/
DWARFUnitIndex.cpp 134 auto &Row = Rows[i];
135 if (auto *Contribs = Row.Contributions.get()) {
136 OS << format("%5u 0x%016" PRIx64 " ", i + 1, Row.Signature);
  /external/skia/src/gpu/
GrRectanizer_pow2.h 17 // of two can have, at most, one active row/shelf. Once a row/shelf for
19 // to a new row.
45 struct Row {
48 // but it is used to signal if there exists an open row of this height
56 Row fRows[kMaxExponent]; // 0-th entry will be unused
72 void initRow(Row* row, int rowHeight) {
73 row->fLoc.set(0, fNextStripY);
74 row->fRowHeight = rowHeight
    [all...]
  /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
edit_distance.h 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
    [all...]
  /external/webrtc/webrtc/system_wrappers/include/
aligned_array.h 19 // Wrapper class for aligned arrays. Every row (and the first dimension) are
50 T* Row(size_t row) {
51 RTC_CHECK_LE(row, rows_);
52 return head_row_[row];
55 const T* Row(size_t row) const {
56 RTC_CHECK_LE(row, rows_);
57 return head_row_[row];
60 T& At(size_t row, size_t col)
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/
edit_distance.h 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/
edit_distance.h 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/
edit_distance.h 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
edit_distance.h 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/
edit_distance.h 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/
edit_distance.h 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/
edit_distance.h 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
edit_distance.h 53 // array, only one row plus one element are used at a time, so this
54 // implementation just keeps one vector for the row. To update one entry,
56 // entry is in Row[x-1], the top entry is what's in Row[x] from the last
64 unsigned *Row = SmallBuffer;
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0]
    [all...]
  /device/linaro/bootloader/edk2/StdLib/Include/sys/
EfiSysCall.h 342 UINT32 Row;
  /frameworks/support/v17/leanback/src/android/support/v17/leanback/widget/
Row.java 22 public class Row {
33 * Constructor for a Row.
35 * @param id The id of the row.
36 * @param headerItem The {@link HeaderItem} for this Row, or null if there
39 public Row(long id, HeaderItem headerItem) {
45 * Constructor for a Row.
47 * @param headerItem The {@link HeaderItem} for this Row, or null if there
50 public Row(HeaderItem headerItem) {
55 * Constructor for a Row.
57 public Row() {
    [all...]
  /device/linaro/bootloader/edk2/IntelFrameworkPkg/Library/FrameworkUefiLib/
Console.c 324 UINTN Row;
387 // Compute the starting row and starting column for the popup
389 Row = (Rows - (NumberOfLines + 3)) / 2;
405 ConOut->SetCursorPosition (ConOut, Column, Row++);
429 ConOut->SetCursorPosition (ConOut, Column, Row++);
442 ConOut->SetCursorPosition (ConOut, Column, Row++);
  /external/emma/core/java12/com/vladium/emma/report/html/doc/
HTMLTable.java 56 final Row row = new Row (true); local
57 add (row);
59 return row;
64 final Row row = new Row (false); local
65 add (row);
67 return row;
    [all...]
  /external/snakeyaml/src/test/java/org/yaml/snakeyaml/extensions/compactnotation/
Row.java 18 public class Row {
25 public Row(String id) {
78 return "Row id=" + id;
  /external/webrtc/webrtc/modules/desktop_capture/
desktop_region.h 25 // Internally each region is stored as a set of rows where each row contains one
32 // RowSpan represents a horizontal span withing a single row.
47 // Row represents a single row of a region. A row is set of rectangles that
49 struct Row {
50 Row(int32_t top, int32_t bottom);
51 ~Row();
59 // Type used to store list of rows in the region. The bottom position of row
62 typedef std::map<int, Row*> Rows
    [all...]
desktop_region.cc 23 DesktopRegion::Row::Row(int32_t top, int32_t bottom)
27 DesktopRegion::Row::~Row() {}
51 // Copy each row.
52 Row* row = it->second; local
53 it->second = new Row(*row);
59 // Iterate over rows of the tow regions and compare each row
98 Rows::iterator row = rows_.upper_bound(top); local
374 Row* row = it->second; local
    [all...]
  /packages/apps/QuickSearchBox/tests/src/com/android/quicksearchbox/
MockSuggestionProviderCursor.java 28 private final ArrayList<Row> mRows;
32 mRows = new ArrayList<Row>();
35 public Row addRow(Object... values) {
36 Row row = new Row(values); local
37 mRows.add(row);
38 return row;
90 private class Row {
92 public Row(Object... values)
    [all...]
  /external/webrtc/webrtc/system_wrappers/source/
data_log.cc 30 // A Row contains cells, which are indexed by the column names as std::string.
32 class Row {
34 Row();
35 ~Row();
56 // A LogTable contains multiple rows, where only the latest row is active for
70 // Buffers the current row while it is waiting to be written to file,
71 // which is done by a call to Flush(). A new row is available when the
94 typedef std::list<Row*> RowList;
100 Row* current_row_;
106 Row::Row(
    [all...]
  /developers/build/prebuilts/gradle/GridViewPager/Wearable/src/main/java/com/example/android/wearable/gridviewpager/
SampleGridPagerAdapter.java 38 * Constructs fragments as requested by the GridViewPager. For each row a different background is
49 private List<Row> mRows;
58 mRows = new ArrayList<SampleGridPagerAdapter.Row>();
60 mRows.add(new Row(cardFragment(R.string.welcome_title, R.string.welcome_text)));
61 mRows.add(new Row(cardFragment(R.string.about_title, R.string.about_text)));
62 mRows.add(new Row(
65 mRows.add(new Row(
68 mRows.add(new Row(new CustomFragment()));
69 mRows.add(new Row(cardFragment(R.string.dismiss_title, R.string.dismiss_text)));
76 protected Drawable create(final Integer row) {
    [all...]

Completed in 742 milliseconds

1 2 3 4 5 6 7 8 910