mirror of
https://github.com/loot/libloot.git
synced 2026-07-27 14:16:01 -07:00
Reorder PluginGraph methods
Also make the order of definitions match the order of declarations, and rename a few internal functions for clarity.
This commit is contained in:
+316
-314
File diff suppressed because it is too large
Load Diff
@@ -63,23 +63,14 @@ private:
|
||||
class PluginGraph {
|
||||
public:
|
||||
size_t CountVertices() const;
|
||||
void CheckForCycles() const;
|
||||
|
||||
void AddPluginVertices(const Game& game,
|
||||
const std::vector<std::string>& loadOrder);
|
||||
void AddSpecificEdges();
|
||||
void AddHardcodedPluginEdges(const Game& game);
|
||||
void AddGroupEdges(const std::unordered_map<std::string, Group>& groups);
|
||||
void AddOverlapEdges();
|
||||
void AddTieBreakEdges();
|
||||
|
||||
std::vector<std::string> TopologicalSort() const;
|
||||
|
||||
std::pair<vertex_it, vertex_it> GetVertices() const;
|
||||
std::optional<vertex_t> GetVertexByName(const std::string& name) const;
|
||||
|
||||
const PluginSortingData& GetPlugin(const vertex_t& vertex) const;
|
||||
|
||||
void CheckForCycles() const;
|
||||
std::vector<std::string> TopologicalSort() const;
|
||||
|
||||
bool EdgeExists(const vertex_t& fromVertex, const vertex_t& toVertex);
|
||||
bool PathExists(const vertex_t& fromVertex, const vertex_t& toVertex);
|
||||
|
||||
@@ -88,6 +79,14 @@ public:
|
||||
EdgeType edgeType);
|
||||
void AddVertex(const PluginSortingData& plugin);
|
||||
|
||||
void AddPluginVertices(const Game& game,
|
||||
const std::vector<std::string>& loadOrder);
|
||||
void AddSpecificEdges();
|
||||
void AddHardcodedPluginEdges(const Game& game);
|
||||
void AddGroupEdges(const std::unordered_map<std::string, Group>& groups);
|
||||
void AddOverlapEdges();
|
||||
void AddTieBreakEdges();
|
||||
|
||||
private:
|
||||
RawPluginGraph graph_;
|
||||
PathsCache pathsCache_;
|
||||
|
||||
Reference in New Issue
Block a user