Debian Codegraph @

Source/Reasoner/Kernel/Process/CDatatypeBinaryDataValueSpaceMap.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 "CDatatypeBinaryDataValueSpaceMap.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Process {
31
32
33 CDatatypeBinaryDataValueSpaceMap::CDatatypeBinaryDataValueSpaceMap(CProcessContext* processContext) : CDatatypeCompareValueSpaceMap(processContext) {
34 }
35
36 bool CDatatypeBinaryDataValueSpaceMap::representsInfinitelyManyValues(CDataLiteralCompareValue* leftValueExcluded, CDataLiteralCompareValue* rightValueExcluded) {
37 CDataLiteralBinaryDataValue* binaryDataLeftValue = dynamic_cast<CDataLiteralBinaryDataValue*>(leftValueExcluded);
38 CDataLiteralBinaryDataValue* binaryDataRightValue = dynamic_cast<CDataLiteralBinaryDataValue*>(rightValueExcluded);
39 if (binaryDataRightValue->getLength() >= 7) {
40 return true;
41 }
42 return false;
43 }
44
45 bool CDatatypeBinaryDataValueSpaceMap::representsInfinitelyManyValues(CDataLiteralCompareValue* value) {
46 CDataLiteralBinaryDataValue* binaryDataValue = dynamic_cast<CDataLiteralBinaryDataValue*>(value);
47 if (binaryDataValue) {
48 return binaryDataValue->isInfiniteLength();
49 }
50 return false;
51 }
52
53 bool CDatatypeBinaryDataValueSpaceMap::getValueCopy(CDataLiteralCompareValue* valueCopyInto, CDataLiteralCompareValue* valueCopyFrom) {
54 CDataLiteralBinaryDataValue* binaryDataValueCopyInto = dynamic_cast<CDataLiteralBinaryDataValue*>(valueCopyInto);
55 CDataLiteralBinaryDataValue* binaryDataValueCopyFrom = dynamic_cast<CDataLiteralBinaryDataValue*>(valueCopyFrom);
56 binaryDataValueCopyInto->initValue(binaryDataValueCopyFrom);
57 return true;
58 }
59
60 bool CDatatypeBinaryDataValueSpaceMap::getValueNext(CDataLiteralCompareValue* valueNext, CDataLiteralCompareValue* valueLast) {
61 CDataLiteralBinaryDataValue* binaryDataValueNext = dynamic_cast<CDataLiteralBinaryDataValue*>(valueNext);
62 CDataLiteralBinaryDataValue* binaryDataValueLast = dynamic_cast<CDataLiteralBinaryDataValue*>(valueLast);
63
64 binaryDataValueNext->initValue(binaryDataValueLast);
65 binaryDataValueNext->incrementBinaryData();
66 return true;
67 }
68
69
70 cuint64 CDatatypeBinaryDataValueSpaceMap::getIntervalValueCount(CDataLiteralCompareValue* leftValueExcluded, CDataLiteralCompareValue* rightValueExcluded) {
71 CDataLiteralBinaryDataValue* binaryDataLeftValue = dynamic_cast<CDataLiteralBinaryDataValue*>(leftValueExcluded);
72 CDataLiteralBinaryDataValue* binaryDataRightValue = dynamic_cast<CDataLiteralBinaryDataValue*>(rightValueExcluded);
73 cuint64 valueCount = 0;
74
75 cuint64 leftValueID = binaryDataLeftValue->getBinaryDataID();
76 cuint64 rightValueID = binaryDataRightValue->getBinaryDataID();
77 valueCount = rightValueID - leftValueID;
78 return valueCount;
79 }
80
81
82
83 }; // end namespace Process
84
85 }; // end namespace Kernel
86
87 }; // end namespace Reasoner
88
89 }; // end namespace Konclude