| [61c364] | 1 | /* | 
|---|
|  | 2 | * Project: MoleCuilder | 
|---|
|  | 3 | * Description: creates and alters _atomecular systems | 
|---|
|  | 4 | * Copyright (C)  2010-2012 University of Bonn. All rights reserved. | 
|---|
| [94d5ac6] | 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/>. | 
|---|
| [61c364] | 21 | */ | 
|---|
|  | 22 |  | 
|---|
|  | 23 | /* | 
|---|
|  | 24 | * AtomOrderDescriptor.cpp | 
|---|
|  | 25 | * | 
|---|
|  | 26 | *  Created on: Mar 22, 2012 | 
|---|
|  | 27 | *      Author: heber | 
|---|
|  | 28 | */ | 
|---|
|  | 29 |  | 
|---|
|  | 30 | // include config.h | 
|---|
|  | 31 | #ifdef HAVE_CONFIG_H | 
|---|
|  | 32 | #include <config.h> | 
|---|
|  | 33 | #endif | 
|---|
|  | 34 |  | 
|---|
|  | 35 | #include "CodePatterns/MemDebug.hpp" | 
|---|
|  | 36 |  | 
|---|
|  | 37 | #include "AtomOrderDescriptor.hpp" | 
|---|
|  | 38 | #include "AtomOrderDescriptor_impl.hpp" | 
|---|
|  | 39 |  | 
|---|
|  | 40 | #include "Atom/atom.hpp" | 
|---|
|  | 41 | #include "CodePatterns/Observer/ObservedContainer_impl.hpp" | 
|---|
|  | 42 |  | 
|---|
|  | 43 | using namespace std; | 
|---|
|  | 44 |  | 
|---|
|  | 45 |  | 
|---|
|  | 46 | AtomOrderDescriptor_impl::AtomOrderDescriptor_impl(int _id) : | 
|---|
|  | 47 | id(_id) | 
|---|
|  | 48 | {} | 
|---|
|  | 49 |  | 
|---|
|  | 50 | AtomOrderDescriptor_impl::~AtomOrderDescriptor_impl() | 
|---|
|  | 51 | {} | 
|---|
|  | 52 |  | 
|---|
| [795c0f] | 53 | bool AtomOrderDescriptor_impl::predicate(std::pair<atomId_t,const atom*> _atom) const | 
|---|
| [61c364] | 54 | { | 
|---|
| [795c0f] | 55 | const atom *Walker = find(); | 
|---|
| [61c364] | 56 | return (Walker == _atom.second); | 
|---|
|  | 57 | } | 
|---|
|  | 58 |  | 
|---|
|  | 59 | AtomDescriptor AtomByOrder(int id){ | 
|---|
|  | 60 | return AtomDescriptor(AtomDescriptor::impl_ptr(new AtomOrderDescriptor_impl(id))); | 
|---|
|  | 61 | } | 
|---|
|  | 62 |  | 
|---|
|  | 63 | World::AtomSet& AtomOrderDescriptor_impl::getAtoms() | 
|---|
|  | 64 | { | 
|---|
|  | 65 | return World::getInstance().atoms; | 
|---|
|  | 66 | } | 
|---|
|  | 67 |  | 
|---|
| [795c0f] | 68 | const World::AtomSet& AtomOrderDescriptor_impl::getAtoms() const | 
|---|
|  | 69 | { | 
|---|
|  | 70 | return const_cast<const World &>(World::getInstance()).atoms; | 
|---|
|  | 71 | } | 
|---|
| [61c364] | 72 |  | 
|---|
|  | 73 | atom *AtomOrderDescriptor_impl::find(){ | 
|---|
|  | 74 | World::AtomSet &atoms = getAtoms(); | 
|---|
|  | 75 |  | 
|---|
|  | 76 | int i=0; | 
|---|
|  | 77 | atom *_atom = NULL; | 
|---|
|  | 78 | if (id == 0) { | 
|---|
|  | 79 | return NULL; | 
|---|
|  | 80 | } else if (id > 0) { | 
|---|
|  | 81 | World::AtomSet::internal_iterator res = atoms.begin_internal(); | 
|---|
|  | 82 | for (; res != atoms.end_internal(); ++res) { // when iterator is normal, ++ goes forward! | 
|---|
|  | 83 | ++i; | 
|---|
|  | 84 | if (id == i) { | 
|---|
|  | 85 | _atom = res->second; | 
|---|
|  | 86 | break; | 
|---|
|  | 87 | } | 
|---|
|  | 88 | } | 
|---|
|  | 89 | } else { | 
|---|
|  | 90 | World::AtomSet::reverse_internal_iterator res = atoms.rbegin_internal(); | 
|---|
|  | 91 | for (; res != atoms.rend_internal(); ++res) {  // when iterator is reverse, ++ goes backward! | 
|---|
|  | 92 | --i; | 
|---|
|  | 93 | if (id == i) { | 
|---|
|  | 94 | _atom = res->second; | 
|---|
|  | 95 | break; | 
|---|
|  | 96 | } | 
|---|
|  | 97 | } | 
|---|
|  | 98 | } | 
|---|
|  | 99 |  | 
|---|
|  | 100 | return _atom; | 
|---|
|  | 101 | } | 
|---|
|  | 102 |  | 
|---|
| [795c0f] | 103 | const atom *AtomOrderDescriptor_impl::find() const { | 
|---|
|  | 104 | const World::AtomSet &atoms = getAtoms(); | 
|---|
|  | 105 |  | 
|---|
|  | 106 | int i=0; | 
|---|
|  | 107 | const atom *_atom = NULL; | 
|---|
|  | 108 | if (id == 0) { | 
|---|
|  | 109 | return NULL; | 
|---|
|  | 110 | } else if (id > 0) { | 
|---|
|  | 111 | World::AtomSet::const_iterator res = atoms.begin(); | 
|---|
|  | 112 | for (; res != atoms.end(); ++res) { // when iterator is normal, ++ goes forward! | 
|---|
|  | 113 | ++i; | 
|---|
|  | 114 | if (id == i) { | 
|---|
|  | 115 | _atom = res->second; | 
|---|
|  | 116 | break; | 
|---|
|  | 117 | } | 
|---|
|  | 118 | } | 
|---|
|  | 119 | } else { | 
|---|
|  | 120 | World::AtomSet::const_reverse_iterator res = atoms.rbegin(); | 
|---|
|  | 121 | for (; res != atoms.rend(); ++res) {  // when iterator is reverse, ++ goes backward! | 
|---|
|  | 122 | --i; | 
|---|
|  | 123 | if (id == i) { | 
|---|
|  | 124 | _atom = res->second; | 
|---|
|  | 125 | break; | 
|---|
|  | 126 | } | 
|---|
|  | 127 | } | 
|---|
|  | 128 | } | 
|---|
|  | 129 |  | 
|---|
|  | 130 | return _atom; | 
|---|
|  | 131 | } | 
|---|
|  | 132 |  | 
|---|
| [61c364] | 133 | vector<atom*> AtomOrderDescriptor_impl::findAll(){ | 
|---|
|  | 134 | atom *res = find(); | 
|---|
|  | 135 | return (res)?(vector<atom*>(1,res)):(vector<atom*>()); | 
|---|
|  | 136 | } | 
|---|
| [795c0f] | 137 |  | 
|---|
|  | 138 | vector<const atom*> AtomOrderDescriptor_impl::findAll() const { | 
|---|
|  | 139 | const atom *res = find(); | 
|---|
|  | 140 | return (res)?(vector<const atom*>(1,res)):(vector<const atom*>()); | 
|---|
|  | 141 | } | 
|---|