You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I have discussed this feature request with the community.
Describe the background of your feature request
As of today heimdall matches the urls of incoming requests either based on regular expressions or globs. While doing this it iterates over available rules in the order of their definition in the rule set. First match wins. While this approach is pretty simple and also straight forward in sense of rules definitions in a rule set - define the most specific rule first, it might be challenging to follow for bigger rule sets.
Describe your idea
The idea is to relax the above said rule so that there is no requirement to order rules in a rule set and let heilmdall calculate the Levenshtein distance instead for all matches and select the shortest for the given url and the match expressions in the matched rules.
That would simplify the rule set development - no need for a specific order any more if order matters
Are there any workarounds or alternatives?
Like written above, the rules must be ordered in the rule set with most specific at the top if the matching expressions in the defined rules would match same urls.
Version
v0.7.0-alpha
Additional Context
No response
The text was updated successfully, but these errors were encountered:
Preflight checklist
Describe the background of your feature request
As of today heimdall matches the urls of incoming requests either based on regular expressions or globs. While doing this it iterates over available rules in the order of their definition in the rule set. First match wins. While this approach is pretty simple and also straight forward in sense of rules definitions in a rule set - define the most specific rule first, it might be challenging to follow for bigger rule sets.
Describe your idea
The idea is to relax the above said rule so that there is no requirement to order rules in a rule set and let heilmdall calculate the Levenshtein distance instead for all matches and select the shortest for the given url and the match expressions in the matched rules.
That would simplify the rule set development - no need for a specific order any more if order matters
Are there any workarounds or alternatives?
Like written above, the rules must be ordered in the rule set with most specific at the top if the matching expressions in the defined rules would match same urls.
Version
v0.7.0-alpha
Additional Context
No response
The text was updated successfully, but these errors were encountered: