Lines Matching refs:change_ty
51 typedef DAGDeltaAlgorithm::change_ty change_ty;
57 typedef std::vector<change_ty>::iterator pred_iterator_ty;
58 typedef std::vector<change_ty>::iterator succ_iterator_ty;
59 typedef std::set<change_ty>::iterator pred_closure_iterator_ty;
60 typedef std::set<change_ty>::iterator succ_closure_iterator_ty;
67 std::vector<change_ty> Roots;
76 std::map<change_ty, std::vector<change_ty> > Predecessors;
77 std::map<change_ty, std::vector<change_ty> > Successors;
79 std::map<change_ty, std::set<change_ty> > PredClosure;
80 std::map<change_ty, std::set<change_ty> > SuccClosure;
83 pred_iterator_ty pred_begin(change_ty Node) {
87 pred_iterator_ty pred_end(change_ty Node) {
92 pred_closure_iterator_ty pred_closure_begin(change_ty Node) {
96 pred_closure_iterator_ty pred_closure_end(change_ty Node) {
101 succ_iterator_ty succ_begin(change_ty Node) {
105 succ_iterator_ty succ_end(change_ty Node) {
110 succ_closure_iterator_ty succ_closure_begin(change_ty Node) {
114 succ_closure_iterator_ty succ_closure_end(change_ty Node) {
192 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>()));
193 Successors.insert(std::make_pair(*it, std::vector<change_ty>()));
208 std::vector<change_ty> Worklist(Roots.begin(), Roots.end());
210 change_ty Change = Worklist.back();
213 std::set<change_ty> &ChangeSuccs = SuccClosure[Change];
225 PredClosure.insert(std::make_pair(*it, std::set<change_ty>()));
254 for (std::vector<change_ty>::const_iterator it = Roots.begin(),
