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. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 2. 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.
 *
 * SUPPORT OPEN SCIENCE!  If you use OpenMD or its source code in your
 * research, please cite the appropriate papers when you publish your
 * work.  Good starting points are:
 *                                                                      
 * [1]  Meineke, et al., J. Comp. Chem. 26, 252-271 (2005).             
 * [2]  Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006).          
 * [3]  Sun, Lin & Gezelter, J. Chem. Phys. 128, 234107 (2008).          
 * [4]  Kuang & Gezelter,  J. Chem. Phys. 133, 164101 (2010).
 * [5]  Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011).
 */
 
#include <cstring>
#include "visitors/CompositeVisitor.hpp"
#include "primitives/RigidBody.hpp"
#include "primitives/DirectionalAtom.hpp"

namespace OpenMD {

  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 OpenMD
Revision:	1874
Committed:	Wed May 15 15:09:35 2013 UTC (11 years, 11 months ago) by gezelter
File size:	5615 byte(s)
Log Message:	Fixed a bunch of cppcheck warnings.
#	Content
1	/*
2	* 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. Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.
11	*
12	* 2. Redistributions in binary form must reproduce the above copyright
13	* notice, this list of conditions and the following disclaimer in the
14	* documentation and/or other materials provided with the
15	* distribution.
16	*
17	* This software is provided "AS IS," without a warranty of any
18	* kind. All express or implied conditions, representations and
19	* warranties, including any implied warranty of merchantability,
20	* fitness for a particular purpose or non-infringement, are hereby
21	* excluded. The University of Notre Dame and its licensors shall not
22	* be liable for any damages suffered by licensee as a result of
23	* using, modifying or distributing the software or its
24	* derivatives. In no event will the University of Notre Dame or its
25	* licensors be liable for any lost revenue, profit or data, or for
26	* direct, indirect, special, consequential, incidental or punitive
27	* damages, however caused and regardless of the theory of liability,
28	* arising out of the use of or inability to use software, even if the
29	* University of Notre Dame has been advised of the possibility of
30	* such damages.
31	*
32	* SUPPORT OPEN SCIENCE! If you use OpenMD or its source code in your
33	* research, please cite the appropriate papers when you publish your
34	* work. Good starting points are:
35	*
36	* [1] Meineke, et al., J. Comp. Chem. 26, 252-271 (2005).
37	* [2] Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006).
38	* [3] Sun, Lin & Gezelter, J. Chem. Phys. 128, 234107 (2008).
39	* [4] Kuang & Gezelter, J. Chem. Phys. 133, 164101 (2010).
40	* [5] Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011).
41	*/
42
43	#include <cstring>
44	#include "visitors/CompositeVisitor.hpp"
45	#include "primitives/RigidBody.hpp"
46	#include "primitives/DirectionalAtom.hpp"
47
48	namespace OpenMD {
49
50	CompositeVisitor::~CompositeVisitor(){
51	VisitorIterator i;
52	BaseVisitor* curVisitor;
53
54	for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i))
55	delete curVisitor;
56
57	visitorList.clear();
58
59	}
60	void CompositeVisitor::addVisitor(BaseVisitor* newVisitor, int priority){
61	VisitorIterator i;
62	int curPriority;
63
64	for(i = visitorList.begin(); i != visitorList.end(); ++i){
65	curPriority = (*i).second;
66	//if new visitor has higher priority, just insert it before current visitor
67	if(priority > curPriority){
68	visitorList.insert(i, std::make_pair(newVisitor, priority));
69	}
70	}
71
72	//if new visitor has lowest priority, insert it at the end of the list
73	visitorList.insert(visitorList.end(), std::make_pair(newVisitor, priority));
74	}
75
76	BaseVisitor* CompositeVisitor::beginVisitor(VisitorIterator& i){
77	i = visitorList.begin();
78	return i != visitorList.end() ? (*i).first : NULL;
79	}
80
81	BaseVisitor* CompositeVisitor::nextVisitor(VisitorIterator& i){
82	++i;
83	return i != visitorList.end() ? (*i).first : NULL;
84
85	}
86
87	void CompositeVisitor::visit(Atom* atom){
88	VisitorIterator i;
89	BaseVisitor* curVisitor;
90
91	for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i))
92	atom->accept(curVisitor);
93	}
94
95	void CompositeVisitor::visit(DirectionalAtom* datom){
96	VisitorIterator i;
97	BaseVisitor* curVisitor;
98
99	for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i))
100	datom->accept(curVisitor);
101	}
102	void CompositeVisitor::visit(RigidBody* rb){
103	VisitorIterator i;
104	BaseVisitor* curVisitor;
105	std::vector<Atom*> myAtoms;
106	std::vector<Atom*>::iterator atomIter;
107
108	myAtoms = rb->getAtoms();
109
110	for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i)){
111	rb->accept(curVisitor);
112
113	for(atomIter = myAtoms.begin(); atomIter != myAtoms.end(); ++atomIter)
114	(*atomIter)->accept(curVisitor);
115	}
116
117
118
119	}
120
121	const std::string CompositeVisitor::toString(){
122	VisitorIterator i;
123	std::string result;
124	char buffer[65535];
125
126	sprintf(buffer ,"******************************************************************\n");
127	result += buffer;
128
129	sprintf(buffer ,"Visitor name: %s\n", visitorName.c_str());
130	result += buffer;
131
132	sprintf(buffer , "Visitor Description: visitor manager maintaining a priority list\n");
133	result += buffer;
134
135	sprintf(buffer , "visitors in current priority list:\n");
136	result += buffer;
137
138	for(i = visitorList.begin(); i != visitorList.end(); ++i){
139	sprintf(buffer, "Priority = %d\tvisitor = %s\n", (i).second, ((i).first->getVisitorName()).c_str());
140	result += buffer;
141	}
142
143	sprintf(buffer, "Detail information about every visitor:\n");
144
145
146	for(i = visitorList.begin(); i != visitorList.end(); ++i)
147	result += ((*i).first)->toString();
148
149	sprintf(buffer ,"******************************************************************\n");
150	result += buffer;
151
152	return result;
153	}
154
155	void CompositeVisitor::update(){
156	VisitorIterator i;
157	BaseVisitor* curVisitor;
158
159	for(curVisitor = beginVisitor(i); curVisitor; curVisitor = nextVisitor(i))
160	curVisitor->update();
161	}
162
163	}//namespace OpenMD