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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
/*
* Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
*
* This file is part of the reasoning system Konclude.
* For details and support, see <http://konclude.com/>.
*
* Konclude is free software: you can redistribute it and/or modify
* it under the terms of version 3 of the GNU Lesser General Public
* License (LGPLv3) as published by the Free Software Foundation.
*
* Konclude 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 (Lesser) General Public License for more details.
*
* You should have received a copy of the GNU (Lesser) General Public
* License along with Konclude. If not, see <http://www.gnu.org/licenses/>.
*
*/
#ifndef KONCLUDE_UTILITIES_CONTAINER_CSORTEDLINKER_H
#define KONCLUDE_UTILITIES_CONTAINER_CSORTEDLINKER_H
// Namespace includes
#include "ContainerSettings.h"
#include "CLinker.h"
// Library includes
// Other includes
// Logger includes
#include "Logger/CLogger.h"
namespace Konclude {
namespace Utilities {
namespace Container {
template<class T> class CLinkerOperatorCompareFunctor;
template<class T>
class CLinkerOperatorCompareFunctor<T*> {
public:
static inline bool sortedLinkerDataCompare(T* const & beforeData1, T* const & data2) {
return *beforeData1 <= *data2;
}
};
template<class T>
class CLinkerOperatorCompareFunctor {
public:
static inline bool sortedLinkerDataCompare(const T& beforeData1, const T& data2) {
return beforeData1 <= data2;
}
};
/*!
*
* \class CSortedLinkerBase
* \author Andreas Steigmiller
* \version 0.1
* \brief TODO
*
*/
template<class T, class S, class C = CLinkerOperatorCompareFunctor<T> >
class CSortedLinkerBase : public CLinkerBase<T,S> {
// public methods
public:
// Constructor
inline CSortedLinkerBase();
inline CSortedLinkerBase(const T& dataElement, CSortedLinkerBase<T,S,C>* nextLink = nullptr);
//! Destructor
inline ~CSortedLinkerBase();
S* insertSortedNextSorted(CSortedLinkerBase<T,S,C>* nextLink);
S* insertNextSorted(CSortedLinkerBase<T,S,C>* nextLink);
// protected methods
protected:
bool isSortedBeforeCompare(const T& checkData, const T& linkedData) const;
// protected variables
protected:
// private methods
private:
// private variables
private:
};
/*!
*
* \class CSortedLinker
* \author Andreas Steigmiller
* \version 0.1
* \brief TODO
*
*/
template<class T, class C = CLinkerOperatorCompareFunctor<T> >
class CXSortedLinker : public CSortedLinkerBase<T,CXSortedLinker<T>,C> {
// public methods
public:
// Constructor
inline CXSortedLinker() : CSortedLinkerBase<T,CXSortedLinker<T>,C>() {};
inline CXSortedLinker(const T& dataElement, CXSortedLinker<T,C>* nextLink = nullptr) : CSortedLinkerBase<T,CXSortedLinker<T>,C>(dataElement,nextLink) {};
//! Destructor
inline ~CXSortedLinker() {};
};
}; // end namespace Container
}; // end namespace Utilities
}; // end namespace Konclude
#include "CSortedLinker.cpp"
#endif // KONCLUDE_UTILITIES_CONTAINER_CSORTEDLINKER_H
|
