/*
* 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_CPP
#define KONCLUDE_UTILITIES_CONTAINER_CSORTEDNEGLINKER_CPP
#include "CSortedNegLinker.h"
namespace Konclude {
namespace Utilities {
namespace Container {
template
CSortedNegLinkerBase::CSortedNegLinkerBase() : CNegLinkerBase() {
}
template
CSortedNegLinkerBase::CSortedNegLinkerBase(const T& dataElement, bool negation, CSortedNegLinkerBase* nextLink) : CNegLinkerBase(dataElement,negation,nextLink) {
}
template
CSortedNegLinkerBase::~CSortedNegLinkerBase() {
}
template
S* CSortedNegLinkerBase::insertNextSorted(CSortedNegLinkerBase* nextLink) {
CSortedNegLinkerBase* firstLinker = this;
while (nextLink) {
CSortedNegLinkerBase* nIns = nextLink;
nextLink = nextLink->getNext();
nIns->setNext(nullptr);
CSortedNegLinkerBase* list = firstLinker;
CSortedNegLinkerBase* lastList = nullptr;
bool inserted = false;
const T& dataIns = nIns->getData();
bool dataInsNegated = nIns->isNegated();
while (list) {
const T& dataList = list->getData();
bool dataListNegated = list->isNegated();
// compare items
if (isSortedBeforeCompare(dataIns,dataInsNegated,dataList,dataListNegated)) {
if (lastList == nullptr){
firstLinker = nIns->insertNext(firstLinker);
} else {
lastList->insertNext(nIns);
}
inserted = true;
break;
}
lastList = list;
list = (CSortedNegLinkerBase*)list->next;
}
if (!inserted) {
lastList->insertNext(nIns);
}
}
return (S*)firstLinker;
}
template
S* CSortedNegLinkerBase::insertSortedNextSorted(CSortedNegLinkerBase* nextLink) {
// items from nextLink are already sorted!
CSortedNegLinkerBase* firstLinker = this;
CSortedNegLinkerBase* list = firstLinker;
CSortedNegLinkerBase* lastList = nullptr;
while (nextLink) {
CSortedNegLinkerBase* nIns = nextLink;
nextLink = nextLink->getNext();
nIns->setNext(nullptr);
bool inserted = false;
const T& dataIns = nIns->getData();
bool dataInsNegated = nIns->isNegated();
while (list) {
const T& dataList = list->getData();
bool dataListNegated = list->isNegated();
if (isSortedBeforeCompare(dataIns,dataInsNegated,dataList,dataListNegated)) {
if (lastList == 0){
firstLinker = nIns->insertNext(firstLinker);
list = (CSortedNegLinkerBase*)firstLinker->next;
lastList = firstLinker;
} else {
lastList->insertNext(nIns);
lastList = (CSortedNegLinkerBase*)lastList->next;
// list is already on the correct position
}
inserted = true;
break;
}
lastList = list;
list = (CSortedNegLinkerBase*)list->next;
}
if (!inserted) {
lastList->insertNext(nIns);
lastList = nIns;
}
}
return (S*)firstLinker;
}
template
bool CSortedNegLinkerBase::isSortedBeforeCompare(const T& checkData, const bool& checkNegation, const T& linkedData, const bool& linkedNegation) const {
return C::sortedNegLinkerDataCompare(checkData,checkNegation,linkedData,linkedNegation);
}
}; // end namespace Container
}; // end namespace Utilities
}; // end namespace Konclude
#endif // KONCLUDE_UTILITIES_CONTAINER_CSORTEDNEGLINKER_CPP