src/visitors/CompositeVisitor.cpp

/*
 * Copyright (c) 2005 The University of Notre Dame. All Rights Reserved.
 *
 * The University of Notre Dame grants you ("Licensee") a
 * non-exclusive, royalty free, license to use, modify and
 * redistribute this software in source and binary code form, provided
 * that the following conditions are met:
 *
 * 1. Acknowledgement of the program authors must be made in any
 *    publication of scientific results based in part on use of the
 *    program.  An acceptable form of acknowledgement is citation of
 *    the article in which the program was described (Matthew
 *    A. Meineke, Charles F. Vardeman II, Teng Lin, Christopher
 *    J. Fennell and J. Daniel Gezelter, "OOPSE: An Object-Oriented
 *    Parallel Simulation Engine for Molecular Dynamics,"
 *    J. Comput. Chem. 26, pp. 252-271 (2005))
 *
 * 2. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 3. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the
 *    distribution.
 *
 * This software is provided "AS IS," without a warranty of any
 * kind. All express or implied conditions, representations and
 * warranties, including any implied warranty of merchantability,
 * fitness for a particular purpose or non-infringement, are hereby
 * excluded.  The University of Notre Dame and its licensors shall not
 * be liable for any damages suffered by licensee as a result of
 * using, modifying or distributing the software or its
 * derivatives. In no event will the University of Notre Dame or its
 * licensors be liable for any lost revenue, profit or data, or for
 * direct, indirect, special, consequential, incidental or punitive
 * damages, however caused and regardless of the theory of liability,
 * arising out of the use of or inability to use software, even if the
 * University of Notre Dame has been advised of the possibility of
 * such damages.
 */
 
#include <cstring>
#include "visitors/CompositeVisitor.hpp"
#include "primitives/RigidBody.hpp"
#include "primitives/DirectionalAtom.hpp"

