A fast math parser library
muParser is an extensible high performance math parser library written in C++. It works by transforming a mathematical expression into bytecode and precalculating constant parts of the expression.
- Devel package for openSUSE:Factory
-
2
derived packages
- Links to openSUSE:Factory / muparser
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout science/muparser && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| _link | 0000000124 124 Bytes | |
| baselibs.conf | 0000000087 87 Bytes | |
| muparser-abiversion.diff | 0000000397 397 Bytes | |
| muparser.changes | 0000004018 3.92 KB | |
| muparser.spec | 0000002436 2.38 KB | |
| v2.3.2.tar.gz | 0000103979 102 KB |
Revision 25 (latest revision is 32)
Jan Engelhardt (jengelh)
accepted
request 815514
from
Paolo Stivanin (polslinux)
(revision 25)
- Update to 2.3.2:
* using OpenMP is now the default settings for cmake based builds
* added optimization for trivial expressions
* introduced a maximum length for expressions (5000 Character)
* introduced a maximum length for identifiers (100 Characters)
* removed the MUP_MATH_EXCEPTION macro and related functionality
* removed ParserStack.h (replaced with std::stack)
* removed macros for defining E and PI (replaced with a static constants)
* the MUP_ASSERT macro is no longer removed in release builds
for better protection against segmentation faults
- Updated muparser-abiversion.diff as the project is now using cmake
- Removed muparser-optflags.patch as the project is now using cmake
and the Makefile.in file no longer exists
Comments 3
@jengelh Any specific reason keeping the updated version from being submitted to Factory?
I probably forgot. What's more interesting is why obs-autosubmit did not step in ...
Yeah, that is odd. Anyway, thanks for keeping this updated!