#ifndef _QTUNARYFUNC_HH__ #define _QTUNARYFUNC_HH___ #include "qlparser/qtunaryoperation.hh" // forward declarations class QtOperation; /* * 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 . * * Copyright 2003, 2004, 2005, 2006, 2007, 2008, 2009 Peter Baumann / rasdaman GmbH. * * For more information please see * or contact Peter Baumann via . */ /************************************************************* * * * COMMENTS: * ************************************************************/ //@ManMemo: Module: {\bf qlparser} /*@Doc: The class represenst a function returning the lower bound of an interval. */ class QtIntervalLoOp : public QtUnaryOperation { public: /// constructor getting operand QtIntervalLoOp( QtOperation* newInput ); /// evaluates 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; /// type checking of the subtree virtual const QtTypeElement& checkType( QtTypeTuple* typeTuple = NULL ); private: /// attribute for identification of nodes static const QtNodeType nodeType; }; //@ManMemo: Module: {\bf qlparser} /*@Doc: The class represenst a function returning the higher bound of an interval. */ class QtIntervalHiOp : public QtUnaryOperation { public: /// constructor getting operand QtIntervalHiOp( QtOperation* newInput ); /// evaluates 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; /// type checking of the subtree virtual const QtTypeElement& checkType( QtTypeTuple* typeTuple = NULL ); private: /// attribute for identification of nodes static const QtNodeType nodeType; }; //@ManMemo: Module: {\bf qlparser} /*@Doc: The class represenst a function returning the spatial domain of an mdd object. */ class QtSDom : public QtUnaryOperation { public: /// constructor getting operand QtSDom( QtOperation* newInput ); /// evaluates the node QtData* evaluate( QtDataList* inputList ); /// optimizing load access virtual void optimizeLoad( QtTrimList* trimList ); /** The method deletes the given {\tt trimList} and passes the {\tt optimizeLoad} message with empty triming list to its operand tree. Optimization process enters a new MDD area. */ /// 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; /// type checking virtual const QtTypeElement& checkType( QtTypeTuple* typeTuple = NULL ); private: /// attribute for identification of nodes static const QtNodeType nodeType; }; #include "qlparser/qtunaryfunc.icc" #endif