| /frameworks/base/core/tests/benchmarks/src/com/android/internal/util/ |
| D | IndentingPrintWriterBenchmark.java | 33 private Node mSimple;
34 private Node mComplex;
42 final Node manyChildren = Node.build("ManyChildren", Node.build("1"), Node.build("2"), in setUp()
43 Node.build("3"), Node.build("4"), Node.build("5"), Node.build("6"), Node.build("7"), in setUp()
44 Node.build("8"), Node.build("9"), Node.build("10")); in setUp()
46 mSimple = Node.build("RED"); in setUp()
47 mComplex = Node.build("PARENT", Node.build("RED"), Node.build("GREEN", in setUp()
48 Node.build("BLUE", manyChildren, manyChildren), manyChildren, manyChildren), in setUp()
99 private static class Node { class in IndentingPrintWriterBenchmark
101 public ArrayList<Node> children;
[all …]
|
| /frameworks/compile/mclinker/unittests/ |
| D | GCFactoryListTraitsTest.h | 37 class Node : public llvm::ilist_node<Node>
45 Node() : m_Init(0), m_Value(0) { } in Node() function
47 Node(unsigned pInit) : m_Init(pInit), m_Value(pInit) { } in Node() function
60 class NodeFactory : public mcld::GCFactory<Node, 0> {
62 NodeFactory() : mcld::GCFactory<Node, 0>(16) { } in NodeFactory()
64 Node *produce(unsigned pInit) { in produce()
65 Node *result = allocate(); in produce()
66 new (result) Node(pInit); in produce()
83 const llvm::iplist<Node, mcld::GCFactoryListTraits<Node> > &getNodeList() const in getNodeList()
86 llvm::iplist<Node, mcld::GCFactoryListTraits<Node> > &getNodeList() in getNodeList()
[all …]
|
| D | GraphTest.cpp | 44 ListDigraph::Node* u1 = graph.addNode(); in TEST_F()
45 ListDigraph::Node* u2 = graph.addNode(); in TEST_F()
46 ListDigraph::Node* u3 = graph.addNode(); in TEST_F()
63 ListDigraph::Node* head = NULL; in TEST_F()
92 ListDigraph::Node* u1 = graph.addNode(); in TEST_F()
93 ListDigraph::Node* u2 = graph.addNode(); in TEST_F()
94 ListDigraph::Node* u3 = graph.addNode(); in TEST_F()
111 ListDigraph::Node* head = NULL; in TEST_F()
140 ListDigraph::Node* u1 = graph.addNode(); in TEST_F()
141 ListDigraph::Node* u2 = graph.addNode(); in TEST_F()
[all …]
|
| D | GCFactoryListTraitsTest.cpp | 18 m_pNodesAlloc = new Node* [10]; in GCFactoryListTraitsTest()
66 llvm::iplist<Node>::const_iterator it = m_pNodeList.begin(); \
95 Node *NewNode = m_NodeFactory.produce(11); in TEST_F()
104 for (llvm::iplist<Node>::const_iterator I = m_pNodeList.begin(), in TEST_F()
|
| /frameworks/compile/mclinker/include/mcld/ADT/GraphLite/ |
| D | ListDigraph.h | 35 struct Node;
38 struct Node { struct
40 Node();
43 Node *prev, *next;
52 Node *target, *source; argument
60 Node* addNode();
62 Arc* addArc(Node& pU, Node& pV);
64 void erase(Node& pNode);
70 void getHead(Node*& pNode) const { pNode = m_pNodeHead; } in getHead()
73 typedef GCFactory<Node, 0> NodeList;
[all …]
|
| D | Digraph.h | 26 class Node
30 Node() {} in Node() function
32 bool operator==(const Node& pOther) const { return m_ID == pOther.m_ID; }
33 bool operator!=(const Node& pOther) const { return m_ID != pOther.m_ID; }
45 bool operator==(const Node& pOther) const;
46 bool operator!=(const Node& pOther) const;
48 Node source() const;
49 Node target() const;
62 Node addNode();
64 Arc addArc(const Node& pSource, const Node& pTarget);
[all …]
|
| /frameworks/base/core/java/android/animation/ |
| D | AnimatorSet.java | 71 private HashMap<Animator, Node> mNodeMap = new HashMap<Animator, Node>();
78 private ArrayList<Node> mNodes = new ArrayList<Node>();
85 private ArrayList<Node> mSortedNodes = new ArrayList<Node>();
218 for (Node node : mNodes) { in getChildAnimations()
233 for (Node node : mNodes) { in setTarget()
334 for (Node node : mSortedNodes) { in cancel()
360 for (Node node : mSortedNodes) { in end()
371 for (Node node : mSortedNodes) { in end()
393 for (Node node : mNodes) { in isRunning()
464 for (Node node : mNodes) { in setupStartValues()
[all …]
|
| /frameworks/compile/mclinker/lib/ADT/GraphLite/ |
| D | Digraph.cpp | 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()
32 return Node(); in source()
35 Digraph::Node Digraph::Arc::target() const in target()
37 return Node(); in target()
53 Digraph::Node Digraph::addNode() in addNode()
55 return Node(); in addNode()
60 Digraph::addArc(const Digraph::Node& pSource, const Digraph::Node& pTarget) in addArc()
66 void Digraph::erase(const Digraph::Node& pNode) in erase()
|
| D | ListDigraph.cpp | 16 ListDigraph::Node::Node() in Node() function in ListDigraph::Node
37 ListDigraph::Node* ListDigraph::addNode() in addNode()
40 Node* result = NULL; in addNode()
43 new (result) Node(); in addNode()
64 ListDigraph::Arc* ListDigraph::addArc(Node& pU, Node& pV) in addArc()
98 void ListDigraph::erase(ListDigraph::Node& pNode) in erase()
|
| /frameworks/base/rs/java/android/renderscript/ |
| D | ScriptGroup.java | 76 static class Node { class in ScriptGroup
83 Node mNext;
85 Node(Script s) { in Node() method in ScriptGroup.Node
170 private ArrayList<Node> mNodes = new ArrayList<Node>();
186 private void validateCycle(Node target, Node original) { in validateCycle()
190 Node tn = findNode(cl.mToK.mScript); in validateCycle()
197 Node tn = findNode(cl.mToF.mScript); in validateCycle()
213 private void validateDAGRecurse(Node n, int dagNumber) { in validateDAGRecurse()
224 Node tn = findNode(cl.mToK.mScript); in validateDAGRecurse()
228 Node tn = findNode(cl.mToF.mScript); in validateDAGRecurse()
[all …]
|
| /frameworks/support/v8/renderscript/java/src/android/support/v8/renderscript/ |
| D | ScriptGroup.java | 78 static class Node { class in ScriptGroup
85 Node mNext;
87 Node(Script s) { in Node() method in ScriptGroup.Node
172 private ArrayList<Node> mNodes = new ArrayList<Node>();
193 private void validateCycle(Node target, Node original) { in validateCycle()
197 Node tn = findNode(cl.mToK.mScript); in validateCycle()
204 Node tn = findNode(cl.mToF.mScript); in validateCycle()
220 private void validateDAGRecurse(Node n, int dagNumber) { in validateDAGRecurse()
231 Node tn = findNode(cl.mToK.mScript); in validateDAGRecurse()
235 Node tn = findNode(cl.mToF.mScript); in validateDAGRecurse()
[all …]
|
| /frameworks/opt/datetimepicker/src/com/android/datetimepicker/time/ |
| D | TimePickerDialog.java | 103 private Node mLegalTimesTree;
604 Node node = mLegalTimesTree;
822 mLegalTimesTree = new Node();
825 Node minuteFirstDigit = new Node(k0, k1, k2, k3, k4, k5);
826 Node minuteSecondDigit = new Node(k0, k1, k2, k3, k4, k5, k6, k7, k8, k9);
831 Node firstDigit = new Node(k0, k1);
835 Node secondDigit = new Node(k0, k1, k2, k3, k4, k5);
841 Node thirdDigit = new Node(k6, k7, k8, k9);
846 secondDigit = new Node(k6, k7, k8, k9);
852 firstDigit = new Node(k2);
[all …]
|
| /frameworks/base/core/java/android/widget/ |
| D | TimePickerClockDelegate.java | 101 private Node mLegalTimesTree;
885 Node node = mLegalTimesTree;
1103 mLegalTimesTree = new Node();
1106 Node minuteFirstDigit = new Node(k0, k1, k2, k3, k4, k5);
1107 Node minuteSecondDigit = new Node(k0, k1, k2, k3, k4, k5, k6, k7, k8, k9);
1112 Node firstDigit = new Node(k0, k1);
1116 Node secondDigit = new Node(k0, k1, k2, k3, k4, k5);
1122 Node thirdDigit = new Node(k6, k7, k8, k9);
1127 secondDigit = new Node(k6, k7, k8, k9);
1133 firstDigit = new Node(k2);
[all …]
|
| D | RelativeLayout.java | 1012 DependencyGraph.Node node = mGraph.mKeyNodes.get(id); in getRelatedView()
1620 private ArrayList<Node> mNodes = new ArrayList<Node>();
1626 private SparseArray<Node> mKeyNodes = new SparseArray<Node>();
1632 private ArrayDeque<Node> mRoots = new ArrayDeque<Node>();
1638 final ArrayList<Node> nodes = mNodes; in clear()
1657 final Node node = Node.acquire(view); in add()
1677 final ArrayDeque<Node> roots = findRoots(rules); in getSortedViews()
1680 Node node; in getSortedViews()
1687 final ArrayMap<Node, DependencyGraph> dependents = node.dependents; in getSortedViews()
1690 final Node dependent = dependents.keyAt(i); in getSortedViews()
[all …]
|
| /frameworks/rs/ |
| D | rsScriptGroup.cpp | 40 ScriptGroup::Node::Node(Script *s) { in Node() function in ScriptGroup::Node
46 ScriptGroup::Node * ScriptGroup::findNode(Script *s) const { in findNode()
49 Node *n = mNodes[ct]; in findNode()
59 bool ScriptGroup::calcOrderRecurse(Node *n, int depth) { in calcOrderRecurse()
67 Node *nt = NULL; in calcOrderRecurse()
82 static int CompareNodeForSort(ScriptGroup::Node *const* lhs, in CompareNodeForSort()
83 ScriptGroup::Node *const* rhs) { in CompareNodeForSort()
92 bool operator() (const ScriptGroup::Node* lhs, in operator ()()
93 const ScriptGroup::Node* rhs) { in operator ()()
107 Node *n = findNode(k->mScript); in calcOrder()
[all …]
|
| D | rsScriptGroup.h | 48 class Node {
50 Node(Script *);
69 Vector<Node *> mNodes;
103 bool calcOrderRecurse(Node *n, int depth);
105 Node * findNode(Script *s) const;
|
| /frameworks/compile/mclinker/include/mcld/ADT/ |
| D | TreeAllocator.h | 29 class NodeFactory : public GCFactory<Node<DataType>, 64>
32 typedef GCFactory<Node<DataType>, 64> Alloc;
35 typedef Node<DataType> NodeType;
|
| D | TreeBase.h | 104 class Node : public NodeBase
113 Node() in Node() function
117 Node(const value_type& pValue) in Node() function
|
| D | BinTree.h | 107 typedef Node<value_type> node_type;
195 typedef Node<value_type> node_type;
266 typedef Node<DataType> NodeType;
378 typedef Node<value_type> node_type;
|
| /frameworks/base/tools/layoutlib/bridge/tests/src/com/android/layoutlib/bridge/android/ |
| D | BridgeXmlBlockParserTest.java | 21 import org.w3c.dom.Node;
71 private void dump(Node node, String prefix) { in dump()
72 Node n; in dump()
|
| /frameworks/base/tests/RenderScriptTests/SceneGraph/src/com/android/scenegraph/ |
| D | ColladaParser.java | 35 import org.w3c.dom.Node;
243 Node childNode = node.getFirstChild(); in getNode()
245 if (childNode.getNodeType() == Node.ELEMENT_NODE) { in getNode()
309 Node paramNode = fx.getFirstChild(); in extractParams()
311 if (paramNode.getNodeType() == Node.ELEMENT_NODE) { in extractParams()
314 Node typeNode = paramNode.getFirstChild(); in extractParams()
315 while (typeNode != null && typeNode.getNodeType() != Node.ELEMENT_NODE) { in extractParams()
490 Node childNode = scene.getFirstChild(); in getScene()
492 if (childNode.getNodeType() == Node.ELEMENT_NODE) { in getScene()
|
| /frameworks/base/docs/html/sdk/api_diff/8/ |
| D | missingSinces.txt | 69 NO DOC BLOCK: org.w3c.dom.Document Method adoptNode(org.w3c.dom.Node)
78 NO DOC BLOCK: org.w3c.dom.Node Method compareDocumentPosition(org.w3c.dom.Node)
95 NO DOC BLOCK: org.w3c.dom.Node Method getBaseURI()
121 NO DOC BLOCK: org.w3c.dom.Node Method getFeature(java.lang.String, java.lang.String)
152 NO DOC BLOCK: org.w3c.dom.Node Method getTextContent()
155 NO DOC BLOCK: org.w3c.dom.Node Method getUserData(java.lang.String)
173 NO DOC BLOCK: org.w3c.dom.Node Method isDefaultNamespace(java.lang.String)
175 NO DOC BLOCK: org.w3c.dom.Node Method isEqualNode(org.w3c.dom.Node)
178 NO DOC BLOCK: org.w3c.dom.Node Method isSameNode(org.w3c.dom.Node)
185 NO DOC BLOCK: org.w3c.dom.Node Method lookupNamespaceURI(java.lang.String)
[all …]
|
| /frameworks/base/docs/html/training/wearables/data-layer/ |
| D | events.jd | 111 …leListenerService.html#onPeerDisconnected(com.google.android.gms.wearable.Node)"><code>onPeerDisco…
257 …NodeApi.NodeListener.html#onPeerConnected(com.google.android.gms.wearable.Node)"><code>onMessageRe…
258 …NodeApi.NodeListener.html#onPeerConnected(com.google.android.gms.wearable.Node)"><code>onPeerConne…
259 …eApi.NodeListener.html#onPeerDisconnected(com.google.android.gms.wearable.Node)"><code>onPeerDisco…
|
| D | messages.jd | 71 for (Node node : nodes.getNodes()) {
|
| /frameworks/compile/mclinker/include/mcld/ |
| D | InputTree.h | 89 typedef Node<value_type> node_type;
|