/*
* Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
*
* This file is part of the reasoning system Konclude.
* For details and support, see .
*
* 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 .
*
*/
#ifndef KONCLUDE_UTILITIES_CONTAINER_CSORTEDNEGLINKER_H
#define KONCLUDE_UTILITIES_CONTAINER_CSORTEDNEGLINKER_H
// Namespace includes
#include "ContainerSettings.h"
#include "CSortedLinker.h"
#include "CNegLinker.h"
// Library includes
// Other includes
// Logger includes
#include "Logger/CLogger.h"
namespace Konclude {
namespace Utilities {
namespace Container {
template class CNegLinkerOperatorCompareFunctor;
template
class CNegLinkerOperatorCompareFunctor {
public:
static inline bool sortedNegLinkerDataCompare(T* const & beforeData1, const bool& negation1, T* const & data2, const bool& negation2) {
return *beforeData1 <= *data2;
}
};
template
class CNegLinkerOperatorCompareFunctor {
public:
static inline bool sortedNegLinkerDataCompare(const T& beforeData1, const bool& negation1, const T& data2, const bool& negation2) {
return beforeData1 <= data2;
}
};
/*!
*
* \class CSortedNegLinkerBase
* \author Andreas Steigmiller
* \version 0.1
* \brief TODO
*
*/
template >
class CSortedNegLinkerBase : public CNegLinkerBase {
// public methods
public:
// Constructor
inline CSortedNegLinkerBase();
inline CSortedNegLinkerBase(const T& dataElement, bool negation = false, CSortedNegLinkerBase* nextLink = nullptr);
//! Destructor
inline ~CSortedNegLinkerBase();
S* insertSortedNextSorted(CSortedNegLinkerBase* nextLink);
S* insertNextSorted(CSortedNegLinkerBase* nextLink);
// protected methods
protected:
bool isSortedBeforeCompare(const T& checkData, const bool& checkNegation, const T& linkedData, const bool& linkedNegation) const;
// protected variables
protected:
// private methods
private:
// private variables
private:
};
/*!
*
* \class CSortedNegLinker
* \author Andreas Steigmiller
* \version 0.1
* \brief TODO
*
*/
template >
class CXSortedNegLinker : public CSortedNegLinkerBase,C> {
// public methods
public:
// Constructor
inline CXSortedNegLinker() : CSortedNegLinkerBase,C>() {};
inline CXSortedNegLinker(const T& dataElement, bool negation = false, CXSortedNegLinker* nextLink = nullptr) : CSortedNegLinkerBase,C>(dataElement,negation,nextLink) {};
//! Destructor
inline ~CXSortedNegLinker() {};
};
}; // end namespace Container
}; // end namespace Utilities
}; // end namespace Konclude
#include "CSortedNegLinker.cpp"
#endif // KONCLUDE_UTILITIES_CONTAINER_CSORTEDNEGLINKER_H