public Void visit()

in asterix-graphix/src/main/java/org/apache/asterix/graphix/lang/rewrite/print/GraphixASTPrintVisitor.java [167:207]

41 lines of code
10 McCabe index (conditional complexity)


    public Void visit(EdgePatternExpr edgePatternExpr, Integer step) throws CompilationException {
        out.print(skip(step));
        edgePatternExpr.getLeftVertex().accept(this, 0);
        switch (edgePatternExpr.getEdgeDescriptor().getEdgeDirection()) {
            case LEFT_TO_RIGHT:
            case UNDIRECTED:
                out.print("-[");
                break;
            case RIGHT_TO_LEFT:
                out.print("<-[");
                break;
        }
        if (edgePatternExpr.getEdgeDescriptor().getVariableExpr() != null) {
            out.print(edgePatternExpr.getEdgeDescriptor().getVariableExpr().getVar().getValue());
        }
        out.print(":(");
        int index = 0;
        for (ElementLabel label : edgePatternExpr.getEdgeDescriptor().getEdgeLabels()) {
            if (index > 0) {
                out.print("|");
            }
            out.print(label);
            index++;
        }
        out.print("){");
        out.print(edgePatternExpr.getEdgeDescriptor().getMinimumHops().toString());
        out.print(",");
        out.print(edgePatternExpr.getEdgeDescriptor().getMaximumHops().toString());
        out.print("}");
        switch (edgePatternExpr.getEdgeDescriptor().getEdgeDirection()) {
            case LEFT_TO_RIGHT:
                out.print("]->");
                break;
            case RIGHT_TO_LEFT:
            case UNDIRECTED:
                out.print("]-");
                break;
        }
        edgePatternExpr.getRightVertex().accept(this, 0);
        return null;
    }