forked from OSchip/llvm-project
parent
718a89a501
commit
02def54fa1
|
@ -1,62 +0,0 @@
|
|||
//===- llvm/ADT/Tree.h - Generic n-way tree structure -----------*- C++ -*-===//
|
||||
//
|
||||
// The LLVM Compiler Infrastructure
|
||||
//
|
||||
// This file is distributed under the University of Illinois Open Source
|
||||
// License. See LICENSE.TXT for details.
|
||||
//
|
||||
//===----------------------------------------------------------------------===//
|
||||
//
|
||||
// This class defines a generic N-way tree node structure. The tree structure
|
||||
// is immutable after creation, but the payload contained within it is not.
|
||||
//
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
#ifndef LLVM_ADT_TREE_H
|
||||
#define LLVM_ADT_TREE_H
|
||||
|
||||
#include <vector>
|
||||
|
||||
namespace llvm {
|
||||
|
||||
template<class ConcreteTreeNode, class Payload>
|
||||
class Tree {
|
||||
std::vector<ConcreteTreeNode*> Children; // This node's children, if any.
|
||||
ConcreteTreeNode *Parent; // Parent of this node.
|
||||
Payload Data; // Data held in this node.
|
||||
|
||||
protected:
|
||||
void setChildren(const std::vector<ConcreteTreeNode*> &children) {
|
||||
Children = children;
|
||||
}
|
||||
public:
|
||||
inline Tree(ConcreteTreeNode *parent) : Parent(parent) {}
|
||||
inline Tree(const std::vector<ConcreteTreeNode*> &children,
|
||||
ConcreteTreeNode *par) : Children(children), Parent(par) {}
|
||||
|
||||
inline Tree(const std::vector<ConcreteTreeNode*> &children,
|
||||
ConcreteTreeNode *par, const Payload &data)
|
||||
: Children(children), Parent(par), Data(data) {}
|
||||
|
||||
// Tree dtor - Free all children
|
||||
inline ~Tree() {
|
||||
for (unsigned i = Children.size(); i > 0; --i)
|
||||
delete Children[i-1];
|
||||
}
|
||||
|
||||
// Tree manipulation/walking routines...
|
||||
inline ConcreteTreeNode *getParent() const { return Parent; }
|
||||
inline unsigned getNumChildren() const { return Children.size(); }
|
||||
inline ConcreteTreeNode *getChild(unsigned i) const {
|
||||
assert(i < Children.size() && "Tree::getChild with index out of range!");
|
||||
return Children[i];
|
||||
}
|
||||
|
||||
// Payload access...
|
||||
inline Payload &getTreeData() { return Data; }
|
||||
inline const Payload &getTreeData() const { return Data; }
|
||||
};
|
||||
|
||||
} // End llvm namespace
|
||||
|
||||
#endif
|
Loading…
Reference in New Issue