/* * 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 "CCacheTestReader.h" namespace Konclude { namespace Test { CCacheTestReader::CCacheTestReader(COccurrenceUnsatisfiableCacheReader *occUnsatCacheReader) { reader = occUnsatCacheReader; testCount = 0; unsatCount = 0; } CCacheTestReader::~CCacheTestReader() { quit(); wait(); } void CCacheTestReader::startReader() { start(); moveToThread(this); } qint64 CCacheTestReader::getCacheReads() { return testCount; } void CCacheTestReader::run() { if (reader) { qint64 maxOntTag = 1; qint64 maxConTag = 100; qint64 maxCount = 20; while (true) { qint64 randOntTagNumber = rand() % maxOntTag; qint64 randCount = rand() % maxCount; QVector conTags(randCount,0); for (qint64 i = 0; i < randCount; ++i) { qint64 randConTagNumber = rand() % maxConTag; conTags[i] = randConTagNumber; } qSort(conTags); QVector values; for (qint64 i = 0; i < randCount; ++i) { values.append(CCacheValue(conTags[i],randOntTagNumber,CCacheValue::CACHEVALCONCEPTONTOLOGYTAG)); } values.append(CCacheValue(0,0,CCacheValue::CACHEVALUETERMINATOR)); testCount++; if (reader->isUnsatisfiable(values,values.count())) { unsatCount++; } } } } }; // end namespace Test }; // end namespace Konclude