@sitevision/api 2023.2.1 → 2023.2.2-beta.1

package/server/ArraysInstance/index.d.ts

@@ -1,22 +1,46 @@
+import type { Object } from "../../types/java/lang/Object";
+
+import type { Comparator } from "../../types/java/util/Comparator";
+
+import type { Class } from "../../types/java/lang/Class";
+import type { List } from "../../types/java/util/List";
+import type { String } from "../../types/java/lang/String";
+import type { BinaryOperator } from "../../types/java/util/function/BinaryOperator";
+import type { LongBinaryOperator } from "../../types/java/util/function/LongBinaryOperator";
+import type { DoubleBinaryOperator } from "../../types/java/util/function/DoubleBinaryOperator";
+import type { IntBinaryOperator } from "../../types/java/util/function/IntBinaryOperator";
+import type { IntFunction } from "../../types/java/util/function/IntFunction";
+import type { IntUnaryOperator } from "../../types/java/util/function/IntUnaryOperator";
+import type { IntToLongFunction } from "../../types/java/util/function/IntToLongFunction";
+import type { IntToDoubleFunction } from "../../types/java/util/function/IntToDoubleFunction";
+import type { Spliterator } from "../../types/java/util/Spliterator";
+import type { OfInt } from "../../types/java/util/Spliterator.OfInt";
+import type { OfLong } from "../../types/java/util/Spliterator.OfLong";
+import type { OfDouble } from "../../types/java/util/Spliterator.OfDouble";
+import type { Stream } from "../../types/java/util/stream/Stream";
+import type { IntStream } from "../../types/java/util/stream/IntStream";
+import type { LongStream } from "../../types/java/util/stream/LongStream";
+import type { DoubleStream } from "../../types/java/util/stream/DoubleStream";
+
 /**
  * Instance wrapper for the <code>java.util.Arrays</code> class that delegates all method calls to the corresponding <code>Arrays</code> method.
  *
- * <p>
- *    <em>
- *       Note! Method documentations in this interface are only excerpts. For full documentation, see official <code>java.util.Arrays</code> Javadoc.
- *    </em>
- * </p>
+ *  <p>
+ *     <em>
+ *        Note! Method documentations in this interface are only excerpts. For full documentation, see official <code>java.util.Arrays</code> Javadoc.
+ *     </em>
+ *  </p>
  *
- * <p>
- *    <em>
- *       Tip! You would typically use {@link InstanceCreatorUtil} to create array instances.
- *    </em>
- * </p>
+ *  <p>
+ *     <em>
+ *        Tip! You would typically use {@link InstanceCreatorUtil} to create array instances.
+ *     </em>
+ *  </p>
  *
- * <p>
- *    An instance of the Sitevision class implementing this interface can be obtained via {@link InstanceCreatorUtil#getArraysInstance()}.
- *    See {@link InstanceCreatorUtil} for how to obtain an instance of the <code>InstanceCreatorUtil</code> interface.
- * </p>
+ *  <p>
+ *     An instance of the Sitevision class implementing this interface can be obtained via {@link InstanceCreatorUtil#getArraysInstance()}.
+ *     See {@link InstanceCreatorUtil} for how to obtain an instance of the <code>InstanceCreatorUtil</code> interface.
+ *  </p>
  * @author Magnus Lövgren
  * @since Sitevision 3.1
  */
