[d505a3] | 1 | /*
|
---|
| 2 | * Filler.hpp
|
---|
| 3 | *
|
---|
| 4 | * Created on: Jan 16, 2012
|
---|
| 5 | * Author: heber
|
---|
| 6 | */
|
---|
| 7 |
|
---|
| 8 | #ifndef FILLER_HPP_
|
---|
| 9 | #define FILLER_HPP_
|
---|
| 10 |
|
---|
| 11 |
|
---|
| 12 | // include config.h
|
---|
| 13 | #ifdef HAVE_CONFIG_H
|
---|
| 14 | #include <config.h>
|
---|
| 15 | #endif
|
---|
| 16 |
|
---|
[42b6de] | 17 | #include <vector>
|
---|
| 18 |
|
---|
[d505a3] | 19 | #include "Cluster.hpp"
|
---|
| 20 | #include "Predicates/FillPredicate.hpp"
|
---|
| 21 | #include "Mesh/Mesh.hpp"
|
---|
| 22 | #include "NodeTypes.hpp"
|
---|
| 23 |
|
---|
| 24 | class CopyAtomsInterface;
|
---|
| 25 | class FillPredicate;
|
---|
[901d87] | 26 | class Inserter;
|
---|
[d505a3] | 27 | class Mesh;
|
---|
| 28 |
|
---|
| 29 | /** This class operators on a set of nodes (Vector's), checks which fulfill some
|
---|
| 30 | * given predicate, and fills these position with a given molecule lateron.
|
---|
| 31 | *
|
---|
| 32 | */
|
---|
| 33 | class Filler
|
---|
| 34 | {
|
---|
| 35 | public:
|
---|
[42b6de] | 36 | /** Constructor for class Filler.
|
---|
| 37 | *
|
---|
| 38 | * \note We store inverted \a _predicate because we need it only for
|
---|
| 39 | * remove_copy_if which works in this inverted way as desired.
|
---|
| 40 | *
|
---|
| 41 | * @param _mesh Mesh with a NodeSet that fills its Shape
|
---|
| 42 | * @param _predicate predicate construct to check at each Node
|
---|
| 43 | * @param _inserter inserter which places the cloned cluster
|
---|
| 44 | */
|
---|
[901d87] | 45 | Filler(const Mesh &_mesh, const FillPredicate &_predicate, const Inserter &_inserter);
|
---|
[42b6de] | 46 |
|
---|
| 47 | /** Destructor for class Filler.
|
---|
| 48 | *
|
---|
| 49 | */
|
---|
[d505a3] | 50 | ~Filler();
|
---|
| 51 |
|
---|
[42b6de] | 52 | //!> typedef Vector of clusters as return type for operator()
|
---|
| 53 | typedef std::vector<ClusterInterface::Cluster_impl> ClusterVector_t;
|
---|
| 54 |
|
---|
| 55 | /** Fill in the desired Cluster at each remaining node.
|
---|
| 56 | *
|
---|
| 57 | * \note The cluster is non-const because it is moved to the first vacant node.
|
---|
| 58 | *
|
---|
| 59 | * @param copyMethod functor that knows how to copy atoms.
|
---|
| 60 | * @param cluster set of atomic ids contained in a specific Shape to fill each Node with
|
---|
| 61 | * @param ClonedClusters reference to vector of clusters, that is filled with created clones
|
---|
| 62 | * @return true - all clusters inserted succesfully, else - insertion failed
|
---|
| 63 | */
|
---|
| 64 | bool operator()(CopyAtomsInterface ©Method, ClusterInterface::Cluster_impl cluster, ClusterVector_t &ClonedClusters) const;
|
---|
[d505a3] | 65 |
|
---|
| 66 | private:
|
---|
[42b6de] | 67 |
|
---|
[d505a3] | 68 | //!> mesh is the set of points filling a Shape
|
---|
| 69 | const Mesh mesh;
|
---|
| 70 | //!> the predicate is evaluted whether a Node in the NodeSet of mesh is filled or not
|
---|
| 71 | const FillPredicate predicate;
|
---|
[901d87] | 72 | //!> Inserter function to allow for some changes when placing the cluster at the node
|
---|
| 73 | const Inserter &inserter;
|
---|
[d505a3] | 74 | };
|
---|
| 75 |
|
---|
| 76 |
|
---|
| 77 | #endif /* FILLER_HPP_ */
|
---|