Debian Codegraph @

Source/Reasoner/Query/CIndividualSynsetResult.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 "CIndividualSynsetResult.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Query {
29
30
31 CIndividualSynsetResult::CIndividualSynsetResult() {
32 }
33
34 CIndividualSynsetResult::CIndividualSynsetResult(const QString &individualName) {
35 addEquivalentIndividualName(individualName);
36 }
37
38 CIndividualSynsetResult::CIndividualSynsetResult(const QStringList &individualNameList) {
39 addEquivalentIndividualNames(individualNameList);
40 }
41
42
43 CIndividualSynsetResult::~CIndividualSynsetResult() {
44 }
45
46
47 QStringList CIndividualSynsetResult::getEquivalentIndividualNameList() {
48 return eqIndividualNameList;
49 }
50
51 CIndividualSynsetResult *CIndividualSynsetResult::addEquivalentIndividualName(const QString &individualName) {
52 eqIndividualNameList.append(individualName);
53 return this;
54 }
55
56 CIndividualSynsetResult *CIndividualSynsetResult::addEquivalentIndividualNames(const QStringList &individualNameList) {
57 eqIndividualNameList += individualNameList;
58 return this;
59 }
60
61 qint64 CIndividualSynsetResult::getIndividualCount() {
62 return eqIndividualNameList.count();
63 }
64
65
66 bool CIndividualSynsetResult::hasIndividualName(const QString &individualName) {
67 return eqIndividualNameList.contains(individualName);
68 }
69
70 bool CIndividualSynsetResult::hasIndividualNames(const QStringList &individualNameList) {
71 QStringList remEqIndividualNameList(eqIndividualNameList);
72 foreach (QString individualName, individualNameList) {
73 bool contained = false;
74 for (qint64 cnt = remEqIndividualNameList.count(); cnt > 0; --cnt) {
75 contained |= remEqIndividualNameList.first() == individualName;
76 if (contained) {
77 remEqIndividualNameList.takeFirst();
78 break;
79 } else {
80 remEqIndividualNameList.append(remEqIndividualNameList.takeFirst());
81 }
82 }
83 if (!contained) {
84 return false;
85 }
86 }
87 return true;
88 }
89
90 QString CIndividualSynsetResult::getQueryResultString() {
91 QString individualNames = eqIndividualNameList.join(", ");
92 if (eqIndividualNameList.count() > 1) {
93 return QString("Equivalent Individual Set '%1'").arg(individualNames);
94 } else if (eqIndividualNameList.count() > 0) {
95 return QString("Individual '%1'").arg(individualNames);
96 } else {
97 return QString("Empty Individual Set");
98 }
99 }
100
101 bool CIndividualSynsetResult::isResultEquivalentTo(CQueryResult *otherQueryResult) {
102 if (!otherQueryResult) {
103 return false;
104 }
105 CIndividualSynsetResult *otherIndividualSynset = dynamic_cast<CIndividualSynsetResult *>(otherQueryResult);
106 if (!otherIndividualSynset) {
107 return false;
108 }
109 if (getIndividualCount() != otherIndividualSynset->getIndividualCount()) {
110 return false;
111 }
112 if (!hasIndividualNames(otherIndividualSynset->getEquivalentIndividualNameList())) {
113 return false;
114 }
115 return true;
116 }
117
118
119 }; // end namespace Query
120
121 }; // end namespace Reasoner
122
123 }; // end namespace Konclude