Re: [boost] [yap] Re-announcing Yap

Subject: Re: [boost] [yap] Re-announcing Yap
From: Jeffrey Graham (jeffrey.graham.traclabs_at_[hidden])
Date: 2018-02-23 17:14:30

   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/readme.md