OOPSE/libmdtools/CompositeVisitor.cpp

#include <cstring>
#include "CompositeVisitor.hpp"
CompositeVisitor::~CompositeVisitor(){
  VisitorIterator i;
  BaseVisitor* curVisitor;
  
  for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i))
    delete curVisitor;   

  visitorList.clear();
  
}
void CompositeVisitor::addVisitor(BaseVisitor* newVisitor, int priority){
  VisitorIterator i;
  int curPriority;
  
  for(i = visitorList.begin(); i != visitorList.end(); i++){
    curPriority = (*i).second;
    //if new visitor has higher priority, just insert it before current visitor
    if(priority > curPriority){      
      visitorList.insert(i, make_pair(newVisitor, priority));
    }
  }

  //if new visitor has lowest priority, insert it at the end of the list
  visitorList.insert(visitorList.end(), make_pair(newVisitor, priority));
}

BaseVisitor* CompositeVisitor::beginVisitor(VisitorIterator& i){
  i = visitorList.begin();
  return i != visitorList.end() ? (*i).first : NULL;
}

BaseVisitor* CompositeVisitor::nextVisitor(VisitorIterator& i){
  ++i;
  return i != visitorList.end() ? (*i).first : NULL;

}

void CompositeVisitor::internalVisit(StuntDouble* sd){
 VisitorIterator i;
  BaseVisitor* curVisitor;

  for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i))
    sd->accept(curVisitor);
}

const string CompositeVisitor::toString(){
  VisitorIterator i;
  char buffer[65535];
  
  for(i = visitorList.begin(); i != visitorList.end(); i++){
    sprintf(buffer, "Priority = %d\n",  (*i).second);
    strcat(buffer, (((*i).first)->toString()).c_str());
  }

  return buffer;
}

void CompositeVisitor::update(){
  VisitorIterator i;
  BaseVisitor* curVisitor;  
  
  for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i))
    curVisitor->update();
 }
Revision:	1118
Committed:	Mon Apr 19 03:52:27 2004 UTC (21 years, 6 months ago) by tim
File size:	1786 byte(s)
Log Message:	new implement of quickLate using visitor and composite pattern
#	User	Rev	Content
1	tim	1118	#include <cstring>
2			#include "CompositeVisitor.hpp"
3			CompositeVisitor::~CompositeVisitor(){
4			VisitorIterator i;
5			BaseVisitor* curVisitor;
6
7			for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i))
8			delete curVisitor;
9
10			visitorList.clear();
11
12			}
13			void CompositeVisitor::addVisitor(BaseVisitor* newVisitor, int priority){
14			VisitorIterator i;
15			int curPriority;
16
17			for(i = visitorList.begin(); i != visitorList.end(); i++){
18			curPriority = (*i).second;
19			//if new visitor has higher priority, just insert it before current visitor
20			if(priority > curPriority){
21			visitorList.insert(i, make_pair(newVisitor, priority));
22			}
23			}
24
25			//if new visitor has lowest priority, insert it at the end of the list
26			visitorList.insert(visitorList.end(), make_pair(newVisitor, priority));
27			}
28
29			BaseVisitor* CompositeVisitor::beginVisitor(VisitorIterator& i){
30			i = visitorList.begin();
31			return i != visitorList.end() ? (*i).first : NULL;
32			}
33
34			BaseVisitor* CompositeVisitor::nextVisitor(VisitorIterator& i){
35			++i;
36			return i != visitorList.end() ? (*i).first : NULL;
37
38			}
39
40			void CompositeVisitor::internalVisit(StuntDouble* sd){
41			VisitorIterator i;
42			BaseVisitor* curVisitor;
43
44			for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i))
45			sd->accept(curVisitor);
46			}
47
48			const string CompositeVisitor::toString(){
49			VisitorIterator i;
50			char buffer[65535];
51
52			for(i = visitorList.begin(); i != visitorList.end(); i++){
53			sprintf(buffer, "Priority = %d\n", (*i).second);
54			strcat(buffer, (((*i).first)->toString()).c_str());
55			}
56
57			return buffer;
58			}
59
60			void CompositeVisitor::update(){
61			VisitorIterator i;
62			BaseVisitor* curVisitor;
63
64			for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i))
65			curVisitor->update();
66			}