[8387e0] | 1 | /*
|
---|
| 2 | * FragmentNode.hpp
|
---|
| 3 | *
|
---|
| 4 | * Created on: Sep 24, 2012
|
---|
| 5 | * Author: heber
|
---|
| 6 | */
|
---|
| 7 |
|
---|
| 8 | #ifndef FRAGMENTNODE_HPP_
|
---|
| 9 | #define FRAGMENTNODE_HPP_
|
---|
| 10 |
|
---|
| 11 | // include config.h
|
---|
| 12 | #ifdef HAVE_CONFIG_H
|
---|
| 13 | #include <config.h>
|
---|
| 14 | #endif
|
---|
| 15 |
|
---|
[67db80] | 16 | #include <boost/serialization/export.hpp>
|
---|
| 17 |
|
---|
[8387e0] | 18 | #include <iosfwd>
|
---|
| 19 |
|
---|
| 20 | /** FragmentNode contains all information important to homology considerations
|
---|
| 21 | * between fragments.
|
---|
| 22 | *
|
---|
| 23 | * This is important to answer whether to fragments have the same structure or
|
---|
| 24 | * not. Basically, the node simply represents an atom but without any index to
|
---|
| 25 | * make it indistinguishable from another atom having same number of bonds and
|
---|
| 26 | * same atomic number.
|
---|
| 27 | *
|
---|
| 28 | * Namely, we need:
|
---|
| 29 | * -# charge/atomic number of the node
|
---|
| 30 | * -# number of edges connected to this node
|
---|
| 31 | *
|
---|
| 32 | * Central is have this class be sortable by having comparison operators defined.
|
---|
| 33 | */
|
---|
| 34 | class FragmentNode
|
---|
| 35 | {
|
---|
| 36 | //!> grant output operator access to internals
|
---|
| 37 | friend std::ostream& operator<<(std::ostream &out, const FragmentNode &node);
|
---|
| 38 | public:
|
---|
| 39 | /** Default constructor for class FragmentNode.
|
---|
| 40 | *
|
---|
| 41 | * Is required to allow placement in STL containers.
|
---|
| 42 | */
|
---|
| 43 | FragmentNode() :
|
---|
| 44 | AtomicNumber(0),
|
---|
| 45 | ConnectedEdges(0)
|
---|
| 46 | {}
|
---|
| 47 |
|
---|
| 48 | /** Constructor for class FragmentNode.
|
---|
| 49 | *
|
---|
| 50 | * @param _AtomicNumber atomic number of represented atom
|
---|
| 51 | * @param _ConnectedEdges number of "bonds" of represented atom
|
---|
| 52 | */
|
---|
| 53 | FragmentNode(const size_t _AtomicNumber, const size_t _ConnectedEdges) :
|
---|
| 54 | AtomicNumber(_AtomicNumber),
|
---|
| 55 | ConnectedEdges(_ConnectedEdges)
|
---|
| 56 | {}
|
---|
| 57 | ~FragmentNode()
|
---|
| 58 | {}
|
---|
| 59 |
|
---|
| 60 | FragmentNode& operator=(const FragmentNode &node);
|
---|
| 61 |
|
---|
| 62 | // comparison operators to allow for sorting
|
---|
| 63 | bool operator<(const FragmentNode &node) const;
|
---|
| 64 | bool operator>(const FragmentNode &node) const;
|
---|
| 65 | bool operator==(const FragmentNode &node) const;
|
---|
| 66 | bool operator!=(const FragmentNode &node) const {
|
---|
| 67 | return (!(*this == node));
|
---|
| 68 | }
|
---|
| 69 |
|
---|
[e920d3d] | 70 | const size_t getAtomicNumber() const {
|
---|
| 71 | return AtomicNumber;
|
---|
| 72 | }
|
---|
| 73 |
|
---|
| 74 | const size_t getConnectedEdges() const {
|
---|
| 75 | return ConnectedEdges;
|
---|
| 76 | }
|
---|
| 77 |
|
---|
[8387e0] | 78 | private:
|
---|
| 79 | //!> the atomic number
|
---|
| 80 | const size_t AtomicNumber;
|
---|
| 81 | //!> number of connecting edges
|
---|
| 82 | const size_t ConnectedEdges;
|
---|
[67db80] | 83 |
|
---|
| 84 | private:
|
---|
| 85 | friend class boost::serialization::access;
|
---|
| 86 | // serialization
|
---|
| 87 | template <typename Archive>
|
---|
| 88 | void serialize(Archive& ar, const unsigned int version)
|
---|
| 89 | {
|
---|
| 90 | ar & const_cast<size_t &>(AtomicNumber);
|
---|
| 91 | ar & const_cast<size_t &>(ConnectedEdges);
|
---|
| 92 | }
|
---|
[8387e0] | 93 | };
|
---|
| 94 |
|
---|
[67db80] | 95 | // we need to give this class a unique key for serialization
|
---|
| 96 | BOOST_CLASS_EXPORT_KEY(FragmentNode)
|
---|
| 97 |
|
---|
[8387e0] | 98 | std::ostream& operator<<(std::ostream &out, const FragmentNode &node);
|
---|
| 99 |
|
---|
| 100 | #endif /* FRAGMENTNODE_HPP_ */
|
---|