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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
|
#ifndef _QTBINARYINDUCE_
#define _QTBINARYINDUCE_
#ifndef CPPSTDLIB
#include <ospace/string.h> // STL<ToolKit>
#else
#include <string>
#endif
#include "qlparser/qtbinaryoperation.hh"
#include "qlparser/qtdata.hh"
#include "qlparser/qtmdd.hh"
#include "qlparser/qtscalardata.hh"
#include "catalogmgr/ops.hh"
/*
* This file is part of rasdaman community.
*
* Rasdaman community is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Rasdaman community 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with rasdaman community. If not, see <http://www.gnu.org/licenses/>.
*
* Copyright 2003, 2004, 2005, 2006, 2007, 2008, 2009 Peter Baumann /
rasdaman GmbH.
*
* For more information please see <http://www.rasdaman.org>
* or contact Peter Baumann via <baumann@rasdaman.com>.
*/
/*************************************************************
*
*
* COMMENTS:
*
************************************************************/
//@ManMemo: Module: {\bf qlparser}
/*@Doc:
The class hierarchy guarantees no type safety. Type checking is done at
execution time.
The operations greater and greater equal are mapped to QtLess and QtLessEqual.
*/
class QtBinaryInduce : public QtBinaryOperation
{
public:
/// constructor getting the two operands
QtBinaryInduce( QtOperation* input1, QtOperation* input2, Ops::OpType initOpType );
/// method for evaluating the node
QtData* evaluate( QtDataList* inputList );
/// type checking of the subtree
virtual const QtTypeElement& checkType( QtTypeTuple* typeTuple = NULL );
protected:
/// computes the binary operation
QtData* computeOp( QtData* operand1, QtData* operand2 );
/// computes an unary induce operation with one MDD object and a scalar value either being atomic or complex constant
QtData* computeUnaryMDDOp( QtMDD* operand1, QtScalarData* operand2, const BaseType* resultBaseType, int scalarPos=1 );
/**
The method carries out the unary induce operation specified by {\tt operation} on the two operands. {\tt scalarPos }
determines if the scalar value is the first (=1, default) or the second (=2) operand in the operation. For
the result, a new transient MDD object is created and returned. In the end, the MDD object of the first operand
is freed.
*/
/// computes a binary induce operation on two MDD objects
QtData* computeBinaryMDDOp( QtMDD* operand1, QtMDD* operand2, const BaseType* resultBaseType );
/**
The method carries out the binary induce operation specified by {\tt operation} on the two operands. For
the result, a new transient MDD object is created and returned. In the end, the MDD objects of the operands
are freed.
*/
/// computes a binary operation on two scalar objects
QtData* computeBinaryOp( QtScalarData* operand1, QtScalarData* operand2, const BaseType* resultBaseType );
/**
The method carries out the binary operation specified by {\tt operation} on the two operands.
*/
// private:
// type of operation
Ops::OpType opType;
private:
/// atribute for identification of nodes
static const QtNodeType nodeType;
};
//@ManMemo: Module: {\bf qlparser}
/*@Doc:
*/
class QtPlus : public QtBinaryInduce
{
public:
/// constructor getting the two operands
QtPlus( QtOperation* input1, QtOperation* input2 );
/// optimizes the tree
// virtual void rewriteOps();
/// optimizes the tree
// virtual void sortAssociativeOps();
///for associative law
virtual QtOperation* getUniqueOrder( const QtNode::QtNodeType ID );
/// prints the tree
virtual void printTree( int tab, std::ostream& s = std::cout, QtChildType mode = QT_ALL_NODES );
/// prints the algebraic expression
virtual void printAlgebraicExpression( std::ostream& s = std::cout );
/// method for identification of nodes
inline virtual const QtNodeType getNodeType() const;
private:
/// attribute for identification of nodes
static const QtNodeType nodeType;
};
//@ManMemo: Module: {\bf qlparser}
/*@Doc:
*/
class QtMinus : public QtBinaryInduce
{
public:
/// constructor getting the two operands
QtMinus( QtOperation* input1, QtOperation* input2 );
/// prints the tree
virtual void printTree( int tab, std::ostream& s = std::cout, QtChildType mode = QT_ALL_NODES );
/// prints the algebraic expression
virtual void printAlgebraicExpression( std::ostream& s = std::cout );
/// method for identification of nodes
inline virtual const QtNodeType getNodeType() const;
/// returns FALSE saying that the operation IS NOT commutative
virtual bool isCommutative() const;
private:
/// attribute for identification of nodes
static const QtNodeType nodeType;
};
//@ManMemo: Module: {\bf qlparser}
/*@Doc:
*/
class QtMult : public QtBinaryInduce
{
public:
/// constructor getting the two operands
QtMult( QtOperation* input1, QtOperation* input2 );
/// optimizes the tree
// virtual void rewriteOps();
/// optimizes the tree
// virtual void sortAssociativeOps();
/// optimizes the tree
virtual QtOperation* getUniqueOrder( const QtNode::QtNodeType ID );
/// prints the tree
virtual void printTree( int tab, std::ostream& s = std::cout, QtChildType mode = QT_ALL_NODES );
/// prints the algebraic expression
virtual void printAlgebraicExpression( std::ostream& s = std::cout );
/// method for identification of nodes
inline virtual const QtNodeType getNodeType() const;
private:
/// attribute for identification of nodes
static const QtNodeType nodeType;
};
//@ManMemo: Module: {\bf qlparser}
/*@Doc:
*/
class QtDiv : public QtBinaryInduce
{
public:
/// constructor getting the two operands
QtDiv( QtOperation* input1, QtOperation* input2 );
/// prints the tree
virtual void printTree( int tab, std::ostream& s = std::cout, QtChildType mode = QT_ALL_NODES );
/// prints the algebraic expression
virtual void printAlgebraicExpression( std::ostream& s = std::cout );
/// method for identification of nodes
inline virtual const QtNodeType getNodeType() const;
/// returns FALSE saying that the operation IS NOT commutative
virtual bool isCommutative() const;
private:
/// attribute for identification of nodes
static const QtNodeType nodeType;
};
#include "qlparser/qtbinaryinduce.icc"
#endif
|
