diff --git a/X10D.Unity.dll b/X10D.Unity.dll
index 6829e06..72b2e1a 100644
Binary files a/X10D.Unity.dll and b/X10D.Unity.dll differ
diff --git a/X10D.dll b/X10D.dll
index 6bceda2..a247dd7 100644
Binary files a/X10D.dll and b/X10D.dll differ
diff --git a/X10D.xml b/X10D.xml
index 4fc354a..737742c 100644
--- a/X10D.xml
+++ b/X10D.xml
@@ -510,6 +510,18 @@
or is null.
+
+
+ Filters a sequence of values by omitting elements that are ( in
+ Visual Basic).
+
+ An to filter.
+ The type of the elements of .
+
+ An that contains elements from the input sequence that are not
+ ( in Visual Basic).
+
+
Collection-related extension methods for .
@@ -730,7 +742,7 @@
is .
- is less than zero or greater than .
+ is less than zero or greater than .
@@ -747,7 +759,7 @@
is .
or + is less than zero or greater than
- .
+ .
@@ -1076,6 +1088,53 @@
+
+
+ Returns a random element from the specified span of elements using the current instance.
+
+ The element type.
+ The instance.
+ The span of elements from which to draw.
+ A random element of type from .
+
+ is is
+ -or-
+ is .
+
+
+
+ Span<int> span = stackalloc span[5];
+ // populate the span ...
+
+ var random = new Random();
+ var number = random.NextFrom(span);
+
+
+
+
+
+ Returns a random element from the specified readonly span of elements using the current
+ instance.
+
+ The element type.
+ The instance.
+ The readonly span of elements from which to draw.
+ A random element of type from .
+
+ is is
+ -or-
+ is .
+
+
+
+ Span<int> span = stackalloc span[5];
+ // populate the span ...
+
+ var random = new Random();
+ var number = random.NextFrom(span.AsReadOnly());
+
+
+
Returns a non-negative random integer.
@@ -5422,6 +5481,14 @@
The value whose factorial to compute.
The factorial of .
+
+
+ Calculates the greatest common factor between the current 8-bit unsigned integer, and another 8-bit unsigned integer.
+
+ The first value.
+ The second value.
+ The greatest common factor between and .
+
Returns a value indicating whether the current value is evenly divisible by 2.
@@ -5461,6 +5528,23 @@
Multiplicative persistence is defined as the recursive digital product until that product is a single digit.
+
+
+ Wraps the current 8-bit unsigned 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 8-bit unsigned integer between 0 and a high value.
+
+ The value to wrap.
+ The exclusive upper bound.
+ The wrapped value.
+
Extension methods for .
@@ -5747,7 +5831,7 @@
- Returns the square root of this double-precision floating-point number.
+ Returns the square root of this decimal number.
The number whose square root is to be found.
@@ -5775,6 +5859,23 @@
is negative.
+
+
+ Wraps the current decimal number 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 decimal number between 0 and a high value.
+
+ The value to wrap.
+ The exclusive upper bound.
+ The wrapped value.
+
Mathematical extension methods.
@@ -6035,6 +6136,23 @@
, this method returns .
+
+
+ Wraps the current double-precision floating-point number 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 double-precision floating-point number between 0 and a high value.
+
+ The value to wrap.
+ The exclusive upper bound.
+ The wrapped value.
+
Provides options for clusivity.
@@ -6084,6 +6202,14 @@
The factorial of .
is less than 0.
+
+
+ Calculates the greatest common factor between the current 16-bit signed integer, and another 16-bit signed integer.
+
+ The first value.
+ The second value.
+ The greatest common factor between and .
+
Returns a value indicating whether the current value is evenly divisible by 2.
@@ -6168,6 +6294,23 @@
+
+
+ Wraps the current 16-bit signed 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 16-bit signed integer between 0 and a high value.
+
+ The value to wrap.
+ The exclusive upper bound.
+ The wrapped value.
+
Extension methods for .
@@ -6192,6 +6335,14 @@
The factorial of .
is less than 0.
+
+
+ Calculates the greatest common factor between the current 32-bit signed integer, and another 32-bit signed integer.
+
+ The first value.
+ The second value.
+ The greatest common factor between and .
+
Returns a value indicating whether the current value is evenly divisible by 2.
@@ -6276,6 +6427,23 @@
+
+
+ Wraps the current 32-bit signed 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 32-bit signed integer between 0 and a high value.
+
+ The value to wrap.
+ The exclusive upper bound.
+ The wrapped value.
+
Extension methods for .
@@ -6300,6 +6468,14 @@
The factorial of .
is less than 0.
+
+
+ Calculates the greatest common factor between the current 64-bit signed integer, and another 64-bit unsigned integer.
+
+ The first value.
+ The second value.
+ The greatest common factor between and .
+
Returns a value indicating whether the current value is evenly divisible by 2.
@@ -6384,11 +6560,58 @@
+
+
+ Wraps the current 64-bit signed 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 64-bit signed integer between 0 and a high value.
+
+ The value to wrap.
+ The exclusive upper bound.
+ The wrapped value.
+
Provides static helpers methods for mathematical functions not found in the .NET class.
+
+
+ Converts a gamma-encoded value to a linear value using a gamma value of 2.2.
+
+ The gamma-encoded value to convert. Expected range is [0, 1].
+ The linear value.
+
+
+
+ Converts a gamma-encoded value to a linear value using the specified gamma value.
+
+ The gamma-encoded value to convert. Expected range is [0, 1].
+ The gamma value to use for decoding.
+ The linear value.
+
+
+
+ Converts a gamma-encoded value to a linear value using a gamma value of 2.2.
+
+ The gamma-encoded value to convert. Expected range is [0, 1].
+ The linear value.
+
+
+
+ Converts a gamma-encoded value to a linear value using the specified gamma value.
+
+ The gamma-encoded value to convert. Expected range is [0, 1].
+ The gamma value to use for decoding.
+ The linear value.
+
Returns the linear interpolation inverse of a value, such that it determines where a value lies between two other
@@ -6431,6 +6654,36 @@
The interpolation result as determined by (1 - alpha) * value + alpha * target.
+
+
+ Converts a linear value to a gamma-encoded value using a gamma value of 2.2.
+
+ The linear value to convert. Expected range is [0, 1].
+ The gamma-encoded value.
+
+
+
+ Converts a linear value to a gamma-encoded value using the specified gamma value.
+
+ The linear value to convert. Expected range is [0, 1].
+ The gamma value to use for encoding.
+ The gamma-encoded value.
+
+
+
+ Converts a linear value to a gamma-encoded value using a gamma value of 2.2.
+
+ The linear value to convert. Expected range is [0, 1].
+ The gamma-encoded value.
+
+
+
+ Converts a linear value to a gamma-encoded value using the specified gamma value.
+
+ The linear value to convert. Expected range is [0, 1].
+ The gamma value to use for encoding.
+ The gamma-encoded value.
+
Converts a value from being a percentage of one range, to being the same percentage in a new range.
@@ -6477,6 +6730,14 @@
The factorial of .
is less than 0.
+
+
+ Calculates the greatest common factor between the current 8-bit signed integer, and another 8-bit signed integer.
+
+ The first value.
+ The second value.
+ The greatest common factor between and .
+
Returns a value indicating whether the current value is evenly divisible by 2.
@@ -6561,6 +6822,23 @@
+
+
+ Wraps the current 8-bit signed 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 8-bit signed integer between 0 and a high value.
+
+ The value to wrap.
+ The exclusive upper bound.
+ The wrapped value.
+
Extension methods for .
@@ -6820,6 +7098,23 @@
, this method returns .
+
+
+ Wraps the current single-precision floating-point number 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 single-precision floating-point number between 0 and a high value.
+
+ The value to wrap.
+ The exclusive upper bound.
+ The wrapped value.
+
Extension methods for .
@@ -6843,6 +7138,15 @@
The value whose factorial to compute.
The factorial of .
+
+
+ Calculates the greatest common factor between the current 16-bit unsigned integer, and another 16-bit unsigned
+ integer.
+
+ The first value.
+ The second value.
+ The greatest common factor between and .
+
Returns a value indicating whether the current value is evenly divisible by 2.
@@ -6882,6 +7186,23 @@
Multiplicative persistence is defined as the recursive digital product until that product is a single digit.
+
+
+ Wraps the current 16-bit unsigned 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 16-bit unsigned integer between 0 and a high value.
+
+ The value to wrap.
+ The exclusive upper bound.
+ The wrapped value.
+
Extension methods for .
@@ -6905,6 +7226,15 @@
The value whose factorial to compute.
The factorial of .
+
+
+ Calculates the greatest common factor between the current 32-bit unsigned integer, and another 32-bit unsigned
+ integer.
+
+ The first value.
+ The second value.
+ The greatest common factor between and .
+
Returns a value indicating whether the current value is evenly divisible by 2.
@@ -6944,6 +7274,23 @@
Multiplicative persistence is defined as the recursive digital product until that product is a single digit.
+
+
+ Wraps the current 32-bit unsigned 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 32-bit unsigned integer between 0 and a high value.
+
+ The value to wrap.
+ The exclusive upper bound.
+ The wrapped value.
+
Extension methods for .
@@ -6967,6 +7314,15 @@
The value whose factorial to compute.
The factorial of .
+
+
+ Calculates the greatest common factor between the current 64-bit unsigned integer, and another 64-bit unsigned
+ integer.
+
+ The first value.
+ The second value.
+ The greatest common factor between and .
+
Returns a value indicating whether the current value is evenly divisible by 2.
@@ -7006,6 +7362,23 @@
Multiplicative persistence is defined as the recursive digital product until that product is a single digit.
+
+
+ Wraps the current 64-bit unsigned 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 64-bit unsigned integer between 0 and a high value.
+
+ The value to wrap.
+ The exclusive upper bound.
+ The wrapped value.
+
Extension methods for and derived types.
@@ -8225,6 +8598,16 @@
The input string.
if this string is an emoji; otherwise, .
+
+
+ Returns a value indicating whether the current string represents an empty string.
+
+ The value to check.
+
+ if is empty; otherwise, .
+
+ is .
+
Determines if all alpha characters in this string are considered lowercase.
@@ -8234,6 +8617,28 @@
if all alpha characters in this string are lowercase; otherwise, .
+
+
+ Returns a value indicating whether the current string is ( in Visual
+ Basic), or represents an empty string.
+
+ The value to check.
+
+ if is or empty; otherwise,
+ .
+
+
+
+
+ Returns a value indicating whether the current string is ( in Visual
+ Basic), represents an empty string, or consists of only whitespace characters.
+
+ The value to check.
+
+ if is , empty, or consists of only
+ whitespace; otherwise, .
+
+
Determines whether the current string is considered palindromic; that is, the letters within the string are the
@@ -8255,6 +8660,18 @@
if all alpha characters in this string are uppercase; otherwise, .
+
+
+ Returns a value indicating whether the current string represents an empty string, or consists of only whitespace
+ characters.
+
+ The value to check.
+
+ if is empty or consists of only whitespace; otherwise,
+ .
+
+ is .
+
Repeats a string a specified number of times.
diff --git a/package.json b/package.json
index 9544e89..55e78b0 100644
--- a/package.json
+++ b/package.json
@@ -6,7 +6,7 @@
"url": "https://oliverbooth.dev"
},
"displayName": "X10D",
- "version": "3.2.0-nightly.155",
+ "version": "3.2.0-nightly.163",
"unity": "2021.2",
"description": "Extension methods on crack",
"keywords": ["dotnet", "extension-methods"],