23 Feb
2018
23 Feb
'18
5:14 p.m.
Zack, I have been lurking on this topic, and have interested because I use muparserx (and before that exprtk) in a commercial application. I am curious about 2 things: 1) Is it possible to evaluate a large number of expressions at run-time, where each expression is provided dynamically as a std::string (assuming all functions used are already available)? 2) What is the performance compared to other expression evaluation libraries, as compared here: [1]https://github.com/ArashPartow/math-parser-benchmark-project/blob/ma ster/readme.md Thanks, Jeff References 1. https://github.com/ArashPartow/math-parser-benchmark-project/blob/master/rea...