Debian Codegraph @

Source/Reasoner/Query/CIndividualSynsetsResult.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 "CIndividualSynsetsResult.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Query {
29
30
31 CIndividualSynsetsResult::CIndividualSynsetsResult() {
32 }
33
34
35
36 CIndividualSynsetsResult::~CIndividualSynsetsResult() {
37 qDeleteAll(mIndividualSynsetContainer);
38 }
39
40
41 CIndividualSynsetResult *CIndividualSynsetsResult::getIndividualSynset(const QString &individualName, bool create) {
42 CIndividualSynsetResult *individualSynset = mIndividualIndividualSynsetHash.value(individualName,0);
43 if (!individualSynset && create) {
44 individualSynset = new CIndividualSynsetResult(individualName);
45 mIndividualIndividualSynsetHash.insert(individualName,individualSynset);
46 mIndividualSynsetContainer.append(individualSynset);
47 }
48 return individualSynset;
49 }
50
51 CIndividualSynsetResult *CIndividualSynsetsResult::getIndividualSynset(const QStringList &individualNames, bool create) {
52 CIndividualSynsetResult *individualSynset = 0;
53 if (!individualNames.isEmpty()) {
54 individualSynset = mIndividualIndividualSynsetHash.value(individualNames.first(),0);
55 if (!individualSynset && create) {
56 individualSynset = new CIndividualSynsetResult(individualNames);
57 foreach (QString individualName, individualNames) {
58 mIndividualIndividualSynsetHash.insert(individualName,individualSynset);
59 }
60 mIndividualSynsetContainer.append(individualSynset);
61 }
62 }
63 return individualSynset;
64 }
65
66 CIndividualSynsetResult *CIndividualSynsetsResult::addIndividualSynset(CIndividualSynsetResult *takeIndividualSynset) {
67 foreach (QString individualName, takeIndividualSynset->getEquivalentIndividualNameList()) {
68 mIndividualIndividualSynsetHash.insert(individualName,takeIndividualSynset);
69 }
70 mIndividualSynsetContainer.append(takeIndividualSynset);
71 return takeIndividualSynset;
72 }
73
74 QList<CIndividualSynsetResult*>* CIndividualSynsetsResult::getIndividualSynsetList() {
75 return &mIndividualSynsetContainer;
76 }
77
78
79 QString CIndividualSynsetsResult::getQueryResultString() {
80 QString string;
81 return string;
82 }
83
84
85 bool CIndividualSynsetsResult::isResultEquivalentTo(CQueryResult *otherQueryResult) {
86 if (!otherQueryResult) {
87 return false;
88 }
89 CIndividualSynsetsResult *otherIndividualSynsets = dynamic_cast<CIndividualSynsetsResult *>(otherQueryResult);
90 if (!otherIndividualSynsets) {
91 return false;
92 }
93
94 if (mIndividualIndividualSynsetHash.count() != otherIndividualSynsets->mIndividualIndividualSynsetHash.count()) {
95 return false;
96 }
97
98 for (QList<CIndividualSynsetResult*>::const_iterator it = mIndividualSynsetContainer.constBegin(), itEnd = mIndividualSynsetContainer.constEnd(); it != itEnd; ++it) {
99 CIndividualSynsetResult* individualSynRes(*it);
100 CIndividualSynsetResult* otherIndividualSynRes = nullptr;
101 QStringList individualNameList(individualSynRes->getEquivalentIndividualNameList());
102 if (!individualNameList.isEmpty()) {
103 const QString& individualName = individualNameList.first();
104 otherIndividualSynRes = otherIndividualSynsets->mIndividualIndividualSynsetHash.value(individualName);
105 }
106 if (!otherIndividualSynRes && !individualNameList.isEmpty()) {
107 return false;
108 }
109 if (!individualSynRes->isResultEquivalentTo(otherIndividualSynRes)) {
110 return false;
111 }
112 }
113 return true;
114 }
115
116
117 }; // end namespace Query
118
119 }; // end namespace Reasoner
120
121 }; // end namespace Konclude