Debian Codegraph @

Source/Reasoner/Kernel/Process/CBranchingMergingIndividualNodeCandidateLinker.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 "CBranchingMergingIndividualNodeCandidateLinker.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Process {
31
32
33 CBranchingMergingIndividualNodeCandidateLinker::CBranchingMergingIndividualNodeCandidateLinker(CProcessContext* processContext) {
34 mProcessContext = processContext;
35 mMergingIndiNodeCandidate = nullptr;
36 mMergingLink = nullptr;
37 }
38
39
40 CBranchingMergingIndividualNodeCandidateLinker::~CBranchingMergingIndividualNodeCandidateLinker() {
41 }
42
43 CBranchingMergingIndividualNodeCandidateLinker* CBranchingMergingIndividualNodeCandidateLinker::initBranchingMergingIndividualNodeCandidate(CBranchingMergingIndividualNodeCandidateLinker* prevRest) {
44 if (prevRest) {
45 mMergingIndiNodeCandidate = prevRest->mMergingIndiNodeCandidate;
46 mMergingLink = prevRest->mMergingLink;
47 } else {
48 mMergingIndiNodeCandidate = nullptr;
49 mMergingLink = nullptr;
50 }
51 return this;
52 }
53
54 CBranchingMergingIndividualNodeCandidateLinker* CBranchingMergingIndividualNodeCandidateLinker::initBranchingMergingIndividualNodeCandidate(CIndividualProcessNode* mergingIndiNodeCand, CIndividualLinkEdge* mergingLink) {
55 mMergingLink = mergingLink;
56 mMergingIndiNodeCandidate = mergingIndiNodeCand;
57 return this;
58 }
59
60
61 CIndividualProcessNode* CBranchingMergingIndividualNodeCandidateLinker::getMergingIndividualNodeCandidate() {
62 return mMergingIndiNodeCandidate;
63 }
64
65 CBranchingMergingIndividualNodeCandidateLinker* CBranchingMergingIndividualNodeCandidateLinker::setMergingIndividualNodeCandidate(CIndividualProcessNode* mergingIndiNodeCand) {
66 mMergingIndiNodeCandidate = mergingIndiNodeCand;
67 return this;
68 }
69
70
71 CIndividualLinkEdge* CBranchingMergingIndividualNodeCandidateLinker::getMergingIndividualLink() {
72 return mMergingLink;
73 }
74
75 CBranchingMergingIndividualNodeCandidateLinker* CBranchingMergingIndividualNodeCandidateLinker::setMergingIndividualLink(CIndividualLinkEdge* mergingLink) {
76 mMergingLink = mergingLink;
77 return this;
78 }
79
80 bool CBranchingMergingIndividualNodeCandidateLinker::isCandidateBlockableAndCreator() {
81 return mMergingIndiNodeCandidate && mMergingLink && mMergingIndiNodeCandidate->isBlockableIndividual() && mMergingLink->isCreatorIndividualID(mMergingIndiNodeCandidate);
82 }
83
84
85 bool CBranchingMergingIndividualNodeCandidateLinker::operator<=(const CBranchingMergingIndividualNodeCandidateLinker& otherIndiNodeCandLinker) {
86 return true;
87 }
88
89
90 }; // end namespace Kernel
91
92 }; // end namespace Process
93
94 }; // end namespace Reasoner
95
96 }; // end namespace Konclude