ArrayEx

Test whether all entries in an array are equal to a given value.

Test whether all entries in an array are equal to a given value.

Tests whether all pears are null.

Tests whether any of the pears contain meta data.

Tests whether any of the pears are null.

Append a collection of items to the end of this array.

Append an item to the end of this array.

Chain a set of enumerations.

Collate all array elements that line up with true array in the map at the start of the array.

Collate all null elements in an array.

Gets whether a collection of pears contains any meta data.

Gets whether a collection of pears contains any meta data.

Convert an array of one type into another.

Convert nested arrays of one type to another.

Copies specific elements from an array into another array.

Copy the first N items from one array to the start of another.

Copy the last N items from one array to the end of another.

Guess the length of a collection. If the type cannot be quickly resolved, a default value is returned.

Create an array out of all non-NaN elements in a collection.

Create a one dimensional array from a collection of values and inclusion flags.

Create a one dimensional array.

Create a two dimensional, nested array.

Create a three dimensional, nested array.

Create a four dimensional, nested array.

Convert a collection of elements into a set with valence tracking.

Convert a collection of elements into a set with valence tracking.

Apply a culling pattern to an array.

Clone a jagged array.

Clone a jagged array.

Clone a multiply jagged array.

Compare two string arrays.

Perform an entrywise equality test on two arrays.

Perform an entrywise equality test on two arrays.

Expand an array.

Expand an array.

Find the index of the first interval which contains the given value.

Find the first local maximum in an array of doubles.

Find the first local maximum in an array of doubles.

Find the first local maximum in an array of doubles.

Find the first local maximum in an array of integers.

Find the first local maximum in an array of integers.

Find the first local maximum in an array of integers.

Find the first local minimum in an array of doubles.

Find the first local minimum in an array of doubles.

Find the first local minimum in an array of doubles.

Find the first local minimum in an array of integers.

Find the first local minimum in an array of integers.

Find the first local minimum in an array of integers.

Find the first range that passes the predicate.

Find the first range that passes the predicate.

Return the first index within the array where a specific predicate returns true.

Return the first index within the array where a specific predicate returns true.

Return the first index within the array where a specific value can be found.

Return the first index within the array where a specific value can be found.

Flip a two-dimensional, rectangular nested array.

Enumerate over an array in a backwards fashion (from the highest to the lowest index).

Enumerate over an array in a forwards fashion (from the lowest to the highest index).

Format an array.

Format a two-dimensional jagged array.

Create and populate an array.

Perform an inverse transform sampling on an array of increasing doubles. This means treat the array as a polyline and intersect it with a horizontal ray whose y-value is constant. If the array is not strictly increasing, the results of this method cannot be relied upon.

Finds the first occurrence of an array within another array.

Inject an item into the array. All items starting at the index will be moved one position to the right. The last item will disappear. This method differs from Insert in that Inject does not change the array size, nor does it create a second, modified array.

Insert a collection of items into this array.

Insert an item into this array.

Invert a bool enumeration.

Test an array for null-ness of empty-ness.

Gets whether the array instance is null or empty.

Gets whether the array instance is null, empty, or contains only null items.

Gets the item at a cyclical index.

Sets the item at a cyclical index.

Apply a culling pattern to an array.

Gets the last item in an array.

Return the last index within the array where a specific value can be found.

Return the last index within the array where a specific value can be found.

Map an index specified within a expanded collection to the appropriate index in the unexpanded collection.

Map an index specified within a shrunk collection to the appropriate index in the unshrunk collection.

Count the number of meta data entries. An entry with zero key-value fields does not count towards the total.

Gets the most derived type constraint required to store all the elements in the array.

Invert all array in a boolean array.

Tests whether none of the pears are null.

Normalise all values in an array so they sum to a specific value.

Normalise all values in an array so they sum to 1.

Normalise all values in a nested array so they sum up to a specific value.

Normalise all values in a nested array so they sum up to 1.

Normalise all array in an array so they sum to a specific value.

Normalise all array in an array so they sum to 1.

