Unfortunately, that is correct. Trying to find the fastest ordering isn't deterministic. We need a "generally fastest" ordering and we'll have to understand how to handle worst-case scenarios when we have real-world data.
In reply to Re^4: Evolving a faster filter?
by Ovid
in thread Evolving a faster filter?
by Ovid
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |