Eberhard Graether
9d0b86ad98
* add inheritance edges between parents of active symbol and other visible symbols * add dashed inheritance edges when symbols are no direct decendants * inheritance edges are also respected in layouting, putting base/derived classes in the correct top/bottom spot now bug id = 167
137 lines
3.7 KiB
C++
137 lines
3.7 KiB
C++
#ifndef NODE_H
|
|
#define NODE_H
|
|
|
|
#include <algorithm>
|
|
#include <functional>
|
|
#include <map>
|
|
#include <string>
|
|
|
|
#include "data/graph/Edge.h"
|
|
#include "data/graph/Token.h"
|
|
#include "data/name/NameHierarchy.h"
|
|
|
|
class TokenComponentAbstraction;
|
|
class TokenComponentAccess;
|
|
class TokenComponentConst;
|
|
class TokenComponentStatic;
|
|
class TokenComponentFilePath;
|
|
class TokenComponentSignature;
|
|
|
|
class Node
|
|
: public Token
|
|
{
|
|
public:
|
|
typedef int NodeTypeMask;
|
|
enum NodeType : NodeTypeMask
|
|
{ // make sure that the value of 0x0 is not used here because it doesn't work for bitmasking.
|
|
NODE_NON_INDEXED = 0x1,
|
|
NODE_TYPE = 0x2,
|
|
NODE_BUILTIN_TYPE = 0x4,
|
|
|
|
NODE_NAMESPACE = 0x8,
|
|
NODE_PACKAGE = 0x10,
|
|
NODE_STRUCT = 0x20,
|
|
NODE_CLASS = 0x40,
|
|
NODE_INTERFACE = 0x80,
|
|
NODE_GLOBAL_VARIABLE = 0x100,
|
|
NODE_FIELD = 0x200,
|
|
NODE_FUNCTION = 0x400,
|
|
NODE_METHOD = 0x800,
|
|
|
|
NODE_ENUM = 0x1000,
|
|
NODE_ENUM_CONSTANT = 0x2000,
|
|
NODE_TYPEDEF = 0x4000,
|
|
NODE_TEMPLATE_PARAMETER_TYPE = 0x8000,
|
|
NODE_TYPE_PARAMETER = 0x10000,
|
|
|
|
NODE_FILE = 0x20000,
|
|
NODE_MACRO = 0x40000
|
|
};
|
|
|
|
static std::string getUnderscoredTypeString(NodeType type);
|
|
static std::string getReadableTypeString(NodeType type);
|
|
|
|
static int typeToInt(NodeType type);
|
|
static NodeType intToType(int value);
|
|
|
|
static const NodeTypeMask NODE_NOT_VISIBLE;
|
|
static const NodeTypeMask NODE_USEABLE_TYPE;
|
|
static const NodeTypeMask NODE_INHERITABLE_TYPE;
|
|
|
|
Node(Id id, NodeType type, NameHierarchy nameHierarchy, bool defined);
|
|
Node(const Node& other);
|
|
virtual ~Node();
|
|
|
|
NodeType getType() const;
|
|
void setType(NodeType type);
|
|
bool isType(NodeTypeMask mask) const;
|
|
|
|
std::string getName() const;
|
|
std::string getFullName() const;
|
|
NameHierarchy getNameHierarchy() const;
|
|
|
|
bool isDefined() const;
|
|
void setDefined(bool defined);
|
|
|
|
bool isImplicit() const;
|
|
void setImplicit(bool implicit);
|
|
|
|
bool isExplicit() const;
|
|
void setExplicit(bool bExplicit);
|
|
|
|
size_t getChildCount() const;
|
|
void setChildCount(size_t childCount);
|
|
|
|
size_t getEdgeCount() const;
|
|
|
|
void addEdge(Edge* edge);
|
|
void removeEdge(Edge* edge);
|
|
|
|
Node* getParentNode() const;
|
|
Node* getLastParentNode();
|
|
Edge* getMemberEdge() const;
|
|
|
|
Edge* findEdge(std::function<bool(Edge*)> func) const;
|
|
Edge* findEdgeOfType(Edge::EdgeTypeMask mask) const;
|
|
Edge* findEdgeOfType(Edge::EdgeTypeMask mask, std::function<bool(Edge*)> func) const;
|
|
Node* findChildNode(std::function<bool(Node*)> func) const;
|
|
|
|
void forEachEdge(std::function<void(Edge*)> func) const;
|
|
void forEachEdgeOfType(Edge::EdgeTypeMask mask, std::function<void(Edge*)> func) const;
|
|
void forEachChildNode(std::function<void(Node*)> func) const;
|
|
void forEachNodeRecursive(std::function<void(const Node*)> func) const;
|
|
|
|
// Token implementation.
|
|
virtual bool isNode() const;
|
|
virtual bool isEdge() const;
|
|
|
|
// Component setters.
|
|
void addComponentAbstraction(std::shared_ptr<TokenComponentAbstraction> component);
|
|
void addComponentConst(std::shared_ptr<TokenComponentConst> component);
|
|
void addComponentStatic(std::shared_ptr<TokenComponentStatic> component);
|
|
void addComponentFilePath(std::shared_ptr<TokenComponentFilePath> component);
|
|
void addComponentSignature(std::shared_ptr<TokenComponentSignature> component);
|
|
void addComponentAccess(std::shared_ptr<TokenComponentAccess> component);
|
|
|
|
// Logging.
|
|
virtual std::string getReadableTypeString() const;
|
|
std::string getAsString() const;
|
|
|
|
private:
|
|
void operator=(const Node&);
|
|
|
|
std::map<Id, Edge*> m_edges;
|
|
|
|
NodeType m_type;
|
|
NameHierarchy m_nameHierarchy;
|
|
bool m_defined;
|
|
bool m_implicit;
|
|
bool m_explicit;
|
|
|
|
size_t m_childCount;
|
|
};
|
|
|
|
std::ostream& operator<<(std::ostream& ostream, const Node& node);
|
|
|
|
#endif // NODE_H
|