1 |
tim |
1118 |
#include <cstring> |
2 |
|
|
#include "CompositeVisitor.hpp" |
3 |
tim |
1120 |
#include "RigidBody.hpp" |
4 |
|
|
#include "DirectionalAtom.hpp" |
5 |
tim |
1118 |
CompositeVisitor::~CompositeVisitor(){ |
6 |
|
|
VisitorIterator i; |
7 |
|
|
BaseVisitor* curVisitor; |
8 |
|
|
|
9 |
|
|
for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i)) |
10 |
|
|
delete curVisitor; |
11 |
|
|
|
12 |
|
|
visitorList.clear(); |
13 |
|
|
|
14 |
|
|
} |
15 |
|
|
void CompositeVisitor::addVisitor(BaseVisitor* newVisitor, int priority){ |
16 |
|
|
VisitorIterator i; |
17 |
|
|
int curPriority; |
18 |
|
|
|
19 |
|
|
for(i = visitorList.begin(); i != visitorList.end(); i++){ |
20 |
|
|
curPriority = (*i).second; |
21 |
|
|
//if new visitor has higher priority, just insert it before current visitor |
22 |
|
|
if(priority > curPriority){ |
23 |
|
|
visitorList.insert(i, make_pair(newVisitor, priority)); |
24 |
|
|
} |
25 |
|
|
} |
26 |
|
|
|
27 |
|
|
//if new visitor has lowest priority, insert it at the end of the list |
28 |
|
|
visitorList.insert(visitorList.end(), make_pair(newVisitor, priority)); |
29 |
|
|
} |
30 |
|
|
|
31 |
|
|
BaseVisitor* CompositeVisitor::beginVisitor(VisitorIterator& i){ |
32 |
|
|
i = visitorList.begin(); |
33 |
|
|
return i != visitorList.end() ? (*i).first : NULL; |
34 |
|
|
} |
35 |
|
|
|
36 |
|
|
BaseVisitor* CompositeVisitor::nextVisitor(VisitorIterator& i){ |
37 |
|
|
++i; |
38 |
|
|
return i != visitorList.end() ? (*i).first : NULL; |
39 |
|
|
|
40 |
|
|
} |
41 |
|
|
|
42 |
tim |
1120 |
void CompositeVisitor::internalVisit(Atom* atom){ |
43 |
tim |
1118 |
VisitorIterator i; |
44 |
|
|
BaseVisitor* curVisitor; |
45 |
|
|
|
46 |
|
|
for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i)) |
47 |
tim |
1120 |
atom->accept(curVisitor); |
48 |
tim |
1118 |
} |
49 |
|
|
|
50 |
tim |
1120 |
void CompositeVisitor::internalVisit(RigidBody* rb){ |
51 |
|
|
VisitorIterator i; |
52 |
|
|
BaseVisitor* curVisitor; |
53 |
|
|
vector<Atom*> myAtoms; |
54 |
|
|
vector<Atom*>::iterator atomIter; |
55 |
|
|
|
56 |
|
|
myAtoms = rb->getAtoms(); |
57 |
|
|
|
58 |
|
|
for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i)){ |
59 |
|
|
rb->accept(curVisitor); |
60 |
|
|
|
61 |
|
|
for(atomIter = myAtoms.begin(); atomIter != myAtoms.end(); ++atomIter) |
62 |
|
|
(*atomIter)->accept(curVisitor); |
63 |
|
|
} |
64 |
|
|
|
65 |
|
|
|
66 |
|
|
|
67 |
|
|
} |
68 |
|
|
|
69 |
tim |
1118 |
const string CompositeVisitor::toString(){ |
70 |
|
|
VisitorIterator i; |
71 |
tim |
1119 |
string result; |
72 |
tim |
1118 |
char buffer[65535]; |
73 |
|
|
|
74 |
|
|
for(i = visitorList.begin(); i != visitorList.end(); i++){ |
75 |
|
|
sprintf(buffer, "Priority = %d\n", (*i).second); |
76 |
tim |
1119 |
result += buffer; |
77 |
|
|
|
78 |
|
|
result += ((*i).first)->toString(); |
79 |
tim |
1118 |
} |
80 |
|
|
|
81 |
tim |
1119 |
return result; |
82 |
tim |
1118 |
} |
83 |
|
|
|
84 |
|
|
void CompositeVisitor::update(){ |
85 |
|
|
VisitorIterator i; |
86 |
|
|
BaseVisitor* curVisitor; |
87 |
|
|
|
88 |
|
|
for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i)) |
89 |
|
|
curVisitor->update(); |
90 |
|
|
} |