Debian Codegraph @

Source/Parser/Expressions/CPairExpressionAssociator.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 "CPairExpressionAssociator.h"
22
23
24 namespace Konclude {
25
26 namespace Parser {
27
28 namespace Expression {
29
30
31 CPairExpressionAssociator::CPairExpressionAssociator(CBuildExpression *expression1, CBuildExpression *expression2)
32 : mFirstExpression(expression1),mSecondExpression(expression2) {
33 }
34
35
36 CPairExpressionAssociator* CPairExpressionAssociator::setFirstExpression(CBuildExpression *expression1) {
37 mFirstExpression = expression1;
38 return this;
39 }
40
41 CBuildExpression *CPairExpressionAssociator::getFirstExpression() const {
42 return mFirstExpression;
43 }
44
45 CPairExpressionAssociator* CPairExpressionAssociator::setSecondExpression(CBuildExpression *expression2) {
46 mSecondExpression = expression2;
47 return this;
48 }
49
50 CBuildExpression *CPairExpressionAssociator::getSecondExpression() const {
51 return mSecondExpression;
52 }
53
54
55
56 cint64 CPairExpressionAssociator::getStructuralHashValue() {
57 cint64 hashValue = 0;
58 cint64 tmpValue1 = 0;
59 cint64 tmpValue2 = 1;
60 if (mFirstExpression) {
61 tmpValue1 += cint64(mFirstExpression);
62 tmpValue2 *= cint64(mFirstExpression);
63 }
64 if (mSecondExpression) {
65 tmpValue1 += cint64(mSecondExpression);
66 tmpValue2 *= cint64(mSecondExpression);
67 }
68 hashValue = tmpValue1*tmpValue2;
69 return hashValue;
70 }
71
72 bool CPairExpressionAssociator::compareStructuralEquivalence(const CPairExpressionAssociator& pairExpressionAssociator) {
73 if (mFirstExpression != pairExpressionAssociator.mFirstExpression) {
74 if (mFirstExpression != pairExpressionAssociator.mSecondExpression) {
75 return false;
76 }
77 if (mSecondExpression != pairExpressionAssociator.mFirstExpression) {
78 return false;
79 }
80 } else {
81 if (mSecondExpression != pairExpressionAssociator.mSecondExpression) {
82 return false;
83 }
84 }
85 return true;
86 }
87
88 bool CPairExpressionAssociator::visitSubExpressions(CBuildExpression* expression, CSubExpressionVisitor* subExpressionVisitor) {
89 if (subExpressionVisitor) {
90 if (mFirstExpression) {
91 subExpressionVisitor->visitSubExpression(expression,mFirstExpression,subExpressionVisitor);
92 }
93 if (mSecondExpression) {
94 subExpressionVisitor->visitSubExpression(expression,mSecondExpression,subExpressionVisitor);
95 }
96 return true;
97 }
98 return false;
99 }
100
101
102
103 }; // end namespace Expression
104
105 }; // end namespace Parser
106
107 }; // end namespace Konclude