123 struct Transition {  struct
126     Transition(int64_t _time, int32_t _type) {  in Transition()  argument
164     vector<Transition> transitions;
379                     info.transitions.push_back(Transition(transitionTimes[i], transitionTypes[i]));  in readzoneinfo()
386                 vector<Transition>::iterator itr = info.transitions.begin();  in readzoneinfo()
387                 info.transitions.insert(itr, Transition(LOWEST_TIME32, transitionTypes[minidx]));  in readzoneinfo()
395             info.transitions.push_back(Transition(transitionTimes[i], transitionTypes[i]));  in readzoneinfo()
444         vector<Transition>::iterator itr = info.transitions.begin();  in readzoneinfo()
445         info.transitions.insert(itr, Transition(LOWEST_TIME32, initialTypeIdx));  in readzoneinfo()
1032     vector<Transition>::const_iterator trn;  in print()
1197 bool isAfter(const Transition t, int64_t thresh) {  in isAfter()
1259         for (vector<Transition>::const_iterator i=transitions.begin();  in optimizeTypeList()
1274         for (vector<Transition>::iterator i=transitions.begin();  in optimizeTypeList()
1306 …        for (vector<Transition>::const_iterator i=transitions.begin(); i!=transitions.end(); ++i) {  in optimizeTypeList()
1322             for (vector<Transition>::iterator i=transitions.begin();  in optimizeTypeList()
1343             for (vector<Transition>::iterator i=transitions.begin(); i!=transitions.end();) {  in optimizeTypeList()
1375     vector<Transition>::iterator it =  in mergeFinalData()