Debian Codegraph @

Source/Reasoner/Realizer/CPossibleInstancesIndividualsMergingData.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 "CPossibleInstancesIndividualsMergingData.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Realizer {
29
30
31 CPossibleInstancesIndividualsMergingData::CPossibleInstancesIndividualsMergingData(cint64 maxMergingAttemptCount) {
32 mMaxMergingAttemptCount = maxMergingAttemptCount;
33 mPossibleInstancesIndividualsMergingLinker = nullptr;
34 mPossibleMergingIndiCount = 0;
35 mAllPossibleInstancesIndividualsNonMerging = false;
36 mMergingAttemptCount.store(0);
37 mMergingSuccessCount.store(0);
38 mMergingStreakFailCount.store(0);
39 }
40
41 CPossibleInstancesIndividualsMergingLinker* CPossibleInstancesIndividualsMergingData::getPossibleInstancesIndividualsMergingLinker() {
42 return mPossibleInstancesIndividualsMergingLinker;
43 }
44
45 CPossibleInstancesIndividualsMergingData* CPossibleInstancesIndividualsMergingData::addPossibleInstancesIndividualsMergingLinker(CPossibleInstancesIndividualsMergingLinker* linker) {
46 mPossibleMergingIndiCount += linker->getCount();
47 mPossibleInstancesIndividualsMergingLinker = (CPossibleInstancesIndividualsMergingLinker*)linker->append(mPossibleInstancesIndividualsMergingLinker);
48 return this;
49 }
50
51 cint64 CPossibleInstancesIndividualsMergingData::getPossibleMergingIndividualCount() {
52 return mPossibleMergingIndiCount;
53 }
54
55 cint64 CPossibleInstancesIndividualsMergingData::getMergingAttemptCount() {
56 return mMergingAttemptCount;
57 }
58
59 cint64 CPossibleInstancesIndividualsMergingData::getMergingSuccessCount() {
60 return mMergingSuccessCount;
61 }
62
63 cint64 CPossibleInstancesIndividualsMergingData::getMaxMergingAttemptCount() {
64 return mMaxMergingAttemptCount;
65 }
66
67 cint64 CPossibleInstancesIndividualsMergingData::getMergingStreakFailCount() {
68 return mMergingStreakFailCount;
69 }
70
71 CPossibleInstancesIndividualsMergingData* CPossibleInstancesIndividualsMergingData::incMergingAttempt() {
72 mMergingAttemptCount.ref();
73 return this;
74 }
75
76 CPossibleInstancesIndividualsMergingData* CPossibleInstancesIndividualsMergingData::incMergingSuccess() {
77 mMergingSuccessCount.ref();
78 return this;
79 }
80
81 CPossibleInstancesIndividualsMergingData* CPossibleInstancesIndividualsMergingData::incMergingStreakFails() {
82 mMergingStreakFailCount.ref();
83 return this;
84 }
85
86
87 bool CPossibleInstancesIndividualsMergingData::areAllPossibleInstancesIndividualsNonMerging() {
88 return mAllPossibleInstancesIndividualsNonMerging;
89 }
90
91 CPossibleInstancesIndividualsMergingData* CPossibleInstancesIndividualsMergingData::setAllPossibleInstancesIndividualsNonMerging(bool allNonMergeable) {
92 mAllPossibleInstancesIndividualsNonMerging = allNonMergeable;
93 return this;
94 }
95
96
97 }; // end namespace Realizer
98
99 }; // end namespace Reasoner
100
101 }; // end namespace Konclude