11-29-2019, 09:29 AM
our rule engine works on GPU to achieve full speed.
It's not a good idea to have dynamic buffers/memory/sizes which would reduce speed tremendously and make code much more complex. it's just a well-choosen upper bound (4) which honestly works in 99.99 % of the cases and the other ones can easily be converted or worked around. with too small charsets (?1, ?2, ?3, ?4) it would be anyway very bad for performance/acceleration so users should choose a more clever and advanced approach which doesn't involve very small charsets like -1 abc -2 348 -3 FOBAR -4 .-=+ ?1?1?1?2?3?4
It's not a good idea to have dynamic buffers/memory/sizes which would reduce speed tremendously and make code much more complex. it's just a well-choosen upper bound (4) which honestly works in 99.99 % of the cases and the other ones can easily be converted or worked around. with too small charsets (?1, ?2, ?3, ?4) it would be anyway very bad for performance/acceleration so users should choose a more clever and advanced approach which doesn't involve very small charsets like -1 abc -2 348 -3 FOBAR -4 .-=+ ?1?1?1?2?3?4