AngouriMath

Navigation

Home Quick start Wiki Almanac Research What's new Try Use Angouri.org GitHub Report a bug Contacts

← Back to list of members

#ctor

 Method with 3 overloads

• #ctor​(System.​String,​AngouriMath.​Core.​Transformations.​Matching.​MatchPattern,​AngouriMath.​Core.​Transformations.​Matching.​MatchPattern,​AngouriMath.​Core.​Transformations.​Soundness,​System.​Func{AngouriMath.​Core.​Transformations.​Matching.​Bindings,​System.​Boolean},​System.​String,​System.​Int32)

  Summary

  A rule whose right-hand side is a pattern, and which therefore has two directions.

• #ctor​(System.​String,​AngouriMath.​Core.​Transformations.​Matching.​MatchPattern,​System.​Func{AngouriMath.​Core.​Transformations.​Matching.​Bindings,​AngouriMath.​Entity},​AngouriMath.​Core.​Transformations.​Soundness,​System.​Nullable{AngouriMath.​Core.​Transformations.​RewriteRuleGrowth},​System.​Func{AngouriMath.​Core.​Transformations.​Matching.​Bindings,​System.​Boolean},​System.​String,​System.​Int32)

  Summary

  A rule whose right-hand side is code. One-way: see ReplacementIsCode.
  

• #ctor​(System.​String,​AngouriMath.​Core.​Transformations.​Matching.​MatchPattern,​System.​Func{AngouriMath.​Entity,​AngouriMath.​Core.​Transformations.​Matching.​Bindings,​AngouriMath.​Entity},​AngouriMath.​Core.​Transformations.​Soundness,​System.​Nullable{AngouriMath.​Core.​Transformations.​RewriteRuleGrowth},​System.​Func{AngouriMath.​Core.​Transformations.​Matching.​Bindings,​System.​Boolean},​System.​String,​System.​Int32)

  Summary

  A rule whose right-hand side is code and wants the node it matched as well as
  the bindings.
  

  Remarks

  Not a convenience. A replacement that needs the whole expression — because it hands it
  to a helper that decides for itself whether to rewrite — otherwise has to rebuild it
  from the bindings, and a rebuilt node is a different object with none of the
  original's cached work: its InnerSimplified, Evaled, Codomain and rate are all computed again, on every attempt, for every node of the tree.
  Measured on the limit of x * ln(x) / cos(x), which reaches
  RationalizeDenominator at every quotient it builds: rebuilding cost 4.0 s to
  5.2 s, and a test with a thirty-second cap failed on two of the three CI platforms
  while passing locally. Handing the node over costs nothing and the rule keeps the
  caches it was given.