ViewVC Help
View File | Revision Log | Show Annotations | View Changeset | Root Listing
root/group/trunk/OOPSE-4/src/brains/DataStorage.hpp
Revision: 3397
Committed: Tue May 27 16:39:06 2008 UTC (16 years, 11 months ago) by chuckv
File size: 5337 byte(s)
Log Message:
Checking in changes for Hefland moment calculations

File Contents

# 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. 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 /**
43 * @file Vector.hpp
44 * @author Teng Lin
45 * @date 09/14/2004
46 * @version 1.0
47 */
48
49 #ifndef BRAINS_DATASTORAGE_HPP
50 #define BRAINS_DATASTORAGE_HPP
51
52 #include <vector>
53 #include <math/Vector3.hpp>
54 #include <math/SquareMatrix3.hpp>
55
56 namespace oopse {
57 /**
58 * @class DataStorage
59 * @warning do not try to insert element into (or ease element from) private member data
60 * of DataStorage directly.
61 * @todo DataStorage may need refactoring. Every std::vector can inherit from the same base class
62 * which will make it easy to maintain
63 */
64 class DataStorage {
65 public:
66
67 enum{
68 dslPosition = 1,
69 dslVelocity = 2,
70 dslAmat = 4,
71 dslAngularMomentum = 8,
72 dslElectroFrame = 16,
73 dslZAngle = 32,
74 dslForce = 64,
75 dslTorque = 128,
76 dslParticlePot = 256
77 };
78
79
80 DataStorage();
81 DataStorage(int size, int storageLayout = 511);
82 /** return the size of this DataStorage. */
83 int getSize();
84 /**
85 * Changes the size of this DataStorage.
86 * @param size new size of this DataStorage
87 */
88 void resize(int newSize);
89 /**
90 * Reallocates memory manually. The main reason for using reserve() is efficiency
91 * if you know the capacity to which your std::vector must eventually grow, then it is usually more
92 * efficient to allocate that memory all at once.
93 */
94 void reserve(int size);
95 /**
96 * Copies data inside DataStorage class.
97 * Copy function actually call std::copy for every std::vector in DataStorage class.
98 * One Precondition of std::copy is that target is not within the range [soruce, soruce + num]
99 * @param souce
100 * @param num number of element to be moved
101 * @param target
102 */
103 void copy(int source, int num, int target);
104 /** Returns the storage layout */
105 int getStorageLayout();
106 /** Sets the storage layout */
107 void setStorageLayout(int layout);
108 /** Returns the pointer of internal array */
109 RealType *getArrayPointer(int whichArray);
110
111 std::vector<Vector3d> position; /** position array */
112 std::vector<Vector3d> velocity; /** velocity array */
113 std::vector<RotMat3x3d> aMat; /** rotation matrix array */
114 std::vector<Vector3d> angularMomentum;/** angular momentum array (body-fixed) */
115 std::vector<Mat3x3d> electroFrame; /** the lab frame unit std::vector array*/
116 std::vector<RealType> zAngle; /** z -angle array */
117 std::vector<Vector3d> force; /** force array */
118 std::vector<Vector3d> torque; /** torque array */
119 std::vector<RealType> particlePot; /** pair potential arrray */
120
121 static int getBytesPerStuntDouble(int layout);
122
123 private:
124
125 RealType* internalGetArrayPointer(std::vector<Vector3d>& v);
126
127 RealType* internalGetArrayPointer(std::vector<RotMat3x3d>& v);
128 RealType* internalGetArrayPointer(std::vector<RealType>& v);
129
130
131 template<typename T>
132 void internalResize(std::vector<T>& v, int newSize);
133
134 template<typename T>
135 void internalCopy(std::vector<T>& v, int source, int num, int target);
136
137 int size_;
138 int storageLayout_;
139
140 };
141
142 }
143 #endif //BRAINS_DATASTORAGE_HPP

Properties

Name Value
svn:executable *