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 <stdlib.h> |
43 |
|
|
#include <stdio.h> |
44 |
|
|
#include <string.h> |
45 |
|
|
#include <iostream> |
46 |
|
|
|
47 |
tim |
1492 |
#include "types/CutoffGroupStamp.hpp" |
48 |
gezelter |
1490 |
|
49 |
|
|
char CutoffGroupStamp::errMsg[500]; |
50 |
|
|
|
51 |
|
|
CutoffGroupStamp::CutoffGroupStamp(){ |
52 |
|
|
|
53 |
|
|
unhandled = NULL; |
54 |
|
|
have_members = 0; |
55 |
|
|
have_extras = 0; |
56 |
|
|
n_members = 0; |
57 |
|
|
which = 0; |
58 |
|
|
|
59 |
|
|
} |
60 |
|
|
|
61 |
|
|
CutoffGroupStamp::~CutoffGroupStamp(){ |
62 |
|
|
if( unhandled != NULL ) delete unhandled; |
63 |
|
|
|
64 |
|
|
free(members); |
65 |
|
|
|
66 |
|
|
} |
67 |
|
|
|
68 |
|
|
char* CutoffGroupStamp::assignString( char* lhs, char* rhs ){ |
69 |
|
|
|
70 |
|
|
if( unhandled == NULL ) unhandled = new LinkedAssign( lhs, rhs ); |
71 |
|
|
else unhandled->add( lhs, rhs ); |
72 |
|
|
have_extras = 1; |
73 |
|
|
return NULL; |
74 |
|
|
|
75 |
|
|
} |
76 |
|
|
|
77 |
|
|
char* CutoffGroupStamp::assignDouble( char* lhs, double rhs ){ |
78 |
|
|
if( !strcmp( lhs, "nMembers" ) ){ |
79 |
|
|
n_members = (int)rhs; |
80 |
|
|
|
81 |
|
|
if( have_members ){ |
82 |
|
|
sprintf( errMsg, |
83 |
|
|
"CutoffGroupStamp error, nMembers already declared" |
84 |
|
|
" for this CutoffGroup.\n"); |
85 |
|
|
return strdup( errMsg ); |
86 |
|
|
} |
87 |
|
|
have_members = 1; |
88 |
|
|
members = (int *) calloc(n_members, sizeof(int)); |
89 |
|
|
} |
90 |
|
|
else { |
91 |
|
|
if( unhandled == NULL ) unhandled = new LinkedAssign( lhs, rhs ); |
92 |
|
|
else unhandled->add( lhs, rhs ); |
93 |
|
|
have_extras = 1; |
94 |
|
|
} |
95 |
|
|
return NULL; |
96 |
|
|
} |
97 |
|
|
|
98 |
|
|
char* CutoffGroupStamp::assignInt( char* lhs, int rhs ){ |
99 |
|
|
if( !strcmp( lhs, "nMembers" ) ){ |
100 |
|
|
n_members = rhs; |
101 |
|
|
|
102 |
|
|
if( have_members ){ |
103 |
|
|
sprintf( errMsg, |
104 |
|
|
"CutoffGroupStamp error, nMembers already declared for" |
105 |
|
|
" this CutoffGroup.\n"); |
106 |
|
|
return strdup( errMsg ); |
107 |
|
|
} |
108 |
|
|
have_members = 1; |
109 |
|
|
members = (int *) calloc(n_members, sizeof(int)); |
110 |
|
|
} |
111 |
|
|
else { |
112 |
|
|
if( unhandled == NULL ) unhandled = new LinkedAssign( lhs, rhs ); |
113 |
|
|
else unhandled->add( lhs, rhs ); |
114 |
|
|
have_extras = 1; |
115 |
|
|
} |
116 |
|
|
return NULL; |
117 |
|
|
} |
118 |
|
|
|
119 |
|
|
char* CutoffGroupStamp::addMember( int atomIndex ){ |
120 |
|
|
|
121 |
|
|
if( have_members && which < n_members ) { |
122 |
|
|
members[which] = atomIndex; |
123 |
|
|
which++; |
124 |
|
|
} else { |
125 |
|
|
if( have_members ){ |
126 |
|
|
sprintf( errMsg, "CutoffGroupStamp error, %d out of nMembers range", |
127 |
|
|
which ); |
128 |
|
|
return strdup( errMsg ); |
129 |
|
|
} |
130 |
|
|
else return strdup("CutoffGroupStamp error, nMembers not given before" |
131 |
|
|
" member list declaration." ); |
132 |
|
|
} |
133 |
|
|
return NULL; |
134 |
|
|
} |
135 |
|
|
|
136 |
|
|
char* CutoffGroupStamp::checkMe( void ){ |
137 |
|
|
|
138 |
|
|
short int no_member; |
139 |
|
|
|
140 |
|
|
if( !have_members ){ |
141 |
|
|
return strdup( "CutoffGroupStamp error. CutoffGroup contains no members." ); |
142 |
|
|
} |
143 |
|
|
|
144 |
|
|
if (which < n_members) { |
145 |
|
|
sprintf( errMsg, |
146 |
|
|
"CutoffGroupStamp error. Not all of the members were" |
147 |
|
|
" declared for this CutoffGroup."); |
148 |
|
|
return strdup( errMsg ); |
149 |
|
|
} |
150 |
|
|
|
151 |
|
|
return NULL; |
152 |
|
|
|
153 |
|
|
} |