/*
* 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 .
*
*/
#include "COccurrenceUnsatisfiableCacheWriter.h"
namespace Konclude {
namespace Reasoner {
namespace Kernel {
namespace Cache {
COccurrenceUnsatisfiableCacheWriter::COccurrenceUnsatisfiableCacheWriter(COccurrenceUnsatisfiableCache *unsatisfiableCache) {
cache = unsatisfiableCache;
}
COccurrenceUnsatisfiableCacheWriter::~COccurrenceUnsatisfiableCacheWriter() {
}
void COccurrenceUnsatisfiableCacheWriter::setUnsatisfiable(QList &itemList) {
cache->addUnsatisfiableCacheEntry(itemList);
}
void COccurrenceUnsatisfiableCacheWriter::setUnsatisfiable(QVector &itemVec, qint64 count, QVector &clashVec, qint64 clashCount) {
if (clashCount > 0) {
QList itemList;
for (qint64 i = 0; i < clashCount; ++i) {
itemList.append(clashVec[i]);
}
setUnsatisfiable(itemList);
}
}
}; // end namespace Cache
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude