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 |
#include <stdlib.h> |
43 |
#include <string.h> |
44 |
|
45 |
#include "io/LinkedAssign.hpp" |
46 |
|
47 |
LinkedAssign::LinkedAssign( char* the_text, int the_ival ){ |
48 |
|
49 |
next = NULL; |
50 |
strcpy( text, the_text ); |
51 |
ival = the_ival; |
52 |
type = 0; |
53 |
} |
54 |
|
55 |
LinkedAssign::LinkedAssign( char* the_text, double the_dval ){ |
56 |
|
57 |
next = NULL; |
58 |
strcpy( text, the_text ); |
59 |
dval = the_dval; |
60 |
type = 1; |
61 |
} |
62 |
|
63 |
LinkedAssign::LinkedAssign( char* the_text, char* the_sval ){ |
64 |
|
65 |
next = NULL; |
66 |
strcpy( text, the_text ); |
67 |
strcpy( sval, the_sval ); |
68 |
type = 2; |
69 |
} |
70 |
|
71 |
void LinkedAssign::setValues( char* the_text, int the_ival ){ |
72 |
|
73 |
strcpy( text, the_text ); |
74 |
ival = the_ival; |
75 |
type = 0; |
76 |
} |
77 |
|
78 |
void LinkedAssign::setValues( char* the_text, double the_dval ){ |
79 |
|
80 |
strcpy( text, the_text ); |
81 |
dval = the_dval; |
82 |
type = 1; |
83 |
} |
84 |
|
85 |
void LinkedAssign::setValues( char* the_text, char* the_sval ){ |
86 |
|
87 |
strcpy( text, the_text ); |
88 |
strcpy( sval, the_sval ); |
89 |
type = 2; |
90 |
} |
91 |
|
92 |
void LinkedAssign::add( char* the_text, int the_ival ){ |
93 |
|
94 |
if( next != NULL ) next->add( the_text, the_ival ); |
95 |
|
96 |
else next = new LinkedAssign( the_text, the_ival ); |
97 |
} |
98 |
|
99 |
void LinkedAssign::add( char* the_text, double the_dval ){ |
100 |
|
101 |
if( next != NULL ) next->add( the_text, the_dval ); |
102 |
|
103 |
else next = new LinkedAssign( the_text, the_dval ); |
104 |
} |
105 |
|
106 |
void LinkedAssign::add( char* the_text, char* the_sval ){ |
107 |
|
108 |
if( next != NULL ) next->add( the_text, the_sval ); |
109 |
|
110 |
else next = new LinkedAssign( the_text, the_sval ); |
111 |
} |
112 |
|
113 |
LinkedAssign* LinkedAssign::find( char* key ){ |
114 |
|
115 |
if( !strcmp(key, text) ) return this; |
116 |
|
117 |
if( next != NULL ) return next->find(key); |
118 |
|
119 |
return NULL; |
120 |
} |
121 |
|