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
|
#ifndef _QTCONST_
#define _QTCONST_
#ifndef CPPSTDLIB
#include <ospace/string.h> // STL<ToolKit>
#else
#include <string>
#endif
#include "qlparser/qtdata.hh"
#include "qlparser/qtoperation.hh"
#include <stdio.h>
/*
* 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 serves as a carrier for a {\tt QtData} object
and, additionally, provides functionality necessary in
the query tree.
*/
class QtConst : public QtOperation
{
public:
/// constructor getting a pointer to the data object
QtConst( QtData* newDataObj );
/**
Lifetime of {\tt newDataObj} is managed by this class from now on.
*/
/// virtual destructor
virtual ~QtConst();
/// test if the two nodes have an equal meaning in the query tree
virtual bool equalMeaning( QtNode* node );
/// creates a unique name for a common subexpression
virtual std::string getSpelling();
/// test if the edge to the parent node is of type mdd or atomic
virtual QtAreaType getAreaType();
/// optimizing load access
virtual void optimizeLoad( QtTrimList* trimList );
/// method for evaluating the node
QtData* evaluate( QtDataList* inputList );
/// 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;
//@Man: Operations of the ONC protocol:
//@{
///
QtDataList* next();
//@}
//@Man: Read/Write methods:
//@{
///
/// return the data object
inline QtData* getDataObj();
///
//@}
/// type checking of the subtree
virtual const QtTypeElement& checkType( QtTypeTuple* typeTuple = NULL );
private:
/// pointer to the data object
QtData* dataObj;
/// attribute for identification of nodes
static const QtNodeType nodeType;
};
#include "qlparser/qtconst.icc"
#endif
|
