qExpr.h

Go to the documentation of this file.

// File: $Id$
// Author: John Wu <John.Wu at acm.org>
//      Lawrence Berkeley National Laboratory
// Copyright 1998-2012 the Regents of the University of California
//
// Primary contact: John Wu <John.Wu at acm.org>
#ifndef IBIS_EXPR_H
#define IBIS_EXPR_H



#include "util.h"
#include "array_t.h"

namespace ibis { // additional names related to qExpr
    class qRange;       
    class qContinuousRange;
    class qDiscreteRange;       
    class qString;      
    class qMultiString; 
    class compRange;    
    class deprecatedJoin;       
    class qAnyAny;      
    class qLike;        
    class qIntHod;      
    class qUIntHod;     
}

class FASTBIT_CXX_DLLSPEC ibis::qExpr {
public:
    enum TYPE {
        LOGICAL_UNDEFINED, LOGICAL_NOT, LOGICAL_AND, LOGICAL_OR, LOGICAL_XOR,
        LOGICAL_MINUS, RANGE, DRANGE, STRING, MSTRING, COMPRANGE, MATHTERM,
        DEPRECATEDJOIN, TOPK, ANYANY, LIKE, INTHOD, UINTHOD
    };
    enum COMPARE {
        OP_UNDEFINED, OP_LT, OP_GT, OP_LE, OP_GE, OP_EQ
    };

    qExpr() : type(LOGICAL_UNDEFINED), left(0), right(0) {}

    explicit qExpr(TYPE op) : type(op), left(0), right(0) {}
    qExpr(TYPE op, qExpr* qe1, qExpr* qe2) : type(op), left(qe1), right(qe2) {}
    qExpr(const qExpr& qe) : type(qe.type),
                             left(qe.left ? qe.left->dup() : 0),
                             right(qe.right ? qe.right->dup() : 0) {}
    virtual ~qExpr() {delete right; delete left;}

    void setLeft(qExpr *expr) {delete left; left=expr;}
    void setRight(qExpr *expr) {delete right; right=expr;}
    qExpr*& getLeft() {return left;}
    qExpr*& getRight() {return right;}

    TYPE getType() const {return type;}
    const qExpr* getLeft() const {return left;}
    const qExpr* getRight() const {return right;}

    void swap(qExpr& rhs) {
        {TYPE t = type; type = rhs.type; rhs.type = t;}
        {qExpr* p = left; left = rhs.left; rhs.left = p;}
        {qExpr* q = right; right = rhs.right; rhs.right = q;}
    }

    qExpr& operator=(const qExpr& rhs) {
        qExpr tmp(rhs); // copy
        swap(tmp);
        return *this;
    }

    virtual uint32_t nItems() const {
        return 1 + (left != 0 ? left->nItems() : 0) +
            (right != 0 ? right->nItems() : 0);}

    virtual void print(std::ostream&) const;
    virtual void printFull(std::ostream& out) const;

    struct weight {
        virtual double operator()(const qExpr* ex) const = 0;
        virtual ~weight() {};
    };
    double reorder(const weight&); 

    virtual qExpr* dup() const {
        qExpr* res = new qExpr(type);
        if (left)
            res->left = left->dup();
        if (right)
            res->right = right->dup();
        return res;
    }

    virtual bool isConstant() const {return false;}
    bool isTerminal() const {return (left==0 && right==0);}
    bool directEval() const
    {return (type==RANGE || type==STRING || type==COMPRANGE ||
             type==DRANGE || type==MSTRING || type==ANYANY ||
             type==INTHOD || type==UINTHOD ||
             (type==LOGICAL_NOT && left && left->directEval()));}

    virtual bool isSimple() const {
        if (left) {
            if (right) return left->isSimple() && right->isSimple();
            else return left->isSimple();
        }
        else if (right) {
            return right->isSimple();
        }
        else { // the derived classes essentially overrides this case.
            return true;
        }
    }

    int separateSimple(ibis::qExpr *&simple, ibis::qExpr *&tail) const;
    void extractDeprecatedJoins(std::vector<const deprecatedJoin*>&) const;
    virtual void getTableNames(std::set<std::string>& plist) const;

    qRange* findRange(const char* vname);

    static void simplify(ibis::qExpr*&);

    static std::string extractTableName(const char*);
    static void splitColumnName(const char*, std::string&, std::string&);

    struct TTN {
        const qExpr* term;
        std::set<std::string> tnames;
    }; // TTN
    typedef std::vector<TTN> termTableList;
    void getConjunctiveTerms(termTableList&) const;

protected:
    TYPE   type;        // the type of node, logical operator, type of leaf
    qExpr* left;        // the left child
    qExpr* right;       // the right child

    void adjust();
}; // ibis::qExpr

class FASTBIT_CXX_DLLSPEC ibis::qRange : public ibis::qExpr {
public:
    virtual const char* colName() const = 0;
    virtual bool inRange(double val) const = 0;

    virtual void restrictRange(double left, double right) = 0;
    virtual double leftBound() const = 0;
    virtual double rightBound() const = 0;
    virtual bool empty() const = 0;
    virtual void getTableNames(std::set<std::string>& plist) const;

