AngouriMath
Piecewise
Description
Summary
This is a node which defined on different subsets differently. When evaluating, it will turn
into a particular case once all cases' predicates before are false, and this case's predicate is true.
That is, the order counts. An example:
Piecewise(a provided false, b provided true, c provided true)
Will be evaluated into b,
Piecewise(a provided false, b provided c, c provided false)
Will remain as it is (although unreachable cases will be removed)
into a particular case once all cases' predicates before are false, and this case's predicate is true.
That is, the order counts. An example:
Piecewise(a provided false, b provided true, c provided true)
Will be evaluated into b,
Piecewise(a provided false, b provided c, c provided false)
Will remain as it is (although unreachable cases will be removed)
Members
#ctor(System.Collections.Generic.IEnumerable{AngouriMath.Entity.Providedf})
MethodApply(System.Func{AngouriMath.Entity.Providedf,AngouriMath.Entity.Providedf})
MethodApplyToValues(System.Func{AngouriMath.Entity,AngouriMath.Entity})
MethodCodomain
PropertyGetHashCode
MethodInitDirectChildren
MethodInnerEval
MethodInnerSimplify
MethodLatexise
MethodReplace(System.Func{AngouriMath.Entity,AngouriMath.Entity})
MethodStringize
MethodToString
Method
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 1534 pages online