{"id":387098,"date":"2024-06-29T07:07:31","date_gmt":"2024-06-29T07:07:31","guid":{"rendered":"http:\/\/savepearlharbor.com\/?p=387098"},"modified":"-0001-11-30T00:00:00","modified_gmt":"-0001-11-29T21:00:00","slug":"","status":"publish","type":"post","link":"https:\/\/savepearlharbor.com\/?p=387098","title":{"rendered":"AngouriMath 1.3 update<\/span>"},"content":{"rendered":"
<\/div>\n
\n
\n
\n
\n

What is it about?<\/h2>\n

AngouriMath is a free open-source symbolic algebra library, written in and for .NET, that I’ve been working since the end of 2019. The previous major release happened on the second of March, I made an article<\/a> about it too.<\/p>\n

Now, let me tell what we, together with contributors, did within these four months!<\/p>\n

<\/figcaption><\/figure>\n

AngouriMath is made for C#, F#, Interactive, and to an extent, C++, so let me draw a distinction, what package affects what environment:<\/p>\n

\n
\n\n\n\n\n\n\n\n
\n

\n<\/td>\n

\n

C#<\/p>\n<\/td>\n

\n

F#<\/p>\n<\/td>\n

\n

Interactive<\/p>\n<\/td>\n

\n

C++<\/p>\n<\/td>\n<\/tr>\n

\n

AngouriMath<\/p>\n<\/td>\n

\n

\u2713 <\/p>\n<\/td>\n

\n

\u2713<\/p>\n<\/td>\n

\n

\u2713<\/p>\n<\/td>\n

\n<\/td>\n<\/tr>\n
\n

AngouriMath.FSharp<\/p>\n<\/td>\n

\n<\/td>\n\n

\u2713<\/p>\n<\/td>\n

\n

\u2713<\/p>\n<\/td>\n

\n<\/td>\n<\/tr>\n
\n

AngouriMath.Interactive<\/p>\n<\/td>\n

\n<\/td>\n\n<\/td>\n\n

\u2713<\/p>\n<\/td>\n

\n<\/td>\n<\/tr>\n
\n

AngouriMath.CPP<\/p>\n<\/td>\n

\n<\/td>\n\n<\/td>\n\n<\/td>\n\n

\u2713<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<\/div>\n

Matrices<\/h2>\n

This is the main change in terms of breaking API and behaviour. Now, instead of tensor, there’s matrix, which is Entity.Matrix<\/code>. There is also vector, but it doesn’t have its own type. Instead, it’s a single-column matrix. So for matrices there’s only one type.<\/p>\n

The syntax for parsing is<\/p>\n

Entity a = \"[1, 2, 3]\";<\/code><\/pre>\n
it becomes a vector of three elements.<\/p>\n
Entity a = \"[1, 2, 3]T\"<\/code><\/pre>\n
becomes a transposed vector, that is, instead of column vector, it’s a row vector. Here’s how we create a 2×2 matrix:<\/p>\n
Entity a = \"[[1, 2], [3, 4]]\"<\/code><\/pre>\n
[1, 2] is a row.<\/p>\n
The properties and functions of matrix:<\/p>\n
Entity.Matrix m = ... m.Adjugate   \/\/ null if it doesn't exist m.AsScalar() \/\/ casts a 1x1 to scalar m.Inverse    \/\/ null if it doesn't exist m.Pow(int)   \/\/ finds a matrix power or throws m.ReducedRowEchelonForm<\/code><\/pre>\n
See more at the docs<\/a>.<\/p>\n
There are also improvements in AngouriMath.FSharp’s matrices. All matrix-related functions moved to AngouriMath.FSharp.Matrices<\/code>. Now there is a number of operators for matrices specifically all of which end with dot. For example,<\/p>\n
a +. b a -. b a *. b a \/. b a **. b \/\/ matrix power a ***. b \/\/ tensor product a ****. b \/\/ tensor power<\/code><\/pre>\n
Parser and LaTeX<\/h2>\n
The parser now supports Cyrillic and Greek letters, as well as it skips \\n and \\r letters, which might be helpful for building matrices.<\/p>\n
There’s also now a setting MathS.Settings.ExplicitParsingOnly<\/code>, which, when set to true, does not insert omitted operators, so while<\/p>\n
Entity a = \"2x + 3(x + 1)\";<\/code><\/pre>\n
is fine when the setting is disabled, it won’t be considered valid with the setting enabled.<\/p>\n
There is also MathS.Parse<\/code> which returns an Either<\/code> of Entity<\/code> and reason why parsing failed. Either<\/code> is an anonymous type union from Honk#<\/a>, which I’ll mention later. Example of code using it:<\/p>\n
using AngouriMath; using System;  var res = MathS.Parse(\"2x + 3\")     .Switch(         valid => valid,         failure => failure.Reason.Switch<Entity>(                 unknown => $\"Unknown reason: {unknown.Reason}\",                 missingOperator => $\"Operator missed: {missingOperator.Details}\",                 internalError => $\"Internal error: {internalError.Details}\"         )     );  Console.WriteLine(res);<\/code><\/pre>\n
Latexise now doesn’t produce unneeded \\times, and instead, \\dot-s are only produced when needed (e. g. between variables). A few bugs in it fixed.<\/p>\n
New Functions<\/h2>\n
MathS.Series.Maclaurin<\/code>, MathS.Series.Taylor<\/code> , MathS.Series.TaylorTerms<\/code> are functions to generate Taylor expansion expressions. <\/p>\n
A lot of experimental API added for number theory. The final function is the symbolic form of sine and cosine based on existing analytical angles, for example, here’s the precise value of sin(17\/42 pi):<\/p>\n
1\/2 * ((sqrt(1 - sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) ^ 2) ^ 2 - sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) ^ 2) * sqrt(1 - sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) ^ 2) - 2 * sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) * sqrt(1 - sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) ^ 2) * sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2))) - -(2 * sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) * sqrt(1 - sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) ^ 2) * sqrt(1 - sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) ^ 2) + (sqrt(1 - sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) ^ 2) ^ 2 - sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) ^ 2) * sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2))) * sqrt(3) \/ 2<\/code><\/pre>\n
All added functions: SymbolicFormOfSine<\/code>,\u00a0SymbolicFormOfCosine<\/code>,\u00a0ExpandSineOfSum<\/code>,\u00a0ExpandConsineOfSum<\/code>,\u00a0ExpandSineArgumentMultiplied<\/code>,\u00a0ExpandCosineArgumentMultiplied<\/code>,\u00a0GetSineOfHalvedAngle<\/code>,\u00a0GetCosineOfHalvedAngle<\/code>,\u00a0DecomposeRational<\/code>,\u00a0GetSineOfHalvedAngle<\/code>  <\/p>\n
A few synonyms added for hyperbolic functions. All functions from AngouriMath.FSharp now get InnerSimplified<\/code> applied (for instance, sqrt 4<\/code> will return 2<\/code> while MathS.Sqrt(4)<\/code> will still return a power node).<\/p>\n
AngouriMath.Interactive now has a AggressiveOperators module, which overrides the default operators, such as +, -, *, \/, **, <, >, >=, <=, =. It is not recommended to use it as a library, but might be useful for some small calculations, like I did it in the terminal<\/a>.<\/p>\n
AngouriMath.CPP: wrapper for C++<\/h2>\n
Now there’s a native version of the library that can be consumed from unmanaged code. It is possible thanks to NativeAOT<\/a>, new feature which allows to compile managed .NET assemblies into native code. Here’s an example:<\/p>\n
#include <AngouriMath.h> AngouriMath::Entity expr(\"x * y + 2sin(x * y) - y^x\"); std::cout << expr.Differentiate(\"x\") << \"\\n\";<\/code><\/pre>\n
Output:<\/p>\n
y + cos(x * y) * y * 2 - y ^ x * ln(y)<\/code><\/pre>\n
It is currently in the experimental phase. You can try it by installing it following a short instruction<\/a>. Very few functions are still exposed, so it can be barely used for now, but hope it will be developed further in the future.<\/p>\n
My Reddit post <\/a>about it.<\/p>\n
Using AngouriMath in your projects<\/h2>\n
Now, aside from netstandard2.0, it multitargets .NET Framework 4.7.2+ and netstandard2.1. The former allows to use the library in legacy projects more conveniently.<\/p>\n
Honk#<\/a> now helps to maintain the project easier, but since it’s shipped with AngouriMath now, it might be a good idea to try its syntax in some cases.<\/p>\n
Conclusion<\/h2>\n
There are a lot of minor features and fixes that are not very interesting to read about. Most of them and other updates are listed in the what’s new page on the website<\/a>.<\/p>\n
Thank you for your attention! Feel free to ask questions.<\/p>\n
References<\/h2>\n
    \n
  1. \n
    Github<\/a> of the project<\/p>\n<\/li>\n
  2. \n
    Website<\/a><\/p>\n<\/li>\n
  3. \n
    Release notes<\/a><\/p>\n<\/li>\n
  4. \n
    Nuget<\/a> (C#<\/a>, F#<\/a>, Interactive<\/a>)<\/p>\n<\/li>\n
  5. \n
    Try in binder<\/a><\/p>\n<\/li>\n
  6. \n
    NativeAOT<\/a> for native compilation<\/p>\n<\/li>\n
  7. \n
    dotnet\/interactive<\/a> for Jupyter and notebooks<\/p>\n<\/li>\n
  8. \n
    Honk#<\/a> for convenient coding<\/p>\n<\/li>\n
  9. \n
    My twitter<\/a><\/p>\n<\/li>\n<\/ol>\n
    Thanks<\/h2>\n
    Aside from myself, I want to thank these people for helping with the project:<\/p>\n
    Contributors<\/strong>: Happypig375<\/a>, ryynmapes<\/a>, MomoDeve<\/a>, TheSeems<\/a>, KuhakuPixel<\/a>, jaimeadf<\/a>, yoshiask<\/a>.<\/p>\n
    Consultants<\/strong>: Happypig375<\/a>, mednik.<\/p>\n
    Sponsors<\/strong>: zyzhu.<\/p>\n<\/div>\n<\/div>\n<\/div>\n
    <\/div>\n

     \u0441\u0441\u044b\u043b\u043a\u0430 \u043d\u0430 \u043e\u0440\u0438\u0433\u0438\u043d\u0430\u043b \u0441\u0442\u0430\u0442\u044c\u0438      https:\/\/habr.com\/ru\/articles\/565996\/<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"
    <\/div>\n
    \n
    \n
    \n
    \n
    What is it about?<\/h2>\n
    AngouriMath is a free open-source symbolic algebra library, written in and for .NET, that I’ve been working since the end of 2019. The previous major release happened on the second of March, I made an article<\/a> about it too.<\/p>\n
    Now, let me tell what we, together with contributors, did within these four months!<\/p>\n
    <\/figcaption><\/figure>\n
    AngouriMath is made for C#, F#, Interactive, and to an extent, C++, so let me draw a distinction, what package affects what environment:<\/p>\n
    \n
    \n\n\n\n\n\n\n\n
    \n
    \n<\/td>\n
    		\n
    C#<\/p>\n<\/td>\n
    		\n
    F#<\/p>\n<\/td>\n
    		\n
    Interactive<\/p>\n<\/td>\n
    		\n
    C++<\/p>\n<\/td>\n<\/tr>\n
    \n
    AngouriMath<\/p>\n<\/td>\n
    		\n
    \u2713  <\/p>\n<\/td>\n
    		\n
    \u2713<\/p>\n<\/td>\n
    		\n
    \u2713<\/p>\n<\/td>\n
    		\n<\/td>\n<\/tr>\n
    \n
    AngouriMath.FSharp<\/p>\n<\/td>\n
    		\n<\/td>\n\n
    \u2713<\/p>\n<\/td>\n
    		\n
    \u2713<\/p>\n<\/td>\n
    		\n<\/td>\n<\/tr>\n
    \n
    AngouriMath.Interactive<\/p>\n<\/td>\n
    		\n<\/td>\n\n<\/td>\n\n
    \u2713<\/p>\n<\/td>\n
    		\n<\/td>\n<\/tr>\n
    \n
    AngouriMath.CPP<\/p>\n<\/td>\n
    		\n<\/td>\n\n<\/td>\n\n<\/td>\n\n
    \u2713<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<\/div>\n
    Matrices<\/h2>\n
    This is the main change in terms of breaking API and behaviour. Now, instead of tensor, there’s matrix, which is Entity.Matrix<\/code>. There is also vector, but it doesn’t have its own type. Instead, it’s a single-column matrix. So for matrices there’s only one type.<\/p>\n
    The syntax for parsing is<\/p>\n
    Entity a = \"[1, 2, 3]\";<\/code><\/pre>\n
    it becomes a vector of three elements.<\/p>\n
    Entity a = \"[1, 2, 3]T\"<\/code><\/pre>\n
    becomes a transposed vector, that is, instead of column vector, it’s a row vector. Here’s how we create a 2×2 matrix:<\/p>\n
    Entity a = \"[[1, 2], [3, 4]]\"<\/code><\/pre>\n
    [1, 2] is a row.<\/p>\n
    The properties and functions of matrix:<\/p>\n
    Entity.Matrix m = ... m.Adjugate   \/\/ null if it doesn't exist m.AsScalar() \/\/ casts a 1x1 to scalar m.Inverse    \/\/ null if it doesn't exist m.Pow(int)   \/\/ finds a matrix power or throws m.ReducedRowEchelonForm<\/code><\/pre>\n
    See more at the docs<\/a>.<\/p>\n
    There are also improvements in AngouriMath.FSharp’s matrices. All matrix-related functions moved to AngouriMath.FSharp.Matrices<\/code>. Now there is a number of operators for matrices specifically all of which end with dot. For example,<\/p>\n
    a +. b a -. b a *. b a \/. b a **. b \/\/ matrix power a ***. b \/\/ tensor product a ****. b \/\/ tensor power<\/code><\/pre>\n
    Parser and LaTeX<\/h2>\n
    The parser now supports Cyrillic and Greek letters, as well as it skips \\n and \\r letters, which might be helpful for building matrices.<\/p>\n
    There’s also now a setting MathS.Settings.ExplicitParsingOnly<\/code>, which, when set to true, does not insert omitted operators, so while<\/p>\n
    Entity a = \"2x + 3(x + 1)\";<\/code><\/pre>\n
    is fine when the setting is disabled, it won’t be considered valid with the setting enabled.<\/p>\n
    There is also MathS.Parse<\/code> which returns an Either<\/code> of Entity<\/code> and reason why parsing failed. Either<\/code> is an anonymous type union from Honk#<\/a>, which I’ll mention later. Example of code using it:<\/p>\n
    using AngouriMath; using System;  var res = MathS.Parse(\"2x + 3\")     .Switch(         valid => valid,         failure => failure.Reason.Switch<Entity>(                 unknown => $\"Unknown reason: {unknown.Reason}\",                 missingOperator => $\"Operator missed: {missingOperator.Details}\",                 internalError => $\"Internal error: {internalError.Details}\"         )     );  Console.WriteLine(res);<\/code><\/pre>\n
    Latexise now doesn’t produce unneeded \\times, and instead, \\dot-s are only produced when needed (e. g. between variables). A few bugs in it fixed.<\/p>\n
    New Functions<\/h2>\n
    MathS.Series.Maclaurin<\/code>, MathS.Series.Taylor<\/code> , MathS.Series.TaylorTerms<\/code> are functions to generate Taylor expansion expressions. <\/p>\n
    A lot of experimental API added for number theory. The final function is the symbolic form of sine and cosine based on existing analytical angles, for example, here’s the precise value of sin(17\/42 pi):<\/p>\n
    1\/2 * ((sqrt(1 - sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) ^ 2) ^ 2 - sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) ^ 2) * sqrt(1 - sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) ^ 2) - 2 * sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) * sqrt(1 - sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) ^ 2) * sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2))) - -(2 * sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) * sqrt(1 - sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) ^ 2) * sqrt(1 - sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) ^ 2) + (sqrt(1 - sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) ^ 2) ^ 2 - sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2)) ^ 2) * sqrt(1\/2 - 1\/2 * sqrt(1 - sqrt(1 - (1\/6 * (-1 + ((7 + 21 * sqrt(-3)) \/ 2) ^ (1\/3) + ((7 - 21 * sqrt(-3)) \/ 2) ^ (1\/3))) ^ 2) ^ 2))) * sqrt(3) \/ 2<\/code><\/pre>\n
    All added functions: SymbolicFormOfSine<\/code>,\u00a0SymbolicFormOfCosine<\/code>,\u00a0ExpandSineOfSum<\/code>,\u00a0ExpandConsineOfSum<\/code>,\u00a0ExpandSineArgumentMultiplied<\/code>,\u00a0ExpandCosineArgumentMultiplied<\/code>,\u00a0GetSineOfHalvedAngle<\/code>,\u00a0GetCosineOfHalvedAngle<\/code>,\u00a0DecomposeRational<\/code>,\u00a0GetSineOfHalvedAngle<\/code>  <\/p>\n
    A few synonyms added for hyperbolic functions. All functions from AngouriMath.FSharp now get InnerSimplified<\/code> applied (for instance, sqrt 4<\/code> will return 2<\/code> while MathS.Sqrt(4)<\/code> will still return a power node).<\/p>\n
    AngouriMath.Interactive now has a AggressiveOperators module, which overrides the default operators, such as +, -, *, \/, **, <, >, >=, <=, =. It is not recommended to use it as a library, but might be useful for some small calculations, like I did it in the terminal<\/a>.<\/p>\n
    AngouriMath.CPP: wrapper for C++<\/h2>\n
    Now there’s a native version of the library that can be consumed from unmanaged code. It is possible thanks to NativeAOT<\/a>, new feature which allows to compile managed .NET assemblies into native code. Here’s an example:<\/p>\n
    #include <AngouriMath.h> AngouriMath::Entity expr(\"x * y + 2sin(x * y) - y^x\"); std::cout << expr.Differentiate(\"x\") << \"\\n\";<\/code><\/pre>\n
    Output:<\/p>\n
    y + cos(x * y) * y * 2 - y ^ x * ln(y)<\/code><\/pre>\n
    It is currently in the experimental phase. You can try it by installing it following a short instruction<\/a>. Very few functions are still exposed, so it can be barely used for now, but hope it will be developed further in the future.<\/p>\n
    My Reddit post <\/a>about it.<\/p>\n
    Using AngouriMath in your projects<\/h2>\n
    Now, aside from netstandard2.0, it multitargets .NET Framework 4.7.2+ and netstandard2.1. The former allows to use the library in legacy projects more conveniently.<\/p>\n
    Honk#<\/a> now helps to maintain the project easier, but since it’s shipped with AngouriMath now, it might be a good idea to try its syntax in some cases.<\/p>\n
    Conclusion<\/h2>\n
    There are a lot of minor features and fixes that are not very interesting to read about. Most of them and other updates are listed in the what’s new page on the website<\/a>.<\/p>\n
    Thank you for your attention! Feel free to ask questions.<\/p>\n
    References<\/h2>\n
      \n
    1. \n
      Github<\/a> of the project<\/p>\n<\/li>\n
    2. \n
      Website<\/a><\/p>\n<\/li>\n
    3. \n
      Release notes<\/a><\/p>\n<\/li>\n
    4. \n
      Nuget<\/a> (C#<\/a>, F#<\/a>, Interactive<\/a>)<\/p>\n<\/li>\n
    5. \n
      Try in binder<\/a><\/p>\n<\/li>\n
    6. \n
      NativeAOT<\/a> for native compilation<\/p>\n<\/li>\n
    7. \n
      dotnet\/interactive<\/a> for Jupyter and notebooks<\/p>\n<\/li>\n
    8. \n
      Honk#<\/a> for convenient coding<\/p>\n<\/li>\n
    9. \n
      My twitter<\/a><\/p>\n<\/li>\n<\/ol>\n
      Thanks<\/h2>\n
      Aside from myself, I want to thank these people for helping with the project:<\/p>\n
      Contributors<\/strong>: Happypig375<\/a>, ryynmapes<\/a>, MomoDeve<\/a>, TheSeems<\/a>, KuhakuPixel<\/a>, jaimeadf<\/a>, yoshiask<\/a>.<\/p>\n
      Consultants<\/strong>: Happypig375<\/a>, mednik.<\/p>\n
      Sponsors<\/strong>: zyzhu.<\/p>\n<\/div>\n<\/div>\n<\/div>\n
      <\/div>\n

       \u0441\u0441\u044b\u043b\u043a\u0430 \u043d\u0430 \u043e\u0440\u0438\u0433\u0438\u043d\u0430\u043b \u0441\u0442\u0430\u0442\u044c\u0438        https:\/\/habr.com\/ru\/articles\/565996\/<\/a>
      <\/br><\/br><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[],"tags":[],"class_list":["post-387098","post","type-post","status-publish","format-standard","hentry"],"_links":{"self":[{"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/posts\/387098","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=387098"}],"version-history":[{"count":0,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/posts\/387098\/revisions"}],"wp:attachment":[{"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=387098"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=387098"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=387098"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}