* Graph edge representation. Most use cases just need the * destination vertex, so we support conversion to/from an int. We * also store boolean to indicate whether an edge is "strong". */
| 16 | * also store boolean to indicate whether an edge is "strong". |
| 17 | */ |
| 18 | class cmGraphEdge |
| 19 | { |
| 20 | public: |
| 21 | cmGraphEdge(size_t n, bool s, bool c, cmListFileBacktrace bt) |
| 22 | : Dest(n) |
| 23 | , Strong(s) |
| 24 | , Cross(c) |
| 25 | , Backtrace(std::move(bt)) |
| 26 | { |
| 27 | } |
| 28 | operator size_t() const { return this->Dest; } |
| 29 | |
| 30 | bool IsStrong() const { return this->Strong; } |
| 31 | |
| 32 | bool IsCross() const { return this->Cross; } |
| 33 | |
| 34 | cmListFileBacktrace const& GetBacktrace() const { return this->Backtrace; } |
| 35 | |
| 36 | private: |
| 37 | size_t Dest; |
| 38 | bool Strong; |
| 39 | bool Cross; |
| 40 | cmListFileBacktrace Backtrace; |
| 41 | }; |
| 42 | struct cmGraphEdgeList : public std::vector<cmGraphEdge> |
| 43 | { |
| 44 | }; |
no outgoing calls
no test coverage detected
searching dependent graphs…