1 | /*
|
---|
2 | * Project: MoleCuilder
|
---|
3 | * Description: creates and alters molecular systems
|
---|
4 | * Copyright (C) 2012 University of Bonn. All rights reserved.
|
---|
5 | * Please see the COPYING file or "Copyright notice" in builder.cpp for details.
|
---|
6 | *
|
---|
7 | *
|
---|
8 | * This file is part of MoleCuilder.
|
---|
9 | *
|
---|
10 | * MoleCuilder is free software: you can redistribute it and/or modify
|
---|
11 | * it under the terms of the GNU General Public License as published by
|
---|
12 | * the Free Software Foundation, either version 2 of the License, or
|
---|
13 | * (at your option) any later version.
|
---|
14 | *
|
---|
15 | * MoleCuilder is distributed in the hope that it will be useful,
|
---|
16 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
17 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
18 | * GNU General Public License for more details.
|
---|
19 | *
|
---|
20 | * You should have received a copy of the GNU General Public License
|
---|
21 | * along with MoleCuilder. If not, see <http://www.gnu.org/licenses/>.
|
---|
22 | */
|
---|
23 |
|
---|
24 | /*
|
---|
25 | * SortIndex.cpp
|
---|
26 | *
|
---|
27 | * Created on: Sep 20, 2012
|
---|
28 | * Author: heber
|
---|
29 | */
|
---|
30 |
|
---|
31 |
|
---|
32 | // include config.h
|
---|
33 | #ifdef HAVE_CONFIG_H
|
---|
34 | #include <config.h>
|
---|
35 | #endif
|
---|
36 |
|
---|
37 | #include "CodePatterns/MemDebug.hpp"
|
---|
38 |
|
---|
39 | #include "Fragmentation/SortIndex.hpp"
|
---|
40 |
|
---|
41 | #include "CodePatterns/Assert.hpp"
|
---|
42 |
|
---|
43 | #include "molecule.hpp"
|
---|
44 |
|
---|
45 | SortIndex_t::SortIndex_t()
|
---|
46 | {}
|
---|
47 |
|
---|
48 | /** Constructor for SortIndex from the internal numbering in a molecule.
|
---|
49 | *
|
---|
50 | * \param *mol molecule to place in the internal index
|
---|
51 | */
|
---|
52 | SortIndex_t::SortIndex_t(const molecule *mol)
|
---|
53 | {
|
---|
54 | int AtomNo = 0;
|
---|
55 | for(molecule::const_iterator iter=mol->begin();iter!=mol->end();++iter){
|
---|
56 | #ifndef NDEBUG
|
---|
57 | std::pair<index_t::iterator, bool> inserter =
|
---|
58 | #endif
|
---|
59 | index.insert( std::make_pair((*iter)->getNr(), AtomNo) );
|
---|
60 | ASSERT( inserter.second,
|
---|
61 | "SortIndex_t::SortIndex_t() - index "+toString((*iter)->getNr())+" already present.");
|
---|
62 | ++AtomNo;
|
---|
63 | }
|
---|
64 | }
|
---|
65 |
|
---|
66 |
|
---|
67 | int SortIndex_t::find(atomId_t id) const
|
---|
68 | {
|
---|
69 | index_t::const_iterator iter = index.find(id);
|
---|
70 | if (iter == index.end())
|
---|
71 | return -1;
|
---|
72 | else
|
---|
73 | return iter->second;
|
---|
74 | }
|
---|