| [bc069f] | 1 | /* | 
|---|
|  | 2 | * Project: MoleCuilder | 
|---|
|  | 3 | * Description: creates and alters molecular systems | 
|---|
|  | 4 | * Copyright (C)  2016 Frederik Heber. 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 | * BindingModel.cpp | 
|---|
|  | 25 | * | 
|---|
|  | 26 | *  Created on: Oct 5, 2016 | 
|---|
|  | 27 | *      Author: heber | 
|---|
|  | 28 | */ | 
|---|
|  | 29 |  | 
|---|
|  | 30 |  | 
|---|
|  | 31 | // include config.h | 
|---|
|  | 32 | #ifdef HAVE_CONFIG_H | 
|---|
|  | 33 | #include <config.h> | 
|---|
|  | 34 | #endif | 
|---|
|  | 35 |  | 
|---|
| [9eb71b3] | 36 | //#include "CodePatterns/MemDebug.hpp" | 
|---|
| [bc069f] | 37 |  | 
|---|
|  | 38 | #include "Potentials/BindingModel.hpp" | 
|---|
|  | 39 |  | 
|---|
|  | 40 | static HomologyGraph::nodes_t getMapOfNodes(const BindingModel::vector_nodes_t &_nodes) | 
|---|
|  | 41 | { | 
|---|
|  | 42 | HomologyGraph::nodes_t returnnodes; | 
|---|
|  | 43 | for (BindingModel::vector_nodes_t::const_iterator iter = _nodes.begin(); | 
|---|
|  | 44 | iter != _nodes.end(); ++iter) { | 
|---|
|  | 45 | std::pair<HomologyGraph::nodes_t::iterator, bool > inserter; | 
|---|
|  | 46 | inserter = returnnodes.insert( std::make_pair(*iter, 1) ); | 
|---|
|  | 47 | if (!inserter.second) | 
|---|
|  | 48 | ++(inserter.first->second); | 
|---|
|  | 49 | } | 
|---|
|  | 50 | return returnnodes; | 
|---|
|  | 51 | } | 
|---|
|  | 52 |  | 
|---|
|  | 53 | BindingModel::BindingModel( | 
|---|
|  | 54 | const BindingModel::vector_nodes_t &_nodes, | 
|---|
|  | 55 | const HomologyGraph::edges_t &_edges) : | 
|---|
|  | 56 | graph(getMapOfNodes(_nodes), _edges), | 
|---|
|  | 57 | nodes(_nodes) | 
|---|
|  | 58 | {} | 
|---|
|  | 59 |  | 
|---|
|  | 60 |  | 
|---|