Home
last modified time | relevance | path

Searched refs:NodeBase (Results 1 – 4 of 4) sorted by relevance

/frameworks/compile/mclinker/include/mcld/ADT/
DTreeBase.h20 class NodeBase {
22 NodeBase* left;
23 NodeBase* right;
26 NodeBase() : left(NULL), right(NULL) {} in NodeBase() function
38 NodeBase* m_pNode;
43 explicit TreeIteratorBase(NodeBase* X) : m_pNode(X) {} in TreeIteratorBase()
53 void hook(NodeBase* pNode) { in hook()
88 NodeBase* pOther) {
94 NodeBase* pOther) {
99 class Node : public NodeBase {
[all …]
DBinTree.h31 explicit DFSIterator(NodeBase* X) : TreeIteratorBase(X) { in DFSIterator()
54 std::stack<NodeBase*> m_Stack;
61 explicit BFSIterator(NodeBase* X) : TreeIteratorBase(X) { in BFSIterator()
84 std::queue<NodeBase*> m_Queue;
115 explicit PolicyIteratorBase(NodeBase* X) : IteratorType(X) {} in PolicyIteratorBase()
151 explicit PolicyIterator(NodeBase* X) : Base(X) {} in PolicyIterator()
240 explicit TreeIterator(NodeBase* X) : TreeIteratorBase(X) {} in TreeIterator()
272 NodeBase node;
/frameworks/compile/mclinker/include/mcld/
DInputTree.h41 explicit PolicyIterator(NodeBase* X) : Base(X) {} in PolicyIterator()
151 const_cast<NodeBase*>(&BinaryTreeBase<Input>::m_Root.node)); in root()
238 virtual void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const = 0;
247 void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const { in connect()
258 void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const { in connect()
/frameworks/compile/mclinker/lib/Core/
DInputTree.cpp36 NodeBase* node = createNode(); in enterGroup()