Debian Codegraph @

Source/Reasoner/Realizer/COptimizedRepresentativeKPSetConceptSetCacheLabelItemData.h

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 #ifndef KONCLUDE_REASONER_REALIZER_COPTIMIZEDREPRESENTATIVEKPSETCONCEPTSETCACHELABELITEMDATA_H
22 #define KONCLUDE_REASONER_REALIZER_COPTIMIZEDREPRESENTATIVEKPSETCONCEPTSETCACHELABELITEMDATA_H
23
24 // Libraries includes
25
26
27 // Namespace includes
28 #include "RealizerSettings.h"
29 #include "COptimizedKPSetConceptInstancesItem.h"
30 #include "COptimizedRepresentativeKPSetConceptSetCacheLabelItemInstancesData.h"
31
32
33 // Other includes
34
35
36 // Logger includes
37 #include "Logger/CLogger.h"
38
39
40 namespace Konclude {
41
42 namespace Reasoner {
43
44 namespace Realizer {
45
46
47 /*!
48 *
49 * \class COptimizedRepresentativeKPSetConceptSetCacheLabelItemData
50 * \author Andreas Steigmiller
51 * \version 0.1
52 * \brief TODO
53 *
54 */
55 class COptimizedRepresentativeKPSetConceptSetCacheLabelItemData {
56 // public methods
57 public:
58 //! Constructor
59 COptimizedRepresentativeKPSetConceptSetCacheLabelItemData(CBackendRepresentativeMemoryLabelCacheItem* labelCacheItem);
60
61
62 CBackendRepresentativeMemoryLabelCacheItem* getLabelCacheItem();
63
64
65 bool hasPossibleInstances();
66 COptimizedRepresentativeKPSetConceptSetCacheLabelItemData* setPossibleInstances(bool possibleInstances);
67
68
69 QHash<COptimizedKPSetConceptInstancesItem*, COptimizedRepresentativeKPSetConceptSetCacheLabelItemInstancesData*>* getInstancesItemDataHash();
70 COptimizedRepresentativeKPSetConceptSetCacheLabelItemInstancesData* getInstancesItemData(COptimizedKPSetConceptInstancesItem* instanceItem, bool createIfNotExists = true);
71
72 QList<COptimizedKPSetConceptInstancesItem*>* getKnownInstancesItemList();
73 QList<COptimizedKPSetConceptInstancesItem*>* getPossibleInstancesItemList();
74
75 // protected methods
76 protected:
77
78 // protected variables
79 protected:
80 bool mPossibleInstances;
81
82 CBackendRepresentativeMemoryLabelCacheItem* mLabelCacheItem;
83
84 QHash<COptimizedKPSetConceptInstancesItem*, COptimizedRepresentativeKPSetConceptSetCacheLabelItemInstancesData*> mInstancesItemDataHash;
85 QList<COptimizedKPSetConceptInstancesItem*> mKnownInstancesItemList;
86 QList<COptimizedKPSetConceptInstancesItem*> mPossibleInstancesItemList;
87
88 // private methods
89 private:
90
91 // private variables
92 private:
93
94 };
95
96 }; // end namespace Realizer
97
98 }; // end namespace Reasoner
99
100 }; // end namespace Konclude
101
102 #endif // KONCLUDE_REASONER_REALIZER_COPTIMIZEDREPRESENTATIVEKPSETCONCEPTSETCACHELABELITEMDATA_H