1 | /*
|
---|
2 | * Project: MoleCuilder
|
---|
3 | * Description: creates and alters molecular systems
|
---|
4 | * Copyright (C) 2012 University of Bonn. All rights reserved.
|
---|
5 | * Please see the LICENSE file or "Copyright notice" in builder.cpp for details.
|
---|
6 | */
|
---|
7 |
|
---|
8 | /*
|
---|
9 | * Filler.cpp
|
---|
10 | *
|
---|
11 | * Created on: Jan 16, 2012
|
---|
12 | * Author: heber
|
---|
13 | */
|
---|
14 |
|
---|
15 |
|
---|
16 | // include config.h
|
---|
17 | #ifdef HAVE_CONFIG_H
|
---|
18 | #include <config.h>
|
---|
19 | #endif
|
---|
20 |
|
---|
21 | #include "CodePatterns/MemDebug.hpp"
|
---|
22 |
|
---|
23 | #include <algorithm>
|
---|
24 | #include <boost/bind.hpp>
|
---|
25 | #include <boost/lambda/lambda.hpp>
|
---|
26 | #include <sstream>
|
---|
27 | #include <vector>
|
---|
28 |
|
---|
29 | #include "Filler.hpp"
|
---|
30 |
|
---|
31 | #include "CodePatterns/Assert.hpp"
|
---|
32 | #include "CodePatterns/Log.hpp"
|
---|
33 |
|
---|
34 | #include "Atom/atom.hpp"
|
---|
35 | #include "ClusterInterface.hpp"
|
---|
36 | #include "Descriptors/AtomIdDescriptor.hpp"
|
---|
37 | #include "LinearAlgebra/Vector.hpp"
|
---|
38 | #include "NodeTypes.hpp"
|
---|
39 | #include "Predicates/FillPredicate.hpp"
|
---|
40 | #include "Predicates/Ops_FillPredicate.hpp"
|
---|
41 | #include "World.hpp"
|
---|
42 |
|
---|
43 |
|
---|
44 | /** Constructor for class Filler.
|
---|
45 | *
|
---|
46 | * \note We store inverted \a _predicate because we need it only for
|
---|
47 | * remove_copy_if which works in this inverted way as desired.
|
---|
48 | *
|
---|
49 | * @param mesh Mesh with a NodeSet that fills its Shape
|
---|
50 | * @param predicate predicate construct to check at each Node
|
---|
51 | */
|
---|
52 | Filler::Filler(const Mesh &_mesh, const FillPredicate &_predicate) :
|
---|
53 | mesh(_mesh),
|
---|
54 | predicate(!_predicate)
|
---|
55 | {}
|
---|
56 |
|
---|
57 | /** Destructor for class Filler.
|
---|
58 | *
|
---|
59 | */
|
---|
60 | Filler::~Filler()
|
---|
61 | {}
|
---|
62 |
|
---|
63 | /** Fill in the desired Cluster at each remaining node.
|
---|
64 | *
|
---|
65 | * \note The cluster is non-const because it is moved to the first vacant node.
|
---|
66 | *
|
---|
67 | * @param copyMethod functor that knows how to copy atoms.
|
---|
68 | * @param cluster set of atomic ids contained in a specific Shape to fill each Node with
|
---|
69 | */
|
---|
70 | void Filler::operator()(
|
---|
71 | CopyAtomsInterface ©Method,
|
---|
72 | ClusterInterface::Cluster_impl cluster) const
|
---|
73 | {
|
---|
74 | const NodeSet &nodes = mesh.getNodes();
|
---|
75 | std::stringstream output;
|
---|
76 | std::for_each( nodes.begin(), nodes.end(), output << boost::lambda::_1 << " ");
|
---|
77 | LOG(1, "INFO: Listing nodes to check: " << output.str());
|
---|
78 | if (nodes.size() == 0) {
|
---|
79 | ASSERT(false,
|
---|
80 | "Filler::operator() - Mesh contains no nodes.");
|
---|
81 | return;
|
---|
82 | }
|
---|
83 | NodeSet FillNodes(nodes.size(), zeroVec);
|
---|
84 |
|
---|
85 | // evaluate predicate and gather into new set
|
---|
86 | NodeSet::iterator transform_end =
|
---|
87 | std::remove_copy_if(nodes.begin(), nodes.end(), FillNodes.begin(), predicate );
|
---|
88 | FillNodes.erase(transform_end, FillNodes.end());
|
---|
89 |
|
---|
90 | if (FillNodes.size() == 0) {
|
---|
91 | LOG(1, "INFO: For none of the nodes did the predicate return true.");
|
---|
92 | return;
|
---|
93 | }
|
---|
94 |
|
---|
95 | // skip first node (as we must keep the original atoms)
|
---|
96 | NodeSet::iterator iter = ++FillNodes.begin();
|
---|
97 |
|
---|
98 | // fill all other true nodes
|
---|
99 | std::for_each(iter , FillNodes.end(),
|
---|
100 | boost::bind(&ClusterInterface::clone, boost::cref(cluster), boost::ref(copyMethod), _1) );
|
---|
101 |
|
---|
102 | // move cluster to first node
|
---|
103 | cluster->translate(*FillNodes.begin());
|
---|
104 | }
|
---|