@@ -25,24 +49,24 @@ export interface ArraysInstance {
    * Sorts the specified array of longs into ascending numerical order.
    * @param anArray the array to be sorted
    */
-  sort(anArray: number): void;
+  sort(anArray: number[]): void;
 
   /**
    * Sorts the specified range of the specified array of longs into
-   * ascending numerical order.
+   *  ascending numerical order.
    * @param anArray the array to be sorted
    * @param aFromIndex the index of the first element (inclusive) to be sorted
    * @param aToIndex the index of the last element (exclusive) to be sorted
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aToIndex &gt; anArray.length</tt>
    */
-  sort(anArray: number, aFromIndex: number, aToIndex: number): void;
+  sort(anArray: number[], aFromIndex: number, aToIndex: number): void;
 
   /**
    * Sorts the specified array of ints into ascending numerical order.
    * @param anArray the array to be sorted
    */
-  sort(anArray: number): void;
+  sort(anArray: number[]): void;
 
   /**
    * Sorts the specified range of the specified array of ints into ascending numerical order.
@@ -52,13 +76,13 @@ export interface ArraysInstance {
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aToIndex &gt; anArray.length</tt>
    */
-  sort(anArray: number, aFromIndex: number, aToIndex: number): void;
+  sort(anArray: number[], aFromIndex: number, aToIndex: number): void;
 
   /**
    * Sorts the specified array of shorts into ascending numerical order.
    * @param anArray the array to be sorted
    */
-  sort(anArray: number): void;
+  sort(anArray: number[]): void;
 
   /**
    * Sorts the specified range of the specified array of shorts into ascending numerical order.
@@ -68,13 +92,13 @@ export interface ArraysInstance {
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aToIndex &gt; anArray.length</tt>
    */
-  sort(anArray: number, aFromIndex: number, aToIndex: number): void;
+  sort(anArray: number[], aFromIndex: number, aToIndex: number): void;
 
   /**
    * Sorts the specified array of chars into ascending numerical order.
    * @param anArray the array to be sorted
    */
-  sort(anArray: string): void;
+  sort(anArray: string[]): void;
 
   /**
    * Sorts the specified range of the specified array of chars into ascending numerical order.
@@ -84,13 +108,13 @@ export interface ArraysInstance {
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aToIndex &gt; anArray.length</tt>
    */
-  sort(anArray: string, aFromIndex: number, aToIndex: number): void;
+  sort(anArray: string[], aFromIndex: number, aToIndex: number): void;
 
   /**
    * Sorts the specified array of bytes into ascending numerical order.
    * @param anArray the array to be sorted
    */
-  sort(anArray: unknown): void;
+  sort(anArray: unknown[]): void;
 
   /**
    * Sorts the specified range of the specified array of bytes into ascending numerical order.
@@ -100,13 +124,13 @@ export interface ArraysInstance {
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aToIndex &gt; anArray.length</tt>
    */
-  sort(anArray: unknown, aFromIndex: number, aToIndex: number): void;
+  sort(anArray: unknown[], aFromIndex: number, aToIndex: number): void;
 
   /**
    * Sorts the specified array of doubles into ascending numerical order.
    * @param anArray the array to be sorted
    */
-  sort(anArray: number): void;
+  sort(anArray: number[]): void;
 
   /**
    * Sorts the specified range of the specified array of doubles into ascending numerical order.
@@ -116,13 +140,13 @@ export interface ArraysInstance {
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aToIndex &gt; anArray.length</tt>
    */
-  sort(anArray: number, aFromIndex: number, aToIndex: number): void;
+  sort(anArray: number[], aFromIndex: number, aToIndex: number): void;
 
   /**
    * Sorts the specified array of floats into ascending numerical order.
    * @param anArray the array to be sorted
    */
-  sort(anArray: number): void;
+  sort(anArray: number[]): void;
 
   /**
    * Sorts the specified range of the specified array of floats into ascending numerical order.
@@ -132,35 +156,35 @@ export interface ArraysInstance {
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aToIndex &gt; anArray.length</tt>
    */
-  sort(anArray: number, aFromIndex: number, aToIndex: number): void;
+  sort(anArray: number[], aFromIndex: number, aToIndex: number): void;
 
   /**
    * Sorts the specified array of objects into ascending order, according to the <code>Comparable</code> natural ordering of its elements.
    * @param anArray the array to be sorted
    * @throws ClassCastException if the array contains elements that are not <i>mutually comparable</i> (for example, strings and integers).
    */
-  sort(anArray: unknown): void;
+  sort(anArray: unknown[]): void;
 
   /**
    * Sorts the specified range of the specified array of objects into ascending order, according to the <code>Comparable</code>
-   * natural ordering of its elements.
+   *  natural ordering of its elements.
    * @param anArray the array to be sorted
    * @param aFromIndex the index of the first element (inclusive) to be sorted
    * @param aToIndex the index of the last element (exclusive) to be sorted
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
-   * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aToIndex &gt; anArray.length</tt>
-   * @throws ClassCastException if the array contains elements that are not <i>mutually comparable</i> (for example, strings and integers).
+   * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or&#xA; <tt>aToIndex &gt; anArray.length</tt>
+   * @throws ClassCastException if the array contains elements that are not <i>mutually comparable</i>&#xA; (for example, strings and integers).
    */
-  sort(anArray: unknown, aFromIndex: number, aToIndex: number): void;
+  sort(anArray: unknown[], aFromIndex: number, aToIndex: number): void;
 
   /**
    * Sorts the specified array of objects according to the order induced by the specified comparator.
    * @param <T> the class of the objects to be sorted
    * @param anArray the array to be sorted
-   * @param aComparator the comparator to determine the order of the array. A <tt>null</tt> value indicates that the elements' Comparable natural ordering should be used.
+   * @param aComparator the comparator to determine the order of the array. A <tt>null</tt> value indicates that the elements'&#xA; Comparable natural ordering should be used.
    * @throws ClassCastException if the array contains elements that are not <i>mutually comparable</i> using the specified comparator.
    */
-  sort(anArray: unknown, aComparator: unknown): void;
+  sort(anArray: unknown[], aComparator: Comparator): void;
 
   /**
    * Sorts the specified range of the specified array of objects according to the order induced by the specified comparator.
@@ -168,25 +192,25 @@ export interface ArraysInstance {
    * @param anArray the array to be sorted
    * @param aFromIndex the index of the first element (inclusive) to be sorted
    * @param aToIndex the index of the last element (exclusive) to be sorted
-   * @param aComparator the comparator to determine the order of the array. A <tt>null</tt> value indicates that the elements' Comparable natural ordering should be used.
+   * @param aComparator the comparator to determine the order of the array. A <tt>null</tt> value indicates that the elements'&#xA; Comparable natural ordering should be used.
    * @throws ClassCastException if the array contains elements that are not <i>mutually comparable</i> using the specified comparator.
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aToIndex &gt; anArray.length</tt>
    */
   sort(
-    anArray: unknown,
+    anArray: unknown[],
     aFromIndex: number,
     aToIndex: number,
-    aComparator: unknown
+    aComparator: Comparator
   ): void;
 
   /**
    * Searches the specified array of longs for the specified value using the binary search algorithm.
    * @param anArray the array to be searched
    * @param aKey the value to be searched for
-   * @return index of the search key, if it is contained in the array; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or <tt>anArray.length</tt> if all elements in the array are less than the specified key. Note that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
+   * @return index of the search key, if it is contained in the array; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The&#xA; <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first&#xA; element greater than the key, or <tt>anArray.length</tt> if all elements in the array are less than the specified key. Note&#xA; that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
    */
-  binarySearch(anArray: number, aKey: number): number;
+  binarySearch(anArray: number[], aKey: number): number;
 
   /**
    * Searches a range of the specified array of longs for the specified value using the binary search algorithm.
@@ -194,12 +218,12 @@ export interface ArraysInstance {
    * @param aFromIndex the index of the first element (inclusive) to be searched
    * @param aToIndex the index of the last element (exclusive) to be searched
    * @param aKey the value to be searched for
-   * @return index of the search key, if it is contained in the array within the specified range; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or <tt>aToIndex</tt> if all elements in the range are less than the specified key. Note that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
+   * @return index of the search key, if it is contained in the array within the specified range;&#xA; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the&#xA; key would be inserted into the array: the index of the first element in the range greater than the key,&#xA; or <tt>aToIndex</tt> if all elements in the range are less than the specified key. Note&#xA; that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
    * @throws IllegalArgumentException if {@code aFromIndex > aToIndex}
    * @throws ArrayIndexOutOfBoundsException if {@code aFromIndex < 0 or aToIndex > anArray.length}
    */
   binarySearch(
-    anArray: number,
+    anArray: number[],
     aFromIndex: number,
     aToIndex: number,
     aKey: number
@@ -209,9 +233,9 @@ export interface ArraysInstance {
    * Searches the specified array of ints for the specified value using the binary search algorithm.
    * @param anArray the array to be searched
    * @param aKey the value to be searched for
-   * @return index of the search key, if it is contained in the array; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or <tt>anArray.length</tt> if all elements in the array are less than the specified key. Note that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
+   * @return index of the search key, if it is contained in the array; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The&#xA; <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first&#xA; element greater than the key, or <tt>anArray.length</tt> if all elements in the array are less than the specified key. Note&#xA; that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
    */
-  binarySearch(anArray: number, aKey: number): number;
+  binarySearch(anArray: number[], aKey: number): number;
 
   /**
    * Searches a range of the specified array of ints for the specified value using the binary search algorithm.
@@ -219,12 +243,12 @@ export interface ArraysInstance {
    * @param aFromIndex the index of the first element (inclusive) to be searched
    * @param aToIndex the index of the last element (exclusive) to be searched
    * @param aKey the value to be searched for
-   * @return index of the search key, if it is contained in the array within the specified range; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or <tt>aToIndex</tt> if all elements in the range are less than the specified key. Note that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
+   * @return index of the search key, if it is contained in the array within the specified range;&#xA; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the&#xA; key would be inserted into the array: the index of the first element in the range greater than the key,&#xA; or <tt>aToIndex</tt> if all elements in the range are less than the specified key. Note&#xA; that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
    * @throws IllegalArgumentException if {@code aFromIndex > aToIndex}
    * @throws ArrayIndexOutOfBoundsException if {@code aFromIndex < 0 or aToIndex > anArray.length}
    */
   binarySearch(
-    anArray: number,
+    anArray: number[],
     aFromIndex: number,
     aToIndex: number,
     aKey: number
@@ -234,9 +258,9 @@ export interface ArraysInstance {
    * Searches the specified array of shorts for the specified value using the binary search algorithm.
    * @param anArray the array to be searched
    * @param aKey the value to be searched for
-   * @return index of the search key, if it is contained in the array; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or <tt>anArray.length</tt> if all elements in the array are less than the specified key. Note that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
+   * @return index of the search key, if it is contained in the array; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The&#xA; <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first&#xA; element greater than the key, or <tt>anArray.length</tt> if all elements in the array are less than the specified key. Note&#xA; that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
    */
-  binarySearch(anArray: number, aKey: number): number;
+  binarySearch(anArray: number[], aKey: number): number;
 
   /**
    * Searches a range of the specified array of shorts for the specified value using the binary search algorithm.
@@ -244,12 +268,12 @@ export interface ArraysInstance {
    * @param aFromIndex the index of the first element (inclusive) to be searched
    * @param aToIndex the index of the last element (exclusive) to be searched
    * @param aKey the value to be searched for
-   * @return index of the search key, if it is contained in the array within the specified range; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or <tt>aToIndex</tt> if all elements in the range are less than the specified key. Note that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
+   * @return index of the search key, if it is contained in the array within the specified range;&#xA; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the&#xA; key would be inserted into the array: the index of the first element in the range greater than the key,&#xA; or <tt>aToIndex</tt> if all elements in the range are less than the specified key. Note&#xA; that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
    * @throws IllegalArgumentException if {@code aFromIndex > aToIndex}
    * @throws ArrayIndexOutOfBoundsException if {@code aFromIndex < 0 or aToIndex > anArray.length}
    */
   binarySearch(
-    anArray: number,
+    anArray: number[],
     aFromIndex: number,
     aToIndex: number,
     aKey: number
@@ -259,9 +283,9 @@ export interface ArraysInstance {
    * Searches the specified array of chars for the specified value using the binary search algorithm.
    * @param anArray the array to be searched
    * @param aKey the value to be searched for
-   * @return index of the search key, if it is contained in the array; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or <tt>anArray.length</tt> if all elements in the array are less than the specified key. Note that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
+   * @return index of the search key, if it is contained in the array; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The&#xA; <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first&#xA; element greater than the key, or <tt>anArray.length</tt> if all elements in the array are less than the specified key. Note&#xA; that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
    */
-  binarySearch(anArray: string, aKey: string): number;
+  binarySearch(anArray: string[], aKey: string): number;
 
   /**
    * Searches a range of the specified array of chars for the specified value using the binary search algorithm.
@@ -269,12 +293,12 @@ export interface ArraysInstance {
    * @param aFromIndex the index of the first element (inclusive) to be searched
    * @param aToIndex the index of the last element (exclusive) to be searched
    * @param aKey the value to be searched for
-   * @return index of the search key, if it is contained in the array within the specified range; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or <tt>aToIndex</tt> if all elements in the range are less than the specified key. Note that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
+   * @return index of the search key, if it is contained in the array within the specified range;&#xA; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the&#xA; key would be inserted into the array: the index of the first element in the range greater than the key,&#xA; or <tt>aToIndex</tt> if all elements in the range are less than the specified key. Note&#xA; that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
    * @throws IllegalArgumentException if {@code aFromIndex > aToIndex}
    * @throws ArrayIndexOutOfBoundsException if {@code aFromIndex < 0 or aToIndex > anArray.length}
    */
   binarySearch(
-    anArray: string,
+    anArray: string[],
     aFromIndex: number,
     aToIndex: number,
     aKey: string
@@ -284,9 +308,9 @@ export interface ArraysInstance {
    * Searches the specified array of bytes for the specified value using the binary search algorithm.
    * @param anArray the array to be searched
    * @param aKey the value to be searched for
-   * @return index of the search key, if it is contained in the array; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or <tt>anArray.length</tt> if all elements in the array are less than the specified key. Note that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
+   * @return index of the search key, if it is contained in the array; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The&#xA; <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first&#xA; element greater than the key, or <tt>anArray.length</tt> if all elements in the array are less than the specified key. Note&#xA; that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
    */
-  binarySearch(anArray: unknown, aKey: unknown): number;
+  binarySearch(anArray: unknown[], aKey: unknown): number;
 
   /**
    * Searches a range of the specified array of bytes for the specified value using the binary search algorithm.
@@ -294,12 +318,12 @@ export interface ArraysInstance {
    * @param aFromIndex the index of the first element (inclusive) to be searched
    * @param aToIndex the index of the last element (exclusive) to be searched
    * @param aKey the value to be searched for
-   * @return index of the search key, if it is contained in the array within the specified range; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or <tt>aToIndex</tt> if all elements in the range are less than the specified key. Note that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
+   * @return index of the search key, if it is contained in the array within the specified range;&#xA; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the&#xA; key would be inserted into the array: the index of the first element in the range greater than the key,&#xA; or <tt>aToIndex</tt> if all elements in the range are less than the specified key. Note&#xA; that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
    * @throws IllegalArgumentException if {@code aFromIndex > aToIndex}
    * @throws ArrayIndexOutOfBoundsException if {@code aFromIndex < 0 or aToIndex > anArray.length}
    */
   binarySearch(
-    anArray: unknown,
+    anArray: unknown[],
     aFromIndex: number,
     aToIndex: number,
     aKey: unknown
@@ -309,9 +333,9 @@ export interface ArraysInstance {
    * Searches the specified array of doubles for the specified value using the binary search algorithm.
    * @param anArray the array to be searched
    * @param aKey the value to be searched for
-   * @return index of the search key, if it is contained in the array; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or <tt>anArray.length</tt> if all elements in the array are less than the specified key. Note that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
+   * @return index of the search key, if it is contained in the array; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The&#xA; <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first&#xA; element greater than the key, or <tt>anArray.length</tt> if all elements in the array are less than the specified key. Note&#xA; that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
    */
-  binarySearch(anArray: number, aKey: number): number;
+  binarySearch(anArray: number[], aKey: number): number;
 
   /**
    * Searches a range of the specified array of doubles for the specified value using the binary search algorithm.
@@ -319,12 +343,12 @@ export interface ArraysInstance {
    * @param aFromIndex the index of the first element (inclusive) to be searched
    * @param aToIndex the index of the last element (exclusive) to be searched
    * @param aKey the value to be searched for
-   * @return index of the search key, if it is contained in the array within the specified range; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or <tt>aToIndex</tt> if all elements in the range are less than the specified key. Note that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
+   * @return index of the search key, if it is contained in the array within the specified range;&#xA; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the&#xA; key would be inserted into the array: the index of the first element in the range greater than the key,&#xA; or <tt>aToIndex</tt> if all elements in the range are less than the specified key. Note&#xA; that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
    * @throws IllegalArgumentException if {@code aFromIndex > aToIndex}
    * @throws ArrayIndexOutOfBoundsException if {@code aFromIndex < 0 or aToIndex > anArray.length}
    */
   binarySearch(
-    anArray: number,
+    anArray: number[],
     aFromIndex: number,
     aToIndex: number,
     aKey: number
@@ -334,9 +358,9 @@ export interface ArraysInstance {
    * Searches the specified array of floats for the specified value using the binary search algorithm.
    * @param anArray the array to be searched
    * @param aKey the value to be searched for
-   * @return index of the search key, if it is contained in the array; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or <tt>anArray.length</tt> if all elements in the array are less than the specified key. Note that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
+   * @return index of the search key, if it is contained in the array; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The&#xA; <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first&#xA; element greater than the key, or <tt>anArray.length</tt> if all elements in the array are less than the specified key. Note&#xA; that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
    */
-  binarySearch(anArray: number, aKey: number): number;
+  binarySearch(anArray: number[], aKey: number): number;
 
   /**
    * Searches a range of the specified array of floats for the specified value using the binary search algorithm.
@@ -344,12 +368,12 @@ export interface ArraysInstance {
    * @param aFromIndex the index of the first element (inclusive) to be searched
    * @param aToIndex the index of the last element (exclusive) to be searched
    * @param aKey the value to be searched for
-   * @return index of the search key, if it is contained in the array within the specified range; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or <tt>aToIndex</tt> if all elements in the range are less than the specified key. Note that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
+   * @return index of the search key, if it is contained in the array within the specified range;&#xA; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the&#xA; key would be inserted into the array: the index of the first element in the range greater than the key,&#xA; or <tt>aToIndex</tt> if all elements in the range are less than the specified key. Note&#xA; that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
    * @throws IllegalArgumentException if {@code aFromIndex > aToIndex}
    * @throws ArrayIndexOutOfBoundsException if {@code aFromIndex < 0 or aToIndex > anArray.length}
    */
   binarySearch(
-    anArray: number,
+    anArray: number[],
     aFromIndex: number,
     aToIndex: number,
     aKey: number
@@ -359,10 +383,10 @@ export interface ArraysInstance {
    * Searches the specified array for the specified object using the binary search algorithm.
    * @param anArray the array to be searched
    * @param aKey the value to be searched for
-   * @return index of the search key, if it is contained in the array; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or <tt>anArray.length</tt> if all elements in the array are less than the specified key. Note that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
+   * @return index of the search key, if it is contained in the array; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The&#xA; <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first&#xA; element greater than the key, or <tt>anArray.length</tt> if all elements in the array are less than the specified key. Note&#xA; that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
    * @throws ClassCastException if the search key is not comparable to the elements of the array.
    */
-  binarySearch(anArray: unknown, aKey: unknown): number;
+  binarySearch(anArray: unknown[], aKey: unknown): number;
 
   /**
    * Searches a range of the specified array for the specified object using the binary search algorithm.
@@ -370,13 +394,13 @@ export interface ArraysInstance {
    * @param aFromIndex the index of the first element (inclusive) to be searched
    * @param aToIndex the index of the last element (exclusive) to be searched
    * @param aKey the value to be searched for
-   * @return index of the search key, if it is contained in the array within the specified range; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or <tt>aToIndex</tt> if all elements in the range are less than the specified key. Note that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
+   * @return index of the search key, if it is contained in the array within the specified range;&#xA; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the&#xA; key would be inserted into the array: the index of the first element in the range greater than the key,&#xA; or <tt>aToIndex</tt> if all elements in the range are less than the specified key. Note&#xA; that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
    * @throws ClassCastException if the search key is not comparable to the elements of the array within the specified range.
    * @throws IllegalArgumentException if {@code aFromIndex > aToIndex}
    * @throws ArrayIndexOutOfBoundsException if {@code aFromIndex < 0 or aToIndex > anArray.length}
    */
   binarySearch(
-    anArray: unknown,
+    anArray: unknown[],
     aFromIndex: number,
     aToIndex: number,
     aKey: unknown
@@ -387,11 +411,15 @@ export interface ArraysInstance {
    * @param <T> the class of the objects to be searched
    * @param anArray the array to be searched
    * @param aKey the value to be searched for
-   * @param aComparator the comparator by which the array is ordered. A <tt>null</tt> value indicates that the elements' Comparable natural ordering should be used.
-   * @return index of the search key, if it is contained in the array; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or <tt>anArray.length</tt> if all elements in the array are less than the specified key. Note that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
-   * @throws ClassCastException if the array contains elements that are not <i>mutually comparable</i> using the specified comparator, or the search key is not comparable to the elements of the array using this comparator.
+   * @param aComparator the comparator by which the array is ordered. A <tt>null</tt> value indicates that the elements'&#xA; Comparable natural ordering should be used.
+   * @return index of the search key, if it is contained in the array; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The&#xA; <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first&#xA; element greater than the key, or <tt>anArray.length</tt> if all elements in the array are less than the specified key. Note&#xA; that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
+   * @throws ClassCastException if the array contains elements that are not <i>mutually comparable</i> using the specified comparator,&#xA; or the search key is not comparable to the elements of the array using this comparator.
    */
-  binarySearch(anArray: unknown, aKey: unknown, aComparator: unknown): number;
+  binarySearch(
+    anArray: unknown[],
+    aKey: unknown,
+    aComparator: Comparator
+  ): number;
 
   /**
    * Searches a range of the specified array for the specified object using the binary search algorithm.
@@ -400,18 +428,18 @@ export interface ArraysInstance {
    * @param aFromIndex the index of the first element (inclusive) to be searched
    * @param aToIndex the index of the last element (exclusive) to be searched
    * @param aKey the value to be searched for
-   * @param aComparator the comparator by which the array is ordered. A <tt>null</tt> value indicates that the elements' Comparable natural ordering should be used.
-   * @return index of the search key, if it is contained in the array within the specified range; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or <tt>aToIndex</tt> if all elements in the range are less than the specified key. Note that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
-   * @throws ClassCastException if the range contains elements that are not <i>mutually comparable</i> using the specified comparator, or the search key is not comparable to the elements in the range using this comparator.
+   * @param aComparator the comparator by which the array is ordered. A <tt>null</tt> value indicates that the elements'&#xA; Comparable natural ordering should be used.
+   * @return index of the search key, if it is contained in the array within the specified range;&#xA; otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The <i>insertion point</i> is defined as the point at which the&#xA; key would be inserted into the array: the index of the first element in the range greater than the key,&#xA; or <tt>aToIndex</tt> if all elements in the range are less than the specified key. Note&#xA; that this guarantees that the return value will be &gt;= 0 if and only if the key is found.
+   * @throws ClassCastException if the range contains elements that are not <i>mutually comparable</i> using the specified comparator,&#xA; or the search key is not comparable to the elements in the range using this comparator.
    * @throws IllegalArgumentException if {@code aFromIndex > aToIndex}
    * @throws ArrayIndexOutOfBoundsException if {@code aFromIndex < 0 or aToIndex > anArray.length}
    */
   binarySearch(
-    anArray: unknown,
+    anArray: unknown[],
     aFromIndex: number,
     aToIndex: number,
     aKey: unknown,
-    aComparator: unknown
+    aComparator: Comparator
   ): number;
 
   /**
@@ -420,7 +448,7 @@ export interface ArraysInstance {
    * @param anAnotherArray the other array to be tested for equality
    * @return <tt>true</tt> if the two arrays are equal
    */
-  equals(anArray: number, anAnotherArray: number): boolean;
+  equals(anArray: number[], anAnotherArray: number[]): boolean;
 
   /**
    * Returns <tt>true</tt> if the two specified arrays of ints are <i>equal</i> to one another.
@@ -428,7 +456,7 @@ export interface ArraysInstance {
    * @param anAnotherArray the other array to be tested for equality
    * @return <tt>true</tt> if the two arrays are equal
    */
-  equals(anArray: number, anAnotherArray: number): boolean;
+  equals(anArray: number[], anAnotherArray: number[]): boolean;
 
   /**
    * Returns <tt>true</tt> if the two specified arrays of shorts are <i>equal</i> to one another.
@@ -436,7 +464,7 @@ export interface ArraysInstance {
    * @param anAnotherArray the other array to be tested for equality
    * @return <tt>true</tt> if the two arrays are equal
    */
-  equals(anArray: number, anAnotherArray: number): boolean;
+  equals(anArray: number[], anAnotherArray: number[]): boolean;
 
   /**
    * Returns <tt>true</tt> if the two specified arrays of chars are <i>equal</i> to one another.
@@ -444,7 +472,7 @@ export interface ArraysInstance {
    * @param anAnotherArray the other array to be tested for equality
    * @return <tt>true</tt> if the two arrays are equal
    */
-  equals(anArray: string, anAnotherArray: string): boolean;
+  equals(anArray: string[], anAnotherArray: string[]): boolean;
 
   /**
    * Returns <tt>true</tt> if the two specified arrays of bytes are <i>equal</i> to one another.
@@ -452,7 +480,7 @@ export interface ArraysInstance {
    * @param anAnotherArray the other array to be tested for equality
    * @return <tt>true</tt> if the two arrays are equal
    */
-  equals(anArray: unknown, anAnotherArray: unknown): boolean;
+  equals(anArray: unknown[], anAnotherArray: unknown[]): boolean;
 
   /**
    * Returns <tt>true</tt> if the two specified arrays of booleans are <i>equal</i> to one another.
@@ -460,7 +488,7 @@ export interface ArraysInstance {
    * @param anAnotherArray the other array to be tested for equality
    * @return <tt>true</tt> if the two arrays are equal
    */
-  equals(anArray: boolean, anAnotherArray: boolean): boolean;
+  equals(anArray: boolean[], anAnotherArray: boolean[]): boolean;
 
   /**
    * Returns <tt>true</tt> if the two specified arrays of doubles are <i>equal</i> to one another.
@@ -468,7 +496,7 @@ export interface ArraysInstance {
    * @param anAnotherArray the other array to be tested for equality
    * @return <tt>true</tt> if the two arrays are equal
    */
-  equals(anArray: number, anAnotherArray: number): boolean;
+  equals(anArray: number[], anAnotherArray: number[]): boolean;
 
   /**
    * Returns <tt>true</tt> if the two specified arrays of floats are <i>equal</i> to one another.
@@ -476,7 +504,7 @@ export interface ArraysInstance {
    * @param anAnotherArray the other array to be tested for equality
    * @return <tt>true</tt> if the two arrays are equal
    */
-  equals(anArray: number, anAnotherArray: number): boolean;
+  equals(anArray: number[], anAnotherArray: number[]): boolean;
 
   /**
    * Returns <tt>true</tt> if the two specified arrays of Objects are <i>equal</i> to one another.
@@ -484,14 +512,14 @@ export interface ArraysInstance {
    * @param anAnotherArray the other array to be tested for equality
    * @return <tt>true</tt> if the two arrays are equal
    */
-  equals(anArray: unknown, anAnotherArray: unknown): boolean;
+  equals(anArray: unknown[], anAnotherArray: unknown[]): boolean;
 
   /**
    * Assigns the specified long value to each element of the specified array of longs.
    * @param anArray the array to be filled
    * @param aValue the value to be stored in all elements of the array
    */
-  fill(anArray: number, aValue: number): void;
+  fill(anArray: number[], aValue: number): void;
 
   /**
    * Assigns the specified long value to each element of the specified range of the specified array of longs.
@@ -503,7 +531,7 @@ export interface ArraysInstance {
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aToIndex &gt; anArray.length</tt>
    */
   fill(
-    anArray: number,
+    anArray: number[],
     aFromIndex: number,
     aToIndex: number,
     aValue: number
@@ -514,7 +542,7 @@ export interface ArraysInstance {
    * @param anArray the array to be filled
    * @param aValue the value to be stored in all elements of the array
    */
-  fill(anArray: number, aValue: number): void;
+  fill(anArray: number[], aValue: number): void;
 
   /**
    * Assigns the specified int value to each element of the specified range of the specified array of ints.
@@ -526,7 +554,7 @@ export interface ArraysInstance {
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aToIndex &gt; anArray.length</tt>
    */
   fill(
-    anArray: number,
+    anArray: number[],
     aFromIndex: number,
     aToIndex: number,
     aValue: number
@@ -537,7 +565,7 @@ export interface ArraysInstance {
    * @param anArray the array to be filled
    * @param aValue the value to be stored in all elements of the array
    */
-  fill(anArray: number, aValue: number): void;
+  fill(anArray: number[], aValue: number): void;
 
   /**
    * Assigns the specified short value to each element of the specified range of the specified array of shorts.
@@ -549,7 +577,7 @@ export interface ArraysInstance {
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aToIndex &gt; anArray.length</tt>
    */
   fill(
-    anArray: number,
+    anArray: number[],
     aFromIndex: number,
     aToIndex: number,
     aValue: number
@@ -560,7 +588,7 @@ export interface ArraysInstance {
    * @param anArray the array to be filled
    * @param aValue the value to be stored in all elements of the array
    */
-  fill(anArray: string, aValue: string): void;
+  fill(anArray: string[], aValue: string): void;
 
   /**
    * Assigns the specified char value to each element of the specified range of the specified array of chars.
@@ -572,7 +600,7 @@ export interface ArraysInstance {
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aToIndex &gt; anArray.length</tt>
    */
   fill(
-    anArray: string,
+    anArray: string[],
     aFromIndex: number,
     aToIndex: number,
     aValue: string
@@ -583,7 +611,7 @@ export interface ArraysInstance {
    * @param anArray the array to be filled
    * @param aValue the value to be stored in all elements of the array
    */
-  fill(anArray: unknown, aValue: unknown): void;
+  fill(anArray: unknown[], aValue: unknown): void;
 
   /**
    * Assigns the specified byte value to each element of the specified range of the specified array of bytes.
@@ -595,7 +623,7 @@ export interface ArraysInstance {
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aToIndex &gt; anArray.length</tt>
    */
   fill(
-    anArray: unknown,
+    anArray: unknown[],
     aFromIndex: number,
     aToIndex: number,
     aValue: unknown
@@ -606,11 +634,11 @@ export interface ArraysInstance {
    * @param anArray the array to be filled
    * @param aValue the value to be stored in all elements of the array
    */
-  fill(anArray: boolean, aValue: boolean): void;
+  fill(anArray: boolean[], aValue: boolean): void;
 
   /**
    * Assigns the specified boolean value to each element of the specified
-   * range of the specified array of booleans.
+   *  range of the specified array of booleans.
    * @param anArray the array to be filled
    * @param aFromIndex the index of the first element (inclusive) to be filled with the specified value
    * @param aToIndex the index of the last element (exclusive) to be filled with the specified value
@@ -619,7 +647,7 @@ export interface ArraysInstance {
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aToIndex &gt; anArray.length</tt>
    */
   fill(
-    anArray: boolean,
+    anArray: boolean[],
     aFromIndex: number,
     aToIndex: number,
     aValue: boolean
@@ -630,7 +658,7 @@ export interface ArraysInstance {
    * @param anArray the array to be filled
    * @param aValue the value to be stored in all elements of the array
    */
-  fill(anArray: number, aValue: number): void;
+  fill(anArray: number[], aValue: number): void;
 
   /**
    * Assigns the specified double value to each element of the specified range of the specified array of doubles.
@@ -642,7 +670,7 @@ export interface ArraysInstance {
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aToIndex &gt; anArray.length</tt>
    */
   fill(
-    anArray: number,
+    anArray: number[],
     aFromIndex: number,
     aToIndex: number,
     aValue: number
@@ -653,7 +681,7 @@ export interface ArraysInstance {
    * @param anArray the array to be filled
    * @param aValue the value to be stored in all elements of the array
    */
-  fill(anArray: number, aValue: number): void;
+  fill(anArray: number[], aValue: number): void;
 
   /**
    * Assigns the specified float value to each element of the specified range of the specified array of floats.
@@ -665,7 +693,7 @@ export interface ArraysInstance {
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aToIndex &gt; anArray.length</tt>
    */
   fill(
-    anArray: number,
+    anArray: number[],
     aFromIndex: number,
     aToIndex: number,
     aValue: number
@@ -675,9 +703,9 @@ export interface ArraysInstance {
    * Assigns the specified Object reference to each element of the specified array of Objects.
    * @param anArray the array to be filled
    * @param aValue the value to be stored in all elements of the array
-   * @throws ArrayStoreException if the specified value is not of a runtime type that can be stored in the specified array
+   * @throws ArrayStoreException if the specified value is not of a&#xA; runtime type that can be stored in the specified array
    */
-  fill(anArray: unknown, aValue: unknown): void;
+  fill(anArray: unknown[], aValue: unknown): void;
 
   /**
    * Assigns the specified Object reference to each element of the specified range of the specified array of Objects.
@@ -690,7 +718,7 @@ export interface ArraysInstance {
    * @throws ArrayStoreException if the specified value is not of a runtime type that can be stored in the specified array
    */
   fill(
-    anArray: unknown,
+    anArray: unknown[],
     aFromIndex: number,
     aToIndex: number,
     aValue: unknown
@@ -705,11 +733,11 @@ export interface ArraysInstance {
    * @throws NegativeArraySizeException if <tt>aNewLength</tt> is negative
    * @throws NullPointerException if <tt>anArray</tt> is null
    */
-  copyOf(anArray: unknown, aNewLength: number): unknown;
+  copyOf(anArray: unknown[], aNewLength: number): unknown;
 
   /**
    * Copies the specified array, truncating or padding with nulls (if necessary)
-   * so the copy has the specified length.
+   *  so the copy has the specified length.
    * @param <U> the class of the objects in the original array
    * @param <T> the class of the objects in the returned array
    * @param anArray the array to be copied
@@ -718,20 +746,20 @@ export interface ArraysInstance {
    * @return a copy of the original array, truncated or padded with nulls to obtain the specified length
    * @throws NegativeArraySizeException if <tt>aNewLength</tt> is negative
    * @throws NullPointerException if <tt>anArray</tt> is null
-   * @throws ArrayStoreException if an element copied from <tt>anArray</tt> is not of a runtime type that can be stored in an array of class <tt>aNewType</tt>
+   * @throws ArrayStoreException if an element copied from <tt>anArray</tt> is not of a runtime type that can be stored&#xA; in an array of class <tt>aNewType</tt>
    */
-  copyOf(anArray: unknown, aNewLength: number, aNewType: unknown): unknown;
+  copyOf(anArray: unknown[], aNewLength: number, aNewType: Class): unknown;
 
   /**
    * Copies the specified array, truncating or padding with zeros (if necessary)
-   * so the copy has the specified length.
+   *  so the copy has the specified length.
    * @param anArray the array to be copied
    * @param aNewLength the length of the copy to be returned
    * @return a copy of the original array, truncated or padded with zeros to obtain the specified length
    * @throws NegativeArraySizeException if <tt>aNewLength</tt> is negative
    * @throws NullPointerException if <tt>anArray</tt> is null
    */
-  copyOf(anArray: unknown, aNewLength: number): unknown;
+  copyOf(anArray: unknown[], aNewLength: number): unknown;
 
   /**
    * Copies the specified array, truncating or padding with zeros (if necessary) so the copy has the specified length.
@@ -741,7 +769,7 @@ export interface ArraysInstance {
    * @throws NegativeArraySizeException if <tt>aNewLength</tt> is negative
    * @throws NullPointerException if <tt>anArray</tt> is null
    */
-  copyOf(anArray: number, aNewLength: number): number;
+  copyOf(anArray: number[], aNewLength: number): number;
 
   /**
    * Copies the specified array, truncating or padding with zeros (if necessary) so the copy has the specified length.
@@ -751,7 +779,7 @@ export interface ArraysInstance {
    * @throws NegativeArraySizeException if <tt>aNewLength</tt> is negative
    * @throws NullPointerException if <tt>anArray</tt> is null
    */
-  copyOf(anArray: number, aNewLength: number): number;
+  copyOf(anArray: number[], aNewLength: number): number;
 
   /**
    * Copies the specified array, truncating or padding with zeros (if necessary) so the copy has the specified length.
@@ -761,7 +789,7 @@ export interface ArraysInstance {
    * @throws NegativeArraySizeException if <tt>aNewLength</tt> is negative
    * @throws NullPointerException if <tt>anArray</tt> is null
    */
-  copyOf(anArray: number, aNewLength: number): number;
+  copyOf(anArray: number[], aNewLength: number): number;
 
   /**
    * Copies the specified array, truncating or padding with null characters (if necessary) so the copy has the specified length.
@@ -771,7 +799,7 @@ export interface ArraysInstance {
    * @throws NegativeArraySizeException if <tt>aNewLength</tt> is negative
    * @throws NullPointerException if <tt>anArray</tt> is null
    */
-  copyOf(anArray: string, aNewLength: number): string;
+  copyOf(anArray: string[], aNewLength: number): string;
 
   /**
    * Copies the specified array, truncating or padding with zeros (if necessary) so the copy has the specified length.
@@ -781,7 +809,7 @@ export interface ArraysInstance {
    * @throws NegativeArraySizeException if <tt>aNewLength</tt> is negative
    * @throws NullPointerException if <tt>anArray</tt> is null
    */
-  copyOf(anArray: number, aNewLength: number): number;
+  copyOf(anArray: number[], aNewLength: number): number;
 
   /**
    * Copies the specified array, truncating or padding with zeros (if necessary) so the copy has the specified length.
@@ -791,7 +819,7 @@ export interface ArraysInstance {
    * @throws NegativeArraySizeException if <tt>aNewLength</tt> is negative
    * @throws NullPointerException if <tt>anArray</tt> is null
    */
-  copyOf(anArray: number, aNewLength: number): number;
+  copyOf(anArray: number[], aNewLength: number): number;
 
   /**
    * Copies the specified array, truncating or padding with <tt>false</tt> (if necessary) so the copy has the specified length.
@@ -801,7 +829,7 @@ export interface ArraysInstance {
    * @throws NegativeArraySizeException if <tt>aNewLength</tt> is negative
    * @throws NullPointerException if <tt>anArray</tt> is null
    */
-  copyOf(anArray: boolean, aNewLength: number): boolean;
+  copyOf(anArray: boolean[], aNewLength: number): boolean;
 
   /**
    * Copies the specified range of the specified array into a new array.
@@ -814,7 +842,11 @@ export interface ArraysInstance {
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
    * @throws NullPointerException if <tt>anArray</tt> is null
    */
-  copyOfRange(anArray: unknown, aFromIndex: number, aToIndex: number): unknown;
+  copyOfRange(
+    anArray: unknown[],
+    aFromIndex: number,
+    aToIndex: number
+  ): unknown;
 
   /**
    * Copies the specified range of the specified array into a new array.
@@ -828,13 +860,13 @@ export interface ArraysInstance {
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aFromIndex &gt; anArray.length()</tt>
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
    * @throws NullPointerException if <tt>anArray</tt> is null
-   * @throws ArrayStoreException if an element copied from <tt>anArray</tt> is not of a runtime type that can be stored in an array of class <tt>aNewType</tt>.
+   * @throws ArrayStoreException if an element copied from <tt>anArray</tt> is not of a runtime type that can be stored in&#xA; an array of class <tt>aNewType</tt>.
    */
   copyOfRange(
-    anArray: unknown,
+    anArray: unknown[],
     aFromIndex: number,
     aToIndex: number,
-    aNewType: unknown
+    aNewType: Class
   ): unknown;
 
   /**
@@ -847,7 +879,11 @@ export interface ArraysInstance {
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
    * @throws NullPointerException if <tt>anArray</tt> is null
    */
-  copyOfRange(anArray: unknown, aFromIndex: number, aToIndex: number): unknown;
+  copyOfRange(
+    anArray: unknown[],
+    aFromIndex: number,
+    aToIndex: number
+  ): unknown;
 
   /**
    * Copies the specified range of the specified array into a new array.
@@ -859,7 +895,7 @@ export interface ArraysInstance {
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
    * @throws NullPointerException if <tt>anArray</tt> is null
    */
-  copyOfRange(anArray: number, aFromIndex: number, aToIndex: number): number;
+  copyOfRange(anArray: number[], aFromIndex: number, aToIndex: number): number;
 
   /**
    * Copies the specified range of the specified array into a new array.
@@ -871,7 +907,7 @@ export interface ArraysInstance {
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
    * @throws NullPointerException if <tt>anArray</tt> is null
    */
-  copyOfRange(anArray: number, aFromIndex: number, aToIndex: number): number;
+  copyOfRange(anArray: number[], aFromIndex: number, aToIndex: number): number;
 
   /**
    * Copies the specified range of the specified array into a new array.
@@ -883,19 +919,19 @@ export interface ArraysInstance {
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
    * @throws NullPointerException if <tt>anArray</tt> is null
    */
-  copyOfRange(anArray: number, aFromIndex: number, aToIndex: number): number;
+  copyOfRange(anArray: number[], aFromIndex: number, aToIndex: number): number;
 
   /**
    * Copies the specified range of the specified array into a new array.
    * @param anArray the array from which a range is to be copied
    * @param aFromIndex the initial index of the range to be copied, inclusive
    * @param aToIndex the final index of the range to be copied, exclusive. (This index may lie outside the array.)
-   * @return a new array containing the specified range from the original array, truncated or padded with null characters to obtain the required length
+   * @return a new array containing the specified range from the original array, truncated or padded with null characters to obtain&#xA; the required length
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aFromIndex &gt; anArray.length()</tt>
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
    * @throws NullPointerException if <tt>anArray</tt> is null
    */
-  copyOfRange(anArray: string, aFromIndex: number, aToIndex: number): string;
+  copyOfRange(anArray: string[], aFromIndex: number, aToIndex: number): string;
 
   /**
    * Copies the specified range of the specified array into a new array.
@@ -907,7 +943,7 @@ export interface ArraysInstance {
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
    * @throws NullPointerException if <tt>anArray</tt> is null
    */
-  copyOfRange(anArray: number, aFromIndex: number, aToIndex: number): number;
+  copyOfRange(anArray: number[], aFromIndex: number, aToIndex: number): number;
 
   /**
    * Copies the specified range of the specified array into a new array.
@@ -919,19 +955,23 @@ export interface ArraysInstance {
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
    * @throws NullPointerException if <tt>anArray</tt> is null
    */
-  copyOfRange(anArray: number, aFromIndex: number, aToIndex: number): number;
+  copyOfRange(anArray: number[], aFromIndex: number, aToIndex: number): number;
 
   /**
    * Copies the specified range of the specified array into a new array.
    * @param anArray the array from which a range is to be copied
    * @param aFromIndex the initial index of the range to be copied, inclusive
    * @param aToIndex the final index of the range to be copied, exclusive. (This index may lie outside the array.)
-   * @return a new array containing the specified range from the original array, truncated or padded with false elements to obtain the required length
+   * @return a new array containing the specified range from the original array, truncated or padded with false elements to obtain&#xA; the required length
    * @throws ArrayIndexOutOfBoundsException if <tt>aFromIndex &lt; 0</tt> or <tt>aFromIndex &gt; anArray.length()</tt>
    * @throws IllegalArgumentException if <tt>aFromIndex &gt; aToIndex</tt>
    * @throws NullPointerException if <tt>anArray</tt> is null
    */
-  copyOfRange(anArray: boolean, aFromIndex: number, aToIndex: number): boolean;
+  copyOfRange(
+    anArray: boolean[],
+    aFromIndex: number,
+    aToIndex: number
+  ): boolean;
 
   /**
    * Returns a fixed-size list backed by the specified array.
@@ -939,77 +979,77 @@ export interface ArraysInstance {
    * @param anArray the array by which the list will be backed
    * @return a list view of the specified array
    */
-  asList(anArray: unknown): unknown;
+  asList(anArray: unknown[]): List;
 
   /**
    * Returns a hash code based on the contents of the specified array.
    * @param anArray the array whose hash value to compute
    * @return a content-based hash code for <tt>anArray</tt>
    */
-  hashCode(anArray: number): number;
+  hashCode(anArray: number[]): number;
 
   /**
    * Returns a hash code based on the contents of the specified array.
    * @param anArray the array whose hash value to compute
    * @return a content-based hash code for <tt>anArray</tt>
    */
-  hashCode(anArray: number): number;
+  hashCode(anArray: number[]): number;
 
   /**
    * Returns a hash code based on the contents of the specified array.
    * @param anArray the array whose hash value to compute
    * @return a content-based hash code for <tt>anArray</tt>
    */
-  hashCode(anArray: number): number;
+  hashCode(anArray: number[]): number;
 
   /**
    * Returns a hash code based on the contents of the specified array.
    * @param anArray the array whose hash value to compute
    * @return a content-based hash code for <tt>anArray</tt>
    */
-  hashCode(anArray: string): number;
+  hashCode(anArray: string[]): number;
 
   /**
    * Returns a hash code based on the contents of the specified array.
    * @param anArray the array whose hash value to compute
    * @return a content-based hash code for <tt>anArray</tt>
    */
-  hashCode(anArray: unknown): number;
+  hashCode(anArray: unknown[]): number;
 
   /**
    * Returns a hash code based on the contents of the specified array.
    * @param anArray the array whose hash value to compute
    * @return a content-based hash code for <tt>anArray</tt>
    */
-  hashCode(anArray: boolean): number;
+  hashCode(anArray: boolean[]): number;
 
   /**
    * Returns a hash code based on the contents of the specified array.
    * @param anArray the array whose hash value to compute
    * @return a content-based hash code for <tt>anArray</tt>
    */
-  hashCode(anArray: number): number;
+  hashCode(anArray: number[]): number;
 
   /**
    * Returns a hash code based on the contents of the specified array.
    * @param anArray the array whose hash value to compute
    * @return a content-based hash code for <tt>anArray</tt>
    */
-  hashCode(anArray: number): number;
+  hashCode(anArray: number[]): number;
 
   /**
    * Returns a hash code based on the contents of the specified array.
    * @param anArray the array whose content-based hash code to compute
    * @return a content-based hash code for <tt>anArray</tt>
    */
-  hashCode(anArray: unknown): number;
+  hashCode(anArray: unknown[]): number;
 
   /**
    * Returns a hash code based on the "deep contents" of the specified array.
    * @param anArray the array whose deep-content-based hash code to compute
    * @return a deep-content-based hash code for <tt>anArray</tt>
    */
-  deepHashCode(anArray: unknown): number;
+  deepHashCode(anArray: unknown[]): number;
 
   /**
    * Returns <tt>true</tt> if the two specified arrays are <i>deeply equal</i> to one another.
@@ -1017,77 +1057,77 @@ export interface ArraysInstance {
    * @param anAnotherArray the other array to be tested for equality
    * @return <tt>true</tt> if the two arrays are equal
    */
-  deepEquals(anArray: unknown, anAnotherArray: unknown): boolean;
+  deepEquals(anArray: unknown[], anAnotherArray: unknown[]): boolean;
 
   /**
    * Returns a string representation of the contents of the specified array.
    * @param anArray the array whose string representation to return
    * @return a string representation of <tt>anArray</tt>
    */
-  toString(anArray: number): string;
+  toString(anArray: number[]): string;
 
   /**
    * Returns a string representation of the contents of the specified array.
    * @param anArray the array whose string representation to return
    * @return a string representation of <tt>anArray</tt>
    */
-  toString(anArray: number): string;
+  toString(anArray: number[]): string;
 
   /**
    * Returns a string representation of the contents of the specified array.
    * @param anArray the array whose string representation to return
    * @return a string representation of <tt>anArray</tt>
    */
-  toString(anArray: number): string;
+  toString(anArray: number[]): string;
 
   /**
    * Returns a string representation of the contents of the specified array.
    * @param anArray the array whose string representation to return
    * @return a string representation of <tt>anArray</tt>
    */
-  toString(anArray: string): string;
+  toString(anArray: string[]): string;
 
   /**
    * Returns a string representation of the contents of the specified array.
    * @param anArray the array whose string representation to return
    * @return a string representation of <tt>anArray</tt>
    */
-  toString(anArray: unknown): string;
+  toString(anArray: unknown[]): string;
 
   /**
    * Returns a string representation of the contents of the specified array.
    * @param anArray the array whose string representation to return
    * @return a string representation of <tt>anArray</tt>
    */
-  toString(anArray: boolean): string;
+  toString(anArray: boolean[]): string;
 
   /**
    * Returns a string representation of the contents of the specified array.
    * @param anArray the array whose string representation to return
    * @return a string representation of <tt>anArray</tt>
    */
-  toString(anArray: number): string;
+  toString(anArray: number[]): string;
 
   /**
    * Returns a string representation of the contents of the specified array.
    * @param anArray the array whose string representation to return
    * @return a string representation of <tt>anArray</tt>
    */
-  toString(anArray: number): string;
+  toString(anArray: number[]): string;
 
   /**
    * Returns a string representation of the contents of the specified array.
    * @param anArray the array whose string representation to return
    * @return a string representation of <tt>anArray</tt>
    */
-  toString(anArray: unknown): string;
+  toString(anArray: unknown[]): string;
 
   /**
    * Returns a string representation of the "deep contents" of the specified array.
    * @param anArray the array whose string representation to return
    * @return a string representation of <tt>anArray</tt>
    */
-  deepToString(anArray: unknown): string;
+  deepToString(anArray: unknown[]): string;
 
   /**
    * Sorts the specified array into ascending numerical order.
@@ -1095,7 +1135,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSort(a: unknown): void;
+  parallelSort(a: unknown[]): void;
 
   /**
    * Sorts the specified range of the array into ascending numerical order.
@@ -1107,7 +1147,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSort(a: unknown, fromIndex: number, toIndex: number): void;
+  parallelSort(a: unknown[], fromIndex: number, toIndex: number): void;
 
   /**
    * Sorts the specified array into ascending numerical order.
@@ -1115,7 +1155,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSort(a: string): void;
+  parallelSort(a: string[]): void;
 
   /**
    * Sorts the specified range of the array into ascending numerical order.
@@ -1127,7 +1167,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSort(a: string, fromIndex: number, toIndex: number): void;
+  parallelSort(a: string[], fromIndex: number, toIndex: number): void;
 
   /**
    * Sorts the specified array into ascending numerical order.
@@ -1135,7 +1175,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSort(a: number): void;
+  parallelSort(a: number[]): void;
 
   /**
    * Sorts the specified range of the array into ascending numerical order.
@@ -1147,7 +1187,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSort(a: number, fromIndex: number, toIndex: number): void;
+  parallelSort(a: number[], fromIndex: number, toIndex: number): void;
 
   /**
    * Sorts the specified array into ascending numerical order.
@@ -1155,7 +1195,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSort(a: number): void;
+  parallelSort(a: number[]): void;
 
   /**
    * Sorts the specified range of the array into ascending numerical order.
@@ -1167,7 +1207,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSort(a: number, fromIndex: number, toIndex: number): void;
+  parallelSort(a: number[], fromIndex: number, toIndex: number): void;
 
   /**
    * Sorts the specified array into ascending numerical order.
@@ -1175,7 +1215,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSort(a: number): void;
+  parallelSort(a: number[]): void;
 
   /**
    * Sorts the specified range of the array into ascending numerical order.
@@ -1187,7 +1227,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSort(a: number, fromIndex: number, toIndex: number): void;
+  parallelSort(a: number[], fromIndex: number, toIndex: number): void;
 
   /**
    * Sorts the specified array into ascending numerical order.
@@ -1195,7 +1235,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSort(a: number): void;
+  parallelSort(a: number[]): void;
 
   /**
    * Sorts the specified range of the array into ascending numerical order.
@@ -1207,7 +1247,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSort(a: number, fromIndex: number, toIndex: number): void;
+  parallelSort(a: number[], fromIndex: number, toIndex: number): void;
 
   /**
    * Sorts the specified array into ascending numerical order.
@@ -1215,7 +1255,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSort(a: number): void;
+  parallelSort(a: number[]): void;
 
   /**
    * Sorts the specified range of the array into ascending numerical order.
@@ -1227,68 +1267,68 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSort(a: number, fromIndex: number, toIndex: number): void;
+  parallelSort(a: number[], fromIndex: number, toIndex: number): void;
 
   /**
    * Sorts the specified array of objects into ascending order, according
-   * to the {@linkplain Comparable natural ordering} of its elements.
+   *  to the {@linkplain Comparable natural ordering} of its elements.
    * @param <T> the class of the objects to be sorted
    * @param a the array to be sorted
-   * @throws ClassCastException if the array contains elements that are not <i>mutually comparable</i> (for example, strings and integers)
-   * @throws IllegalArgumentException (optional) if the natural ordering of the array elements is found to violate the {@link Comparable} contract
+   * @throws ClassCastException if the array contains elements that are not&#xA; <i>mutually comparable</i> (for example, strings and integers)
+   * @throws IllegalArgumentException (optional) if the natural&#xA; ordering of the array elements is found to violate the&#xA; {@link Comparable} contract
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSort(a: unknown): void;
+  parallelSort(a: unknown[]): void;
 
   /**
    * Sorts the specified range of the specified array of objects into
-   * ascending order, according to the
-   * {@linkplain Comparable natural ordering} of its elements.
+   *  ascending order, according to the
+   *  {@linkplain Comparable natural ordering} of its elements.
    * @param <T> the class of the objects to be sorted
    * @param a the array to be sorted
    * @param fromIndex the index of the first element (inclusive) to be sorted
    * @param toIndex the index of the last element (exclusive) to be sorted
-   * @throws IllegalArgumentException if {@code fromIndex > toIndex} or (optional) if the natural ordering of the array elements is found to violate the {@link Comparable} contract
-   * @throws ArrayIndexOutOfBoundsException if {@code fromIndex < 0} or {@code toIndex > a.length}
-   * @throws ClassCastException if the array contains elements that are not <i>mutually comparable</i> (for example, strings and integers).
+   * @throws IllegalArgumentException if {@code fromIndex > toIndex} or&#xA; (optional) if the natural ordering of the array elements is&#xA; found to violate the {@link Comparable} contract
+   * @throws ArrayIndexOutOfBoundsException if {@code fromIndex < 0} or&#xA; {@code toIndex > a.length}
+   * @throws ClassCastException if the array contains elements that are&#xA; not <i>mutually comparable</i> (for example, strings and&#xA; integers).
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSort(a: unknown, fromIndex: number, toIndex: number): void;
+  parallelSort(a: unknown[], fromIndex: number, toIndex: number): void;
 
   /**
    * Sorts the specified array of objects according to the order induced by
-   * the specified comparator.
+   *  the specified comparator.
    * @param <T> the class of the objects to be sorted
    * @param a the array to be sorted
-   * @param cmp the comparator to determine the order of the array. A {@code null} value indicates that the elements' {@linkplain Comparable natural ordering} should be used.
-   * @throws ClassCastException if the array contains elements that are not <i>mutually comparable</i> using the specified comparator
-   * @throws IllegalArgumentException (optional) if the comparator is found to violate the {@link java.util.Comparator} contract
+   * @param cmp the comparator to determine the order of the array. A&#xA; {@code null} value indicates that the elements'&#xA; {@linkplain Comparable natural ordering} should be used.
+   * @throws ClassCastException if the array contains elements that are&#xA; not <i>mutually comparable</i> using the specified comparator
+   * @throws IllegalArgumentException (optional) if the comparator is&#xA; found to violate the {@link java.util.Comparator} contract
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSort(a: unknown, cmp: unknown): void;
+  parallelSort(a: unknown[], cmp: Comparator): void;
 
   /**
    * Sorts the specified range of the specified array of objects according
-   * to the order induced by the specified comparator.
+   *  to the order induced by the specified comparator.
    * @param <T> the class of the objects to be sorted
    * @param a the array to be sorted
-   * @param fromIndex the index of the first element (inclusive) to be sorted
+   * @param fromIndex the index of the first element (inclusive) to be&#xA; sorted
    * @param toIndex the index of the last element (exclusive) to be sorted
-   * @param cmp the comparator to determine the order of the array. A {@code null} value indicates that the elements' {@linkplain Comparable natural ordering} should be used.
-   * @throws IllegalArgumentException if {@code fromIndex > toIndex} or (optional) if the natural ordering of the array elements is found to violate the {@link Comparable} contract
+   * @param cmp the comparator to determine the order of the array. A&#xA; {@code null} value indicates that the elements'&#xA; {@linkplain Comparable natural ordering} should be used.
+   * @throws IllegalArgumentException if {@code fromIndex > toIndex} or&#xA; (optional) if the natural ordering of the array elements is&#xA; found to violate the {@link Comparable} contract
    * @throws ArrayIndexOutOfBoundsException if {@code fromIndex < 0} or {@code toIndex > a.length}
-   * @throws ClassCastException if the array contains elements that are not <i>mutually comparable</i> (for example, strings and integers).
+   * @throws ClassCastException if the array contains elements that are&#xA; not <i>mutually comparable</i> (for example, strings and integers).
    * @since Sitevision 4.0
    * @since Java 1.8
    */
   parallelSort(
-    a: unknown,
+    a: unknown[],
     fromIndex: number,
     toIndex: number,
-    cmp: unknown
+    cmp: Comparator
   ): void;
 
   /**
@@ -1300,7 +1340,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelPrefix(array: unknown, op: unknown): void;
+  parallelPrefix(array: unknown[], op: BinaryOperator): void;
 
   /**
    * Performs {@link #parallelPrefix(Object[], BinaryOperator)} for the given subrange of the array.
@@ -1308,7 +1348,7 @@ export interface ArraysInstance {
    * @param array the array
    * @param fromIndex the index of the first element, inclusive
    * @param toIndex the index of the last element, exclusive
-   * @param op a side-effect-free, associative function to perform the cumulation
+   * @param op a side-effect-free, associative function to perform the&#xA; cumulation
    * @throws IllegalArgumentException if {@code fromIndex > toIndex}
    * @throws ArrayIndexOutOfBoundsException if {@code fromIndex < 0} or {@code toIndex > array.length}
    * @throws NullPointerException if the specified array or function is null
@@ -1316,10 +1356,10 @@ export interface ArraysInstance {
    * @since Java 1.8
    */
   parallelPrefix(
-    array: unknown,
+    array: unknown[],
     fromIndex: number,
     toIndex: number,
-    op: unknown
+    op: BinaryOperator
   ): void;
 
   /**
@@ -1330,7 +1370,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelPrefix(array: number, op: unknown): void;
+  parallelPrefix(array: number[], op: LongBinaryOperator): void;
 
   /**
    * Performs {@link #parallelPrefix(long[], LongBinaryOperator)} for the given subrange of the array.
@@ -1345,10 +1385,10 @@ export interface ArraysInstance {
    * @since Java 1.8
    */
   parallelPrefix(
-    array: number,
+    array: number[],
     fromIndex: number,
     toIndex: number,
-    op: unknown
+    op: LongBinaryOperator
   ): void;
 
   /**
@@ -1359,7 +1399,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelPrefix(array: number, op: unknown): void;
+  parallelPrefix(array: number[], op: DoubleBinaryOperator): void;
 
   /**
    * Performs {@link #parallelPrefix(double[], DoubleBinaryOperator)} for the given subrange of the array.
@@ -1374,10 +1414,10 @@ export interface ArraysInstance {
    * @since Java 1.8
    */
   parallelPrefix(
-    array: number,
+    array: number[],
     fromIndex: number,
     toIndex: number,
-    op: unknown
+    op: DoubleBinaryOperator
   ): void;
 
   /**
@@ -1388,7 +1428,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelPrefix(array: number, op: unknown): void;
+  parallelPrefix(array: number[], op: IntBinaryOperator): void;
 
   /**
    * Performs {@link #parallelPrefix(int[], IntBinaryOperator)} for the given subrange of the array.
@@ -1403,10 +1443,10 @@ export interface ArraysInstance {
    * @since Java 1.8
    */
   parallelPrefix(
-    array: number,
+    array: number[],
     fromIndex: number,
     toIndex: number,
-    op: unknown
+    op: IntBinaryOperator
   ): void;
 
   /**
@@ -1418,7 +1458,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  setAll(array: unknown, generator: unknown): void;
+  setAll(array: unknown[], generator: IntFunction): void;
 
   /**
    * Set all elements of the specified array, in parallel, using the provided generator function to compute each element.
@@ -1429,7 +1469,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSetAll(array: unknown, generator: unknown): void;
+  parallelSetAll(array: unknown[], generator: IntFunction): void;
 
   /**
    * Set all elements of the specified array, using the provided generator function to compute each element.
@@ -1439,7 +1479,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  setAll(array: number, generator: unknown): void;
+  setAll(array: number[], generator: IntUnaryOperator): void;
 
   /**
    * Set all elements of the specified array, in parallel, using the provided generator function to compute each element.
@@ -1449,7 +1489,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSetAll(array: number, generator: unknown): void;
+  parallelSetAll(array: number[], generator: IntUnaryOperator): void;
 
   /**
    * Set all elements of the specified array, using the provided generator function to compute each element.
@@ -1459,7 +1499,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  setAll(array: number, generator: unknown): void;
+  setAll(array: number[], generator: IntToLongFunction): void;
 
   /**
    * Set all elements of the specified array, in parallel, using the provided generator function to compute each element.
@@ -1469,7 +1509,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSetAll(array: number, generator: unknown): void;
+  parallelSetAll(array: number[], generator: IntToLongFunction): void;
 
   /**
    * Set all elements of the specified array, using the provided generator function to compute each element.
@@ -1479,7 +1519,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  setAll(array: number, generator: unknown): void;
+  setAll(array: number[], generator: IntToDoubleFunction): void;
 
   /**
    * Set all elements of the specified array, in parallel, using the provided generator function to compute each element.
@@ -1489,7 +1529,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  parallelSetAll(array: number, generator: unknown): void;
+  parallelSetAll(array: number[], generator: IntToDoubleFunction): void;
 
   /**
    * Returns a Spliterator covering all of the specified array.
@@ -1499,7 +1539,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  spliterator(array: unknown): unknown;
+  spliterator(array: unknown[]): Spliterator;
 
   /**
    * Returns a {@link Spliterator} covering the specified range of the specified array.
@@ -1508,15 +1548,15 @@ export interface ArraysInstance {
    * @param startInclusive the first index to cover, inclusive
    * @param endExclusive index immediately past the last index to cover
    * @return a spliterator for the array elements
-   * @throws ArrayIndexOutOfBoundsException if {@code startInclusive} is negative, {@code endExclusive} is less than {@code startInclusive}, or {@code endExclusive} is greater than the array size
+   * @throws ArrayIndexOutOfBoundsException if {@code startInclusive} is&#xA; negative, {@code endExclusive} is less than&#xA; {@code startInclusive}, or {@code endExclusive} is greater than&#xA; the array size
    * @since Sitevision 4.0
    * @since Java 1.8
    */
   spliterator(
-    array: unknown,
+    array: unknown[],
     startInclusive: number,
     endExclusive: number
-  ): unknown;
+  ): Spliterator;
 
   /**
    * Returns a {@link Spliterator.OfInt} covering all of the specified array.
@@ -1525,7 +1565,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  spliterator(array: number): unknown;
+  spliterator(array: number[]): OfInt;
 
   /**
    * Returns a {@link Spliterator.OfInt} covering the specified range of the specified array.
@@ -1533,28 +1573,28 @@ export interface ArraysInstance {
    * @param startInclusive the first index to cover, inclusive
    * @param endExclusive index immediately past the last index to cover
    * @return a spliterator for the array elements
-   * @throws ArrayIndexOutOfBoundsException if {@code startInclusive} is negative, {@code endExclusive} is less than {@code startInclusive}, or {@code endExclusive} is greater than the array size
+   * @throws ArrayIndexOutOfBoundsException if {@code startInclusive} is&#xA; negative, {@code endExclusive} is less than&#xA; {@code startInclusive}, or {@code endExclusive} is greater than&#xA; the array size
    * @since Sitevision 4.0
    * @since Java 1.8
    */
   spliterator(
-    array: number,
+    array: number[],
     startInclusive: number,
     endExclusive: number
-  ): unknown;
+  ): OfInt;
 
   /**
    * Returns a {@link Spliterator.OfLong} covering all of the specified array.
    *
-   * <p>The spliterator reports {@link Spliterator#SIZED},
-   * {@link Spliterator#SUBSIZED}, {@link Spliterator#ORDERED}, and
-   * {@link Spliterator#IMMUTABLE}.
+   *  <p>The spliterator reports {@link Spliterator#SIZED},
+   *  {@link Spliterator#SUBSIZED}, {@link Spliterator#ORDERED}, and
+   *  {@link Spliterator#IMMUTABLE}.
    * @param array the array, assumed to be unmodified during use
    * @return the spliterator for the array elements
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  spliterator(array: number): unknown;
+  spliterator(array: number[]): OfLong;
 
   /**
    * Returns a {@link Spliterator.OfLong} covering the specified range of the specified array.
@@ -1562,15 +1602,15 @@ export interface ArraysInstance {
    * @param startInclusive the first index to cover, inclusive
    * @param endExclusive index immediately past the last index to cover
    * @return a spliterator for the array elements
-   * @throws ArrayIndexOutOfBoundsException if {@code startInclusive} is negative, {@code endExclusive} is less than {@code startInclusive}, or {@code endExclusive} is greater than the array size
+   * @throws ArrayIndexOutOfBoundsException if {@code startInclusive} is&#xA; negative, {@code endExclusive} is less than&#xA; {@code startInclusive}, or {@code endExclusive} is greater than&#xA; the array size
    * @since Sitevision 4.0
    * @since Java 1.8
    */
   spliterator(
-    array: number,
+    array: number[],
     startInclusive: number,
     endExclusive: number
-  ): unknown;
+  ): OfLong;
 
   /**
    * Returns a {@link Spliterator.OfDouble} covering all of the specified array.
@@ -1579,7 +1619,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  spliterator(array: number): unknown;
+  spliterator(array: number[]): OfDouble;
 
   /**
    * Returns a {@link Spliterator.OfDouble} covering the specified range of the specified array.
@@ -1587,15 +1627,15 @@ export interface ArraysInstance {
    * @param startInclusive the first index to cover, inclusive
    * @param endExclusive index immediately past the last index to cover
    * @return a spliterator for the array elements
-   * @throws ArrayIndexOutOfBoundsException if {@code startInclusive} is negative, {@code endExclusive} is less than {@code startInclusive}, or {@code endExclusive} is greater than the array size
+   * @throws ArrayIndexOutOfBoundsException if {@code startInclusive} is&#xA; negative, {@code endExclusive} is less than&#xA; {@code startInclusive}, or {@code endExclusive} is greater than&#xA; the array size
    * @since Sitevision 4.0
    * @since Java 1.8
    */
   spliterator(
-    array: number,
+    array: number[],
     startInclusive: number,
     endExclusive: number
-  ): unknown;
+  ): OfDouble;
 
   /**
    * Returns a sequential {@link Stream} with the specified array as its source.
@@ -1605,7 +1645,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  stream(array: unknown): unknown;
+  stream(array: unknown[]): Stream;
 
   /**
    * Returns a sequential {@link Stream} with the specified range of the specified array as its source.
@@ -1614,11 +1654,15 @@ export interface ArraysInstance {
    * @param startInclusive the first index to cover, inclusive
    * @param endExclusive index immediately past the last index to cover
    * @return a {@code Stream} for the array range
-   * @throws ArrayIndexOutOfBoundsException if {@code startInclusive} is negative, {@code endExclusive} is less than {@code startInclusive}, or {@code endExclusive} is greater than the array size
+   * @throws ArrayIndexOutOfBoundsException if {@code startInclusive} is&#xA; negative, {@code endExclusive} is less than&#xA; {@code startInclusive}, or {@code endExclusive} is greater than&#xA; the array size
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  stream(array: unknown, startInclusive: number, endExclusive: number): unknown;
+  stream(
+    array: unknown[],
+    startInclusive: number,
+    endExclusive: number
+  ): Stream;
 
   /**
    * Returns a sequential {@link IntStream} with the specified array as its source.
@@ -1627,7 +1671,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  stream(array: number): unknown;
+  stream(array: number[]): IntStream;
 
   /**
    * Returns a sequential {@link IntStream} with the specified range of the specified array as its source.
@@ -1635,11 +1679,15 @@ export interface ArraysInstance {
    * @param startInclusive the first index to cover, inclusive
    * @param endExclusive index immediately past the last index to cover
    * @return an {@code IntStream} for the array range
-   * @throws ArrayIndexOutOfBoundsException if {@code startInclusive} is negative, {@code endExclusive} is less than {@code startInclusive}, or {@code endExclusive} is greater than the array size
+   * @throws ArrayIndexOutOfBoundsException if {@code startInclusive} is&#xA; negative, {@code endExclusive} is less than&#xA; {@code startInclusive}, or {@code endExclusive} is greater than&#xA; the array size
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  stream(array: number, startInclusive: number, endExclusive: number): unknown;
+  stream(
+    array: number[],
+    startInclusive: number,
+    endExclusive: number
+  ): IntStream;
 
   /**
    * Returns a sequential {@link LongStream} with the specified array as its source.
@@ -1648,7 +1696,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  stream(array: number): unknown;
+  stream(array: number[]): LongStream;
 
   /**
    * Returns a sequential {@link LongStream} with the specified range of the specified array as its source.
@@ -1656,11 +1704,15 @@ export interface ArraysInstance {
    * @param startInclusive the first index to cover, inclusive
    * @param endExclusive index immediately past the last index to cover
    * @return a {@code LongStream} for the array range
-   * @throws ArrayIndexOutOfBoundsException if {@code startInclusive} is negative, {@code endExclusive} is less than {@code startInclusive}, or {@code endExclusive} is greater than the array size
+   * @throws ArrayIndexOutOfBoundsException if {@code startInclusive} is&#xA; negative, {@code endExclusive} is less than&#xA; {@code startInclusive}, or {@code endExclusive} is greater than&#xA; the array size
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  stream(array: number, startInclusive: number, endExclusive: number): unknown;
+  stream(
+    array: number[],
+    startInclusive: number,
+    endExclusive: number
+  ): LongStream;
 
   /**
    * Returns a sequential {@link DoubleStream} with the specified array as its source.
@@ -1669,7 +1721,7 @@ export interface ArraysInstance {
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  stream(array: number): unknown;
+  stream(array: number[]): DoubleStream;
 
   /**
    * Returns a sequential {@link DoubleStream} with the specified range of the specified array as its source.
@@ -1677,11 +1729,15 @@ export interface ArraysInstance {
    * @param startInclusive the first index to cover, inclusive
    * @param endExclusive index immediately past the last index to cover
    * @return a {@code DoubleStream} for the array range
-   * @throws ArrayIndexOutOfBoundsException if {@code startInclusive} is negative, {@code endExclusive} is less than {@code startInclusive}, or {@code endExclusive} is greater than the array size
+   * @throws ArrayIndexOutOfBoundsException if {@code startInclusive} is&#xA; negative, {@code endExclusive} is less than&#xA; {@code startInclusive}, or {@code endExclusive} is greater than&#xA; the array size
    * @since Sitevision 4.0
    * @since Java 1.8
    */
-  stream(array: number, startInclusive: number, endExclusive: number): unknown;
+  stream(
+    array: number[],
+    startInclusive: number,
+    endExclusive: number
+  ): DoubleStream;
 }
 
 declare namespace ArraysInstance {}