    virtual ~qRange() {}; // nothing to do

protected:
    // reduce the scope of the constructor
    qRange() : qExpr() {};
    qRange(TYPE t) : qExpr(t) {};

private:
    qRange(const qRange&) {}; // no copy constructor allowed, must use dup
    qRange& operator=(const qRange&);
}; // ibis::qRange

class FASTBIT_CXX_DLLSPEC ibis::qContinuousRange : public ibis::qRange {
public:
    qContinuousRange()
        : qRange(ibis::qExpr::RANGE), name(0), lower(0), upper(0),
          left_op(OP_UNDEFINED), right_op(OP_UNDEFINED) {};
    qContinuousRange(const char* lstr, COMPARE lop, const char* prop,
                     COMPARE rop, const char* rstr);
    qContinuousRange(const char* col, COMPARE op, uint32_t val) :
        qRange(ibis::qExpr::RANGE), name(ibis::util::strnewdup(col)),
        lower(DBL_MAX), upper(val), left_op(OP_UNDEFINED), right_op(op) {};
    qContinuousRange(const qContinuousRange& rhs) :
        qRange(ibis::qExpr::RANGE), name(ibis::util::strnewdup(rhs.name)),
        lower(rhs.lower), upper(rhs.upper), left_op(rhs.left_op),
        right_op(rhs.right_op) {};
    qContinuousRange(double lv, COMPARE lop, const char* prop,
                     COMPARE rop, double rv)
        : qRange(ibis::qExpr::RANGE), name(ibis::util::strnewdup(prop)),
          lower(lv), upper(rv), left_op(lop), right_op(rop) {};
    qContinuousRange(const char* prop, COMPARE op, double val)
        : qRange(ibis::qExpr::RANGE), name(ibis::util::strnewdup(prop)),
          lower(-DBL_MAX), upper(val), left_op(OP_UNDEFINED), right_op(op) {
        // prefer to use the operator < and <= rather than > and >=
        if (right_op == ibis::qExpr::OP_GT) {
            right_op = ibis::qExpr::OP_UNDEFINED;
            left_op = ibis::qExpr::OP_LT;
            lower = upper;
            upper = DBL_MAX;
        }
        else if (right_op == ibis::qExpr::OP_GE) {
            right_op = ibis::qExpr::OP_UNDEFINED;
            left_op = ibis::qExpr::OP_LE;
            lower = upper;
            upper = DBL_MAX;
        }
    };

    virtual ~qContinuousRange() {delete [] name;}

    // provide read access to all private variables
    virtual const char *colName() const {return name;}
    COMPARE leftOperator() const {return left_op;}
    COMPARE rightOperator() const {return right_op;}
    virtual double leftBound() const {return lower;}
    virtual double rightBound() const {return upper;}
    // allow one to possibly change the left and right bounds, the left and
    // right operator
    double& leftBound() {return lower;}
    double& rightBound() {return upper;}
    COMPARE& leftOperator() {return left_op;}
    COMPARE& rightOperator() {return right_op;}

    // Fold the boundaries to integers.
    void foldBoundaries();
    // Fold the boundaries to unsigned integers.
    void foldUnsignedBoundaries();

    virtual qContinuousRange* dup() const {return new qContinuousRange(*this);}
    virtual bool inRange(double val) const;
    virtual void restrictRange(double left, double right);
    virtual bool empty() const;

    virtual void print(std::ostream&) const;
    virtual void printFull(std::ostream& out) const;

    bool overlap(double, double) const;
    inline bool operator<(const qContinuousRange& y) const;

private:
    char* name;
    double lower, upper;
    COMPARE left_op, right_op;

    qContinuousRange& operator=(const qContinuousRange&);
    friend void ibis::qExpr::simplify(ibis::qExpr*&);
}; // ibis::qContinuousRange

class FASTBIT_CXX_DLLSPEC ibis::qDiscreteRange : public ibis::qRange {
public:
    qDiscreteRange() : qRange(DRANGE) {};
    qDiscreteRange(const char *col, const char *nums);
    qDiscreteRange(const char *col, const std::vector<uint32_t>& val);
    qDiscreteRange(const char *col, const std::vector<double>& val);
    qDiscreteRange(const char *col, ibis::array_t<uint32_t>& val);
    qDiscreteRange(const char *col, ibis::array_t<double>& val);

    qDiscreteRange(const qDiscreteRange& dr)
        : qRange(DRANGE), name(dr.name), values(dr.values) {}
    virtual ~qDiscreteRange() {}; // private variables automatically destructs

    virtual const char* colName() const {return name.c_str();}
    const ibis::array_t<double>& getValues() const {return values;}
    ibis::array_t<double>& getValues() {return values;}

    virtual qDiscreteRange* dup() const {return new qDiscreteRange(*this);}
    virtual bool inRange(double val) const;
    virtual void restrictRange(double left, double right);
    virtual bool empty() const {return values.empty();}
    virtual double leftBound() const {
        return (values.empty() ? DBL_MAX : values.front());}
    virtual double rightBound() const {
        return (values.empty() ? -DBL_MAX : values.back());}
    virtual uint32_t nItems() const {return values.size();}

    ibis::qExpr* convert() const;

    bool overlap(double, double) const;

