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 <iostream>
|
---|
41 |
|
---|
42 | #include "CodePatterns/Assert.hpp"
|
---|
43 |
|
---|
44 | Fragment::Fragment()
|
---|
45 | {}
|
---|
46 |
|
---|
47 | Fragment::Fragment(const positions_t &_positions, const charges_t &_charges)
|
---|
48 | {
|
---|
49 | ASSERT( _positions.size() == _charges.size(),
|
---|
50 | "Fragment::Fragment() - given charges and positions don't match in size.");
|
---|
51 | positions_t::const_iterator piter = _positions.begin();
|
---|
52 | charges_t::const_iterator citer = _charges.begin();
|
---|
53 | for (;piter != _positions.end(); ++piter, ++citer)
|
---|
54 | nuclei.push_back( make_pair( *piter, *citer) );
|
---|
55 | }
|
---|
56 |
|
---|
57 |
|
---|
58 | Fragment& Fragment::operator+=(const Fragment &other)
|
---|
59 | {
|
---|
60 | for (nuclei_t::const_iterator iter = other.nuclei.begin();
|
---|
61 | iter != other.nuclei.end(); ++iter) {
|
---|
62 | if (!containsNuclei(*iter)) {
|
---|
63 | nuclei.push_back(*iter);
|
---|
64 | }
|
---|
65 | }
|
---|
66 | return *this;
|
---|
67 | }
|
---|
68 |
|
---|
69 | Fragment& Fragment::operator=(const Fragment &other)
|
---|
70 | {
|
---|
71 | nuclei.clear();
|
---|
72 | nuclei = other.nuclei;
|
---|
73 | return *this;
|
---|
74 | }
|
---|
75 |
|
---|
76 | Fragment& Fragment::operator-=(const Fragment &other)
|
---|
77 | {
|
---|
78 | for (nuclei_t::const_iterator iter = other.nuclei.begin();
|
---|
79 | iter != other.nuclei.end(); ++iter)
|
---|
80 | removeNuclei(*iter);
|
---|
81 | return *this;
|
---|
82 | }
|
---|
83 |
|
---|
84 | bool Fragment::containsNuclei(const nucleus_t &n) const
|
---|
85 | {
|
---|
86 | for (nuclei_t::const_iterator iter = nuclei.begin();
|
---|
87 | iter != nuclei.end(); ++iter) {
|
---|
88 | if (((*iter).first == n.first) && ((*iter).second == n.second))
|
---|
89 | return true;
|
---|
90 | }
|
---|
91 | return false;
|
---|
92 | }
|
---|
93 |
|
---|
94 | void Fragment::removeNuclei(const nucleus_t &n)
|
---|
95 | {
|
---|
96 | for (nuclei_t::iterator iter = nuclei.begin();
|
---|
97 | iter != nuclei.end(); ++iter) {
|
---|
98 | if (((*iter).first == n.first) && ((*iter).second == n.second)) {
|
---|
99 | nuclei.erase(iter);
|
---|
100 | break;
|
---|
101 | }
|
---|
102 | }
|
---|
103 | }
|
---|
104 |
|
---|
105 | Fragment::positions_t Fragment::getPositions() const
|
---|
106 | {
|
---|
107 | positions_t positions;
|
---|
108 | for (nuclei_t::const_iterator iter = nuclei.begin();
|
---|
109 | iter != nuclei.end(); ++iter)
|
---|
110 | positions.push_back(iter->first);
|
---|
111 | return positions;
|
---|
112 | }
|
---|
113 |
|
---|
114 | Fragment::charges_t Fragment::getCharges() const
|
---|
115 | {
|
---|
116 | charges_t charges;
|
---|
117 | for (nuclei_t::const_iterator iter = nuclei.begin();
|
---|
118 | iter != nuclei.end(); ++iter)
|
---|
119 | charges.push_back(iter->second);
|
---|
120 | return charges;
|
---|
121 | }
|
---|
122 |
|
---|
123 | std::ostream & operator<<(std::ostream &ost, const Fragment &f)
|
---|
124 | {
|
---|
125 | size_t NucleiCounter = 1;
|
---|
126 | for (Fragment::nuclei_t::const_iterator iter = f.nuclei.begin();
|
---|
127 | iter != f.nuclei.end(); ++iter)
|
---|
128 | ost << NucleiCounter++ << "\t" << iter->first << " with charge " << iter->second << std::endl;
|
---|
129 | return ost;
|
---|
130 | }
|
---|
131 |
|
---|
132 | template<> Fragment ZeroInstance<Fragment>()
|
---|
133 | {
|
---|
134 | Fragment::positions_t positions;
|
---|
135 | Fragment::charges_t charges;
|
---|
136 | Fragment returnvalue(positions, charges);
|
---|
137 | return returnvalue;
|
---|
138 | }
|
---|
139 |
|
---|