Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Refactor BooleanExpressionVisitor #100

Closed
jakobbraun opened this issue Oct 27, 2020 · 1 comment · Fixed by #101
Closed

Refactor BooleanExpressionVisitor #100

jakobbraun opened this issue Oct 27, 2020 · 1 comment · Fixed by #101
Labels
refactoring Code improvement without behavior change

Comments

@jakobbraun
Copy link
Contributor

Currently, BooleanExpressionVisitor uses visit and leave. I've got the feeling that it would be better style to only use visit in combination with recursive calls, but I'm not sure about that.

@jakobbraun jakobbraun added the refactoring Code improvement without behavior change label Oct 27, 2020
@jakobbraun
Copy link
Contributor Author

jakobbraun commented Oct 27, 2020

By that we could also rewrite the current logic:

connect(and);
this.connectorDeque.push(" AND ");

to something more readable like
Sering.joing("AND", ...)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
refactoring Code improvement without behavior change
Projects
None yet
Development

Successfully merging a pull request may close this issue.

1 participant