    virtual void print(std::ostream&) const;
    virtual void printFull(std::ostream& out) const {print(out);}

private:
    std::string name; 
    ibis::array_t<double> values; 

    qDiscreteRange& operator=(const qDiscreteRange&);
}; // ibis::qDiscreteRange

class FASTBIT_CXX_DLLSPEC ibis::qIntHod : public ibis::qRange {
public:
    qIntHod() : qRange(INTHOD) {};
    qIntHod(const char* col, int64_t v1);
    qIntHod(const char* col, int64_t v1, int64_t v2);
    qIntHod(const char* col, const char* nums);
    template <typename T>
    qIntHod(const char* col, const std::vector<T>& nums);
    template <typename T>
    qIntHod(const char* col, const ibis::array_t<T>& nums);

    qIntHod(const qIntHod& ih)
        : qRange(INTHOD), name(ih.name), values(ih.values) {};

    virtual ~qIntHod() {};

    const char* colName() const {return name.c_str();}
    const ibis::array_t<int64_t>& getValues() const {return values;}
    ibis::array_t<int64_t>& getValues() {return values;}

    virtual bool inRange(double val) const;
    virtual bool inRange(int64_t val) const;
    virtual void restrictRange(double, double);
    virtual double leftBound() const {
        return (values.empty() ? DBL_MAX : values.front());}
    virtual double rightBound() const {
        return (values.empty() ? -DBL_MAX : values.back());}
    virtual bool empty() const {return values.empty();}
    virtual qIntHod* dup() const {return new qIntHod(*this);}
    virtual uint32_t nItems() const {return values.size();}

    virtual void print(std::ostream&) const;
    virtual void printFull(std::ostream&) const;

private:
    std::string name;
    ibis::array_t<int64_t> values;
}; // ibis::qIntHod

class FASTBIT_CXX_DLLSPEC ibis::qUIntHod : public ibis::qRange {
public:
    qUIntHod() : qRange(UINTHOD) {};
    qUIntHod(const char* col, uint64_t v1);
    qUIntHod(const char* col, uint64_t v1, uint64_t v2);
    qUIntHod(const char* col, const char* nums);
    template <typename T>
    qUIntHod(const char* col, const std::vector<T>& nums);
    template <typename T>
    qUIntHod(const char* col, const ibis::array_t<T>& nums);

    qUIntHod(const qUIntHod& ih)
        : qRange(UINTHOD), name(ih.name), values(ih.values) {};

    virtual ~qUIntHod() {};

    const char* colName() const {return name.c_str();}
    const ibis::array_t<uint64_t>& getValues() const {return values;}
    ibis::array_t<uint64_t>& getValues() {return values;}

    virtual bool inRange(double val) const;
    virtual bool inRange(uint64_t val) const;
    virtual void restrictRange(double, double);
    virtual double leftBound() const {
        return (values.empty() ? DBL_MAX : values.front());}
    virtual double rightBound() const {
        return (values.empty() ? -DBL_MAX : values.back());}
    virtual bool empty() const {return values.empty();}
    virtual qUIntHod* dup() const {return new qUIntHod(*this);}
    virtual uint32_t nItems() const {return values.size();}

    virtual void print(std::ostream&) const;
    virtual void printFull(std::ostream&) const;

private:
    std::string name;
    ibis::array_t<uint64_t> values;
}; // ibis::qUIntHod

class FASTBIT_CXX_DLLSPEC ibis::qString : public ibis::qExpr {
public:
    // construct the qString from two strings
    qString() : qExpr(STRING), lstr(0), rstr(0) {};
    qString(const char* ls, const char* rs);
    virtual ~qString() {delete [] rstr; delete [] lstr;}

    const char* leftString() const {return lstr;}
    const char* rightString() const {return rstr;}

    virtual qString* dup() const {return new qString(*this);}
    virtual void print(std::ostream&) const;
    virtual void printFull(std::ostream& out) const {print(out);}
    virtual void getTableNames(std::set<std::string>& plist) const;

private:
    char* lstr;
    char* rstr;

    qString(const qString& rhs) : qExpr(STRING),
                                  lstr(ibis::util::strnewdup(rhs.lstr)),
                                  rstr(ibis::util::strnewdup(rhs.rstr)) {}
    qString& operator=(const qString&);
}; // ibis::qString

class FASTBIT_CXX_DLLSPEC ibis::qLike : public ibis::qExpr {
public:
    qLike() : qExpr(LIKE), lstr(0), rpat(0) {};
    qLike(const char* ls, const char* rs);
    virtual ~qLike() {delete [] rpat; delete [] lstr;}

    const char* colName() const {return lstr;}
    const char* pattern() const {return rpat;}

    virtual qLike* dup() const {return new qLike(*this);}
    virtual void print(std::ostream&) const;
    virtual void printFull(std::ostream& out) const {print(out);}
    virtual void getTableNames(std::set<std::string>& plist) const;

private:
    char* lstr;
    char* rpat;

    qLike(const qLike& rhs) : qExpr(LIKE),
                              lstr(ibis::util::strnewdup(rhs.lstr)),
                              rpat(ibis::util::strnewdup(rhs.rpat)) {}
    qLike& operator=(const qLike&);
}; // ibis::qLike

