ViewVC Help
View File | Revision Log | Show Annotations | View Changeset | Root Listing
root/group/trunk/OOPSE-4/src/applications/staticProps/RadialDistrFunc.cpp
Revision: 2032
Committed: Tue Feb 15 17:24:12 2005 UTC (19 years, 5 months ago) by tim
File size: 5451 byte(s)
Log Message:
bug fix in StaticProps

File Contents

# User Rev Content
1 tim 1990 /*
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. 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     #include <algorithm>
43    
44     #include "RadialDistrFunc.hpp"
45 tim 1995 #include "io/DumpReader.hpp"
46     #include "primitives/Molecule.hpp"
47 tim 1990 namespace oopse {
48    
49 tim 1994 RadialDistrFunc:: RadialDistrFunc(SimInfo* info, const std::string& filename, const std::string& sele1, const std::string& sele2)
50     : info_(info), currentSnapshot_(NULL), dumpFilename_(filename), step_(1),
51 tim 1995 selectionScript1_(sele1), selectionScript2_(sele2), evaluator1_(info), evaluator2_(info), seleMan1_(info), seleMan2_(info){
52 tim 1990
53     evaluator1_.loadScriptString(sele1);
54     evaluator2_.loadScriptString(sele2);
55    
56 tim 1995 if (!evaluator1_.isDynamic()) {
57     seleMan1_.setSelectionSet(evaluator1_.evaluate());
58 tim 1990 }
59 tim 1995 if (!evaluator2_.isDynamic()) {
60     seleMan2_.setSelectionSet(evaluator2_.evaluate());
61 tim 1990 }
62    
63 tim 2031 if (!evaluator1_.isDynamic() && !evaluator2_.isDynamic()) {
64     //if all selections are static, we can precompute the number of real pairs
65    
66 tim 2032 int nSelected1 = seleMan1_.getSelectionCount();
67     int nSelected2 = seleMan2_.getSelectionCount();
68 tim 2031
69     BitSet bs = seleMan1_.getSelectionSet();
70     bs &= seleMan2_.getSelectionSet();
71     int nIntersect = bs.countBits();
72    
73     nRealPairs_ = nSelected1 * nSelected2 - (nIntersect +1) * nIntersect/2;
74     }
75    
76 tim 1990 }
77    
78     void RadialDistrFunc::process() {
79 tim 1995 Molecule* mol;
80     RigidBody* rb;
81     SimInfo::MoleculeIterator mi;
82     Molecule::RigidBodyIterator rbIter;
83 tim 2002
84 tim 1990 preProcess();
85    
86     DumpReader reader(info_, dumpFilename_);
87 tim 1995 int nFrames = reader.getNFrames();
88 tim 1991 nProcessed_ = nFrames / step_ + 1;
89 tim 1990 for (int i = 0; i < nFrames; i += step_) {
90 tim 1995 reader.readFrame(i);
91 tim 1990 currentSnapshot_ = info_->getSnapshotManager()->getCurrentSnapshot();
92    
93 tim 1995 if (evaluator1_.isDynamic()) {
94     seleMan1_.setSelectionSet(evaluator1_.evaluate());
95 tim 1990 }
96 tim 1995 if (evaluator2_.isDynamic()) {
97     seleMan2_.setSelectionSet(evaluator2_.evaluate());
98 tim 1990 }
99    
100 tim 1995 for (mol = info_->beginMolecule(mi); mol != NULL; mol = info_->nextMolecule(mi)) {
101    
102     //change the positions of atoms which belong to the rigidbodies
103     for (rb = mol->beginRigidBody(rbIter); rb != NULL; rb = mol->nextRigidBody(rbIter)) {
104     rb->updateAtoms();
105     }
106     }
107    
108 tim 1990 initalizeHistogram();
109    
110     StuntDouble* sd1;
111     int j;
112 tim 1995 for (sd1 = seleMan1_.beginSelected(j); sd1 != NULL; sd1 = seleMan1_.nextSelected(j)) {
113 tim 1990
114     StuntDouble* sd2;
115     int k;
116 tim 1995 for (sd2 = seleMan2_.beginSelected(k); sd2 != NULL; sd2 = seleMan2_.nextSelected(k)) {
117 tim 2031 if (sd1 != sd2) {
118     collectHistogram(sd1, sd2);
119     }
120 tim 1990 }
121     }
122    
123     processHistogram();
124    
125     }
126    
127     postProcess();
128    
129 tim 1991 writeRdf();
130 tim 1990 }
131    
132 tim 2031 int RadialDistrFunc::getNRealPairs() {
133     if (evaluator1_.isDynamic() || evaluator2_.isDynamic()) {
134     //if one of the selection is static, need to recompute it
135    
136 tim 2032 int nSelected1 = seleMan1_.getSelectionCount();
137     int nSelected2 = seleMan2_.getSelectionCount();
138 tim 2031
139     BitSet bs = seleMan1_.getSelectionSet();
140     bs &= seleMan2_.getSelectionSet();
141     int nIntersect = bs.countBits();
142    
143     nRealPairs_ = nSelected1 * nSelected2 - (nIntersect +1) * nIntersect/2;
144     }
145    
146 tim 2032 return nRealPairs_;
147 tim 1990 }
148 tim 2031
149     }