Debian Codegraph @

Source/Reasoner/Answerer/COptimizedComplexVariableIndividualBindings.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 "COptimizedComplexVariableIndividualBindings.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Answerer {
29
30 COptimizedComplexVariableIndividualBindings::COptimizedComplexVariableIndividualBindings() {
31 mBindingSize = 0;
32 mBindingArray = nullptr;
33 }
34
35
36 COptimizedComplexVariableIndividualBindings::COptimizedComplexVariableIndividualBindings(cint64 bindingSize, TIndividualInstanceItemDataBinding* bindingArray) {
37 mBindingArray = bindingArray;
38 mBindingSize = bindingSize;
39 }
40
41 COptimizedComplexVariableIndividualBindings::COptimizedComplexVariableIndividualBindings(cint64 bindingSize) {
42 mBindingArray = nullptr;
43 mBindingSize = bindingSize;
44 initIndividualBindings(mBindingSize);
45 }
46
47 COptimizedComplexVariableIndividualBindings::COptimizedComplexVariableIndividualBindings(const COptimizedComplexVariableIndividualBindings& varBindings) {
48 mBindingArray = nullptr;
49 mBindingSize = varBindings.mBindingSize;
50 initIndividualBindings(mBindingSize);
51 for (cint64 i = 0; i < mBindingSize; ++i) {
52 mBindingArray[i] = varBindings.mBindingArray[i];
53 }
54 }
55
56
57
58 COptimizedComplexVariableIndividualBindings::~COptimizedComplexVariableIndividualBindings() {
59 delete[] mBindingArray;
60 }
61
62
63
64 COptimizedComplexVariableIndividualBindings* COptimizedComplexVariableIndividualBindings::initIndividualBindings(cint64 bindingSize) {
65 if (mBindingArray) {
66 delete[] mBindingArray;
67 }
68 mBindingArray = new TIndividualInstanceItemDataBinding[bindingSize];
69 mBindingSize = bindingSize;
70 return this;
71 }
72
73
74 COptimizedComplexVariableIndividualBindings* COptimizedComplexVariableIndividualBindings::initIndividualBindings(cint64 bindingSize, TIndividualInstanceItemDataBinding* bindingArray) {
75 mBindingArray = bindingArray;
76 mBindingSize = bindingSize;
77 return this;
78 }
79
80 TIndividualInstanceItemDataBinding* COptimizedComplexVariableIndividualBindings::getBindingArray() const {
81 return mBindingArray;
82 }
83
84 TIndividualInstanceItemDataBinding& COptimizedComplexVariableIndividualBindings::getBinding(cint64 idx) const {
85 return mBindingArray[idx];
86 }
87
88 COptimizedComplexVariableIndividualBindings* COptimizedComplexVariableIndividualBindings::setBinding(cint64 idx, const TIndividualInstanceItemDataBinding& instItem) {
89 mBindingArray[idx] = instItem;
90 return this;
91 }
92
93
94 cint64 COptimizedComplexVariableIndividualBindings::getBindingSize() const {
95 return mBindingSize;
96 }
97
98
99 cint64 COptimizedComplexVariableIndividualBindings::getHashValue() const {
100 cint64 hashValue = mBindingSize;
101 cint64 multiplier = 13;
102 for (cint64 i = 0; i < mBindingSize; ++i) {
103 hashValue = multiplier * hashValue + (cint64)mBindingArray[i].getHashValue();
104 }
105 return hashValue;
106 }
107
108
109 bool COptimizedComplexVariableIndividualBindings::operator==(const COptimizedComplexVariableIndividualBindings& bindings) const {
110 if (mBindingSize != bindings.mBindingSize) {
111 return false;
112 }
113 for (cint64 i = 0; i < mBindingSize; ++i) {
114 if (mBindingArray[i] != bindings.mBindingArray[i]) {
115 return false;
116 }
117 }
118 return true;
119 }
120
121
122 }; // end namespace Answerer
123
124 }; // end namespace Reasoner
125
126 }; // end namespace Konclude