/
DisjointElement.h
91 lines (76 loc) · 2.54 KB
/
DisjointElement.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#ifndef MANTID_CRYSTAL_DISJOINTELEMENT_H_
#define MANTID_CRYSTAL_DISJOINTELEMENT_H_
#include "MantidKernel/System.h"
namespace Mantid
{
namespace Crystal
{
/** DisjointElement : Cluster item used in a disjoint-set data structure.
Copyright © 2014 ISIS Rutherford Appleton Laboratory & NScD Oak Ridge National Laboratory
This file is part of Mantid.
Mantid is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
Mantid is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
File change history is stored at: <https://github.com/mantidproject/mantid>
Code Documentation is available at: <http://doxygen.mantidproject.org>
*/
class DLLExport DisjointElement
{
public:
/// Default constructor
DisjointElement();
/// Constructor
DisjointElement(const int id);
/// Destructor
virtual ~DisjointElement();
/// Get Id
int getId() const;
/// Get parent element
DisjointElement * getParent() const;
/// Get root id
int getRoot() const;
/// Union with other
void unionWith(DisjointElement* other);
/// Get the current rank
int getRank() const;
/// Increment the rank
int incrementRank();
/// Is empty.
bool isEmpty() const;
/// Copy constructor.
DisjointElement(const DisjointElement& other);
/// Assignment operator.
DisjointElement& operator=(const DisjointElement& other);
/// Less than
inline bool operator<(const DisjointElement& other) const
{
return m_id < other.getId();
}
/// Greater than
inline bool operator>(const DisjointElement& other) const
{
return m_id > other.getId();
}
private:
bool hasParent() const;
int compress();
void setParent(DisjointElement * other);
// Data members
/// Parent element
DisjointElement * m_parent;
/// Current rank
int m_rank;
/// Identifier
int m_id;
};
void unionElements(DisjointElement* a, DisjointElement* b);
} // namespace Crystal
} // namespace Mantid
#endif /* MANTID_CRYSTAL_DISJOINTELEMENT_H_ */