class FASTBIT_CXX_DLLSPEC ibis::qMultiString : public ibis::qExpr {
public:
    qMultiString() : qExpr(MSTRING) {};
    qMultiString(const char *col, const char *sval);
    virtual ~qMultiString() {}; // name and values automatically destroyed

    virtual qMultiString* dup() const {return new qMultiString(*this);}
    virtual void print(std::ostream& out) const;
    virtual void printFull(std::ostream& out) const {print(out);}

    const char* colName() const {return name.c_str();}
    const std::vector<std::string>& valueList() const {return values;}
    ibis::qExpr* convert() const;
    virtual void getTableNames(std::set<std::string>& plist) const;

private:
    std::string name;
    std::vector<std::string> values;
}; // ibis::qMultiString

namespace ibis {
    namespace math {
        enum TERM_TYPE {UNDEF_TERM, VARIABLE, NUMBER, STRING, OPERATOR,
                        STDFUNCTION1, STDFUNCTION2,
                        CUSTOMFUNCTION1, CUSTOMFUNCTION2};
        enum OPERADOR {UNKNOWN=0, BITOR, BITAND, PLUS, MINUS, MULTIPLY,
                       DIVIDE, REMAINDER, NEGATE, POWER};
        enum STDFUN1 {ACOS=0, ASIN, ATAN, CEIL, COS, COSH, EXP, FABS, FLOOR,
                      FREXP, LOG10, LOG, MODF, ROUND, SIN, SINH, SQRT, TAN,
                      TANH, IS_ZERO, IS_NONZERO};
        enum STDFUN2 {ATAN2=0, FMOD, LDEXP, ROUND2, POW, IS_EQL, IS_GTE,
                      IS_LTE};

        extern const char* operator_name[];
        extern const char* stdfun1_name[];
        extern const char* stdfun2_name[];
        extern bool preserveInputExpressions;

        class term : public ibis::qExpr {
        public:
            virtual ~term() {};

            virtual TERM_TYPE termType() const = 0;

            virtual double eval() const = 0;
            virtual bool isTrue() const {return(eval() != 0);}
            virtual term* dup() const = 0;
            virtual void print(std::ostream& out) const = 0;
            virtual void printFull(std::ostream& out) const {print(out);}
            virtual term* reduce() {return this;};

        protected:
            term() : qExpr(MATHTERM) {}; // used by concrete derived classes
        }; // abstract term

        class barrel {
        public:
            barrel() {};
            barrel(const term* const t) {recordVariable(t);}
            virtual ~barrel() {};

            // access functions to the names and values
            uint32_t size() const {return varmap.size();}
            const char* name(uint32_t i) const {return namelist[i];}
            const double& value(uint32_t i) const {return varvalues[i];}
            double& value(uint32_t i) {return varvalues[i];}

            void recordVariable(const term* const t);
            inline uint32_t recordVariable(const char* name);
            bool equivalent(const barrel& rhs) const;

        protected:
            // the data structure to store the variable names in a mathematical
            // expression
            typedef std::map< const char*, uint32_t, ibis::lessi > termMap;

            // functions used by the class variable for accessing values of the
            // variables
            friend class variable;
            double getValue(uint32_t i) const {return varvalues[i];}
            double getValue(const char* nm) const {
                termMap::const_iterator it = varmap.find(nm);
                if (it != varmap.end()) {
                    uint32_t i = (*it).second;
                    return varvalues[i];
                }
                else {
                    return DBL_MAX;
                }
            }

            termMap varmap;
            std::vector< double > varvalues; 
            std::vector< const char* > namelist; 
        }; // class barrel

        class variable : public term {
        public:
            // The constructor inserts the variable name to a list in expr and
            // record the position in private member variable (that is used
            // later to retrieve value from expr class).
            variable(const char* var)
                : name(ibis::util::strnewdup(var)), myBar(0), varind(0) {}
            variable(const variable& v)
                : name(ibis::util::strnewdup(v.name)), myBar(v.myBar),
                  varind(v.varind) {}
            virtual ~variable() {delete [] name;}

            virtual TERM_TYPE termType() const {return VARIABLE;}
            virtual variable* dup() const {return new variable(*this);}
            virtual double eval() const {return myBar->getValue(varind);}
            virtual void getTableNames(std::set<std::string>& plist) const;

            virtual uint32_t nItems() const {return 1U;}
            virtual void print(std::ostream& out) const {out << name;}
            virtual void printFull(std::ostream& out) const {out << name;}
            const char* variableName() const {return name;}

            void recordVariable(barrel& bar) const {
                if (name != 0 && *name != 0 && *name != '*') {
                    varind = bar.recordVariable(name);
                    myBar = &bar;
                }
            }

        protected:
            char* name; // the variable name
            mutable barrel* myBar;// the barrel containing it
            mutable uint32_t varind;// the token to retrieve value from myBar

        private:
            variable& operator=(const variable&);
        }; // the variable term

        class number : public term {
        public:
            number(const char* num) : val(atof(num)) {};
            number(double v) : val(v) {};
            virtual ~number() {};

            virtual TERM_TYPE termType() const {return NUMBER;}
            virtual number* dup() const {return new number(val);}
            virtual double eval() const {return val;}

