Debian Codegraph @

Source/Reasoner/Ontology/CDisjunctBranchingStatistics.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 "CDisjunctBranchingStatistics.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Ontology {
29
30
31 CDisjunctBranchingStatistics::CDisjunctBranchingStatistics() {
32 mExpandedCount = 0;
33 mClashesInvolvedCount = 0;
34 mSatisfiableOccurrenceCount = 0;
35 setData(nullptr);
36 }
37
38
39 CDisjunctBranchingStatistics* CDisjunctBranchingStatistics::initDisjunctBranchingStatistics(CSortedNegLinker<CConcept*>* disjunctLinker) {
40 mExpandedCount = 0;
41 mClashesInvolvedCount = 0;
42 mSatisfiableOccurrenceCount = 0;
43 setData(disjunctLinker);
44 return this;
45 }
46
47 CSortedNegLinker<CConcept*>* CDisjunctBranchingStatistics::getDisjunctLinker() {
48 return getData();
49 }
50
51
52
53 cint64 CDisjunctBranchingStatistics::getExpandedCount() {
54 return mExpandedCount;
55 }
56
57 cint64 CDisjunctBranchingStatistics::getClashInvolvedCount() {
58 return mClashesInvolvedCount;
59 }
60
61 cint64 CDisjunctBranchingStatistics::getSatisfiableOccurrenceCount() {
62 return mSatisfiableOccurrenceCount;
63 }
64
65
66
67 CDisjunctBranchingStatistics* CDisjunctBranchingStatistics::setExpandedCount(cint64 count) {
68 mExpandedCount = count;
69 return this;
70 }
71
72 CDisjunctBranchingStatistics* CDisjunctBranchingStatistics::setClashInvolvedCount(cint64 count) {
73 mClashesInvolvedCount = count;
74 return this;
75 }
76
77 CDisjunctBranchingStatistics* CDisjunctBranchingStatistics::setSatisfiableOccurrenceCount(cint64 count) {
78 mSatisfiableOccurrenceCount = count;
79 return this;
80 }
81
82
83
84 CDisjunctBranchingStatistics* CDisjunctBranchingStatistics::incExpandedCount(cint64 incCount) {
85 mExpandedCount += incCount;
86 return this;
87 }
88
89 CDisjunctBranchingStatistics* CDisjunctBranchingStatistics::incClashInvolvedCount(cint64 incCount) {
90 mClashesInvolvedCount += incCount;
91 return this;
92 }
93
94 CDisjunctBranchingStatistics* CDisjunctBranchingStatistics::incSatisfiableOccurrenceCount(cint64 incCount) {
95 mSatisfiableOccurrenceCount += incCount;
96 return this;
97 }
98
99
100
101
102 }; // end namespace Ontology
103
104
105 }; // end namespace Reasoner
106
107 }; // end namespace Konclude