| /frameworks/compile/mclinker/lib/ADT/GraphLite/ |
| D | Digraph.cpp | 16 Digraph::Arc::Arc() in Arc() function in Digraph::Arc
20 bool Digraph::Arc::operator==(const Digraph::Node& pOther) const in operator ==()
25 bool Digraph::Arc::operator!=(const Digraph::Node& pOther) const in operator !=()
30 Digraph::Node Digraph::Arc::source() const in source()
35 Digraph::Node Digraph::Arc::target() const in target()
40 Digraph::Arc::Arc(Digraph& pParent) in Arc() function in Digraph::Arc
59 Digraph::Arc
62 return Arc(); in addArc()
71 void Digraph::erase(const Digraph::Arc& pArc) in erase()
|
| D | ListDigraph.cpp | 23 ListDigraph::Arc::Arc() in Arc() function in ListDigraph::Arc
64 ListDigraph::Arc* ListDigraph::addArc(Node& pU, Node& pV) in addArc()
67 Arc* result = NULL; in addArc()
70 new (result) Arc(); in addArc()
113 Arc* fan_in = pNode.first_in; in erase()
115 Arc* next_in = fan_in->next_in; in erase()
121 Arc* fan_out = pNode.first_out; in erase()
123 Arc* next_out = fan_out->next_out; in erase()
137 void ListDigraph::erase(ListDigraph::Arc& pArc) in erase()
|
| /frameworks/compile/mclinker/include/mcld/ADT/GraphLite/ |
| D | ListDigraph.h | 36 struct Arc;
44 Arc *first_in, *first_out;
47 struct Arc { struct
49 Arc();
53 Arc *prev_in, *next_in; argument
54 Arc *prev_out, *next_out; argument
62 Arc* addArc(Node& pU, Node& pV);
66 void erase(Arc& pArc);
74 typedef GCFactory<Arc, 0> ArcList;
79 Arc* m_pFreeArcHead;
|
| D | Digraph.h | 39 class Arc
43 Arc();
52 Arc(Digraph& pParent);
64 Arc addArc(const Node& pSource, const Node& pTarget);
68 void erase(const Arc& pArc);
|
| /frameworks/compile/mclinker/unittests/ |
| D | GraphTest.cpp | 193 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2); in TEST_F()
194 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3); in TEST_F()
195 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1); in TEST_F()
214 ListDigraph::Arc* a1 = graph.addArc(*u1, *u1); in TEST_F()
215 ListDigraph::Arc* a2 = graph.addArc(*u1, *u2); in TEST_F()
216 ListDigraph::Arc* a3 = graph.addArc(*u1, *u3); in TEST_F()
235 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2); in TEST_F()
236 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3); in TEST_F()
237 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1); in TEST_F()
263 ListDigraph::Arc* a1 = graph.addArc(*u1, *u2); in TEST_F()
[all …]
|
| /frameworks/support/v7/gridlayout/src/android/support/v7/widget/ |
| D | GridLayout.java | 1115 public Arc[] arcs;
1269 private void include(List<Arc> arcs, Interval key, MutableInt size, in include()
1283 for (Arc arc : arcs) { in include()
1290 arcs.add(new Arc(key, size)); in include()
1293 private void include(List<Arc> arcs, Interval key, MutableInt size) { in include()
1299 Arc[][] groupArcsByFirstVertex(Arc[] arcs) { in groupArcsByFirstVertex()
1301 Arc[][] result = new Arc[N][]; in groupArcsByFirstVertex()
1303 for (Arc arc : arcs) { in groupArcsByFirstVertex()
1307 result[i] = new Arc[sizes[i]]; in groupArcsByFirstVertex()
1311 for (Arc arc : arcs) { in groupArcsByFirstVertex()
[all …]
|
| /frameworks/base/core/java/android/widget/ |
| D | GridLayout.java | 1238 public Arc[] arcs;
1392 private void include(List<Arc> arcs, Interval key, MutableInt size, in include()
1406 for (Arc arc : arcs) { in include()
1413 arcs.add(new Arc(key, size)); in include()
1416 private void include(List<Arc> arcs, Interval key, MutableInt size) { in include()
1422 Arc[][] groupArcsByFirstVertex(Arc[] arcs) { in groupArcsByFirstVertex()
1424 Arc[][] result = new Arc[N][]; in groupArcsByFirstVertex()
1426 for (Arc arc : arcs) { in groupArcsByFirstVertex()
1430 result[i] = new Arc[sizes[i]]; in groupArcsByFirstVertex()
1434 for (Arc arc : arcs) { in groupArcsByFirstVertex()
[all …]
|
| /frameworks/base/libs/hwui/ |
| D | PathCache.h | 140 struct Arc { struct
|
| /frameworks/base/docs/html/guide/practices/ui_guidelines/ |
| D | menu_design.jd | 434 For example, if a user selects a contact "Joan of Arc", put that name in the
|