27 #include "../../core/translator/Translator.h" 28 #include "../../common/StringUtils.h" 29 #include "../../dataaccess/dataset/DataSet.h" 30 #include "../../dataaccess/dataset/DataSetType.h" 31 #include "../../dataaccess/datasource/DataSource.h" 32 #include "../../dataaccess/query_h.h" 33 #include "../core/GraphMetadata.h" 34 #include "../Config.h" 35 #include "../Exception.h" 36 #include "../Globals.h" 77 ob->push_back(obItem);
100 from->push_back(fiEdge);
102 std::string vertexFrom =
"edge.";
105 std::string vertexTo =
"edge.";
108 std::string vId =
"vertex.";
125 gb->push_back(gbItem);
129 ob->push_back(obItem);
178 fields->push_back(f);
186 ob->push_back(obItem);
virtual te::graph::Vertex * getFirstVertex()
It returns a pointer to the first vertex element of a graph.
boost::ptr_vector< GroupByItem > GroupBy
A class that can be used to model a GROUP BY clause.
te::graph::AbstractGraph * m_graph
Pointer to a abstract graph used to access the elements.
A class that can be used in a GROUP BY clause.
An abstract class that models a source of data in a query.
The Field class can be used to model an expression that takes part of the output items of a SELECT...
static const std::string sm_tableVertexModelAttrId
Attribute id.
A class that models the name of a dataset used in a From clause.
A class that models the name of any property of an object.
Base exception class for plugin module.
Expression * getExpression() const
It returns the expression set for an output select query.
virtual te::graph::Edge * getEdge(int id)=0
It returns the edge element if it's exist.
std::unique_ptr< te::da::DataSet > m_vertexQuery
Attribute used to keep the vertex iterator.
boost::ptr_vector< OrderByItem > OrderBy
A class that can be used to model an ORDER BY clause.
#define TE_TR(message)
It marks a string in order to get translated.
This is an abstract class that models a query expression.
bool m_listIsolatedVertex
Flag used to indicated that the isolated vertex will be listed.
From the point of view of graph theory, vertices are treated as featureless and indivisible objects...
virtual std::unique_ptr< DataSet > query(const Select &q, te::common::TraverseType travType=te::common::FORWARDONLY, const te::common::AccessPolicy accessPolicy=te::common::RAccess)
It executes a query that may return some data using a generic query. This method always returns a dis...
virtual te::graph::GraphMetadata * getMetadata()=0
Function used to access the graph metadata.
Class used to define the edge struct of a graph. Its compose with a identifier, the vertex origin and...
virtual te::graph::Edge * getFirstEdge()
It returns a pointer to the first edge element of a graph.
SequenceIterator(te::graph::AbstractGraph *g)
Default constructor.
static const std::string sm_tableEdgeModelAttrId
Attribute Id.
virtual ~SequenceIterator()
Virtual destructor.
Abstract class used to define the main functions of graph struct. All graph implementations must used...
boost::ptr_vector< Field > Fields
Fields is just a boost::ptr_vector of Field pointers.
A class that can be used to model a filter expression that can be applied to a query.
A Select models a query to be used when retrieving data from a DataSource.
boost::ptr_vector< FromItem > From
It models the FROM clause for a query.
std::unique_ptr< te::da::DataSet > m_edgeQuery
Attribute used to keep the edge iterator.
This class defines a commun interface to represents a graph iterator class. The main diferency to ano...
It models the comparison operator.
This class defines a commun interface to represents a graph iterator class. The main diferency to ano...
static const std::string sm_tableEdgeModelAttrVFrom
Attribute Vertex From.
A class that can be used in an ORDER BY clause to sort the items of a resulting query.
virtual te::graph::Vertex * getVertex(int id)=0
It returns the vertex element if it's exist.
static const std::string sm_tableEdgeModelAttrVTo
Attribute Vertex To.