File: CSaturationNominalDependentNodeHash.cpp

package info (click to toggle)
konclude 0.6.2~dfsg-3
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 26,976 kB
  • ctags: 43,332
  • sloc: cpp: 250,898; xml: 54,573; makefile: 29; ansic: 3; sh: 3
file content (75 lines) | stat: -rw-r--r-- 3,288 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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
/*
 *		Copyright (C) 2013, 2014, 2015 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 2.1 of the GNU Lesser General Public License (LGPL2.1)
 *		as published by the Free Software Foundation.
 *
 *		You should have received a copy of the GNU Lesser General Public License
 *		along with Konclude. If not, see <http://www.gnu.org/licenses/>.
 *
 *		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. For more
 *		details, see GNU Lesser General Public License.
 *
 */

#include "CSaturationNominalDependentNodeHash.h"


namespace Konclude {

	namespace Reasoner {

		namespace Kernel {

			namespace Process {


				CSaturationNominalDependentNodeHash::CSaturationNominalDependentNodeHash(CProcessContext* processContext) : mNominalDependentNodeDataHash(processContext),mProcessContext(processContext) {
				}

				CSaturationNominalDependentNodeHash* CSaturationNominalDependentNodeHash::initNominalDependentNodeHash(CSaturationNominalDependentNodeHash* nominalDependentHash) {
					if (nominalDependentHash) {
						mNominalDependentNodeDataHash = nominalDependentHash->mNominalDependentNodeDataHash;
					} else {
						mNominalDependentNodeDataHash.clear();
					}
					return this;
				}

				CSaturationNominalDependentNodeData* CSaturationNominalDependentNodeHash::getNominalDependentNodeData(cint64 nominalID) {
					CSaturationNominalDependentNodeData* nominalDepNodeData = nullptr;
					const CSaturationNominalDependentNodeHashData& hashData = mNominalDependentNodeDataHash.value(nominalID);
					nominalDepNodeData = hashData.mNominalDependentNodeData;
					return nominalDepNodeData;
				}


				CSaturationNominalDependentNodeHash* CSaturationNominalDependentNodeHash::addNominalDependentNodeData(cint64 nominalID, CSaturationNominalDependentNodeData* dependentNodeData) {
					CSaturationNominalDependentNodeHashData& hashData = mNominalDependentNodeDataHash[nominalID];
					hashData.mNominalDependentNodeData = dependentNodeData->append(hashData.mNominalDependentNodeData);
					return this;
				}


				CSaturationNominalDependentNodeHash* CSaturationNominalDependentNodeHash::addNominalDependentNode(cint64 nominalID, CIndividualSaturationProcessNode* dependentNode, CSaturationNominalDependentNodeData::NOMINALCONNECTIONTYPE connectionType) {
					CSaturationNominalDependentNodeHashData& hashData = mNominalDependentNodeDataHash[nominalID];
					CSaturationNominalDependentNodeData* dependentNodeData = CObjectParameterizingAllocator<CSaturationNominalDependentNodeData,CProcessContext*>::allocateAndConstructAndParameterize(mProcessContext->getUsedMemoryAllocationManager(),mProcessContext);
					dependentNodeData->initNominalDependentNodeData(dependentNode,connectionType);
					hashData.mNominalDependentNodeData = dependentNodeData->append(hashData.mNominalDependentNodeData);
					return this;
				}


			}; // end namespace Process

		}; // end namespace Kernel

	}; // end namespace Reasoner

}; // end namespace Konclude