A user specifies this type of query expression with the following syntax,. More...
#include <qExpr.h>
Inheritance diagram for ibis::qAnyAny:
Public Member Functions | |
| virtual qExpr * | dup () const |
| Duplicate this. More... | |
| const char * | getPrefix () const |
| virtual void | getTableNames (std::set< std::string > &plist) const |
| Identify the data partitions involved in the query expression. More... | |
| const ibis::array_t< double > & | getValues () const |
| 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... | |
| qAnyAny (const char *pre, const double dbl) | |
| Constructing a qAnyAny object from a string and a floating-point value. | |
| qAnyAny (const char *pre, const char *val) | |
| Constructing an object of type qAnyAny from two strings. More... | |
 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. | |
| 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... | |
| virtual bool | isSimple () const |
| Is the expression simple? A simple expression contains only range conditions connected with logical operators. 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
A user specifies this type of query expression with the following syntax,.
- any(prefix) = value
- any(prefix) in (list of values) If any column with the given prefix contains the specified values, the row is considered as a hit. This is intended to be used in the cases where the
prefixis actually the name of a set-valued attribute, such as triggerID in STAR datasets. In this case, the set-valued attribute is translated into a number of columns with the same prefix. A common query is "does the set contain a particular value?" or "does the set contain a particular set of values?"
Constructor & Destructor Documentation
| ibis::qAnyAny::qAnyAny | ( | const char * | pre, |
| const char * | val | ||
| ) |
Constructing an object of type qAnyAny from two strings.
The second string is expected to be a list of numbers separated by coma and space.
References ibis::array_t< T >::push_back(), and ibis::array_t< T >::reserve().
Member Function Documentation
|
inlinevirtual |
Duplicate this.
Use the compiler generated copy constructor to perform duplication.
Reimplemented from ibis::qExpr.
|
virtual |
Identify the data partitions involved in the query expression.
Return the list of data partition names in a set.
It records a '*' for the variables without explicit partition names.
Reimplemented from ibis::qExpr.
References ibis::qExpr::extractTableName().
|
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.
Referenced by printFull().
|
inlinevirtual |
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.
References print().
The documentation for this class was generated from the following files:
- qExpr.h
- qExpr.cpp
