1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
/*
* Copyright (C) 2013, 2014, 2015 by the Konclude Developer Team.
*
* This file is part of the reasoning system Konclude.
* For details and support, see <http://konclude.com/>.
*
* Konclude is free software: you can redistribute it and/or modify it under
* the terms of version 2.1 of the GNU Lesser General Public License (LGPL2.1)
* as published by the Free Software Foundation.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Konclude. If not, see <http://www.gnu.org/licenses/>.
*
* 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. For more
* details, see GNU Lesser General Public License.
*
*/
#include "CIndividualSynsetsResult.h"
namespace Konclude {
namespace Reasoner {
namespace Query {
CIndividualSynsetsResult::CIndividualSynsetsResult() {
}
CIndividualSynsetsResult::~CIndividualSynsetsResult() {
qDeleteAll(mIndividualSynsetContainer);
}
CIndividualSynsetResult *CIndividualSynsetsResult::getIndividualSynset(const QString &individualName, bool create) {
CIndividualSynsetResult *individualSynset = mIndividualIndividualSynsetHash.value(individualName,0);
if (!individualSynset && create) {
individualSynset = new CIndividualSynsetResult(individualName);
mIndividualIndividualSynsetHash.insert(individualName,individualSynset);
mIndividualSynsetContainer.append(individualSynset);
}
return individualSynset;
}
CIndividualSynsetResult *CIndividualSynsetsResult::getIndividualSynset(const QStringList &individualNames, bool create) {
CIndividualSynsetResult *individualSynset = 0;
if (!individualNames.isEmpty()) {
individualSynset = mIndividualIndividualSynsetHash.value(individualNames.first(),0);
if (!individualSynset && create) {
individualSynset = new CIndividualSynsetResult(individualNames);
foreach (QString individualName, individualNames) {
mIndividualIndividualSynsetHash.insert(individualName,individualSynset);
}
mIndividualSynsetContainer.append(individualSynset);
}
}
return individualSynset;
}
CIndividualSynsetResult *CIndividualSynsetsResult::addIndividualSynset(CIndividualSynsetResult *takeIndividualSynset) {
foreach (QString individualName, takeIndividualSynset->getEquivalentIndividualNameList()) {
mIndividualIndividualSynsetHash.insert(individualName,takeIndividualSynset);
}
mIndividualSynsetContainer.append(takeIndividualSynset);
return takeIndividualSynset;
}
QList<CIndividualSynsetResult*>* CIndividualSynsetsResult::getIndividualSynsetList() {
return &mIndividualSynsetContainer;
}
QString CIndividualSynsetsResult::getQueryResultString() {
QString string;
return string;
}
bool CIndividualSynsetsResult::isResultEquivalentTo(CQueryResult *otherQueryResult) {
if (!otherQueryResult) {
return false;
}
CIndividualSynsetsResult *otherIndividualSynsets = dynamic_cast<CIndividualSynsetsResult *>(otherQueryResult);
if (!otherIndividualSynsets) {
return false;
}
if (mIndividualIndividualSynsetHash.count() != otherIndividualSynsets->mIndividualIndividualSynsetHash.count()) {
return false;
}
for (QList<CIndividualSynsetResult*>::const_iterator it = mIndividualSynsetContainer.constBegin(), itEnd = mIndividualSynsetContainer.constEnd(); it != itEnd; ++it) {
CIndividualSynsetResult* individualSynRes(*it);
CIndividualSynsetResult* otherIndividualSynRes = nullptr;
QStringList individualNameList(individualSynRes->getEquivalentIndividualNameList());
if (!individualNameList.isEmpty()) {
const QString& individualName = individualNameList.first();
otherIndividualSynRes = otherIndividualSynsets->mIndividualIndividualSynsetHash.value(individualName);
}
if (!otherIndividualSynRes && !individualNameList.isEmpty()) {
return false;
}
if (!individualSynRes->isResultEquivalentTo(otherIndividualSynRes)) {
return false;
}
}
return true;
}
}; // end namespace Query
}; // end namespace Reasoner
}; // end namespace Konclude
|
