Add boolean expression tree #2591
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
AntoinePrv
force-pushed
the
flat-boolean-tree
branch
from
976a72d
to
7ad1ae6
Compare
AntoinePrv
force-pushed
the
flat-boolean-tree
branch
from
09999ae
to
9ce155d
Compare
AntoinePrv
force-pushed
the
flat-boolean-tree
branch
2 times, most recently
from
c5cbb2f
to
8c08e69
Compare
Merged
JohanMabille
requested changes
Jul 5, 2023
Klaim
reviewed
Jul 5, 2023
JohanMabille
approved these changes
Jul 6, 2023
AntoinePrv
force-pushed
the
flat-boolean-tree
branch
from
07a634a
to
f1cf1dd
Compare
AntoinePrv
force-pushed
the
flat-boolean-tree
branch
from
f1cf1dd
to
4309c46
Compare
cvanelteren
pushed a commit
to cvanelteren/mamba
that referenced
this pull request
Jul 31, 2023
* flat_bool_expr_tree postfix ctor and evaluation * Add simple binary tree * Add Postfix parser * Rewrite flat_bool_expr_tree to use parser * Add InfixParser * Refactor exponential bool loop * Add Infix extended test * Fix missing header * Add negative parser testing * Change Postfix tree building * Add advanced Infix expression validation * Add flat_bool_expr_tree doc * Remove not implemented function * Implement revision suggestion * Split flat_binary_tree in own header * Add more documentation on flat_binary_tree * Explicitly default flat_bool_expr_tree ctor * Add is_ostreamable type_trait * Add op/ver repr in flat_bool_tree exception
cvanelteren
added a commit
to cvanelteren/mamba
that referenced
this pull request
Aug 29, 2023
* flat_bool_expr_tree postfix ctor and evaluation * Add simple binary tree * Add Postfix parser * Rewrite flat_bool_expr_tree to use parser * Add InfixParser * Refactor exponential bool loop * Add Infix extended test * Fix missing header * Add negative parser testing * Change Postfix tree building * Add advanced Infix expression validation * Add flat_bool_expr_tree doc * Remove not implemented function * Implement revision suggestion * Split flat_binary_tree in own header * Add more documentation on flat_binary_tree * Explicitly default flat_bool_expr_tree ctor * Add is_ostreamable type_trait * Add op/ver repr in flat_bool_tree exception
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This is a flat boolean expression tree with Infix parser, needed to implement
VersionSpecboolean grammar such as(>=1.2,<1.3)|(==1.7).