Debian Codegraph @

Source/Reasoner/Kernel/Strategy/CIndividualAncestorDepthMaximumConceptProcessingPriorityStrategy.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 "CIndividualAncestorDepthMaximumConceptProcessingPriorityStrategy.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Strategy {
31
32
33 CIndividualAncestorDepthMaximumConceptProcessingPriorityStrategy::CIndividualAncestorDepthMaximumConceptProcessingPriorityStrategy() {
34 mStrictIndiNodeProcessing = false;
35 mAddIDIndiPriorization = false;
36 }
37
38
39 CIndividualAncestorDepthMaximumConceptProcessingPriorityStrategy::~CIndividualAncestorDepthMaximumConceptProcessingPriorityStrategy() {
40 }
41
42
43 void CIndividualAncestorDepthMaximumConceptProcessingPriorityStrategy::configureStrategy(bool strictIndiNodeProcessing, bool additionalIDIndiPriorization) {
44 mStrictIndiNodeProcessing = strictIndiNodeProcessing;
45 mAddIDIndiPriorization = additionalIDIndiPriorization;
46 }
47
48
49 CIndividualProcessNodePriority CIndividualAncestorDepthMaximumConceptProcessingPriorityStrategy::getPriorityForIndividual(CIndividualProcessNode* individual) {
50 double conPriority = 0.;
51 CConceptProcessingQueue* conProQueue = individual->getConceptProcessingQueue(false);
52 if (conProQueue) {
53 CConceptProcessPriority conProPriority;
54 if (conProQueue->getNextConceptProcessPriority(&conProPriority)) {
55 conPriority = conProPriority.getPriority();
56 }
57 }
58 double indiPriority = individual->getIndividualAncestorDepth();
59 if (mAddIDIndiPriorization) {
60 indiPriority += - 1. / (10+individual->getIndividualNodeID()) + 0.1;
61 }
62 return CIndividualProcessNodePriority(conPriority,indiPriority,mStrictIndiNodeProcessing);
63 }
64
65
66 }; // end namespace Strategy
67
68 }; // end namespace Kernel
69
70 }; // end namespace Reasoner
71
72 }; // end namespace Konclude