            virtual uint32_t nItems() const {return 1U;}
            virtual void print(std::ostream& out) const {out << val;}
            virtual void printFull(std::ostream& out) const {out << val;}
            virtual bool isConstant() const {return true;}
            virtual bool isTrue() const {return(val != 0);}

            void negate() {val = -val;}
            void invert() {val = 1.0/val;}

        private:
            double val;
            friend class bediener;
            friend void ibis::qExpr::simplify(ibis::qExpr*&);
        }; // number

        class literal : public term {
        public:
            literal(const char* s) : str(ibis::util::strnewdup(s)) {};
            virtual ~literal() {delete [] str;}

            virtual TERM_TYPE termType() const {return ibis::math::STRING;}
            virtual literal* dup() const {return new literal(str);}
            virtual double eval() const {return 0.0;}
            virtual bool isConstant() const {return true;}
            virtual bool isTrue() const {
                return(str != 0 && (*str == 't' || *str == 'T' ||
                                    (*str == '1' && *str == 0)));}

            virtual uint32_t nItems() const {return 1U;}
            virtual void print(std::ostream& out) const {out << str;}
            virtual void printFull(std::ostream& out) const {out << str;}
            operator const char* () const {return str;}

        private:
            char* str;

            literal(const literal&);
            literal& operator=(const literal&);
        }; // literal

        class bediener : public term {
        public:
            bediener(ibis::math::OPERADOR op) : operador(op) {};
            virtual ~bediener() {};

            virtual TERM_TYPE termType() const {return OPERATOR;}
            virtual bediener* dup() const {
                bediener *tmp = new bediener(operador);
                if (getRight() != 0)
                    tmp->setRight(getRight()->dup());
                if (getLeft() != 0)
                    tmp->setLeft(getLeft()->dup());
                return tmp;
            }
            virtual double eval() const;
            virtual void print(std::ostream& out) const;
            virtual void printFull(std::ostream& out) const {print(out);}
            virtual term* reduce();
            OPERADOR getOperator() const {return operador;}

        private:
            ibis::math::OPERADOR operador; // Spanish for operator

            void reorder(); // reorder the tree of operators
            // place the operands into the list of terms if the operator
            // matches the specified one.
            void linearize(const ibis::math::OPERADOR op,
                           std::vector<ibis::math::term*>& terms);
            // If the right operand is a constant, change operator from - to +
            // or from / to *.
            void convertConstants();
            friend void ibis::qExpr::simplify(ibis::qExpr*&);
        }; // bediener

        class stdFunction1 : public term {
        public:
            stdFunction1(const char* name);
            stdFunction1(const STDFUN1 ft) : ftype(ft) {}
            virtual ~stdFunction1() {}

            virtual stdFunction1* dup() const {
                stdFunction1 *tmp = new stdFunction1(ftype);
                tmp->setLeft(getLeft()->dup());
                return tmp;
            }
            virtual TERM_TYPE termType() const {return STDFUNCTION1;}
            virtual double eval() const;
            virtual void print(std::ostream& out) const;
            virtual void printFull(std::ostream& out) const {print(out);}
            virtual term* reduce();

        private:
            STDFUN1 ftype;
        }; // stdFunction1

        class stdFunction2 : public term {
        public:
            stdFunction2(const char* name);
            stdFunction2(const STDFUN2 ft) : ftype(ft) {}
            virtual ~stdFunction2() {}

            virtual stdFunction2* dup() const {
                stdFunction2 *tmp = new stdFunction2(ftype);
                tmp->setRight(getRight()->dup());
                tmp->setLeft(getLeft()->dup());
                return tmp;
            }
            virtual TERM_TYPE termType() const {return STDFUNCTION2;}
            virtual double eval() const;
            virtual void print(std::ostream& out) const;
            virtual void printFull(std::ostream& out) const {print(out);}
            virtual term* reduce();

        private:
            STDFUN2 ftype;
        }; // stdFunction2
    } // namespace ibis::math
} // namespace ibis

class FASTBIT_CXX_DLLSPEC ibis::compRange : public ibis::qExpr {
public:

    compRange() : qExpr(ibis::qExpr::COMPRANGE), expr3(0),
                  op12(ibis::qExpr::OP_UNDEFINED),
                  op23(ibis::qExpr::OP_UNDEFINED) {;}
    compRange(ibis::math::term* me1, COMPARE lop,
              ibis::math::term* me2)
        : qExpr(ibis::qExpr::COMPRANGE, me1, me2), expr3(0),
          op12(lop), op23(ibis::qExpr::OP_UNDEFINED) {;}
    compRange(ibis::math::term* me1, ibis::qExpr::COMPARE lop,
              ibis::math::term* me2, ibis::qExpr::COMPARE rop,
              ibis::math::term* me3)
        : qExpr(ibis::qExpr::COMPRANGE, me1, me2), expr3(me3),
          op12(lop), op23(rop) {;}
    compRange(const compRange& rhs) :
        ibis::qExpr(rhs), expr3(rhs.expr3 ? rhs.expr3->dup() : 0),
        op12(rhs.op12), op23(rhs.op23) {};
    virtual ~compRange() {delete expr3;}

