Eberhard Graether
dedbc2eb27
Fixed an endless recursion that happenes when the index contains cyclic inheritance relationships, which might accidentally appear due to name collisions.
98 lines
2.5 KiB
C++
98 lines
2.5 KiB
C++
#ifndef HIERARCHY_CACHE_H
|
|
#define HIERARCHY_CACHE_H
|
|
|
|
#include <map>
|
|
#include <memory>
|
|
#include <set>
|
|
#include <vector>
|
|
|
|
#include "types.h"
|
|
|
|
class HierarchyCache
|
|
{
|
|
public:
|
|
void clear();
|
|
|
|
void createConnection(
|
|
Id edgeId, Id fromId, Id toId, bool sourceVisible, bool sourceImplicit, bool targetImplicit);
|
|
void createInheritance(Id edgeId, Id fromId, Id toId);
|
|
|
|
Id getLastVisibleParentNodeId(Id nodeId) const;
|
|
size_t getIndexOfLastVisibleParentNode(Id nodeId) const;
|
|
|
|
void addAllVisibleParentIdsForNodeId(Id nodeId, std::set<Id>* nodeIds, std::set<Id>* edgeIds) const;
|
|
|
|
void addAllChildIdsForNodeId(Id nodeId, std::set<Id>* nodeIds, std::set<Id>* edgeIds) const;
|
|
void addFirstChildIdsForNodeId(Id nodeId, std::vector<Id>* nodeIds, std::vector<Id>* edgeIds) const;
|
|
|
|
size_t getFirstChildIdsCountForNodeId(Id nodeId) const;
|
|
|
|
bool isChildOfVisibleNodeOrInvisible(Id nodeId) const;
|
|
|
|
bool nodeHasChildren(Id nodeId) const;
|
|
bool nodeIsVisible(Id nodeId) const;
|
|
bool nodeIsImplicit(Id nodeId) const;
|
|
|
|
std::vector<std::tuple<Id, Id, std::vector<Id>>> getInheritanceEdgesForNodeId(
|
|
Id nodeId, const std::set<Id>& nodeIds) const;
|
|
|
|
private:
|
|
class HierarchyNode
|
|
{
|
|
public:
|
|
HierarchyNode(Id nodeId);
|
|
|
|
Id getNodeId() const;
|
|
|
|
Id getEdgeId() const;
|
|
void setEdgeId(Id edgeId);
|
|
|
|
HierarchyNode* getParent() const;
|
|
void setParent(HierarchyNode* parent);
|
|
|
|
void addBase(HierarchyNode* base, Id edgeId);
|
|
|
|
void addChild(HierarchyNode* child);
|
|
|
|
size_t getChildrenCount() const;
|
|
size_t getNonImplicitChildrenCount() const;
|
|
|
|
void addChildIds(std::vector<Id>* nodeIds, std::vector<Id>* edgeIds) const;
|
|
void addNonImplicitChildIds(std::vector<Id>* nodeIds, std::vector<Id>* edgeIds) const;
|
|
void addChildIdsRecursive(std::set<Id>* nodeIds, std::set<Id>* edgeIds) const;
|
|
|
|
bool isVisible() const;
|
|
void setIsVisible(bool isVisible);
|
|
|
|
bool isImplicit() const;
|
|
void setIsImplicit(bool isImplicit);
|
|
|
|
void addInheritanceEdgesRecursive(
|
|
Id startId,
|
|
const std::set<Id>& inheritanceEdgeIds,
|
|
const std::set<Id>& nodeIds,
|
|
std::vector<std::tuple<Id, Id, std::vector<Id>>>* inheritanceEdges);
|
|
|
|
private:
|
|
const Id m_nodeId;
|
|
Id m_edgeId;
|
|
|
|
HierarchyNode* m_parent;
|
|
|
|
std::vector<HierarchyNode*> m_bases;
|
|
std::vector<Id> m_baseEdgeIds;
|
|
|
|
std::vector<HierarchyNode*> m_children;
|
|
|
|
bool m_isVisible;
|
|
bool m_isImplicit;
|
|
};
|
|
|
|
HierarchyNode* getNode(Id nodeId) const;
|
|
HierarchyNode* createNode(Id nodeId);
|
|
|
|
std::map<Id, std::unique_ptr<HierarchyNode>> m_nodes;
|
|
};
|
|
|
|
#endif // HIERARCHY_CACHE_H
|