![]() |
graph
5.0.5
Graph: generic attributed relational graphs
|
This is the complete list of members for Tree, including all inherited members.
| accept(TreeVisitor &visitor) | Tree | virtual |
| BaseTree(bool allowsChildren=true) | BaseTree | inline |
| begin() const | BaseTree | inline |
| check(const carto::SyntaxSet &syntax, std::set< std::string > &missing) const | Tree | virtual |
| children() const | BaseTree | |
| childrenSize() const | Tree | virtual |
| clear() | BaseTree | |
| const_accept(ConstTreeVisitor &visitor) const | Tree | virtual |
| const_iterator typedef | BaseTree | |
| const_reverse_iterator typedef | BaseTree | |
| ContentType typedef | carto::SyntaxedObject< T > | |
| end() const | BaseTree | inline |
| getAllowsChildren() const | BaseTree | inline |
| getChildAt(unsigned childIndex) const | BaseTree | inline |
| getElementsWith(const std::string &, bool recurse=true) const | Tree | |
| getElementsWith(const std::string &, const T &, bool recurse=true) const | Tree | inline |
| getIndex(BaseTree *node) const | BaseTree | |
| getParent() const | BaseTree | inline |
| getTopParent() | BaseTree | |
| getTopParent() const | BaseTree | |
| insert(BaseTree *child, int index=-1) | BaseTree | |
| isLeaf() const | BaseTree | inline |
| iterator typedef | BaseTree | |
| rbegin() const | BaseTree | inline |
| remove(unsigned index) | BaseTree | |
| remove(BaseTree *node) | BaseTree | |
| removeFromParent() | BaseTree | inline |
| rend() const | BaseTree | inline |
| reverse_iterator typedef | BaseTree | |
| setParent(BaseTree *newParent) | BaseTree | inline |
| size() const __attribute__((__deprecated__)) | Tree | virtual |
| SyntaxedObject(const std::string &s) | carto::SyntaxedObject< T > | |
| SyntaxedObject(const SyntaxedObject &x) | carto::SyntaxedObject< T > | |
| SyntaxedObject(const SyntaxedObject< PropertySet > &x) | carto::SyntaxedObject< T > | |
| Tree(bool allowChildren=true, const std::string &str="") | Tree | inline |
| ~BaseTree() | BaseTree | virtual |
| ~Tree() | Tree | virtual |