    // provide read access to the operators
    ibis::qExpr::COMPARE leftOperator() const {return op12;}
    ibis::qExpr::COMPARE rightOperator() const {return op23;}
    ibis::math::term* getTerm3() {return expr3;}
    const ibis::math::term* getTerm3() const {return expr3;}
    void setTerm3(ibis::math::term* t) {delete expr3; expr3 = t;}

    virtual qExpr* dup() const {return new compRange(*this);}
    inline bool inRange() const;

    virtual uint32_t nItems() const {
        return ibis::qExpr::nItems() +
            (expr3 != 0 ? expr3->nItems() : 0);}
    virtual void print(std::ostream&) const;
    virtual void printFull(std::ostream& out) const {print(out);}
    virtual void getTableNames(std::set<std::string>& plist) const;

    virtual bool isConstant() const {
        return ((getLeft() != 0 ? getLeft()->isConstant() : true) &&
                (getRight() != 0 ? getRight()->isConstant() : true) &&
                (expr3 != 0 ? expr3->isConstant() : true));}
    virtual bool isSimple() const {return isSimpleRange();}
    inline bool isSimpleRange() const;

    bool maybeStringCompare() const;

    // convert a simple expression to qContinuousRange
    ibis::qContinuousRange* simpleRange() const;
    static compRange* makeConstantFalse();
    static compRange* makeConstantTrue();

private:
    ibis::math::term *expr3;    // the right most expression
    ibis::qExpr::COMPARE op12;  // between qExpr::left and qExpr::right
    ibis::qExpr::COMPARE op23;  // between qExpr::right and expr3
}; // ibis::compRange

class ibis::deprecatedJoin : public ibis::qExpr {
public:
    deprecatedJoin(const char* n1, const char *n2)
        : ibis::qExpr(ibis::qExpr::DEPRECATEDJOIN), name1(n1), name2(n2),
          expr(0) {};
    deprecatedJoin(const char* n1, const char *n2, ibis::math::term *x) : 
        ibis::qExpr(ibis::qExpr::DEPRECATEDJOIN), name1(n1), name2(n2),
        expr(x) {};
    virtual ~deprecatedJoin() {delete expr;};

    virtual void print(std::ostream& out) const;
    virtual void printFull(std::ostream& out) const {print(out);}
    virtual deprecatedJoin* dup() const
    {return new deprecatedJoin(name1.c_str(), name2.c_str(), expr->dup());};

    const char* getName1() const {return name1.c_str();}
    const char* getName2() const {return name2.c_str();}
    ibis::math::term* getRange() {return expr;}
    const ibis::math::term* getRange() const {return expr;}
    void setRange(ibis::math::term *t) {delete expr; expr = t;}

    virtual uint32_t nItems() const {
        return ibis::qExpr::nItems() +
            (expr != 0 ? expr->nItems() : 0);}

private:
    std::string name1;
    std::string name2;
    ibis::math::term *expr;

    deprecatedJoin(const deprecatedJoin&);
    deprecatedJoin& operator=(const deprecatedJoin&);
}; // class ibis::deprecatedJoin

class ibis::qAnyAny : public ibis::qExpr {
public:
    qAnyAny() : qExpr(ANYANY) {};
    qAnyAny(const char *pre, const double dbl);
    qAnyAny(const char *pre, const char *val);
    ~qAnyAny() {}; // all data members can delete themselves.

    const char* getPrefix() const {return prefix.c_str();}
    const ibis::array_t<double>& getValues() const {return values;}

    virtual qExpr* dup() const {return new qAnyAny(*this);}

    virtual void print(std::ostream& out) const;
    virtual void printFull(std::ostream& out) const {print(out);}
    virtual void getTableNames(std::set<std::string>& plist) const;

private:
    std::string prefix; 
    ibis::array_t<double> values; 
}; // class ibis::qAnyAny

inline void ibis::qContinuousRange::foldBoundaries() {
    switch (left_op) {
    case ibis::qExpr::OP_LT:
        lower = floor(lower);
        break;
    case ibis::qExpr::OP_LE:
        lower = ceil(lower);
        break;
    case ibis::qExpr::OP_GT:
        lower = ceil(lower);
        break;
    case ibis::qExpr::OP_GE:
        lower = floor(lower);
        break;
    case ibis::qExpr::OP_EQ:
        if (lower != floor(lower))
            left_op = ibis::qExpr::OP_UNDEFINED;
        break;
    default:
        break;
    }
    switch (right_op) {
    case ibis::qExpr::OP_LT:
        upper = ceil(upper);
        break;
    case ibis::qExpr::OP_LE:
        upper = floor(upper);
        break;
    case ibis::qExpr::OP_GT:
        upper = floor(upper);
        break;
    case ibis::qExpr::OP_GE:
        upper = ceil(upper);
        break;
    case ibis::qExpr::OP_EQ:
        if (upper != floor(upper))
            right_op = ibis::qExpr::OP_UNDEFINED;
        break;
    default:
        break;
    }
} //ibis::qContinuousRange::foldBoundaries

