muparser - Fast Math Parser Library
Version 2.2.3
beltoforion.de
Other Projects of mine
google code project page
muparser @ Google Code
Advertisement
Open source initiative logo

Valid XHTML 1.0 Transitional

CSS ist valide!
Advertisement

About the the muparser library

Many applications require the parsing of mathematical expressions. The main objective of this library is to provide a fast and easy way of doing this. muParser is an extensible high performance math expression parser library written in C++. It works by transforming a mathematical expression into bytecode and precalculating constant parts of the expression.

The library was designed with portability in mind and should compile on every standard compliant C++ compiler. Wrapper for C and C# exist. The parser archive contains ready to use project and makefiles files for a variety of platforms. The code runs on both 32 bit and 64 bit architechtures and has been tested using Visual Studio 2013 and GCC V4.8.1. Code samples are provided in order to help you understand its usage. The library is open source and distributed under the MIT license. The source code archive of the last stable version is available for download here:

muParser download

The muparser project is in "production" state. This means that code changes are kept to a minimum with little active development. The main focus is currently put on bug fixing and keeping the archive compatible with the current generation of C++ compilers. You can obtain the latest version via the SVN repository at Google Code. Usually this is the version that contains the latest patches and fixes.

svn checkout http://muparser.googlecode.com/svn/trunk/ muparser-read-only
Advertisement

© 2014 Ingo Berg Impressum Datenschutzerklärung ^ TOP