This data structure holds a single name. More...
#include <qExpr.h>
Inheritance diagram for ibis::qExists:
Public Member Functions | |
| const char * | colName () const |
| Return the column name. | |
| virtual qExists * | dup () const |
| Duplicate the object. | |
| virtual bool | isSimple () const |
| Is the expression simple? A simple expression contains only range conditions connected with logical operators. More... | |
| virtual void | print (std::ostream &out) const |
| Print out the node in the string form. More... | |
| virtual void | printFull (std::ostream &out) const |
| Print out the full expression. More... | |
| qExists (const char *col) | |
 Public Member Functions inherited from ibis::qExpr | |
| bool | directEval () const |
| Can the expression be directly evaluated? | |
| void | extractDeprecatedJoins (std::vector< const deprecatedJoin * > &) const |
| Extract conjunctive terms of the deprecated joins. | |
| qRange * | findRange (const char *vname) |
| Find the first range condition involving the named variable. | |
| void | getConjunctiveTerms (termTableList &) const |
| Extract the top-level conjunctive terms. More... | |
| qExpr *& | getLeft () |
| Return a pointer to the left child. More... | |
| const qExpr * | getLeft () const |
| Return a const pointer to the left child. | |
| qExpr *& | getRight () |
| Return a pointer to the right child. More... | |
| const qExpr * | getRight () const |
| Return a const pointer to the right child. | |
| virtual void | getTableNames (std::set< std::string > &plist) const |
| Identify the data partitions involved in the query expression. More... | |
| TYPE | getType () const |
| Return the node type. | |
| virtual bool | isConstant () const |
| Is this expression a constant? A constant remains the same not matter which row it is applied to. More... | |
| bool | isTerminal () const |
| Is this expression a terminal node of an expression tree? | |
| virtual uint32_t | nItems () const |
| Count the number of items in the query expression. | |
| qExpr & | operator= (const qExpr &rhs) |
| Assignment operator. | |
| qExpr () | |
| Default constructor. It generates a node of undefined type. | |
| qExpr (TYPE op) | |
| Construct a node of specified type. Not for implicit type conversion. | |
| qExpr (TYPE op, qExpr *qe1, qExpr *qe2) | |
| Construct a full specified node. More... | |
| qExpr (const qExpr &qe) | |
| Copy Constructor. Deep copy. | |
| double | reorder (const weight &) |
| After reordering, the lightest weight is one the left side of a group of commutable operators. More... | |
| int | separateSimple (ibis::qExpr *&simple, ibis::qExpr *&tail) const |
| Separate an expression tree into two connected with an AND operator. More... | |
| void | setLeft (qExpr *expr) |
| Change the left child. More... | |
| void | setRight (qExpr *expr) |
| Change the right child. More... | |
| void | swap (qExpr &rhs) |
| Swap the content. No exception expected. | |
| virtual | ~qExpr () |
| Destructor. More... | |
Additional Inherited Members | |
| Public Types inherited from ibis::qExpr | |
| enum | COMPARE { OP_UNDEFINED, OP_LT, OP_GT, OP_LE, OP_GE, OP_EQ } |
| Comparison operator supported in RANGE. | |
| typedef std::vector< TTN > | termTableList |
| enum | TYPE { LOGICAL_UNDEFINED, LOGICAL_NOT, LOGICAL_AND, LOGICAL_OR, LOGICAL_XOR, LOGICAL_MINUS, RANGE, DRANGE, STRING, ANYSTRING, KEYWORD, ALLWORDS, COMPRANGE, MATHTERM, DEPRECATEDJOIN, TOPK, EXISTS, ANYANY, LIKE, INTHOD, UINTHOD } |
| Definition of node types. More... | |
| Static Public Member Functions inherited from ibis::qExpr | |
| static std::string | extractTableName (const char *) |
| Extract the data partition name from the column name cn. More... | |
| static void | simplify (ibis::qExpr *&) |
| Attempt to simplify the query expressions. More... | |
| static void | splitColumnName (const char *, std::string &, std::string &) |
| Split the incoming name into data partition name and column name. More... | |
| Protected Member Functions inherited from ibis::qExpr | |
| void | adjust () |
| Adjust the tree to favor the sequential evaluation order. More... | |
| Protected Attributes inherited from ibis::qExpr | |
| qExpr * | left |
| The left child. | |
| qExpr * | right |
| The right child. | |
| TYPE | type |
| The type of node. More... | |
Detailed Description
This data structure holds a single name.
Note that the name in this function is not checked against the list of the known variables. Furthermore, when this expression appears as the left side of binary operator, the names on the right-hand side of the expression is not checked either.
Member Function Documentation
|
inlinevirtual |
Is the expression simple? A simple expression contains only range conditions connected with logical operators.
Reimplemented from ibis::qExpr.
|
virtual |
Print out the node in the string form.
The short-form of the print function.
It only prints information about the current node of the query expression tree.
Reimplemented from ibis::qExpr.
|
virtual |
Print out the full expression.
The long form of the print function.
It recursively prints out the whole query expression tree, which can be quite long.
Reimplemented from ibis::qExpr.
The documentation for this class was generated from the following files:
- qExpr.h
- qExpr.cpp
