Lines Matching defs:change_ty
53 typedef DAGDeltaAlgorithm::change_ty change_ty;
59 typedef std::vector<change_ty>::iterator pred_iterator_ty;
60 typedef std::vector<change_ty>::iterator succ_iterator_ty;
61 typedef std::set<change_ty>::iterator pred_closure_iterator_ty;
62 typedef std::set<change_ty>::iterator succ_closure_iterator_ty;
66 std::vector<change_ty> Roots;
75 std::map<change_ty, std::vector<change_ty> > Predecessors;
76 std::map<change_ty, std::vector<change_ty> > Successors;
78 std::map<change_ty, std::set<change_ty> > PredClosure;
79 std::map<change_ty, std::set<change_ty> > SuccClosure;
82 pred_iterator_ty pred_begin(change_ty Node) {
86 pred_iterator_ty pred_end(change_ty Node) {
91 pred_closure_iterator_ty pred_closure_begin(change_ty Node) {
95 pred_closure_iterator_ty pred_closure_end(change_ty Node) {
100 succ_iterator_ty succ_begin(change_ty Node) {
104 succ_iterator_ty succ_end(change_ty Node) {
109 succ_closure_iterator_ty succ_closure_begin(change_ty Node) {
113 succ_closure_iterator_ty succ_closure_end(change_ty Node) {
186 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>()));
187 Successors.insert(std::make_pair(*it, std::vector<change_ty>()));
202 std::vector<change_ty> Worklist(Roots.begin(), Roots.end());
204 change_ty Change = Worklist.back();
207 std::set<change_ty> &ChangeSuccs = SuccClosure[Change];
219 PredClosure.insert(std::make_pair(*it, std::set<change_ty>()));
248 for (std::vector<change_ty>::const_iterator it = Roots.begin(),
