## AngouriMath

## UnsafeAndInternal

## Description

**Summary**

You may need it to manually manage some issues.

Although those functions might be used inside the library

only, the user may want to use them for some reason

Although those functions might be used inside the library

only, the user may want to use them for some reason

## Members

### AreEqualNumerically

Method and its overloads### AreEqualNumerically (AngouriMath. Entity, AngouriMath. Entity, AngouriMath. Entity[])

**Summary**Checks if two expressions are equivalent if

Simplify(System.Int32) does not give the

expected response

### AreEqualNumerically (AngouriMath. Entity, AngouriMath. Entity)

**Summary**Checks if two expressions are equivalent if

Simplify(System.Int32) does not give the

expected response

### CheckPoints

Property**Summary**Checkpoints for numerical equality check

### ClearFromStringCache

Method**Summary**When you implicitly convert string to an Entity,

it caches the result by the string's reference.

If very strict about RAM usage, you can manually

clean it (or use FromString(System.String,System.Boolean) instead and set the flag useCache to false)

### DivideByEntityStrict (AngouriMath. Entity, AngouriMath. Entity)

Method**Summary**Divides the given expression by the divisor.

Requires a given node to exactly match the divisor,

so no "smart" division can be applied.

(e. g. pi / 2 divide by pi would work, but

(2 a) / 2 won't be divided by 4a)

**Returns**The result if valid, null otherwise### RepresentRational (AngouriMath. Entity. Number. Rational, System. Collections. Generic. IEnumerable{AngouriMath. Entity. Number. Rational})

Method**Summary**If it can, it will find coefficients

[a_1, a_2, ..., a_n] such that for

given rational forms [p_1, p_2, ..., p_n]

it is true that

q = a_1 * p_1 + a_2 * p_2 + ... + a_n * p_n

**Returns**The sequence of pairs coef-form or

null if it cannot find them

2019-2021 Angouri · Project's repo · Site's repo · Octicons