File: CNodeChildrenOrderClassificationItem.cpp

package info (click to toggle)
konclude 0.7.0%2B1138%2Bgit20220514~dfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, forky, sid, trixie
  • size: 48,500 kB
  • sloc: cpp: 378,255; xml: 116,067; sh: 66; makefile: 38; ansic: 3
file content (59 lines) | stat: -rw-r--r-- 1,847 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
/*
 *		Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
 *
 *		This file is part of the reasoning system Konclude.
 *		For details and support, see <http://konclude.com/>.
 *
 *		Konclude is free software: you can redistribute it and/or modify
 *		it under the terms of version 3 of the GNU Lesser General Public
 *		License (LGPLv3) as published by the Free Software Foundation.
 *
 *		Konclude is distributed in the hope that it will be useful,
 *		but WITHOUT ANY WARRANTY; without even the implied warranty of
 *		MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 *		GNU (Lesser) General Public License for more details.
 *
 *		You should have received a copy of the GNU (Lesser) General Public
 *		License along with Konclude. If not, see <http://www.gnu.org/licenses/>.
 *
 */

#include "CNodeChildrenOrderClassificationItem.h"


namespace Konclude {

	namespace Reasoner {

		namespace Classifier {


			CNodeChildrenOrderClassificationItem::CNodeChildrenOrderClassificationItem(CHierarchyNode *node, QHash<QPair<CHierarchyNode *,CHierarchyNode *>,double> *subsumptionProbabilisticHash) {
				parentNode = node;
				subsumProbabilisticHash = subsumptionProbabilisticHash;
			}


			CNodeChildrenOrderClassificationItem::~CNodeChildrenOrderClassificationItem() {
			}

			CHierarchyNode *CNodeChildrenOrderClassificationItem::getTestingNode() {
				return parentNode;
			}


			QHash<QPair<CHierarchyNode *,CHierarchyNode *>,double> *CNodeChildrenOrderClassificationItem::getSubsumptionProbabilisticHash() {
				return subsumProbabilisticHash;
			}

			QList<QPair<CHierarchyNode *,CHierarchyNode *> >  *CNodeChildrenOrderClassificationItem::getSubsumptionCalculationOrderList() {
				return &subsumCalcOrderList;
			}



		}; // end namespace Classifier

	}; // end namespace Reasoner

}; // end namespace Konclude