Debian Codegraph @

Source/Reasoner/Ontology/COntologyCoreConceptCyclesData.cpp

raw
1 /*
2 * Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
3 *
4 * This file is part of the reasoning system Konclude.
5 * For details and support, see <http://konclude.com/>.
6 *
7 * Konclude is free software: you can redistribute it and/or modify
8 * it under the terms of version 3 of the GNU Lesser General Public
9 * License (LGPLv3) as published by the Free Software Foundation.
10 *
11 * Konclude is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU (Lesser) General Public License for more details.
15 *
16 * You should have received a copy of the GNU (Lesser) General Public
17 * License along with Konclude. If not, see <http://www.gnu.org/licenses/>.
18 *
19 */
20
21 #include "COntologyCoreConceptCyclesData.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Ontology {
29
30
31 COntologyCoreConceptCyclesData::COntologyCoreConceptCyclesData(COntologyContext* ontoContext) : mContext(ontoContext),mConceptCycleHash(ontoContext),mCycleList(ontoContext) {
32 }
33
34 COntologyCoreConceptCyclesData::~COntologyCoreConceptCyclesData() {
35 }
36
37
38 CBOXHASH<TConceptNegPair,CConceptCycleData*>* COntologyCoreConceptCyclesData::getConceptCycleHash() {
39 return &mConceptCycleHash;
40 }
41 CBOXLIST<CConceptCycleData*>* COntologyCoreConceptCyclesData::getConceptCycleList() {
42 return &mCycleList;
43 }
44
45 cint64 COntologyCoreConceptCyclesData::getConceptCycleCount() {
46 return mCycleList.count();
47 }
48
49 COntologyCoreConceptCyclesData* COntologyCoreConceptCyclesData::installCycle(CConceptCycleData* cycleData) {
50 mCycleList.append(cycleData);
51 CBOXSET<TConceptNegPair>* conSet = cycleData->getCycleConceptSet();
52 for (CBOXSET<TConceptNegPair>::const_iterator it = conSet->constBegin(), itEnd = conSet->constEnd(); it != itEnd; ++it) {
53 TConceptNegPair conNegPair(*it);
54 mConceptCycleHash.insert(conNegPair,cycleData);
55 }
56 return this;
57 }
58
59
60 }; // end namespace Ontology
61
62 }; // end namespace Reasoner
63
64 }; // end namespace Konclude