/* * 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 "CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourData.h" namespace Konclude { namespace Reasoner { namespace Kernel { namespace Cache { CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourData::CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourData() { mIndiIdLinker = nullptr; mCount = 0; } bool CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourData::visitNeighbourIndividualIds(function visitFunc) { bool continueVisiting = true; bool visited = false; for (CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourIndividualIdLinker* indiIdLinkerIt = mIndiIdLinker; continueVisiting && indiIdLinkerIt; indiIdLinkerIt = indiIdLinkerIt->getNext()) { cint64 indiId = indiIdLinkerIt->getIndividualId(); continueVisiting &= visitFunc(indiId); visited = true; } return visited; } bool CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourData::visitNeighbourIndividualIdsFromCursor(function visitFunc, cint64 cursor) { bool continueVisiting = true; bool visited = false; CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourIndividualIdLinker* indiIdLinkerIt = (CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourIndividualIdLinker*)cursor; if (!indiIdLinkerIt) { indiIdLinkerIt = mIndiIdLinker; } else { indiIdLinkerIt = indiIdLinkerIt->getNext(); } while (continueVisiting && indiIdLinkerIt) { cint64 indiId = indiIdLinkerIt->getIndividualId(); continueVisiting &= visitFunc(indiId, (cint64)indiIdLinkerIt); indiIdLinkerIt = indiIdLinkerIt->getNext(); visited = true; } return visited; } CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourIndividualIdLinker* CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourData::getIndividualIdLinker() { return mIndiIdLinker; } CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourData* CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourData::incIndividualCount(cint64 count) { mCount += count; return this; } CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourData* CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourData::decIndividualCount(cint64 count) { mCount -= count; return this; } CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourData* CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourData::setIndividualIdLinker(CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourIndividualIdLinker* indiIdLinker, bool updateCounter) { mIndiIdLinker = indiIdLinker; if (updateCounter) { mCount = mIndiIdLinker->getCount(); } return this; } CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourData* CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourData::addIndividualIdLinker(CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourIndividualIdLinker* indiIdLinker, bool incCounter) { if (incCounter) { mCount += indiIdLinker->getCount(); } mIndiIdLinker = indiIdLinker->append(mIndiIdLinker); return this; } cint64 CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourData::getIndividualCount() { return mCount; } }; // end namespace Cache }; // end namespace Kernel }; // end namespace Reasoner }; // end namespace Konclude