diff --git a/X10D.Unity.dll b/X10D.Unity.dll
index f88f2ab..f587b38 100644
Binary files a/X10D.Unity.dll and b/X10D.Unity.dll differ
diff --git a/X10D.dll b/X10D.dll
index ed2cab4..6116d15 100644
Binary files a/X10D.dll and b/X10D.dll differ
diff --git a/X10D.xml b/X10D.xml
index 4dd2017..0d62618 100644
--- a/X10D.xml
+++ b/X10D.xml
@@ -5769,6 +5769,109 @@
is .
+
+
+ Math-related extension methods for .
+
+
+
+
+ Computes the digital root of this 8-bit integer.
+
+ The value whose digital root to compute.
+ The digital root of .
+ The digital root is defined as the recursive sum of digits until that result is a single digit.
+
+ The digital root is defined as the recursive sum of digits until that result is a single digit.
+ For example, the digital root of 239 is 5: 2 + 3 + 9 = 14, then 1 + 4 = 5.
+
+
+
+
+ Returns the factorial of the current 64-bit signed integer.
+
+ The value whose factorial to compute.
+ The factorial of .
+ is less than 0.
+
+
+
+ Calculates the greatest common factor between this, and another, .
+
+ The first value.
+ The second value.
+ The greatest common factor between and .
+
+
+
+ Returns a value indicating whether the current value is not evenly divisible by 2.
+
+ The value whose parity to check.
+
+ if is not evenly divisible by 2, or
+ otherwise.
+
+
+
+
+ Returns a value indicating whether the current value is a prime number.
+
+ The value whose primality to check.
+
+ if is prime; otherwise, .
+
+
+
+
+ Calculates the lowest common multiple between the current 64-bit signed integer, and another 64-bit signed integer.
+
+ The first value.
+ The second value.
+ The lowest common multiple between and .
+
+
+
+ Performs a modulo operation which supports a negative dividend.
+
+ The dividend.
+ The divisor.
+ The result of dividend mod divisor.
+
+ The % operator (commonly called the modulo operator) in C# is not defined to be modulo, but is instead
+ remainder. This quirk inherently makes it difficult to use modulo in a negative context, as x % y where x is
+ negative will return a negative value, akin to -(x % y), even if precedence is forced. This method provides a
+ modulo operation which supports negative dividends.
+
+ ShreevatsaR, https://stackoverflow.com/a/1082938/1467293
+ CC-BY-SA 2.5
+
+
+
+ Returns the multiplicative persistence of a specified value.
+
+ The value whose multiplicative persistence to calculate.
+ The multiplicative persistence.
+
+ Multiplicative persistence is defined as the recursive digital product until that product is a single digit.
+
+
+
+
+ Wraps the current integer between a low and a high value.
+
+ The value to wrap.
+ The inclusive lower bound.
+ The exclusive upper bound.
+ The wrapped value.
+
+
+
+ Wraps the current integer between 0 and a high value.
+
+ The value to wrap.
+ The exclusive upper bound.
+ The wrapped value.
+
Math-related extension methods for .
@@ -9670,10 +9773,10 @@
Returns the rounded-down integer number of years since a given date as of another specified date.
The date from which to calculate.
- The date at which to stop calculating.
+ The date to use as the calculation reference.
The rounded-down integer number of years since as of the date specified by
- .
+ .
diff --git a/package.json b/package.json
index 8860b33..65bff9f 100644
--- a/package.json
+++ b/package.json
@@ -6,7 +6,7 @@
"url": "https://oliverbooth.dev"
},
"displayName": "X10D",
- "version": "3.2.0",
+ "version": "4.0.0-nightly.225",
"unity": "2021.3",
"description": "Extension methods on crack",
"keywords": [