| /external/clang/test/SemaCXX/ |
| D | constexpr-nqueens.cpp | 13 constexpr Board addQueen(int Row, int Col) { in addQueen()
14 return Board(State | ((uint64_t)Row << (Col * 4))); in addQueen()
19 constexpr bool ok(int Row, int Col) { in ok()
20 return okRecurse(Row, Col, 0); in ok()
22 constexpr bool okRecurse(int Row, int Col, int CheckCol) { in okRecurse()
24 getQueenRow(CheckCol) == Row ? false : in okRecurse()
25 getQueenRow(CheckCol) == Row + (Col - CheckCol) ? false : in okRecurse()
26 getQueenRow(CheckCol) == Row + (CheckCol - Col) ? false : in okRecurse()
27 okRecurse(Row, Col, CheckCol + 1); in okRecurse()
29 constexpr bool at(int Row, int Col) { in at()
[all …]
|
| /external/llvm/include/llvm/ADT/ |
| D | edit_distance.h | 64 unsigned *Row = SmallBuffer; variable
66 Row = new unsigned[n + 1];
67 Allocated.reset(Row);
71 Row[i] = i;
74 Row[0] = y;
75 unsigned BestThisRow = Row[0];
79 int OldRow = Row[x];
81 Row[x] = std::min(
83 std::min(Row[x-1], Row[x])+1);
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| D | Row.java | 19 public class Row<C0, C1, C2, C3, C4> implements java.lang.Comparable, Cloneable, class
20 Freezable<Row<C0, C1, C2, C3, C4>>{
40 public static class R2<C0, C1> extends Row<C0, C1, C1, C1, C1> {
45 public static class R3<C0, C1, C2> extends Row<C0, C1, C2, C2, C2> {
50 public static class R4<C0, C1, C2, C3> extends Row<C0, C1, C2, C3, C3> {
55 public static class R5<C0, C1, C2, C3, C4> extends Row<C0, C1, C2, C3, C4> {
61 public Row<C0, C1, C2, C3, C4> set0(C0 item) { in set0()
67 public Row<C0, C1, C2, C3, C4> set1(C1 item) { in set1()
73 public Row<C0, C1, C2, C3, C4> set2(C2 item) { in set2()
79 public Row<C0, C1, C2, C3, C4> set3(C3 item) { in set3()
[all …]
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| D | Row.java | 15 public class Row<C0, C1, C2, C3, C4> implements java.lang.Comparable, Cloneable, class
16 Freezable<Row<C0, C1, C2, C3, C4>>{
36 public static class R2<C0, C1> extends Row<C0, C1, C1, C1, C1> {
41 public static class R3<C0, C1, C2> extends Row<C0, C1, C2, C2, C2> {
46 public static class R4<C0, C1, C2, C3> extends Row<C0, C1, C2, C3, C3> {
51 public static class R5<C0, C1, C2, C3, C4> extends Row<C0, C1, C2, C3, C4> {
57 public Row<C0, C1, C2, C3, C4> set0(C0 item) { in set0()
63 public Row<C0, C1, C2, C3, C4> set1(C1 item) { in set1()
69 public Row<C0, C1, C2, C3, C4> set2(C2 item) { in set2()
75 public Row<C0, C1, C2, C3, C4> set3(C3 item) { in set3()
[all …]
|
| /external/llvm/lib/DebugInfo/DWARF/ |
| D | DWARFDebugLine.cpp | 134 DWARFDebugLine::Row::Row(bool default_is_stmt) { in Row() function in DWARFDebugLine::Row
138 void DWARFDebugLine::Row::postAppend() { in postAppend()
144 void DWARFDebugLine::Row::reset(bool default_is_stmt) { in reset()
158 void DWARFDebugLine::Row::dump(raw_ostream &OS) const { in dump()
193 for (const Row &R : Rows) { in dump()
211 Row.reset(LineTable->Prologue.DefaultIsStmt); in resetRowAndSequence()
219 Sequence.LowPC = Row.Address; in appendRowToMatrix()
223 LineTable->appendRow(Row); in appendRowToMatrix()
224 if (Row.EndSequence) { in appendRowToMatrix()
226 Sequence.HighPC = Row.Address; in appendRowToMatrix()
[all …]
|
| /external/eigen/Eigen/src/OrderingMethods/ |
| D | Eigen_Colamd.h | 123 #define ROW_IS_DEAD(r) ROW_IS_MARKED_DEAD (Row[r].shared2.mark)
125 #define ROW_IS_ALIVE(r) (Row [r].shared2.mark >= ALIVE)
129 #define KILL_ROW(r) { Row [r].shared2.mark = DEAD ; }
218 static Index init_rows_cols (Index n_row, Index n_col, Colamd_Row<Index> Row [], colamd_col<Index> …
221 static void init_scoring (Index n_row, Index n_col, Colamd_Row<Index> Row [], colamd_col<Index> Col…
224 static Index find_ordering (Index n_row, Index n_col, Index Alen, Colamd_Row<Index> Row [], colamd_…
233 static Index garbage_collection (Index n_row, Index n_col, Colamd_Row<Index> Row [], colamd_col<Ind…
236 static inline Index clear_mark (Index n_row, Colamd_Row<Index> Row [] ) ;
338 Colamd_Row<Index> *Row ; /* pointer into A of Row [0..n_row] array */ in colamd() local
435 Row = (Colamd_Row<Index> *) &A [Alen + Col_size] ; in colamd()
[all …]
|
| /external/webrtc/webrtc/system_wrappers/source/ |
| D | data_log.cc | 32 class Row { class
34 Row();
35 ~Row();
94 typedef std::list<Row*> RowList;
100 Row* current_row_;
106 Row::Row() in Row() function in webrtc::Row
111 Row::~Row() { in ~Row()
120 int Row::InsertCell(const std::string& column_name, in InsertCell()
130 void Row::ToString(const std::string& column_name, in ToString()
146 current_row_(new Row), in LogTable()
[all …]
|
| /external/llvm/include/llvm/DebugInfo/DWARF/ |
| D | DWARFDebugLine.h | 93 struct Row { struct
94 explicit Row(bool default_is_stmt = false);
101 static bool orderByAddress(const Row& LHS, const Row& RHS) { in orderByAddress() argument
177 void appendRow(const DWARFDebugLine::Row &R) { in appendRow()
211 typedef std::vector<Row> RowVector;
239 struct Row Row; member
|
| /external/emma/core/java12/com/vladium/emma/report/html/doc/ |
| D | HTMLTable.java | 56 final Row row = new Row (true); in newTitleRow()
64 final Row row = new Row (false); in newRow()
105 private static class Row extends IElement.Factory.ElementImpl class in HTMLTable
116 Row (final boolean th) in Row() method in HTMLTable.Row
|
| /external/chromium-trace/catapult/dashboard/dashboard/ |
| D | graph_json.py | 259 query = graph_data.Row.query(
260 graph_data.Row.parent_test == test_key,
261 graph_data.Row.revision >= start_rev,
262 graph_data.Row.revision <= end_rev)
273 query_up_to_rev = graph_data.Row.query(
274 graph_data.Row.parent_test == test_key,
275 graph_data.Row.revision <= rev)
276 query_up_to_rev = query_up_to_rev.order(-graph_data.Row.revision)
281 query_after_rev = graph_data.Row.query(
282 graph_data.Row.parent_test == test_key,
[all …]
|
| D | datastore_hooks_test.py | 78 graph_data.Row(
81 graph_data.Row(
132 rows = graph_data.Row.query().fetch()
138 rows = graph_data.Row.query(ndb.OR(
139 graph_data.Row.revision < 20, graph_data.Row.revision > 70)).filter(
140 graph_data.Row.value == 20).fetch()
180 rows = graph_data.Row.query().filter(graph_data.Row.value == 20).fetch()
183 rows = graph_data.Row.query().filter(graph_data.Row.value == 20).fetch()
|
| D | dump_graph_json.py | 64 q = graph_data.Row.query()
65 q = q.filter(graph_data.Row.parent_test == test_key)
67 q = q.filter(graph_data.Row.revision <= int(end_rev))
68 q = q.order(-graph_data.Row.revision)
143 q = graph_data.Row.query()
144 q = q.filter(graph_data.Row.parent_test == test_key)
145 q = q.order(-graph_data.Row.revision)
|
| D | debug_alert.py | 253 q = graph_data.Row.query(projection=['revision', 'value'])
254 q = q.filter(graph_data.Row.parent_test == test.key)
255 q = q.order(-graph_data.Row.revision)
275 query = graph_data.Row.query(projection=['revision', 'value'])
276 query = query.filter(graph_data.Row.parent_test == test.key)
278 before_query = query.filter(graph_data.Row.revision < revision)
279 before_query = before_query.order(-graph_data.Row.revision)
283 after_query = query.filter(graph_data.Row.revision >= revision)
284 after_query = after_query.order(graph_data.Row.revision)
|
| D | find_anomalies.py | 100 query = graph_data.Row.query(projection=['revision', 'value'])
101 query = query.filter(graph_data.Row.parent_test == test.key)
105 query = query.filter(graph_data.Row.revision > test.last_alerted_revision)
106 query = query.order(-graph_data.Row.revision)
114 query = graph_data.Row.query(graph_data.Row.parent_test == test_key)
115 query = query.order(-graph_data.Row.revision)
|
| D | graph_csv.py | 48 q = graph_data.Row.query()
49 q = q.filter(graph_data.Row.parent_test == test_key)
51 q = q.filter(graph_data.Row.revision <= int(rev))
52 q = q.order(-graph_data.Row.revision)
|
| D | mr_test.py | 73 graph_data.Row(
76 graph_data.Row(
96 last_b = graph_data.Row.query(
97 graph_data.Row.parent_test == trace_b.key,
98 graph_data.Row.revision == 4).get()
121 row_key = graph_data.Row(
|
| /external/webrtc/webrtc/modules/desktop_capture/ |
| D | desktop_region.h | 49 struct Row { struct
50 Row(int32_t top, int32_t bottom);
51 ~Row();
62 typedef std::map<int, Row*> Rows; argument
141 static void AddSpanToRow(Row* row, int32_t left, int32_t right);
144 static bool IsSpanInRow(const Row& row, const RowSpan& rect);
|
| D | desktop_region.cc | 23 DesktopRegion::Row::Row(int32_t top, int32_t bottom) in Row() function in webrtc::DesktopRegion::Row
27 DesktopRegion::Row::~Row() {} in ~Row()
52 Row* row = it->second; in operator =()
53 it->second = new Row(*row); in operator =()
107 row, Rows::value_type(bottom, new Row(top, bottom))); in AddRect()
114 row, Rows::value_type(top, new Row(row->second->top, top))); in AddRect()
124 row, Rows::value_type(rect.bottom(), new Row(top, rect.bottom()))); in AddRect()
206 rows_.end(), Rows::value_type(bottom, new Row(top, bottom))); in Intersect()
307 row_a, Rows::value_type(top, new Row(row_a->second->top, top))); in Subtract()
328 rows_.insert(row_a, Rows::value_type(bottom, new Row(top, bottom))); in Subtract()
[all …]
|
| /external/webrtc/webrtc/common_audio/ |
| D | lapped_transform.cc | 32 memcpy(parent_->real_buf_.Row(i), input[i], in ProcessBlock()
34 parent_->fft_->Forward(parent_->real_buf_.Row(i), in ProcessBlock()
35 parent_->cplx_pre_.Row(i)); in ProcessBlock()
48 parent_->fft_->Inverse(parent_->cplx_post_.Row(i), in ProcessBlock()
49 parent_->real_buf_.Row(i)); in ProcessBlock()
50 memcpy(output[i], parent_->real_buf_.Row(i), in ProcessBlock()
|
| /external/libavc/encoder/arm/ |
| D | ime_distortion_metrics_a9q.s | 373 @Row 1
374 vld1.8 {d0, d1}, [r2], r4 @ load src Row 1
375 vld1.8 {d2, d3}, [r0], r3 @ load ref1 Row 1
376 vld1.8 {d4, d5}, [r1], r3 @ load ref2 Row 1
378 @Row 2
379 vld1.8 {d6, d7}, [r2], r4 @ load src Row 2
382 vld1.8 {d8, d9}, [r0], r3 @ load ref1 Row 2
385 vld1.8 {d10, d11}, [r1], r3 @ load ref2 Row 2
390 @Row 1
391 vld1.8 {d0, d1}, [r2], r4 @ load src Row 1
[all …]
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/extensions/compactnotation/ |
| D | CompactConstructorErrorsTest.java | 97 List<Row> rows = table.getRows(); in test4()
99 assertFalse("Row should not be created.", rows.get(0) instanceof Row); in test4()
111 List<Row> rows = table.getRows(); in test5()
113 assertFalse("Row should not be created.", rows.get(0) instanceof Row); in test5()
117 assertNull(map.get(new Row("id222"))); in test5()
118 assertTrue(map.containsKey(new Row("id222"))); in test5()
|
| D | Table.java | 23 private List<Row> rows;
31 public List<Row> getRows() { in getRows()
35 public void setRows(List<Row> rows) { in setRows()
|
| D | ManyListsTable.java | 22 private List<Row> rows;
29 public List<Row> getRows() { in getRows()
33 public void setRows(List<Row> rows) { in setRows()
|
| /external/webrtc/webrtc/system_wrappers/include/ |
| D | aligned_array.h | 50 T* Row(size_t row) { in Row() function
55 const T* Row(size_t row) const { in Row() function
62 return Row(row)[col]; in At()
67 return Row(row)[col]; in At()
|
| /external/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/util/ |
| D | XEquivalenceMap.java | 16 import com.ibm.icu.impl.Row;
17 import com.ibm.icu.impl.Row.R2;
26 Map<K,Row.R2<V,Set<R>>> source_target_reasons = new HashMap<K,Row.R2<V,Set<R>>>();
57 target_reasons = Row.of(target, reasons); in add()
|