AngouriMath
AngouriMath.Entity
Classes within the AngouriMath.Entity namespace
Absf
Summary
A node of abs
Andf
Summary
Is true iff both operands are true
Application
Summary
Application of arguments to the given expression
Arccosecantf
Summary
A node of arccosecant
Arccosf
Summary
A node of arccosine
Arccotanf
Summary
A node of arccotangent
Arcsecantf
Summary
A node of arcsecant
Arcsinf
Summary
A node of arcsine
Arctanf
Summary
A node of arctangent
Boolean
Summary
This node represents all possible values a boolean node might be of
CalculusOperator
Summary
Describes any calculus operator
Ceilf
Summary
A node of ceil: the least integer not below the argument.
Remarks
ComparisonSign
Summary
=, <, >, >=, <=
Nodes Equalsf, Lessf, LessOrEqualf, Greaterf, GreaterOrEqualf are assignable to this type.
ContinuousNode
Summary
Any node that might be counted as a number, derived, etc. is continuous
Cosecantf
Summary
A node of secant
Cosf
Summary
A node of cosine
Cotanf
Summary
A node of cotangent
Derivativef
Summary
A node of derivative
Remarks
Negative iterations convert to integrals.
Divf
Summary
A node of division
Equalsf
Summary
It is true if left and right are equal
Factorialf
Summary
A node of factorial
Floorf
Summary
A node of floor: the greatest integer not above the argument.
Remarks
On a complex argument it is taken componentwise, so that
floor(3/2 + 5/2i) is1 + 2i . That is what SymPy and Mathematica
both do, and it is the only reading under whichfloor of a real number
keeps its meaning when the imaginary part happens to be zero.
Function
Summary
Describes any node that is a function (e. g. sin, cos, etc.) or calculus operator (e. g. derivative, integral, limit)
but not an arithmetic operator or leaf
Gcdf
Summary
A node of gcd: the greatest common divisor of its two arguments.
Remarks
Not integers only. SymPy'sgcd is the polynomial gcd with the integer case
as a special case, and this library already computes one — see
PolynomialGcd, which the
PolynomialGcdCancellation rule set uses. What cannot be settled is left as
this node rather than guessed at.
Greaterf
Summary
It is true iff both parts are numeric and real, and left number is greater
than the right one
It is false iff both parts are numeric and real, and left number is less or equal
the right one
It is NaN/unsimplified otherwise.
GreaterOrEqualf
Summary
It is true iff both parts are numeric and real, and left number is greater
than the right one or equal to it
It is false iff both parts are numeric and real, and left number is less
the right one
It is NaN/unsimplified otherwise.
Impliesf
Summary
Is true iff assumption is false or conclusion is true
Integralf
Summary
A node of integral
Lambda
Summary
A lambda with the only parameter and its body
Lessf
Summary
It is true iff both parts are numeric and real, and left number is less
than the right one
It is false iff both parts are numeric and real, and left number is greater or equal
the right one
It is NaN/unsimplified otherwise.
LessOrEqualf
Summary
It is true iff both parts are numeric and real, and left number is less
than the right one or equal to it
It is false iff both parts are numeric and real, and left number is greater
the right one
It is NaN/unsimplified otherwise.
Limitf
Summary
A node of limit
Logf
Summary
A node of logarithm
Matrix
Summary
Basic matrix implementation: https://en.wikipedia.org/wiki/Matrix_(mathematics)Maxf
Summary
A node of max: the greater of its two arguments.
Remarks
See Minf for why this is a node.Minf
Summary
A node of min: the lesser of its two arguments.
Remarks
A node rather than sugar over(a + b - abs(a - b)) / 2 . The closed form is
what this simplifies to where that helps; it is not what it should print
as, and the round-trip contract would make that permanent. SymPy keeps
Min as a node for the same reason.
Only ordered arguments compare, so a complex one is left alone rather than
guessed at.
Minusf
Summary
A node of difference
Modf
Summary
A node of modulus, that is, the remainder after division. Follows the sign of
the dividend, as C#'s own% does and as
PeterO.Numbers does underneath: -7 % 3 is -1,
not 2.
Mulf
Summary
A node of product
Notf
Summary
Whatever its argument is, the result will be inverted
Number
Summary
Orf
Summary
Is true iff at least one operand is true,
Phif
Summary
This node represents the Euler totient function (phi)
Piecewise
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)
Powf
Summary
A node of exponential (power)
Providedf
Summary
That is a node which equals Expression if Predicate is true, otherwise NaNRoundf
Summary
A node of round: the nearest integer, with a tie going to the even one.
Remarks
Half to even, which is what Python, SymPy, Mathematica and IEEE 754 all do — and
what .NET'sMath.Round does by default, though not what most people expect
of it. Soround(1/2) is0 andround(3/2) is2 , and it
is notfloor(x + 1/2) , which differs at every tie.
Secantf
Summary
A node of secant
Set
Summary
https://en.wikipedia.org/wiki/Set_(mathematics) A set might be a set operator, conditinal set, finite set, or interval
Signumf
Summary
A node of signum
Sinf
Summary
A node of sine
Statement
Summary
This class describes every node whose value is boolean, that is, true or false.
Example
Entity t1 = "a and b"; // Statement Entity t2 = "a > b > c"; // Statement Entity t3 = "a or b implies x > 0"; // Statement Entity t4 = "a"; // Not Statement Entity t5 = "a + 3"; // Not Statement Entity t6 = "a provided c and d"; // Not StatementSumf
Summary
A node of sum
Tanf
Summary
A node of tangent
TrigonometricFunction
Summary
Describes any function that is related to trigonometry
Variable
Summary
Variable node. It only has a name.
Construct a Variable with an implicit conversion from String.
It has no type, so you can substitute any value under a given variable.
Xorf
Summary
Is true iff one operand is true
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 1953 pages online