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

1 2 3 4 5 6 7 8 91011>>

  /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/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...]
  /frameworks/support/v17/leanback/src/android/support/v17/leanback/widget/
OnItemViewClickedListener.java 18 * row object to be sub class of {@link Row}.
20 public interface OnItemViewClickedListener extends BaseOnItemViewClickedListener<Row> {
OnItemViewSelectedListener.java 17 * Interface for receiving notification when a row or item becomes selected. The concept of
18 * current selection is different than focus. A row or item can be selected without having focus;
19 * for example, when a row header view gains focus then the corresponding row view becomes selected.
20 * This interface expects row object to be sub class of {@link Row}.
22 public interface OnItemViewSelectedListener extends BaseOnItemViewSelectedListener<Row> {
DividerRow.java 19 public class DividerRow extends Row {
PageRow.java 19 public class PageRow extends Row {
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...]
  /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...]
  /external/clang/test/SemaCXX/
constexpr-nqueens.cpp 13 constexpr Board addQueen(int Row, int Col) const {
14 return Board(State | ((uint64_t)Row << (Col * 4)));
19 constexpr bool ok(int Row, int Col) const {
20 return okRecurse(Row, Col, 0);
22 constexpr bool okRecurse(int Row, int Col, int CheckCol) const {
24 getQueenRow(CheckCol) == Row ? false :
25 getQueenRow(CheckCol) == Row + (Col - CheckCol) ? false :
26 getQueenRow(CheckCol) == Row + (CheckCol - Col) ? false :
27 okRecurse(Row, Col, CheckCol + 1);
29 constexpr bool at(int Row, int Col) const
    [all...]
  /frameworks/support/samples/SupportLeanbackShowcase/app/src/main/java/android/support/v17/leanback/supportleanbackshowcase/app/media/
SongListRow.java 18 import android.support.v17.leanback.widget.Row;
20 public class SongListRow extends Row {}
TrackListHeader.java 18 import android.support.v17.leanback.widget.Row;
20 public class TrackListHeader extends Row {
  /external/snakeyaml/src/test/java/org/yaml/snakeyaml/extensions/compactnotation/
Table.java 23 private List<Row> rows;
31 public List<Row> getRows() {
35 public void setRows(List<Row> rows) {
ManyListsTable.java 22 private List<Row> rows;
29 public List<Row> getRows() {
33 public void setRows(List<Row> rows) {
  /external/icu/android_icu4j/src/main/java/android/icu/impl/
Row.java 21 public class Row<C0, C1, C2, C3, C4> implements java.lang.Comparable, Cloneable,
22 Freezable<Row<C0, C1, C2, C3, C4>>{
42 public static class R2<C0, C1> extends Row<C0, C1, C1, C1, C1> {
47 public static class R3<C0, C1, C2> extends Row<C0, C1, C2, C2, C2> {
52 public static class R4<C0, C1, C2, C3> extends Row<C0, C1, C2, C3, C3> {
57 public static class R5<C0, C1, C2, C3, C4> extends Row<C0, C1, C2, C3, C4> {
63 public Row<C0, C1, C2, C3, C4> set0(C0 item) {
69 public Row<C0, C1, C2, C3, C4> set1(C1 item) {
75 public Row<C0, C1, C2, C3, C4> set2(C2 item) {
81 public Row<C0, C1, C2, C3, C4> set3(C3 item)
    [all...]
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
Row.java 17 public class Row<C0, C1, C2, C3, C4> implements java.lang.Comparable, Cloneable,
18 Freezable<Row<C0, C1, C2, C3, C4>>{
38 public static class R2<C0, C1> extends Row<C0, C1, C1, C1, C1> {
43 public static class R3<C0, C1, C2> extends Row<C0, C1, C2, C2, C2> {
48 public static class R4<C0, C1, C2, C3> extends Row<C0, C1, C2, C3, C3> {
53 public static class R5<C0, C1, C2, C3, C4> extends Row<C0, C1, C2, C3, C4> {
59 public Row<C0, C1, C2, C3, C4> set0(C0 item) {
65 public Row<C0, C1, C2, C3, C4> set1(C1 item) {
71 public Row<C0, C1, C2, C3, C4> set2(C2 item) {
77 public Row<C0, C1, C2, C3, C4> set3(C3 item)
    [all...]
  /frameworks/support/v17/leanback/tests/java/android/support/v17/leanback/media/
PlaybackGlueHostImpl.java 19 import android.support.v17.leanback.widget.Row;
27 protected Row mRow;
67 public void setPlaybackRow(Row row) {
68 mRow = 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...]
  /tools/loganalysis/src/com/android/loganalysis/item/
QtaguidItem.java 39 private Map<Integer, Row> mRows = new HashMap<Integer, Row>();
41 private static class Row {
97 * Add a row from the qtaguid output to the {@link QtaguidItem}.
104 Row row = new Row(); local
105 row.rxBytes = rxBytes;
106 row.txBytes = txBytes;
107 mRows.put(uid, row);
125 Row row = mRows.get(uid); local
    [all...]

Completed in 674 milliseconds

1 2 3 4 5 6 7 8 91011>>