Normalise all values in a nested array so they sum up to a specific value.

Normalise all values in a nested array so they sum up to 1.

Returns a null reference if the array contains only null array. Otherwise returns the same array.

Compute the hash for an array of values, taking into account ordering. I.e. the hash for {0, 1, 2} will be different than the hash for {0, 2, 1}.

Pad an array on the left side (before the first index) until it has a specific length. This method will not reduce the length of an array if it is already longer than the target length. If the array need not be modified the same instance is returned.

Pad an array on the right side (after the last index) until it has a specific length. This method will not reduce the length of an array if it is already longer than the target length. If the array need not be modified the same instance is returned.

Remove the last item from an array.

Remove the first item from an array.

Apply a function to an enumeration.

Append a collection of items to the end of an array.

Append an item to the end of an array.

Push an item into the first position of an array.

Gets a random item out of this array.

Remove specific items from an array.

Remove all instances from an array.

Remove a specific element from an array.

Remove all duplicate array elements using a custom comparer.

Remove all duplicate array elements using a custom comparer.

Remove all duplicate array elements using the standard comparer.

Remove a range of items from an array.

Apply a minimal, stable reordering to an array based on an ordering constraint. Do note that this method replaces values in the array with values in the keys, so this should only be used when that swap doesn't matter.

Replace the first occurance of a value within an array with another one.

Replace the last occurance of a value within an array with another one.

Replaces all occurrences of a Guid pattern within a source array with a single replacement Guid.

Replace all array in an array of doubles that fall inside any of the domains with a different value. This method is significantly faster than checking each element against each domain, but it does require the array of doubles is already sorted.

Create a reversed copy of an array.

Checks whether all access flags are of a single kind.

Set a range of array of an array to a specific value.

Set all array of an array to a specific value.

Set the first and last elements in an array simultaneously.

Shrink an array.

Shrink an array.

Slice the array between two indices. I.e. extract the sub-array limited by the indices.

Sort all intervals in an array from left to right and merge overlapping intervals.

Sort an array and create a sorting map using a default comparer.

Sort an array and create a sorting map using a default comparer.

Create a sorting map for an array with a null-mask array.

Perform a count sort using integers as keys. CountSort (unlike QuickSort or IntrospectiveSort as used by the .NET framework) is stable, meaning the order of the input items is preserved in case of identical keys. It is however slower than QuickSort and doesn't like big or negative key array.

Perform a topological sort on an array.

Perform a topological sort on an array.

Stack up the elements until the array is filled up.

Sum all elements in a collection.

Sum all elements in a collection.

Sum all elements in a collection.

Swap two items in an array.

Convert a double[] into a byte[].

Convert a float[] into a byte[].

Convert an int[] into a byte[].

Convert a long[] into a byte[].

Convert an array of SpatialVector array into an xyz coordinate array.

Convert an array of Point2d array into an xy coordinate array.

Convert an array of Point3d array into an xyz coordinate array.

Convert an array of Vector3d array into an xyz coordinate array.

Convert a byte[] into a double[].

Convert a byte[] into a float[].

Create a byte array containing all the hashcodes of a collection of objects.

Convert a byte[] into an int[].

Create an item array from a pear array.

Convert a byte[] into a long[].

Create a meta array from a pear array.

Create a null array from a pear array.

Convert an array of sequential xy coordinates into a Point2d array.

Convert an array of sequential xyz coordinates into a Point3d array.

Convert an array of sequential xyz coordinates into a SpatialVector array.

Create a type array from a pear array.

Convert an array of sequential xyz coordinates into a Vector3d array.

Resize an array to contain all items until a specific value.

Compute the hash for an array of array, not taking into account ordering. I.e. the hash for {0, 1, 2} will be the same as the hash for {0, 2, 1}.

Withdraw an item from the array. All items to the right of the index will be moved one position to the left. This method differs from RemoveAt in that Withdraw does not change the array size, nor does it create a second, modified array.

Wrap an IEnumerable into another IEbumerable of a different type.