23 |
|
curPriority = (*i).second; |
24 |
|
//if new visitor has higher priority, just insert it before current visitor |
25 |
|
if(priority > curPriority){ |
26 |
< |
visitorList.insert(i, make_pair(newVisitor, priority)); |
26 |
> |
visitorList.insert(i, std::make_pair(newVisitor, priority)); |
27 |
|
} |
28 |
|
} |
29 |
|
|
30 |
|
//if new visitor has lowest priority, insert it at the end of the list |
31 |
< |
visitorList.insert(visitorList.end(), make_pair(newVisitor, priority)); |
31 |
> |
visitorList.insert(visitorList.end(), std::make_pair(newVisitor, priority)); |
32 |
|
} |
33 |
|
|
34 |
|
BaseVisitor* CompositeVisitor::beginVisitor(VisitorIterator& i){ |