Go to the SVN repository for this file.
51 for(; it != it_end; ++it, ++
i) {
53args.push_back(arg_node);
Expression evaluation visitor functor.
Base class for evaluation functions.
Query tree and associated utility methods.
definition of a Culling tree
CQueryParseTree * m_QTree
void SetExec(CQueryExec &qexec)
Set reference on parent query execution class.
void AddImplicitSearchFunc(CQueryFunctionBase *func)
This is a callback for implicit search nodes Our syntax allows queries like (a=1) AND "search_term" E...
CQueryParseTree & GetQueryTree()
Get query tree (execution context)
vector< CQueryParseTree::TNode * > TArgVector
Vector for easy argument access.
const TNode * GetQueryTree() const
CQueryParseTree::TNode * GetArg0(CQueryParseTree::TNode &qnode)
Get first sub-node.
unique_ptr< CQueryFunctionBase > m_ImplicitSearchFunc
CQueryExec & GetExec()
Get reference on parent execution environment.
void AddFunc(CQueryParseNode::EType func_type, CQueryFunctionBase *func)
Register function implementation.
CQueryParseTree * GetQTree()
void MakeArgVector(CQueryParseTree::TNode &qnode, TArgVector &args)
Created vector of arguments (translate sub-nodes to vector)
virtual ~CQueryFunctionBase()
virtual void Evaluate(CQueryParseTree &qtree)
Run query tree evaluation.
#define END_NCBI_SCOPE
End previously defined NCBI scope.
#define BEGIN_NCBI_SCOPE
Define ncbi namespace.
TNodeList::iterator TNodeList_I
Fun TreeDepthFirstTraverse(TTreeNode &tree_node, Fun func)
Depth-first tree traversal algorithm.
TNodeList_CI SubNodeBegin(void) const
Return first const iterator on subnode list.
TNodeList_CI SubNodeEnd(void) const
Return last const iterator on subnode list.
Defines: CTimeFormat - storage class for time format.
Query parser execution implementations.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4