2 Author: Marco Costalba (C) 2005-2007
4 Copyright: See COPYING file that comes with this distribution
13 #define QString CString
14 #define QVector vector
17 typedef vector<CString> QStringList ;
45 BOUNDARY_C, // corresponds to MERGE_FORK
46 BOUNDARY_R, // corresponds to MERGE_FORK_R
47 BOUNDARY_L, // corresponds to MERGE_FORK_L
54 static inline bool isHead(int x) { return (x == HEAD || x == HEAD_R || x == HEAD_L); }
55 static inline bool isTail(int x) { return (x == TAIL || x == TAIL_R || x == TAIL_L); }
56 static inline bool isJoin(int x) { return (x == JOIN || x == JOIN_R || x == JOIN_L); }
57 static inline bool isFreeLane(int x) { return (x == NOT_ACTIVE || x == CROSS || isJoin(x)); }
58 static inline bool isBoundary(int x) { return (x == BOUNDARY || x == BOUNDARY_C ||
59 x == BOUNDARY_R || x == BOUNDARY_L); }
60 static inline bool isMerge(int x) { return (x == MERGE_FORK || x == MERGE_FORK_R ||
61 x == MERGE_FORK_L || isBoundary(x)); }
62 static inline bool isActive(int x) { return (x == ACTIVE || x == INITIAL || x == BRANCH ||
65 Lanes() {} // init() will setup us later, when data is available
66 bool isEmpty() { return typeVec.empty(); }
67 void init(const QString& expectedSha);
69 bool isFork(const QString& sha, bool& isDiscontinuity);
70 void setBoundary(bool isBoundary);
71 void setFork(const QString& sha);
72 void setMerge(const QStringList& parents);
75 void changeActiveLane(const QString& sha);
81 void nextParent(const QString& sha);
82 void getLanes(QVector<int> &ln) { ln = typeVec; } // O(1) vector is implicitly shared
85 int findNextSha(const QString& next, int pos);
86 int findType(int type, int pos);
87 int add(int type, const QString& next, int pos);
91 QVector<QString> nextShaVec;
93 int NODE, NODE_L, NODE_R;