protected Iterable<TitanRelation> executeRelations(InternalVertex vertex, BaseVertexCentricQuery baseQuery) { if (isPartitionedVertex(vertex)) { if (!hasAllCanonicalTypes()) { InternalVertex[] representatives = tx.getAllRepresentatives(vertex,restrict2Partitions); Iterable<TitanRelation> merge = null; for (InternalVertex rep : representatives) { Iterable<TitanRelation> iter = executeIndividualRelations(rep,baseQuery); if (merge==null) merge = iter; else merge = ResultMergeSortIterator.mergeSort(merge,iter,(Comparator)orders,false); } return ResultSetIterator.wrap(merge,baseQuery.getLimit()); } else vertex = tx.getCanonicalVertex(vertex); } return executeIndividualRelations(vertex,baseQuery); }
private VertexList executeIndividualVertexIds(InternalVertex vertex, BaseVertexCentricQuery baseQuery) { VertexCentricQuery query = constructQuery(vertex, baseQuery); if (useSimpleQueryProcessor(query, vertex)) return new SimpleVertexQueryProcessor(query,tx).vertexIds(); return edges2VertexIds((Iterable) executeIndividualRelations(vertex,baseQuery), vertex); }
private Iterable<TitanVertex> executeIndividualVertices(InternalVertex vertex, BaseVertexCentricQuery baseQuery) { VertexCentricQuery query = constructQuery(vertex, baseQuery); if (useSimpleQueryProcessor(query, vertex)) return new SimpleVertexQueryProcessor(query,tx).vertexIds(); else return edges2Vertices((Iterable) executeIndividualRelations(vertex,baseQuery), query.getVertex()); }
protected Iterable<TitanRelation> executeRelations(InternalVertex vertex, BaseVertexCentricQuery baseQuery) { if (isPartitionedVertex(vertex)) { if (!hasAllCanonicalTypes()) { InternalVertex[] representatives = tx.getAllRepresentatives(vertex,restrict2Partitions); Iterable<TitanRelation> merge = null; for (InternalVertex rep : representatives) { Iterable<TitanRelation> iter = executeIndividualRelations(rep,baseQuery); if (merge==null) merge = iter; else merge = ResultMergeSortIterator.mergeSort(merge,iter,(Comparator)orders,false); } return ResultSetIterator.wrap(merge,baseQuery.getLimit()); } else vertex = tx.getCanonicalVertex(vertex); } return executeIndividualRelations(vertex,baseQuery); }
protected Iterable<TitanRelation> executeRelations(InternalVertex vertex, BaseVertexCentricQuery baseQuery) { if (isPartitionedVertex(vertex)) { if (!hasAllCanonicalTypes()) { InternalVertex[] representatives = tx.getAllRepresentatives(vertex,restrict2Partitions); Iterable<TitanRelation> merge = null; for (InternalVertex rep : representatives) { Iterable<TitanRelation> iter = executeIndividualRelations(rep,baseQuery); if (merge==null) merge = iter; else merge = ResultMergeSortIterator.mergeSort(merge,iter,(Comparator)orders,false); } return ResultSetIterator.wrap(merge,baseQuery.getLimit()); } else vertex = tx.getCanonicalVertex(vertex); } return executeIndividualRelations(vertex,baseQuery); }
private VertexList executeIndividualVertexIds(InternalVertex vertex, BaseVertexCentricQuery baseQuery) { VertexCentricQuery query = constructQuery(vertex, baseQuery); if (useSimpleQueryProcessor(query, vertex)) return new SimpleVertexQueryProcessor(query,tx).vertexIds(); return edges2VertexIds((Iterable) executeIndividualRelations(vertex,baseQuery), vertex); }
private VertexList executeIndividualVertexIds(InternalVertex vertex, BaseVertexCentricQuery baseQuery) { VertexCentricQuery query = constructQuery(vertex, baseQuery); if (useSimpleQueryProcessor(query, vertex)) return new SimpleVertexQueryProcessor(query,tx).vertexIds(); return edges2VertexIds((Iterable) executeIndividualRelations(vertex,baseQuery), vertex); }
private Iterable<TitanVertex> executeIndividualVertices(InternalVertex vertex, BaseVertexCentricQuery baseQuery) { VertexCentricQuery query = constructQuery(vertex, baseQuery); if (useSimpleQueryProcessor(query, vertex)) return new SimpleVertexQueryProcessor(query,tx).vertexIds(); else return edges2Vertices((Iterable) executeIndividualRelations(vertex,baseQuery), query.getVertex()); }
private Iterable<TitanVertex> executeIndividualVertices(InternalVertex vertex, BaseVertexCentricQuery baseQuery) { VertexCentricQuery query = constructQuery(vertex, baseQuery); if (useSimpleQueryProcessor(query, vertex)) return new SimpleVertexQueryProcessor(query,tx).vertexIds(); else return edges2Vertices((Iterable) executeIndividualRelations(vertex,baseQuery), query.getVertex()); }