wok annotate muparser/description.txt @ rev 25783
Up verbiste (0.1.49)
| author | Pascal Bellard <pascal.bellard@slitaz.org> |
|---|---|
| date | Tue Sep 24 13:23:01 2024 +0000 (7 weeks ago) |
| parents | |
| children |
| rev | line source |
|---|---|
| Hans-G?nter@24933 | 1 Many applications require the parsing of mathematical expressions. |
| Hans-G?nter@24933 | 2 The main objective muparser is to provide a fast, easy and secure way |
| Hans-G?nter@24933 | 3 of doing this. |
| Hans-G?nter@24933 | 4 Muparser is an extensible high performance math expression parser |
| Hans-G?nter@24933 | 5 library written in C++. |
| Hans-G?nter@24933 | 6 It works by transforming a mathematical expression into bytecode and |
| Hans-G?nter@24933 | 7 precalculating constant parts of the expression. |
| Hans-G?nter@24933 | 8 For best performance muparser allows parallelized evaluation of |
| Hans-G?nter@24933 | 9 expressions with OpenMP. |
| Hans-G?nter@24933 | 10 |
| Hans-G?nter@24933 | 11 The library was designed with portability in mind and should compile |
| Hans-G?nter@24933 | 12 on every standard compliant C++ compiler. |
| Hans-G?nter@24933 | 13 The build system is based on CMake. |
| Hans-G?nter@24933 | 14 The code runs on both 32 bit and 64 bit architechtures and has been |
| Hans-G?nter@24933 | 15 tested using Visual Studio 2019, CLANG and GCC. |
| Hans-G?nter@24933 | 16 Code samples are provided in order to help you understand its usage. |