inline void ibis::qContinuousRange::foldUnsignedBoundaries() {
    switch (left_op) {
    case ibis::qExpr::OP_LT:
        if (lower >= 0.0) {
            lower = floor(lower);
        }
        else {
            left_op = ibis::qExpr::OP_LE;
            lower = 0.0;
        }
        break;
    case ibis::qExpr::OP_LE:
        if (lower >= 0.0)
            lower = ceil(lower);
        else
            lower = 0.0;
        break;
    case ibis::qExpr::OP_GT:
        lower = ceil(lower);
        break;
    case ibis::qExpr::OP_GE:
        lower = floor(lower);
        break;
    case ibis::qExpr::OP_EQ:
        if (lower != floor(lower) || lower < 0.0)
            left_op = ibis::qExpr::OP_UNDEFINED;
        break;
    default:
        break;
    }
    switch (right_op) {
    case ibis::qExpr::OP_LT:
        upper = ceil(upper);
        break;
    case ibis::qExpr::OP_LE:
        upper = floor(upper);
        break;
    case ibis::qExpr::OP_GT:
        if (upper > 0.0) {
            upper = floor(upper);
        }
        else {
            right_op = ibis::qExpr::OP_GE;
            upper = 0.0;
        }
        break;
    case ibis::qExpr::OP_GE:
        if (upper >= 0.0)
            upper = ceil(upper);
        else
            upper = 0.0;
        break;
    case ibis::qExpr::OP_EQ:
        if (upper != floor(upper) || upper < 0.0)
            right_op = ibis::qExpr::OP_UNDEFINED;
        break;
    default:
        break;
    }
} //ibis::qContinuousRange::foldUnsignedBoundaries

inline bool 
ibis::qContinuousRange::operator<(const ibis::qContinuousRange& y) const {
    int cmp = strcmp(colName(), y.colName());
    if (cmp < 0)
        return true;
    else if (cmp > 0)
        return false;
    else if (left_op < y.left_op)
        return true;
    else if (left_op > y.left_op)
        return false;
    else if (right_op < y.right_op)
        return true;
    else if (right_op > y.right_op)
        return false;
    else if (lower < y.lower)
        return true;
    else if (lower > y.lower)
        return false;
    else if (upper < y.upper)
        return true;
    else
        return false;
} // ibis::qContinuousRange::operator<

inline bool ibis::compRange::isSimpleRange() const {
    bool res = false;
    if (expr3 == 0 && getLeft() != 0)
        res = ((static_cast<const ibis::math::term*>(getLeft())->
                termType()==ibis::math::VARIABLE &&
                static_cast<const ibis::math::term*>(getRight())->
                termType()==ibis::math::NUMBER) ||
               (static_cast<const ibis::math::term*>(getLeft())->
                termType()==ibis::math::NUMBER &&
                static_cast<const ibis::math::term*>(getRight())->
                termType()==ibis::math::VARIABLE));
    else if (expr3 != 0 && expr3->termType()==ibis::math::NUMBER)
        res = (getLeft() == 0 &&
               static_cast<const ibis::math::term*>(getRight())->termType()
               == ibis::math::VARIABLE) || 
            (static_cast<const ibis::math::term*>(getLeft())->
             termType()==ibis::math::NUMBER &&
             static_cast<const ibis::math::term*>(getRight())->
             termType()==ibis::math::VARIABLE);
    return res;
} // ibis::compRange::isSimpleRange

inline bool ibis::compRange::maybeStringCompare() const {
    return (expr3 == 0 && op12==OP_EQ && getLeft() != 0 && getRight() != 0 &&
            (static_cast<const ibis::math::term*>(getLeft())->termType()
             ==ibis::math::VARIABLE ||
             static_cast<const ibis::math::term*>(getLeft())->termType()
             ==ibis::math::STRING) &&
            (static_cast<const ibis::math::term*>(getRight())->termType()
             ==ibis::math::VARIABLE ||
             static_cast<const ibis::math::term*>(getRight())->termType()
             ==ibis::math::STRING));
} // ibis::compRange::maybeStringCompare

inline bool ibis::compRange::inRange() const {
    if (getRight() == 0) return false;

    const double tm2 =
        static_cast<const ibis::math::term*>(getRight())->eval();
    if (op12 == OP_UNDEFINED && op23 == OP_UNDEFINED)
        return (tm2 != 0.0);

    bool res = true;
    if (getLeft() != 0 && op12 != OP_UNDEFINED) {
        const double tm1 =
            static_cast<const ibis::math::term*>(getLeft())->eval();
        switch (op12) {
        case OP_LT: res = (tm1 < tm2);  break;
        case OP_LE: res = (tm1 <= tm2); break;
        case OP_GT: res = (tm1 > tm2);  break;
        case OP_GE: res = (tm1 >= tm2); break;
        case OP_EQ: res = (tm1 == tm2); break;
        default:    break;
        }
    }
    if (expr3 != 0 && op23 != OP_UNDEFINED && res == true) {
        const double tm3 = expr3->eval();
        switch (op23) {
        case OP_LT: res = (tm2 < tm3);  break;
        case OP_LE: res = (tm2 <= tm3); break;
        case OP_GT: res = (tm2 > tm3);  break;
        case OP_GE: res = (tm2 >= tm3); break;
        case OP_EQ: res = (tm2 == tm3); break;
        default:    break;
        }
    }
    return res;
} // ibis::compRange::inRange

