1 | /*
|
---|
2 | * Project: MoleCuilder
|
---|
3 | * Description: creates and alters molecular systems
|
---|
4 | * Copyright (C) 2011 University of Bonn. All rights reserved.
|
---|
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 |
|
---|
24 | #include "CodePatterns/toString.hpp"
|
---|
25 |
|
---|
26 | /** Constructor of LinkedCell_Model::changeModel.
|
---|
27 | *
|
---|
28 | */
|
---|
29 | LinkedCell::LinkedCell_Model::changeModel::changeModel(const double distance) :
|
---|
30 | Observable(std::string("LinkedCell_Model("+toString(distance)+")::changeModel"))
|
---|
31 | {}
|
---|
32 |
|
---|
33 | /** Destructor of LinkedCell_Model::changeModel.
|
---|
34 | *
|
---|
35 | */
|
---|
36 | LinkedCell::LinkedCell_Model::changeModel::~changeModel()
|
---|
37 | {
|
---|
38 | // remove all remaining updates in the queue
|
---|
39 | for (UpdateQueueMap::iterator iter = queue.begin();
|
---|
40 | !queue.empty();
|
---|
41 | iter = queue.begin()) {
|
---|
42 | delete iter->second;
|
---|
43 | queue.erase(iter);
|
---|
44 | }
|
---|
45 | }
|
---|
46 |
|
---|
47 | /** Adds an Update instance to the internal queue.
|
---|
48 | *
|
---|
49 | * @param Walker node which is the update object
|
---|
50 | * @param _updateMethod bound function (to LinkedCell_Model instance) of the update function
|
---|
51 | */
|
---|
52 | void LinkedCell::LinkedCell_Model::changeModel::addUpdate(
|
---|
53 | const TesselPoint *Walker,
|
---|
54 | const LinkedCell_Model::Update::PriorityLevel priority,
|
---|
55 | boost::function<void (const TesselPoint *)> _updateMethod
|
---|
56 | )
|
---|
57 | {
|
---|
58 | UpdateQueueMap::iterator iter = queue.find(Walker);
|
---|
59 | if (iter != queue.end()) {
|
---|
60 | if(iter->second->getPriority() >= priority) {
|
---|
61 | // replace present update with new one
|
---|
62 | OBSERVE;
|
---|
63 | delete iter->second;
|
---|
64 | iter->second = new Update(_updateMethod, Walker, priority);
|
---|
65 | }
|
---|
66 | } else {
|
---|
67 | // insert new update
|
---|
68 | OBSERVE;
|
---|
69 | queue.insert( std::make_pair(Walker, new Update(_updateMethod, Walker, priority)) );
|
---|
70 | }
|
---|
71 | }
|
---|
72 |
|
---|
73 | /** Empties changeModel::queue by performing all update functions.
|
---|
74 | *
|
---|
75 | */
|
---|
76 | void LinkedCell::LinkedCell_Model::changeModel::performUpdates()
|
---|
77 | {
|
---|
78 | for (UpdateQueueMap::iterator iter = queue.begin();
|
---|
79 | !queue.empty();
|
---|
80 | iter = queue.begin()) {
|
---|
81 | // perform update
|
---|
82 | (*iter->second)();
|
---|
83 | // remove update
|
---|
84 | delete iter->second;
|
---|
85 | queue.erase(iter);
|
---|
86 | }
|
---|
87 | }
|
---|