RetroSearch Browse

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://mathparser.org/mxparser-tutorial/fast-limited-user-defined-recursion/ below:

Fast (limited) user defined recursion | mXparser – Math Expressions Parser for JAVA, C#, C++, Kotlin, Android, .NET/MONO/Xamarin – Mathematical Formula Parser

TO SUPPORT MY WORK, ORDER A COMMERCIAL LICENSE THANK YOU! The tutorial consists of more than 200 live examples from 50 sections given separately for JAVA, C# and C++. Each of the examples can be copied and run on your own environment. In addition, mXparser provides an extensive collection of over 500 built-in math functions, expressions and symbols. Familiarize yourself with the scope and the syntax. Live testing is the best way to learn. Good luck! 🙂

Tutorial Math Collection API spec Download

Below is the code for JAVA, C# (the code for C# is almost identical) and C++. To copy the code, double-click inside the frame. Case 1: Fibonacci numbers using fast recursion Java/C# code

// JAVA: import org.mariuszgromada.math.mxparser.*;
// C#: using org.mariuszgromada.math.mxparser;
// ...
RecursiveArgument fib = new RecursiveArgument("fib(n) = fib(n-1) + fib(n-2)");

fib.addBaseCase(0, 0);
fib.addBaseCase(1, 1);

Expression e = new Expression("fib(10)", fib);
         
mXparser.consolePrintln("Res 1: " + e.getExpressionString() + " = " + e.calculate());
mXparser.consolePrintln("Res 2: fib(11) = " + fib.getArgumentValue(11));

C++ code

#include "org/mariuszgromada/math/mxparser.hpp"
// ...
RecursiveArgumentPtr fib = new_RecursiveArgument("fib(n) = fib(n-1) + fib(n-2)");

fib->addBaseCase(0, 0);
fib->addBaseCase(1, 1);

ExpressionPtr e = new_Expression("fib(10)", fib);
     
mXparser::consolePrintln("Res 1: " + e->getExpressionString() + " = " + e->calculate());
mXparser_consolePrintln("Res 2: fib(11) = " + fib->getArgumentValue(11));

Code result

[mXparser-v.5.2.1] Res 1: fib(10) = 55.0
[mXparser-v.5.2.1] Res 2: fib(11) = 89.0

Case 2: Fibonacci numbers using fast recursion – less convenient, but faster constructor Java/C# code

// JAVA: import org.mariuszgromada.math.mxparser.*;
// C#: using org.mariuszgromada.math.mxparser;
// ...
RecursiveArgument fib = new RecursiveArgument("fib", "fib(n-1) + fib(n-2)", "n");

fib.addBaseCase(0, 0);
fib.addBaseCase(1, 1);

Expression e = new Expression("fib(10)", fib);

mXparser.consolePrintln("Res 1: " + e.getExpressionString() + " = " + e.calculate());
mXparser.consolePrintln("Res 2: fib(11) = " + fib.getArgumentValue(11));

C++ code

#include "org/mariuszgromada/math/mxparser.hpp"
// ...
RecursiveArgumentPtr fib = new_RecursiveArgument("fib", "fib(n-1) + fib(n-2)", "n");

fib->addBaseCase(0, 0);
fib->addBaseCase(1, 1);

ExpressionPtr e = new_Expression("fib(10)", fib);

mXparser::consolePrintln("Res 1: " + e->getExpressionString() + " = " + e->calculate());
mXparser_consolePrintln("Res 2: fib(11) = " + fib->getArgumentValue(11));

Code result

[mXparser-v.5.2.1] Res 1: fib(10) = 55.0
[mXparser-v.5.2.1] Res 2: fib(11) = 89.0

Nuget – Package Manager (C#, F#, Visual Basic, …)

Install-Package MathParser.org-mXparser -Version 6.1.0

Nuget – .NET CLI

dotnet add package MathParser.org-mXparser --version 6.1.0

Nuget – Package Reference

<PackageReference Include="MathParser.org-mXparser" Version="6.1.0"/>

Maven – Dependency (Java, Kotlin, Scala, Groovy, …)

<dependency> <groupid>org.mariuszgromada.math</groupid> <artifactid>MathParser.org-mXparser</artifactid> <version>6.1.0</version> </dependency>

Maven – Gradle

implementation 'org.mariuszgromada.math:MathParser.org-mXparser:6.1.0'

CMake – Dependency / FetchContent (C++, MSVC, LLVM/Clang, GNU/GCC, MinGW, MSYS2, WSL, Windows, Linux, Unix, MacOS)

include(FetchContent) FetchContent_Declare(MathParserOrgMxParserGIT_REPOSITORYhttps://github.com/mariuszgromada/MathParser.org-mXparser.gitGIT_TAGv.6.1.0SOURCE_SUBDIR CURRENT/cpp/lib ) FetchContent_MakeAvailable(MathParserOrgMxParser) target_link_libraries(YourExecutableMathParserOrgMxParser)

GitHub

git clone https://github.com/mariuszgromada/MathParser.org-mXparser

OTHER DOWNLOAD OPTIONS

Download latest release – v.6.1.0 Sagitara: .NET bin onlyDownload latest release – v.6.1.0 Sagitara: JAVA bin onlyDownload latest release – v.6.1.0 Sagitara: bin + doc

NEWS FROM MATHPARSER.ORG SOURCE CODE

Source code .zipSource code .tar.gz
View on GitHubMathSpace.pl

My other creative spaces DONATION

Did you find the software useful?

Please consider donation 🙂

DONATE

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4