inline bool ibis::qDiscreteRange::inRange(double val) const {
    if (values.empty()) return false;
    if (val < values[0] || val > values.back()) return false;

    uint32_t i = 0, j = values.size();
    if (j < 32) { // sequential search
        // -- because the heavy branch prediction cost, linear search is
        // more efficient for fairly large range.
        for (i = 0; i < j; ++ i)
            if (values[i] == val) return true;
        return false;
    }
    else { // binary search
        uint32_t m = (i + j) / 2;
        while (i < m) {
            if (values[m] == val) return true;
            if (values[m] < val)
                i = m;
            else
                j = m;
            m = (i + j) / 2;
        }
        return (values[m] == val);
    }
} // ibis::qDiscreteRange::inRange

inline bool ibis::qIntHod::inRange(double val) const {
    if (values.empty()) return false;
    if (val < values[0] || val > values.back()) return false;

    uint32_t i = 0, j = values.size();
    if (j < 32) { // sequential search
        // -- because the heavy branch prediction cost, linear search is
        // more efficient for fairly large range.
        for (i = 0; i < j; ++ i)
            if (values[i] == val) return true;
        return false;
    }
    else { // binary search
        uint32_t m = (i + j) / 2;
        while (i < m) {
            if (values[m] == val) return true;
            if (values[m] < val)
                i = m;
            else
                j = m;
            m = (i + j) / 2;
        }
        return (values[m] == val);
    }
} // ibis::qIntHod::inRange

inline bool ibis::qUIntHod::inRange(double val) const {
    if (values.empty()) return false;
    if (val < values[0] || val > values.back()) return false;

    uint32_t i = 0, j = values.size();
    if (j < 32) { // sequential search
        // -- because the heavy branch prediction cost, linear search is
        // more efficient for fairly large range.
        for (i = 0; i < j; ++ i)
            if (values[i] == val) return true;
        return false;
    }
    else { // binary search
        uint32_t m = (i + j) / 2;
        while (i < m) {
            if (values[m] == val) return true;
            if (values[m] < val)
                i = m;
            else
                j = m;
            m = (i + j) / 2;
        }
        return (values[m] == val);
    }
} // ibis::qUIntHod::inRange

inline bool ibis::qIntHod::inRange(int64_t val) const {
    if (values.empty()) return false;
    if (val < values[0] || val > values.back()) return false;

    uint32_t i = 0, j = values.size();
    if (j < 32) { // sequential search
        // -- because the heavy branch prediction cost, linear search is
        // more efficient for fairly large range.
        for (i = 0; i < j; ++ i)
            if (values[i] == val) return true;
        return false;
    }
    else { // binary search
        uint32_t m = (i + j) / 2;
        while (i < m) {
            if (values[m] == val) return true;
            if (values[m] < val)
                i = m;
            else
                j = m;
            m = (i + j) / 2;
        }
        return (values[m] == val);
    }
} // ibis::qIntHod::inRange

inline bool ibis::qUIntHod::inRange(uint64_t val) const {
    if (values.empty()) return false;
    if (val < values[0] || val > values.back()) return false;

    uint32_t i = 0, j = values.size();
    if (j < 32) { // sequential search
        // -- because the heavy branch prediction cost, linear search is
        // more efficient for fairly large range.
        for (i = 0; i < j; ++ i)
            if (values[i] == val) return true;
        return false;
    }
    else { // binary search
        uint32_t m = (i + j) / 2;
        while (i < m) {
            if (values[m] == val) return true;
            if (values[m] < val)
                i = m;
            else
                j = m;
            m = (i + j) / 2;
        }
        return (values[m] == val);
    }
} // ibis::qUIntHod::inRange

inline uint32_t ibis::math::barrel::recordVariable(const char* name) {
    uint32_t ind = varmap.size();
    termMap::const_iterator it = varmap.find(name);
    if (it == varmap.end()) {
        varmap[name] = ind;
        namelist.push_back(name);
        varvalues.push_back(0.0);
    }
    else {
        ind = (*it).second;
    }
    return ind;
} // ibis::math::barrel::recordVariable

namespace std {
    inline ostream& operator<<(ostream&, const ibis::qExpr&);
    inline ostream& operator<<(ostream&, const ibis::qExpr::COMPARE&);
}

inline std::ostream& std::operator<<(std::ostream& out, const ibis::qExpr& pn) {
    if (ibis::gVerbose > 5)
        pn.printFull(out);
    else
        pn.print(out);
    return out;
} // std::operator<<

inline std::ostream& std::operator<<(std::ostream& out,
                                     const ibis::qExpr::COMPARE& op) {
    switch (op) {
    default:
    case ibis::qExpr::OP_UNDEFINED:
        out << "??"; break;
    case ibis::qExpr::OP_LT:
        out << "<"; break;
    case ibis::qExpr::OP_LE:
        out << "<="; break;
    case ibis::qExpr::OP_GT:
        out << ">"; break;
    case ibis::qExpr::OP_GE:
        out << ">="; break;
    case ibis::qExpr::OP_EQ:
        out << "=="; break;
    }
    return out;
} // std::operator<<
#endif // IBIS_EXPR_H