| [e776dc] | 1 | /*
 | 
|---|
 | 2 |  * Project: MoleCuilder
 | 
|---|
 | 3 |  * Description: creates and alters molecular systems
 | 
|---|
| [0aa122] | 4 |  * Copyright (C)  2012 University of Bonn. All rights reserved.
 | 
|---|
| [e776dc] | 5 |  * Please see the LICENSE file or "Copyright notice" in builder.cpp for details.
 | 
|---|
 | 6 |  */
 | 
|---|
 | 7 | 
 | 
|---|
 | 8 | /*
 | 
|---|
 | 9 |  * LinkedCell_Model_changeModel.cpp
 | 
|---|
 | 10 |  *
 | 
|---|
 | 11 |  *  Created on: Dec 20, 2011
 | 
|---|
 | 12 |  *      Author: heber
 | 
|---|
 | 13 |  */
 | 
|---|
 | 14 | 
 | 
|---|
 | 15 | // include config.h
 | 
|---|
 | 16 | #ifdef HAVE_CONFIG_H
 | 
|---|
 | 17 | #include <config.h>
 | 
|---|
 | 18 | #endif
 | 
|---|
 | 19 | 
 | 
|---|
 | 20 | #include "CodePatterns/MemDebug.hpp"
 | 
|---|
 | 21 | 
 | 
|---|
 | 22 | #include "LinkedCell_Model_changeModel.hpp"
 | 
|---|
 | 23 | 
 | 
|---|
| [54f3d1] | 24 | #include "CodePatterns/Log.hpp"
 | 
|---|
| [8c31865] | 25 | #include "CodePatterns/toString.hpp"
 | 
|---|
 | 26 | 
 | 
|---|
| [e776dc] | 27 | /** Constructor of LinkedCell_Model::changeModel.
 | 
|---|
 | 28 |  *
 | 
|---|
 | 29 |  */
 | 
|---|
 | 30 | LinkedCell::LinkedCell_Model::changeModel::changeModel(const double distance) :
 | 
|---|
 | 31 |     Observable(std::string("LinkedCell_Model("+toString(distance)+")::changeModel"))
 | 
|---|
 | 32 | {}
 | 
|---|
 | 33 | 
 | 
|---|
 | 34 | /** Destructor of LinkedCell_Model::changeModel.
 | 
|---|
 | 35 |  *
 | 
|---|
 | 36 |  */
 | 
|---|
 | 37 | LinkedCell::LinkedCell_Model::changeModel::~changeModel()
 | 
|---|
 | 38 | {
 | 
|---|
 | 39 |   // remove all remaining updates in the queue
 | 
|---|
 | 40 |   for (UpdateQueueMap::iterator iter = queue.begin();
 | 
|---|
 | 41 |       !queue.empty();
 | 
|---|
 | 42 |       iter = queue.begin()) {
 | 
|---|
 | 43 |     delete iter->second;
 | 
|---|
 | 44 |     queue.erase(iter);
 | 
|---|
 | 45 |   }
 | 
|---|
 | 46 | }
 | 
|---|
 | 47 | 
 | 
|---|
 | 48 | /** Adds an Update instance to the internal queue.
 | 
|---|
 | 49 |  *
 | 
|---|
 | 50 |  * @param Walker node which is the update object
 | 
|---|
 | 51 |  * @param _updateMethod bound function (to LinkedCell_Model instance) of the update function
 | 
|---|
 | 52 |  */
 | 
|---|
 | 53 | void LinkedCell::LinkedCell_Model::changeModel::addUpdate(
 | 
|---|
 | 54 |     const TesselPoint *Walker,
 | 
|---|
 | 55 |     const LinkedCell_Model::Update::PriorityLevel priority,
 | 
|---|
 | 56 |     boost::function<void (const TesselPoint *)> _updateMethod
 | 
|---|
 | 57 |     )
 | 
|---|
 | 58 | {
 | 
|---|
 | 59 |   UpdateQueueMap::iterator iter = queue.find(Walker);
 | 
|---|
 | 60 |   if (iter != queue.end()) {
 | 
|---|
 | 61 |     if(iter->second->getPriority() >= priority) {
 | 
|---|
 | 62 |       // replace present update with new one
 | 
|---|
 | 63 |       OBSERVE;
 | 
|---|
 | 64 |       delete iter->second;
 | 
|---|
 | 65 |       iter->second = new Update(_updateMethod, Walker, priority);
 | 
|---|
| [54f3d1] | 66 |     } else {
 | 
|---|
| [44f53e] | 67 |       LOG(2, "INFO: Rejecting update for LinkedCell_Model as higher prioritized one is present.");
 | 
|---|
| [e776dc] | 68 |     }
 | 
|---|
 | 69 |   } else {
 | 
|---|
 | 70 |     // insert new update
 | 
|---|
| [44f53e] | 71 |     LOG(2, "INFO: Placing new update into queue for LinkedCell_Model.");
 | 
|---|
| [e776dc] | 72 |     OBSERVE;
 | 
|---|
 | 73 |     queue.insert( std::make_pair(Walker, new Update(_updateMethod, Walker, priority)) );
 | 
|---|
 | 74 |   }
 | 
|---|
 | 75 | }
 | 
|---|
 | 76 | 
 | 
|---|
 | 77 | /** Empties changeModel::queue by performing all update functions.
 | 
|---|
 | 78 |  *
 | 
|---|
 | 79 |  */
 | 
|---|
 | 80 | void LinkedCell::LinkedCell_Model::changeModel::performUpdates()
 | 
|---|
 | 81 | {
 | 
|---|
| [44f53e] | 82 |   LOG(2, "INFO: Performing "+toString(queue.size())+" updates on LinkedCell_Model.");
 | 
|---|
| [e776dc] | 83 |   for (UpdateQueueMap::iterator iter = queue.begin();
 | 
|---|
 | 84 |       !queue.empty();
 | 
|---|
 | 85 |       iter = queue.begin()) {
 | 
|---|
| [44f53e] | 86 |     LOG(2, "INFO: Performing update ...");
 | 
|---|
| [e776dc] | 87 |     // perform update
 | 
|---|
 | 88 |     (*iter->second)();
 | 
|---|
 | 89 |     // remove update
 | 
|---|
 | 90 |     delete iter->second;
 | 
|---|
 | 91 |     queue.erase(iter);
 | 
|---|
 | 92 |   }
 | 
|---|
 | 93 | }
 | 
|---|