| 1 | /* | 
|---|
| 2 | * Project: MoleCuilder | 
|---|
| 3 | * Description: creates and alters molecular systems | 
|---|
| 4 | * Copyright (C)  2010-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 | * ShapeRegistry.cpp | 
|---|
| 25 | * | 
|---|
| 26 | *  Created on: Sep 13, 2012 | 
|---|
| 27 | *      Author: ankele | 
|---|
| 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 "ShapeRegistry.hpp" | 
|---|
| 38 |  | 
|---|
| 39 | #include "CodePatterns/Singleton_impl.hpp" | 
|---|
| 40 | #include "CodePatterns/Registry_impl.hpp" | 
|---|
| 41 | #include "CodePatterns/Observer/Channels.hpp" | 
|---|
| 42 |  | 
|---|
| 43 | #include "ShapeFactory.hpp" | 
|---|
| 44 |  | 
|---|
| 45 | ShapeRegistry::ShapeRegistry() : | 
|---|
| 46 | Observable::Observable("ShapeRegistry") | 
|---|
| 47 | { | 
|---|
| 48 | Channels *OurChannel = new Channels; | 
|---|
| 49 | NotificationChannels.insert( std::make_pair(this, OurChannel) ); | 
|---|
| 50 | // add instance for each notification type | 
|---|
| 51 | for (size_t type = 0; type < NotificationType_MAX; ++type) | 
|---|
| 52 | OurChannel->addChannel(type); | 
|---|
| 53 |  | 
|---|
| 54 | _lastchanged = NULL; | 
|---|
| 55 | } | 
|---|
| 56 |  | 
|---|
| 57 | void ShapeRegistry::selectShape(const std::string& name) | 
|---|
| 58 | { | 
|---|
| 59 | OBSERVE; | 
|---|
| 60 | NOTIFY(SelectionChanged); | 
|---|
| 61 | ASSERT(isPresentByName(name),"Shape selected that was not in the registry"); | 
|---|
| 62 | selectedShapes[name] = getByName(name); | 
|---|
| 63 | } | 
|---|
| 64 |  | 
|---|
| 65 | void ShapeRegistry::selectShape(Shape* s) | 
|---|
| 66 | { | 
|---|
| 67 | ASSERT(s,"Invalid pointer in selection of shape"); | 
|---|
| 68 | selectShape(s->getName()); | 
|---|
| 69 | } | 
|---|
| 70 |  | 
|---|
| 71 | void ShapeRegistry::unselectShape(const std::string& name) | 
|---|
| 72 | { | 
|---|
| 73 | OBSERVE; | 
|---|
| 74 | NOTIFY(SelectionChanged); | 
|---|
| 75 | ASSERT(isPresentByName(name),"Shape unselected that was not in the registry"); | 
|---|
| 76 | selectedShapes.erase(name); | 
|---|
| 77 | } | 
|---|
| 78 |  | 
|---|
| 79 | void ShapeRegistry::unselectShape(Shape* s) | 
|---|
| 80 | { | 
|---|
| 81 | ASSERT(s,"Invalid pointer in unselection of shape"); | 
|---|
| 82 | unselectShape(s->getName()); | 
|---|
| 83 | } | 
|---|
| 84 |  | 
|---|
| 85 | void ShapeRegistry::selectAllShapes() | 
|---|
| 86 | { | 
|---|
| 87 | OBSERVE; | 
|---|
| 88 | NOTIFY(SelectionChanged); | 
|---|
| 89 | const_iterator iter; | 
|---|
| 90 | for (iter = getBeginIter(); iter != getEndIter(); iter ++) | 
|---|
| 91 | if (!isSelected(iter->first)) | 
|---|
| 92 | selectedShapes[iter->first] = iter->second; | 
|---|
| 93 | } | 
|---|
| 94 |  | 
|---|
| 95 | void ShapeRegistry::unselectAllShapes() | 
|---|
| 96 | { | 
|---|
| 97 | OBSERVE; | 
|---|
| 98 | NOTIFY(SelectionChanged); | 
|---|
| 99 | selectedShapes.clear(); | 
|---|
| 100 | } | 
|---|
| 101 |  | 
|---|
| 102 | void ShapeRegistry::invertShapeSelection() | 
|---|
| 103 | { | 
|---|
| 104 | OBSERVE; | 
|---|
| 105 | NOTIFY(SelectionChanged); | 
|---|
| 106 | std::map<std::string, Shape*> inverted; | 
|---|
| 107 | const_iterator iter; | 
|---|
| 108 | for (iter = getBeginIter(); iter != getEndIter(); iter ++) | 
|---|
| 109 | if (!isSelected(iter->first)) | 
|---|
| 110 | inverted[iter->first] = iter->second; | 
|---|
| 111 | selectedShapes = inverted; | 
|---|
| 112 | } | 
|---|
| 113 |  | 
|---|
| 114 | bool ShapeRegistry::isSelected(const std::string& name) const | 
|---|
| 115 | { | 
|---|
| 116 | return selectedShapes.find(name) != selectedShapes.end(); | 
|---|
| 117 | } | 
|---|
| 118 |  | 
|---|
| 119 | bool ShapeRegistry::isSelected(Shape* s) const | 
|---|
| 120 | { | 
|---|
| 121 | ASSERT(s,"Invalid pointer in selection query of shape"); | 
|---|
| 122 | return isSelected(s->getName()); | 
|---|
| 123 | } | 
|---|
| 124 |  | 
|---|
| 125 | int ShapeRegistry::countSelectedShapes() const | 
|---|
| 126 | { | 
|---|
| 127 | size_t count = 0; | 
|---|
| 128 | for (const_iterator iter = selectedShapes.begin(); iter != selectedShapes.end(); ++iter) | 
|---|
| 129 | count++; | 
|---|
| 130 | return count; | 
|---|
| 131 | } | 
|---|
| 132 |  | 
|---|
| 133 | std::vector<Shape*> ShapeRegistry::getSelectedShapes() const | 
|---|
| 134 | { | 
|---|
| 135 | std::vector<Shape*> returnShapes; | 
|---|
| 136 | returnShapes.resize(countSelectedShapes()); | 
|---|
| 137 | int count = 0; | 
|---|
| 138 | for (const_iterator iter = selectedShapes.begin(); iter != selectedShapes.end(); ++iter) | 
|---|
| 139 | returnShapes[count++] = iter->second; | 
|---|
| 140 | return returnShapes; | 
|---|
| 141 | } | 
|---|
| 142 |  | 
|---|
| 143 | ShapeRegistry::~ShapeRegistry() | 
|---|
| 144 | { | 
|---|
| 145 | cleanup(); | 
|---|
| 146 | } | 
|---|
| 147 |  | 
|---|
| 148 | std::string ShapeRegistry::getDefaultNameForShape(Shape s) const | 
|---|
| 149 | { | 
|---|
| 150 | std::string baseName = ShapeFactory::getInstance().getShapeName(s.getType()); | 
|---|
| 151 | int n = 1; | 
|---|
| 152 | while(true){ | 
|---|
| 153 | std::string name = baseName + toString(n); | 
|---|
| 154 | if (!isPresentByName(name)) | 
|---|
| 155 | return name; | 
|---|
| 156 | n ++; | 
|---|
| 157 | } | 
|---|
| 158 | return ""; | 
|---|
| 159 | } | 
|---|
| 160 |  | 
|---|
| 161 | void ShapeRegistry::addShape(Shape s) | 
|---|
| 162 | { | 
|---|
| 163 | OBSERVE; | 
|---|
| 164 | Shape *instance = new Shape(s); | 
|---|
| 165 | registerInstance(instance); | 
|---|
| 166 | _lastchanged = instance; | 
|---|
| 167 | NOTIFY(ShapeInserted); | 
|---|
| 168 | } | 
|---|
| 169 |  | 
|---|
| 170 | void ShapeRegistry::removeShape(const std::string &name) | 
|---|
| 171 | { | 
|---|
| 172 | selectedShapes.erase(name); | 
|---|
| 173 | Shape *instance = getByName(name); | 
|---|
| 174 | { | 
|---|
| 175 | OBSERVE; | 
|---|
| 176 | _lastchanged = instance; | 
|---|
| 177 | NOTIFY(ShapeRemoved); | 
|---|
| 178 | } | 
|---|
| 179 | unregisterInstance(instance); | 
|---|
| 180 | delete(instance); | 
|---|
| 181 | } | 
|---|
| 182 |  | 
|---|
| 183 | CONSTRUCT_SINGLETON(ShapeRegistry) | 
|---|
| 184 | CONSTRUCT_REGISTRY(Shape) | 
|---|