1 | /*
|
---|
2 | * Project: MoleCuilder
|
---|
3 | * Description: creates and alters molecular systems
|
---|
4 | * Copyright (C) 2012 University of Bonn. All rights reserved.
|
---|
5 | *
|
---|
6 | *
|
---|
7 | * This file is part of MoleCuilder.
|
---|
8 | *
|
---|
9 | * MoleCuilder is free software: you can redistribute it and/or modify
|
---|
10 | * it under the terms of the GNU General Public License as published by
|
---|
11 | * the Free Software Foundation, either version 2 of the License, or
|
---|
12 | * (at your option) any later version.
|
---|
13 | *
|
---|
14 | * MoleCuilder is distributed in the hope that it will be useful,
|
---|
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
17 | * GNU General Public License for more details.
|
---|
18 | *
|
---|
19 | * You should have received a copy of the GNU General Public License
|
---|
20 | * along with MoleCuilder. If not, see <http://www.gnu.org/licenses/>.
|
---|
21 | */
|
---|
22 |
|
---|
23 | /*
|
---|
24 | * Fragment.cpp
|
---|
25 | *
|
---|
26 | * Created on: Aug 8, 2012
|
---|
27 | * Author: heber
|
---|
28 | */
|
---|
29 |
|
---|
30 |
|
---|
31 | // include config.h
|
---|
32 | #ifdef HAVE_CONFIG_H
|
---|
33 | #include <config.h>
|
---|
34 | #endif
|
---|
35 |
|
---|
36 | #include "CodePatterns/MemDebug.hpp"
|
---|
37 |
|
---|
38 | #include "Fragment.hpp"
|
---|
39 |
|
---|
40 | #include "CodePatterns/Assert.hpp"
|
---|
41 |
|
---|
42 | Fragment::Fragment()
|
---|
43 | {}
|
---|
44 |
|
---|
45 | Fragment::Fragment(positions_t &_positions, charges_t &_charges)
|
---|
46 | {
|
---|
47 | ASSERT( _positions.size() == _charges.size(),
|
---|
48 | "Fragment::Fragment() - given charges and positions don't match in size.");
|
---|
49 | positions_t::const_iterator piter = _positions.begin();
|
---|
50 | charges_t::const_iterator citer = _charges.begin();
|
---|
51 | for (;piter != _positions.end(); ++piter, ++citer)
|
---|
52 | nuclei.push_back( make_pair( *piter, *citer) );
|
---|
53 | }
|
---|
54 |
|
---|
55 |
|
---|
56 | Fragment& Fragment::operator+=(const Fragment &other)
|
---|
57 | {
|
---|
58 | for (nuclei_t::const_iterator iter = other.nuclei.begin();
|
---|
59 | iter != other.nuclei.end(); ++iter) {
|
---|
60 | if (!containsNuclei(*iter)) {
|
---|
61 | nuclei.push_back(*iter);
|
---|
62 | }
|
---|
63 | }
|
---|
64 | return *this;
|
---|
65 | }
|
---|
66 |
|
---|
67 | Fragment& Fragment::operator=(const Fragment &other)
|
---|
68 | {
|
---|
69 | nuclei.clear();
|
---|
70 | nuclei = other.nuclei;
|
---|
71 | return *this;
|
---|
72 | }
|
---|
73 |
|
---|
74 | Fragment& Fragment::operator-=(const Fragment &other)
|
---|
75 | {
|
---|
76 | for (nuclei_t::const_iterator iter = other.nuclei.begin();
|
---|
77 | iter != other.nuclei.end(); ++iter)
|
---|
78 | removeNuclei(*iter);
|
---|
79 | return *this;
|
---|
80 | }
|
---|
81 |
|
---|
82 | bool Fragment::containsNuclei(const nucleus_t &n) const
|
---|
83 | {
|
---|
84 | for (nuclei_t::const_iterator iter = nuclei.begin();
|
---|
85 | iter != nuclei.end(); ++iter) {
|
---|
86 | if (((*iter).first == n.first) && ((*iter).second == n.second))
|
---|
87 | return true;
|
---|
88 | }
|
---|
89 | return false;
|
---|
90 | }
|
---|
91 |
|
---|
92 | void Fragment::removeNuclei(const nucleus_t &n)
|
---|
93 | {
|
---|
94 | for (nuclei_t::iterator iter = nuclei.begin();
|
---|
95 | iter != nuclei.end(); ++iter) {
|
---|
96 | if (((*iter).first == n.first) && ((*iter).second == n.second)) {
|
---|
97 | nuclei.erase(iter);
|
---|
98 | break;
|
---|
99 | }
|
---|
100 | }
|
---|
101 | }
|
---|
102 |
|
---|
103 | template<> Fragment ZeroInstance<Fragment>()
|
---|
104 | {
|
---|
105 | Fragment::positions_t positions;
|
---|
106 | Fragment::charges_t charges;
|
---|
107 | Fragment returnvalue(positions, charges);
|
---|
108 | return returnvalue;
|
---|
109 | }
|
---|
110 |
|
---|