File: CIndividualConceptBatchProcessingQueue.h

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 (138 lines) | stat: -rw-r--r-- 4,265 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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
/*
 *		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.
 *
 */

#ifndef KONCLUDE_REASONER_KERNEL_PROCESS_CINDIVIDUALCONCEPTBATCHPROCESSINGQUEUE_H
#define KONCLUDE_REASONER_KERNEL_PROCESS_CINDIVIDUALCONCEPTBATCHPROCESSINGQUEUE_H

// Libraries includes


// Namespace includes
#include "ProcessSettings.h"
#include "CIndividualConceptBatchProcessingData.h"


// Other includes


// Logger includes
#include "Logger/CLogger.h"



namespace Konclude {

	namespace Reasoner {

		namespace Kernel {

			namespace Process {

				/*! 
				 *
				 *		\class		CIndividualConceptBatchProcessingQueue
				 *		\author		Andreas Steigmiller
				 *		\version	0.1
				 *		\brief		TODO
				 *
				 */
				class CIndividualConceptBatchProcessingQueue {
					// public methods
					public:
						//! Constructor
						CIndividualConceptBatchProcessingQueue(CProcessContext* processContext);

						CIndividualConceptBatchProcessingQueue* initProcessingQueue(CIndividualConceptBatchProcessingQueue* processingQueue);


						bool takeNextConceptProcessIndividual(CConcept*& concept, CIndividualProcessNode*& indiNode, CConceptProcessDescriptor*& conProDes);
						CIndividualConceptBatchProcessingQueue* insertIndiviudalForConcept(CConcept* concept, CIndividualProcessNode* individual, CConceptProcessDescriptor* conProDes);
						CIndividualConceptBatchProcessingQueue* insertIndiviudalForBindingCount(CConcept* concept, cint64 bindCount, CIndividualProcessNode* individual, CConceptProcessDescriptor* conProDes);

						bool isEmpty();


						CIndividualConceptBatchProcessingData* getBatchProcessingData(CConcept* concept, bool createAndLocalize = true);
						CIndividualConceptBatchProcessingData* getBatchProcessingData(CConcept* concept, cint64 bindCount, bool createAndLocalize = true);


					// protected methods
					protected:

					// protected variables
					protected:
						class CIndividualConceptBatchProcessingQueueData {
							public:
								inline CIndividualConceptBatchProcessingQueueData() {
									mUseProcData = nullptr;
									mLocProcData = nullptr;
								}
								inline CIndividualConceptBatchProcessingQueueData(const CIndividualConceptBatchProcessingQueueData& data) {
									mUseProcData = data.mUseProcData;
									mLocProcData = nullptr;
								}
								CIndividualConceptBatchProcessingData* mUseProcData;
								CIndividualConceptBatchProcessingData* mLocProcData;
						};

						CProcessContext* mProcessContext;

						cint64 mCurrentProcessingTag;
						CIndividualConceptBatchProcessingData* mUseCurrentProcessingQueue;
						CIndividualConceptBatchProcessingData* mLocCurrentProcessingQueue;

						CPROCESSMAP<cint64,CIndividualConceptBatchProcessingQueueData> mConceptIndiQueueMap;
						CPROCESSMAP<cint64,CIndividualConceptBatchProcessingQueueData> mBindCountIndiQueueMap;

						class CIndividualConceptQueuedData {
							public:
								inline CIndividualConceptQueuedData(bool queued = false, cint64 prevTag = 0) {
									mPrevTag = prevTag;
									mQueued = queued;
								}
								cint64 mPrevTag;
								bool mQueued;
						};


						cint64 mBindindBasedQueuedCount;


						CPROCESSHASH< QPair<cint64,cint64>,CIndividualConceptQueuedData > mBindCountIndiQueuedHash;



					// private methods
					private:

					// private variables
					private:

				};

			}; // end namespace Process

		}; // end namespace Kernel

	}; // end namespace Reasoner

}; // end namespace Konclude

#endif // KONCLUDE_REASONER_KERNEL_PROCESS_CINDIVIDUALCONCEPTBATCHPROCESSINGQUEUE_H