namespace oopse {

  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, std::make_pair(newVisitor, priority));
      }
    }

    //if new visitor has lowest priority, insert it at the end of the list
    visitorList.insert(visitorList.end(), std::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::visit(Atom* atom){
    VisitorIterator i;
    BaseVisitor* curVisitor;

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

  void CompositeVisitor::visit(DirectionalAtom* datom){
    VisitorIterator i;
    BaseVisitor* curVisitor;

    for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i))
      datom->accept(curVisitor);
  }
  void CompositeVisitor::visit(RigidBody* rb){
    VisitorIterator i;
    BaseVisitor* curVisitor;
    std::vector<Atom*> myAtoms;
    std::vector<Atom*>::iterator atomIter;

    myAtoms = rb->getAtoms();
  
    for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i)){
      rb->accept(curVisitor);
    
      for(atomIter = myAtoms.begin(); atomIter != myAtoms.end(); ++atomIter)
        (*atomIter)->accept(curVisitor);
    }

  
  }

  const  std::string CompositeVisitor::toString(){
    VisitorIterator i;
    std::string result;
    char buffer[65535];

    sprintf(buffer ,"******************************************************************\n");
    result += buffer;
  
    sprintf(buffer ,"Visitor name: %s\n", visitorName.c_str());
    result += buffer;

    sprintf(buffer , "Visitor Description: visitor manager  maintaining a priority  list\n");
    result += buffer;

    sprintf(buffer , "visitors in current priority list:\n");
    result += buffer;
  
    for(i = visitorList.begin(); i != visitorList.end(); i++){
      sprintf(buffer, "Priority = %d\tvisitor = %s\n",  (*i).second, ((*i).first->getVisitorName()).c_str());
      result += buffer;
    }

    sprintf(buffer, "Detail information about every visitor:\n");


    for(i = visitorList.begin(); i != visitorList.end(); i++)
      result += ((*i).first)->toString();

    sprintf(buffer ,"******************************************************************\n");
    result += buffer;
  
    return result;
  }

  void CompositeVisitor::update(){
    VisitorIterator i;
    BaseVisitor* curVisitor;  
  
    for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i))
      curVisitor->update();
  }

}//namespace oopse
Revision:	2204
Committed:	Fri Apr 15 22:04:00 2005 UTC (19 years, 2 months ago) by gezelter
File size:	5505 byte(s)
Log Message:	xemacs has been drafted to perform our indentation services
#	User	Rev	Content
1	gezelter	2204	/*
2	gezelter	1930	* Copyright (c) 2005 The University of Notre Dame. All Rights Reserved.
3			*
4			* The University of Notre Dame grants you ("Licensee") a
5			* non-exclusive, royalty free, license to use, modify and
6			* redistribute this software in source and binary code form, provided
7			* that the following conditions are met:
8			*
9			* 1. Acknowledgement of the program authors must be made in any
10			* publication of scientific results based in part on use of the
11			* program. An acceptable form of acknowledgement is citation of
12			* the article in which the program was described (Matthew
13			* A. Meineke, Charles F. Vardeman II, Teng Lin, Christopher
14			* J. Fennell and J. Daniel Gezelter, "OOPSE: An Object-Oriented
15			* Parallel Simulation Engine for Molecular Dynamics,"
16			* J. Comput. Chem. 26, pp. 252-271 (2005))
17			*
18			* 2. Redistributions of source code must retain the above copyright
19			* notice, this list of conditions and the following disclaimer.
20			*
21			* 3. Redistributions in binary form must reproduce the above copyright
22			* notice, this list of conditions and the following disclaimer in the
23			* documentation and/or other materials provided with the
24			* distribution.
25			*
26			* This software is provided "AS IS," without a warranty of any
27			* kind. All express or implied conditions, representations and
28			* warranties, including any implied warranty of merchantability,
29			* fitness for a particular purpose or non-infringement, are hereby
30			* excluded. The University of Notre Dame and its licensors shall not
31			* be liable for any damages suffered by licensee as a result of
32			* using, modifying or distributing the software or its
33			* derivatives. In no event will the University of Notre Dame or its
34			* licensors be liable for any lost revenue, profit or data, or for
35			* direct, indirect, special, consequential, incidental or punitive
36			* damages, however caused and regardless of the theory of liability,
37			* arising out of the use of or inability to use software, even if the
38			* University of Notre Dame has been advised of the possibility of
39			* such damages.
40			*/
41
42	gezelter	1490	#include <cstring>
43	tim	1492	#include "visitors/CompositeVisitor.hpp"
44			#include "primitives/RigidBody.hpp"
45			#include "primitives/DirectionalAtom.hpp"
46	tim	1625
47			namespace oopse {
48
49	gezelter	2204	CompositeVisitor::~CompositeVisitor(){
50			VisitorIterator i;
51			BaseVisitor* curVisitor;
52	gezelter	1490
53	gezelter	2204	for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i))
54			delete curVisitor;
55	gezelter	1490
56	gezelter	2204	visitorList.clear();
57	gezelter	1490
58	gezelter	2204	}
59			void CompositeVisitor::addVisitor(BaseVisitor* newVisitor, int priority){
60			VisitorIterator i;
61			int curPriority;
62	gezelter	1490
63	gezelter	2204	for(i = visitorList.begin(); i != visitorList.end(); i++){
64			curPriority = (*i).second;
65			//if new visitor has higher priority, just insert it before current visitor
66			if(priority > curPriority){
67			visitorList.insert(i, std::make_pair(newVisitor, priority));
68			}
69	gezelter	1490	}
70	gezelter	2204
71			//if new visitor has lowest priority, insert it at the end of the list
72			visitorList.insert(visitorList.end(), std::make_pair(newVisitor, priority));
73	gezelter	1490	}
74
75	gezelter	2204	BaseVisitor* CompositeVisitor::beginVisitor(VisitorIterator& i){
76			i = visitorList.begin();
77			return i != visitorList.end() ? (*i).first : NULL;
78			}
79	gezelter	1490
80	gezelter	2204	BaseVisitor* CompositeVisitor::nextVisitor(VisitorIterator& i){
81			++i;
82			return i != visitorList.end() ? (*i).first : NULL;
83	gezelter	1490
84	gezelter	2204	}
85	gezelter	1490
86	gezelter	2204	void CompositeVisitor::visit(Atom* atom){
87			VisitorIterator i;
88			BaseVisitor* curVisitor;
89	gezelter	1490
90	gezelter	2204	for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i))
91			atom->accept(curVisitor);
92			}
93	gezelter	1490
94	gezelter	2204	void CompositeVisitor::visit(DirectionalAtom* datom){
95			VisitorIterator i;
96			BaseVisitor* curVisitor;
97	gezelter	1490
98	gezelter	2204	for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i))
99			datom->accept(curVisitor);
100			}
101			void CompositeVisitor::visit(RigidBody* rb){
102			VisitorIterator i;
103			BaseVisitor* curVisitor;
104			std::vector<Atom*> myAtoms;
105			std::vector<Atom*>::iterator atomIter;
106	gezelter	1490
107	gezelter	2204	myAtoms = rb->getAtoms();
108	gezelter	1490
109	gezelter	2204	for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i)){
110			rb->accept(curVisitor);
111	gezelter	1490
112	gezelter	2204	for(atomIter = myAtoms.begin(); atomIter != myAtoms.end(); ++atomIter)
113			(*atomIter)->accept(curVisitor);
114			}
115	gezelter	1490
116
117
118	gezelter	2204	}
119	gezelter	1490
120	gezelter	2204	const std::string CompositeVisitor::toString(){
121			VisitorIterator i;
122			std::string result;
123			char buffer[65535];
124	gezelter	1490
125	gezelter	2204	sprintf(buffer ,"******************************************************************\n");
126			result += buffer;
127	gezelter	1490
128	gezelter	2204	sprintf(buffer ,"Visitor name: %s\n", visitorName.c_str());
129			result += buffer;
130	gezelter	1490
131	gezelter	2204	sprintf(buffer , "Visitor Description: visitor manager maintaining a priority list\n");
132			result += buffer;
133	gezelter	1490
134	gezelter	2204	sprintf(buffer , "visitors in current priority list:\n");
135			result += buffer;
136	gezelter	1490
137	gezelter	2204	for(i = visitorList.begin(); i != visitorList.end(); i++){
138			sprintf(buffer, "Priority = %d\tvisitor = %s\n", (i).second, ((i).first->getVisitorName()).c_str());
139			result += buffer;
140			}
141	gezelter	1490
142	gezelter	2204	sprintf(buffer, "Detail information about every visitor:\n");
143	gezelter	1490
144
145	gezelter	2204	for(i = visitorList.begin(); i != visitorList.end(); i++)
146			result += ((*i).first)->toString();
147	gezelter	1490
148	gezelter	2204	sprintf(buffer ,"******************************************************************\n");
149			result += buffer;
150	gezelter	1490
151	gezelter	2204	return result;
152			}
153	gezelter	1490
154	gezelter	2204	void CompositeVisitor::update(){
155			VisitorIterator i;
156			BaseVisitor* curVisitor;
157	gezelter	1490
158	gezelter	2204	for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i))
159			curVisitor->update();
160			}
161	tim	1625
162	gezelter	1930	}//namespace oopse