/* * 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_CNEGLINKER_H #define KONCLUDE_UTILITIES_CNEGLINKER_H // Libraries includes // Namespace includes // Other includes // Logger includes #include "Logger/CLogger.h" using namespace Konclude::Logger; namespace Konclude { namespace Utilities { /*! * * \class CNegLinker * \author Andreas Steigmiller * \version 0.1 * \brief TODO * */ template class CNegLinker { // public methods public: //! Constructor CNegLinker(); CNegLinker(T dataElement, bool isNegated = false, CNegLinker *nextLink = 0); //! Destructor virtual ~CNegLinker(); CNegLinker *init(T dataElement, bool isNegated = false, CNegLinker *nextLink = 0); bool hasNext(); CNegLinker *setNext(CNegLinker *nextLink); CNegLinker *getNext(); T getData(); CNegLinker *setData(T dataElement); bool isNegated(); CNegLinker *setNegated(bool isNegated); CNegLinker *prepend(CNegLinker *prependingList); CNegLinker *append(CNegLinker *appendingList); CNegLinker *removeNext(); CNegLinker *getLastListLink(); // protected methods protected: // private methods private: // private variables private: CNegLinker *next; T data; bool negated; }; template CNegLinker::CNegLinker() { next = 0; negated = false; } template CNegLinker::CNegLinker(T dataElement, bool isNegated, CNegLinker *nextLink) { next = nextLink; negated = isNegated; data = dataElement; } template CNegLinker *CNegLinker::init(T dataElement, bool isNegated, CNegLinker *nextLink) { next = nextLink; negated = isNegated; data = dataElement; } template CNegLinker::~CNegLinker() { } template bool CNegLinker::hasNext() { return next != 0; } template CNegLinker *CNegLinker::setNext(CNegLinker *nextLink) { next = nextLink; return this; } template CNegLinker *CNegLinker::getNext() { return next; } template T CNegLinker::getData() { return data; } template CNegLinker *CNegLinker::setData(T dataElement) { data = dataElement; return this; } template bool CNegLinker::isNegated() { return negated; } template CNegLinker *CNegLinker::setNegated(bool isNegated) { negated = isNegated; return this; } template CNegLinker *CNegLinker::prepend(CNegLinker *prependingList) { CNegLinker *last = prependingList->getLastListLink(); last->setNext(this); return prependingList; } template CNegLinker *CNegLinker::append(CNegLinker *appendingList) { CNegLinker *last = getLastListLink(); last->setNext(appendingList); return this; } template CNegLinker *CNegLinker::removeNext() { CNegLinker *tmpNext = next; if (next) { CNegLinker *tmpNextNext = next->next; next->next = 0; setNext(tmpNextNext); } return tmpNext; } template CNegLinker *CNegLinker::getLastListLink() { CNegLinker *lastListLink = this; while (lastListLink->hasNext()) { lastListLink = lastListLink->getNext(); } return lastListLink; } }; // end namespace Utilities }; // end namespace Konclude #endif // KONCLUDE_UTILITIES_CNEGLINKER_H