java.util

Class Arrays


public class Arrays
extends Object

This class contains various methods for manipulating arrays (such as sorting and searching). This class also contains a static factory that allows arrays to be viewed as lists.

The methods in this class all throw a NullPointerException if the specified array reference is null, except where noted.

The documentation for the methods contained in this class includes briefs description of the implementations. Such descriptions should be regarded as implementation notes, rather than parts of the specification. Implementors should feel free to substitute other algorithms, so long as the specification itself is adhered to. (For example, the algorithm used by sort(Object[]) does not have to be a mergesort, but it does have to be stable.)

This class is a member of the ../../../guide/collections/index.html"> Java Collections Framework.

Since:
1.2
See Also:
Comparable, Comparator

Method Summary

static
List asList(T... a)
Returns a fixed-size list backed by the specified array.
static int
binarySearch(byte[] a, byte key)
Searches the specified array of bytes for the specified value using the binary search algorithm.
static int
binarySearch(char[] a, char key)
Searches the specified array of chars for the specified value using the binary search algorithm.
static int
binarySearch(double[] a, double key)
Searches the specified array of doubles for the specified value using the binary search algorithm.
static int
binarySearch(float[] a, float key)
Searches the specified array of floats for the specified value using the binary search algorithm.
static int
binarySearch(int[] a, int key)
Searches the specified array of ints for the specified value using the binary search algorithm.
static int
binarySearch(Object[] a, Object key)
Searches the specified array for the specified object using the binary search algorithm.
static int
binarySearch(long[] a, long key)
Searches the specified array of longs for the specified value using the binary search algorithm.
static int
binarySearch(short[] a, short key)
Searches the specified array of shorts for the specified value using the binary search algorithm.
static boolean
deepEquals(Object[] a1, Object[] a2)
Returns true if the two specified arrays are deeply equal to one another.
static int
deepHashCode(a[] )
Returns a hash code based on the "deep contents" of the specified array.
static String
deepToString(Object[] a)
Returns a string representation of the "deep contents" of the specified array.
static boolean
equals(boolean[] a, boolean[] a2)
Returns true if the two specified arrays of booleans are equal to one another.
static boolean
equals(byte[] a, byte[] a2)
Returns true if the two specified arrays of bytes are equal to one another.
static boolean
equals(char[] a, char[] a2)
Returns true if the two specified arrays of chars are equal to one another.
static boolean
equals(double[] a, double[] a2)
Returns true if the two specified arrays of doubles are equal to one another.
static boolean
equals(float[] a, float[] a2)
Returns true if the two specified arrays of floats are equal to one another.
static boolean
equals(int[] a, int[] a2)
Returns true if the two specified arrays of ints are equal to one another.
static boolean
equals(Object[] a, Object[] a2)
Returns true if the two specified arrays of Objects are equal to one another.
static boolean
equals(long[] a, long[] a2)
Returns true if the two specified arrays of longs are equal to one another.
static boolean
equals(short[] a, a2[] )
Returns true if the two specified arrays of shorts are equal to one another.
static void
fill(boolean[] a, boolean val)
Assigns the specified boolean value to each element of the specified array of booleans.
static void
fill(boolean[] a, int fromIndex, int toIndex, boolean val)
Assigns the specified boolean value to each element of the specified range of the specified array of booleans.
static void
fill(byte[] a, byte val)
Assigns the specified byte value to each element of the specified array of bytes.
static void
fill(byte[] a, int fromIndex, int toIndex, byte val)
Assigns the specified byte value to each element of the specified range of the specified array of bytes.
static void
fill(char[] a, char val)
Assigns the specified char value to each element of the specified array of chars.
static void
fill(char[] a, int fromIndex, int toIndex, char val)
Assigns the specified char value to each element of the specified range of the specified array of chars.
static void
fill(double[] a, double val)
Assigns the specified double value to each element of the specified array of doubles.
static void
fill(double[] a, int fromIndex, int toIndex, double val)
Assigns the specified double value to each element of the specified range of the specified array of doubles.
static void
fill(float[] a, float val)
Assigns the specified float value to each element of the specified array of floats.
static void
fill(float[] a, int fromIndex, int toIndex, float val)
Assigns the specified float value to each element of the specified range of the specified array of floats.
static void
fill(int[] a, int val)
Assigns the specified int value to each element of the specified array of ints.
static void
fill(int[] a, int fromIndex, int toIndex, int val)
Assigns the specified int value to each element of the specified range of the specified array of ints.
static void
fill(Object[] a, int fromIndex, int toIndex, Object val)
Assigns the specified Object reference to each element of the specified range of the specified array of Objects.
static void
fill(Object[] a, Object val)
Assigns the specified Object reference to each element of the specified array of Objects.
static void
fill(long[] a, int fromIndex, int toIndex, long val)
Assigns the specified long value to each element of the specified range of the specified array of longs.
static void
fill(long[] a, long val)
Assigns the specified long value to each element of the specified array of longs.
static void
fill(short[] a, int fromIndex, int toIndex, short val)
Assigns the specified short value to each element of the specified range of the specified array of shorts.
static void
fill(short[] a, short val)
Assigns the specified short value to each element of the specified array of shorts.
static int
hashCode(a[] )
Returns a hash code based on the contents of the specified array.
static int
hashCode(a[] )
Returns a hash code based on the contents of the specified array.
static int
hashCode(a[] )
Returns a hash code based on the contents of the specified array.
static int
hashCode(a[] )
Returns a hash code based on the contents of the specified array.
static int
hashCode(a[] )
Returns a hash code based on the contents of the specified array.
static int
hashCode(a[] )
Returns a hash code based on the contents of the specified array.
static int
hashCode(a[] )
Returns a hash code based on the contents of the specified array.
static int
hashCode(a[] )
Returns a hash code based on the contents of the specified array.
static int
hashCode(a[] )
Returns a hash code based on the contents of the specified array.
static
int binarySearch(T[] a, T key, T> c)
Searches the specified array for the specified object using the binary search algorithm.
static void
sort(byte[] a)
Sorts the specified array of bytes into ascending numerical order.
static void
sort(byte[] a, int fromIndex, int toIndex)
Sorts the specified range of the specified array of bytes into ascending numerical order.
static void
sort(char[] a)
Sorts the specified array of chars into ascending numerical order.
static void
sort(char[] a, int fromIndex, int toIndex)
Sorts the specified range of the specified array of chars into ascending numerical order.
static void
sort(double[] a)
Sorts the specified array of doubles into ascending numerical order.
static void
sort(double[] a, int fromIndex, int toIndex)
Sorts the specified range of the specified array of doubles into ascending numerical order.
static void
sort(float[] a)
Sorts the specified array of floats into ascending numerical order.
static void
sort(float[] a, int fromIndex, int toIndex)
Sorts the specified range of the specified array of floats into ascending numerical order.
static void
sort(int[] a)
Sorts the specified array of ints into ascending numerical order.
static void
sort(int[] a, int fromIndex, int toIndex)
Sorts the specified range of the specified array of ints into ascending numerical order.
static void
sort(Object[] a)
Sorts the specified array of objects into ascending order, according to the natural ordering of its elements.
static void
sort(Object[] a, int fromIndex, int toIndex)
Sorts the specified range of the specified array of objects into ascending order, according to the natural ordering of its elements.
static void
sort(long[] a)
Sorts the specified array of longs into ascending numerical order.
static void
sort(long[] a, int fromIndex, int toIndex)
Sorts the specified range of the specified array of longs into ascending numerical order.
static void
sort(short[] a)
Sorts the specified array of shorts into ascending numerical order.
static void
sort(short[] a, int fromIndex, int toIndex)
Sorts the specified range of the specified array of shorts into ascending numerical order.
static String
toString(boolean[] a)
Returns a string representation of the contents of the specified array.
static String
toString(byte[] a)
Returns a string representation of the contents of the specified array.
static String
toString(char[] a)
Returns a string representation of the contents of the specified array.
static String
toString(double[] a)
Returns a string representation of the contents of the specified array.
static String
toString(float[] a)
Returns a string representation of the contents of the specified array.
static String
toString(int[] a)
Returns a string representation of the contents of the specified array.
static String
toString(Object[] a)
Returns a string representation of the contents of the specified array.
static String
toString(long[] a)
Returns a string representation of the contents of the specified array.
static String
toString(short[] a)
Returns a string representation of the contents of the specified array.
static
void sort(T[] a, T> c)
Sorts the specified array of objects according to the order induced by the specified comparator.
static
void sort(T[] a, int fromIndex, int toIndex, T> c)
Sorts the specified range of the specified array of objects according to the order induced by the specified comparator.

Methods inherited from class java.lang.Object

clone, equals, extends Object> getClass, finalize, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Details

List asList

public static  List asList(T... a)
Returns a fixed-size list backed by the specified array. (Changes to the returned list "write through" to the array.) This method acts as bridge between array-based and collection-based APIs, in combination with Collection.toArray. The returned list is serializable and implements RandomAccess.

This method also provides a convenient way to create a fixed-size list initialized to contain several elements:

     List stooges = Arrays.asList("Larry", "Moe", "Curly");
 
Parameters:
a - the array by which the list will be backed.
Returns:
a list view of the specified array.

binarySearch

public static int binarySearch(byte[] a,
                               byte key)
Searches the specified array of bytes for the specified value using the binary search algorithm. The array must be sorted (as by the sort method, above) prior to making this call. If it is not sorted, the results are undefined. If the array contains multiple elements with the specified value, there is no guarantee which one will be found.
Parameters:
a - the array to be searched.
key - the value to be searched for.
Returns:
index of the search key, if it is contained in the list; otherwise, (-(insertion point) - 1). The insertion point is defined as the point at which the key would be inserted into the list: the index of the first element greater than the key, or list.size(), if all elements in the list are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.
See Also:
sort(byte[])
Usages and Demos :

View More Examples of binarySearch(byte[] a,byte key)
   1: 
   2: import java.util.Arrays;
   3: import org.eclipse.core.runtime.Platform;
   4:         ...
   5:             INVALID_RESOURCE_CHARACTERS = new char[] {'\\', '/', ':', '*', '?', '"', '<', '>', '|'};
   6:             Arrays.sort(INVALID_RESOURCE_NAMES);
   7:         } else {
   8:         ...
   9:         }
  10:         return Arrays.binarySearch(INVALID_RESOURCE_NAMES, name.toLowerCase()) < 0;
  11:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:         int iscErrorCode = ex.getFbErrorCode();
   6:         return Arrays.binarySearch(FATAL_ERRORS, iscErrorCode) != -1;
   7:     }
   8:         ...
   9:     static {
  10:         Arrays.sort(FATAL_ERRORS); 
  11:     }

View Full Code Here
   1:     } else {
   2:       System.out.println("PASSED: [Arrays] All " + passed + " tests.");
   3:     }
   4:         ...
   5:     boolean[] a3 = new boolean[] {true, false, false, true, true, false, true};
   6:     passfail("boolean equals", !Arrays.equals(a1, a2) && Arrays.equals(a1, a3));
   7:         ...
   8:     Arrays.fill(a1, false);
   9:     boolean filled = true;
  10:         ...
  11:     passfail("byte sort", sorted);
  12:     passfail("byte search", Arrays.binarySearch(a2, (byte)1) == 4 &&

View Full Code Here
   1: import java.util.ArrayList;
   2: import java.util.Arrays;
   3: import java.util.Collections;
   4:         ...
   5:     private boolean isAcceptableEntry(ProjectEntry entry) {
   6:         return Arrays.binarySearch(ACCEPTABLE_TYPES, entry.getType()) >= 0;
   7:     }
   8: 
   9:     public boolean isFeatureReadOnly() {

View Full Code Here
   1: 
   2: public class Arrays {
   3: 
   4:         ...
   5:     private Arrays() {}
   6: 
   7:         ...
   8:     public static void sort(long[] a) {
   9:         java.util.Arrays.sort(a);
  10:     }
  11:         ...
  12:     public static int binarySearch(long[] a, long key) {
  13:         return java.util.Arrays.binarySearch(a, key);

View Full Code Here

binarySearch

public static int binarySearch(char[] a,
                               char key)
Searches the specified array of chars for the specified value using the binary search algorithm. The array must be sorted (as by the sort method, above) prior to making this call. If it is not sorted, the results are undefined. If the array contains multiple elements with the specified value, there is no guarantee which one will be found.
Parameters:
a - the array to be searched.
key - the value to be searched for.
Returns:
index of the search key, if it is contained in the list; otherwise, (-(insertion point) - 1). The insertion point is defined as the point at which the key would be inserted into the list: the index of the first element greater than the key, or list.size(), if all elements in the list are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.
See Also:
sort(char[])
Usages and Demos :

View More Examples of binarySearch(char[] a,char key)
   1: 
   2: import java.util.Arrays;
   3: import org.eclipse.core.runtime.Platform;
   4:         ...
   5:             INVALID_RESOURCE_CHARACTERS = new char[] {'\\', '/', ':', '*', '?', '"', '<', '>', '|'};
   6:             Arrays.sort(INVALID_RESOURCE_NAMES);
   7:         } else {
   8:         ...
   9:         }
  10:         return Arrays.binarySearch(INVALID_RESOURCE_NAMES, name.toLowerCase()) < 0;
  11:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:         int iscErrorCode = ex.getFbErrorCode();
   6:         return Arrays.binarySearch(FATAL_ERRORS, iscErrorCode) != -1;
   7:     }
   8:         ...
   9:     static {
  10:         Arrays.sort(FATAL_ERRORS); 
  11:     }

View Full Code Here
   1:     } else {
   2:       System.out.println("PASSED: [Arrays] All " + passed + " tests.");
   3:     }
   4:         ...
   5:     boolean[] a3 = new boolean[] {true, false, false, true, true, false, true};
   6:     passfail("boolean equals", !Arrays.equals(a1, a2) && Arrays.equals(a1, a3));
   7:         ...
   8:     Arrays.fill(a1, false);
   9:     boolean filled = true;
  10:         ...
  11:     passfail("byte sort", sorted);
  12:     passfail("byte search", Arrays.binarySearch(a2, (byte)1) == 4 &&

View Full Code Here
   1: import java.util.ArrayList;
   2: import java.util.Arrays;
   3: import java.util.Collections;
   4:         ...
   5:     private boolean isAcceptableEntry(ProjectEntry entry) {
   6:         return Arrays.binarySearch(ACCEPTABLE_TYPES, entry.getType()) >= 0;
   7:     }
   8: 
   9:     public boolean isFeatureReadOnly() {

View Full Code Here
   1: 
   2: public class Arrays {
   3: 
   4:         ...
   5:     private Arrays() {}
   6: 
   7:         ...
   8:     public static void sort(long[] a) {
   9:         java.util.Arrays.sort(a);
  10:     }
  11:         ...
  12:     public static int binarySearch(long[] a, long key) {
  13:         return java.util.Arrays.binarySearch(a, key);

View Full Code Here

binarySearch

public static int binarySearch(double[] a,
                               double key)
Searches the specified array of doubles for the specified value using the binary search algorithm. The array must be sorted (as by the sort method, above) prior to making this call. If it is not sorted, the results are undefined. If the array contains multiple elements with the specified value, there is no guarantee which one will be found. This method considers all NaN values to be equivalent and equal.
Parameters:
a - the array to be searched.
key - the value to be searched for.
Returns:
index of the search key, if it is contained in the list; otherwise, (-(insertion point) - 1). The insertion point is defined as the point at which the key would be inserted into the list: the index of the first element greater than the key, or list.size(), if all elements in the list are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.
Usages and Demos :

View More Examples of binarySearch(double[] a,double key)
   1: 
   2: import java.util.Arrays;
   3: import org.eclipse.core.runtime.Platform;
   4:         ...
   5:             INVALID_RESOURCE_CHARACTERS = new char[] {'\\', '/', ':', '*', '?', '"', '<', '>', '|'};
   6:             Arrays.sort(INVALID_RESOURCE_NAMES);
   7:         } else {
   8:         ...
   9:         }
  10:         return Arrays.binarySearch(INVALID_RESOURCE_NAMES, name.toLowerCase()) < 0;
  11:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:         int iscErrorCode = ex.getFbErrorCode();
   6:         return Arrays.binarySearch(FATAL_ERRORS, iscErrorCode) != -1;
   7:     }
   8:         ...
   9:     static {
  10:         Arrays.sort(FATAL_ERRORS); 
  11:     }

View Full Code Here
   1:     } else {
   2:       System.out.println("PASSED: [Arrays] All " + passed + " tests.");
   3:     }
   4:         ...
   5:     boolean[] a3 = new boolean[] {true, false, false, true, true, false, true};
   6:     passfail("boolean equals", !Arrays.equals(a1, a2) && Arrays.equals(a1, a3));
   7:         ...
   8:     Arrays.fill(a1, false);
   9:     boolean filled = true;
  10:         ...
  11:     passfail("byte sort", sorted);
  12:     passfail("byte search", Arrays.binarySearch(a2, (byte)1) == 4 &&

View Full Code Here
   1: import java.util.ArrayList;
   2: import java.util.Arrays;
   3: import java.util.Collections;
   4:         ...
   5:     private boolean isAcceptableEntry(ProjectEntry entry) {
   6:         return Arrays.binarySearch(ACCEPTABLE_TYPES, entry.getType()) >= 0;
   7:     }
   8: 
   9:     public boolean isFeatureReadOnly() {

View Full Code Here
   1: 
   2: public class Arrays {
   3: 
   4:         ...
   5:     private Arrays() {}
   6: 
   7:         ...
   8:     public static void sort(long[] a) {
   9:         java.util.Arrays.sort(a);
  10:     }
  11:         ...
  12:     public static int binarySearch(long[] a, long key) {
  13:         return java.util.Arrays.binarySearch(a, key);

View Full Code Here

binarySearch

public static int binarySearch(float[] a,
                               float key)
Searches the specified array of floats for the specified value using the binary search algorithm. The array must be sorted (as by the sort method, above) prior to making this call. If it is not sorted, the results are undefined. If the array contains multiple elements with the specified value, there is no guarantee which one will be found. This method considers all NaN values to be equivalent and equal.
Parameters:
a - the array to be searched.
key - the value to be searched for.
Returns:
index of the search key, if it is contained in the list; otherwise, (-(insertion point) - 1). The insertion point is defined as the point at which the key would be inserted into the list: the index of the first element greater than the key, or list.size(), if all elements in the list are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.
See Also:
sort(float[])
Usages and Demos :

View More Examples of binarySearch(float[] a,float key)
   1: 
   2: import java.util.Arrays;
   3: import org.eclipse.core.runtime.Platform;
   4:         ...
   5:             INVALID_RESOURCE_CHARACTERS = new char[] {'\\', '/', ':', '*', '?', '"', '<', '>', '|'};
   6:             Arrays.sort(INVALID_RESOURCE_NAMES);
   7:         } else {
   8:         ...
   9:         }
  10:         return Arrays.binarySearch(INVALID_RESOURCE_NAMES, name.toLowerCase()) < 0;
  11:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:         int iscErrorCode = ex.getFbErrorCode();
   6:         return Arrays.binarySearch(FATAL_ERRORS, iscErrorCode) != -1;
   7:     }
   8:         ...
   9:     static {
  10:         Arrays.sort(FATAL_ERRORS); 
  11:     }

View Full Code Here
   1:     } else {
   2:       System.out.println("PASSED: [Arrays] All " + passed + " tests.");
   3:     }
   4:         ...
   5:     boolean[] a3 = new boolean[] {true, false, false, true, true, false, true};
   6:     passfail("boolean equals", !Arrays.equals(a1, a2) && Arrays.equals(a1, a3));
   7:         ...
   8:     Arrays.fill(a1, false);
   9:     boolean filled = true;
  10:         ...
  11:     passfail("byte sort", sorted);
  12:     passfail("byte search", Arrays.binarySearch(a2, (byte)1) == 4 &&

View Full Code Here
   1: import java.util.ArrayList;
   2: import java.util.Arrays;
   3: import java.util.Collections;
   4:         ...
   5:     private boolean isAcceptableEntry(ProjectEntry entry) {
   6:         return Arrays.binarySearch(ACCEPTABLE_TYPES, entry.getType()) >= 0;
   7:     }
   8: 
   9:     public boolean isFeatureReadOnly() {

View Full Code Here
   1: 
   2: public class Arrays {
   3: 
   4:         ...
   5:     private Arrays() {}
   6: 
   7:         ...
   8:     public static void sort(long[] a) {
   9:         java.util.Arrays.sort(a);
  10:     }
  11:         ...
  12:     public static int binarySearch(long[] a, long key) {
  13:         return java.util.Arrays.binarySearch(a, key);

View Full Code Here

binarySearch

public static int binarySearch(int[] a,
                               int key)
Searches the specified array of ints for the specified value using the binary search algorithm. The array must be sorted (as by the sort method, above) prior to making this call. If it is not sorted, the results are undefined. If the array contains multiple elements with the specified value, there is no guarantee which one will be found.
Parameters:
a - the array to be searched.
key - the value to be searched for.
Returns:
index of the search key, if it is contained in the list; otherwise, (-(insertion point) - 1). The insertion point is defined as the point at which the key would be inserted into the list: the index of the first element greater than the key, or list.size(), if all elements in the list are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.
See Also:
sort(int[])
Usages and Demos :

View More Examples of binarySearch(int[] a,int key)
   1: 
   2: import java.util.Arrays;
   3: import org.eclipse.core.runtime.Platform;
   4:         ...
   5:             INVALID_RESOURCE_CHARACTERS = new char[] {'\\', '/', ':', '*', '?', '"', '<', '>', '|'};
   6:             Arrays.sort(INVALID_RESOURCE_NAMES);
   7:         } else {
   8:         ...
   9:         }
  10:         return Arrays.binarySearch(INVALID_RESOURCE_NAMES, name.toLowerCase()) < 0;
  11:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:         int iscErrorCode = ex.getFbErrorCode();
   6:         return Arrays.binarySearch(FATAL_ERRORS, iscErrorCode) != -1;
   7:     }
   8:         ...
   9:     static {
  10:         Arrays.sort(FATAL_ERRORS); 
  11:     }

View Full Code Here
   1:     } else {
   2:       System.out.println("PASSED: [Arrays] All " + passed + " tests.");
   3:     }
   4:         ...
   5:     boolean[] a3 = new boolean[] {true, false, false, true, true, false, true};
   6:     passfail("boolean equals", !Arrays.equals(a1, a2) && Arrays.equals(a1, a3));
   7:         ...
   8:     Arrays.fill(a1, false);
   9:     boolean filled = true;
  10:         ...
  11:     passfail("byte sort", sorted);
  12:     passfail("byte search", Arrays.binarySearch(a2, (byte)1) == 4 &&

View Full Code Here
   1: import java.util.ArrayList;
   2: import java.util.Arrays;
   3: import java.util.Collections;
   4:         ...
   5:     private boolean isAcceptableEntry(ProjectEntry entry) {
   6:         return Arrays.binarySearch(ACCEPTABLE_TYPES, entry.getType()) >= 0;
   7:     }
   8: 
   9:     public boolean isFeatureReadOnly() {

View Full Code Here
   1: 
   2: public class Arrays {
   3: 
   4:         ...
   5:     private Arrays() {}
   6: 
   7:         ...
   8:     public static void sort(long[] a) {
   9:         java.util.Arrays.sort(a);
  10:     }
  11:         ...
  12:     public static int binarySearch(long[] a, long key) {
  13:         return java.util.Arrays.binarySearch(a, key);

View Full Code Here

binarySearch

public static int binarySearch(Object[] a,
                               Object key)
Searches the specified array for the specified object using the binary search algorithm. The array must be sorted into ascending order according to the natural ordering of its elements (as by Sort(Object[]), above) prior to making this call. If it is not sorted, the results are undefined. (If the array contains elements that are not mutually comparable (for example,strings and integers), it cannot be sorted according to the natural order of its elements, hence results are undefined.) If the array contains multiple elements equal to the specified object, there is no guarantee which one will be found.
Parameters:
a - the array to be searched.
key - the value to be searched for.
Returns:
index of the search key, if it is contained in the list; otherwise, (-(insertion point) - 1). The insertion point is defined as the point at which the key would be inserted into the list: the index of the first element greater than the key, or list.size(), if all elements in the list are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.
Throws:
ClassCastException - if the search key in not comparable to the elements of the array.
Usages and Demos :

View More Examples of binarySearch(Object[] a,Object key)
   1: 
   2: import java.util.Arrays;
   3: import org.eclipse.core.runtime.Platform;
   4:         ...
   5:             INVALID_RESOURCE_CHARACTERS = new char[] {'\\', '/', ':', '*', '?', '"', '<', '>', '|'};
   6:             Arrays.sort(INVALID_RESOURCE_NAMES);
   7:         } else {
   8:         ...
   9:         }
  10:         return Arrays.binarySearch(INVALID_RESOURCE_NAMES, name.toLowerCase()) < 0;
  11:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:         int iscErrorCode = ex.getFbErrorCode();
   6:         return Arrays.binarySearch(FATAL_ERRORS, iscErrorCode) != -1;
   7:     }
   8:         ...
   9:     static {
  10:         Arrays.sort(FATAL_ERRORS); 
  11:     }

View Full Code Here
   1:     } else {
   2:       System.out.println("PASSED: [Arrays] All " + passed + " tests.");
   3:     }
   4:         ...
   5:     boolean[] a3 = new boolean[] {true, false, false, true, true, false, true};
   6:     passfail("boolean equals", !Arrays.equals(a1, a2) && Arrays.equals(a1, a3));
   7:         ...
   8:     Arrays.fill(a1, false);
   9:     boolean filled = true;
  10:         ...
  11:     passfail("byte sort", sorted);
  12:     passfail("byte search", Arrays.binarySearch(a2, (byte)1) == 4 &&

View Full Code Here
   1: import java.util.ArrayList;
   2: import java.util.Arrays;
   3: import java.util.Collections;
   4:         ...
   5:     private boolean isAcceptableEntry(ProjectEntry entry) {
   6:         return Arrays.binarySearch(ACCEPTABLE_TYPES, entry.getType()) >= 0;
   7:     }
   8: 
   9:     public boolean isFeatureReadOnly() {

View Full Code Here
   1: 
   2: public class Arrays {
   3: 
   4:         ...
   5:     private Arrays() {}
   6: 
   7:         ...
   8:     public static void sort(long[] a) {
   9:         java.util.Arrays.sort(a);
  10:     }
  11:         ...
  12:     public static int binarySearch(long[] a, long key) {
  13:         return java.util.Arrays.binarySearch(a, key);

View Full Code Here

binarySearch

public static int binarySearch(long[] a,
                               long key)
Searches the specified array of longs for the specified value using the binary search algorithm. The array must be sorted (as by the sort method, above) prior to making this call. If it is not sorted, the results are undefined. If the array contains multiple elements with the specified value, there is no guarantee which one will be found.
Parameters:
a - the array to be searched.
key - the value to be searched for.
Returns:
index of the search key, if it is contained in the list; otherwise, (-(insertion point) - 1). The insertion point is defined as the point at which the key would be inserted into the list: the index of the first element greater than the key, or list.size(), if all elements in the list are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.
See Also:
sort(long[])
Usages and Demos :

View More Examples of binarySearch(long[] a,long key)
   1: 
   2: import java.util.Arrays;
   3: import org.eclipse.core.runtime.Platform;
   4:         ...
   5:             INVALID_RESOURCE_CHARACTERS = new char[] {'\\', '/', ':', '*', '?', '"', '<', '>', '|'};
   6:             Arrays.sort(INVALID_RESOURCE_NAMES);
   7:         } else {
   8:         ...
   9:         }
  10:         return Arrays.binarySearch(INVALID_RESOURCE_NAMES, name.toLowerCase()) < 0;
  11:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:         int iscErrorCode = ex.getFbErrorCode();
   6:         return Arrays.binarySearch(FATAL_ERRORS, iscErrorCode) != -1;
   7:     }
   8:         ...
   9:     static {
  10:         Arrays.sort(FATAL_ERRORS); 
  11:     }

View Full Code Here
   1:     } else {
   2:       System.out.println("PASSED: [Arrays] All " + passed + " tests.");
   3:     }
   4:         ...
   5:     boolean[] a3 = new boolean[] {true, false, false, true, true, false, true};
   6:     passfail("boolean equals", !Arrays.equals(a1, a2) && Arrays.equals(a1, a3));
   7:         ...
   8:     Arrays.fill(a1, false);
   9:     boolean filled = true;
  10:         ...
  11:     passfail("byte sort", sorted);
  12:     passfail("byte search", Arrays.binarySearch(a2, (byte)1) == 4 &&

View Full Code Here
   1: import java.util.ArrayList;
   2: import java.util.Arrays;
   3: import java.util.Collections;
   4:         ...
   5:     private boolean isAcceptableEntry(ProjectEntry entry) {
   6:         return Arrays.binarySearch(ACCEPTABLE_TYPES, entry.getType()) >= 0;
   7:     }
   8: 
   9:     public boolean isFeatureReadOnly() {

View Full Code Here
   1: 
   2: public class Arrays {
   3: 
   4:         ...
   5:     private Arrays() {}
   6: 
   7:         ...
   8:     public static void sort(long[] a) {
   9:         java.util.Arrays.sort(a);
  10:     }
  11:         ...
  12:     public static int binarySearch(long[] a, long key) {
  13:         return java.util.Arrays.binarySearch(a, key);

View Full Code Here

binarySearch

public static int binarySearch(short[] a,
                               short key)
Searches the specified array of shorts for the specified value using the binary search algorithm. The array must be sorted (as by the sort method, above) prior to making this call. If it is not sorted, the results are undefined. If the array contains multiple elements with the specified value, there is no guarantee which one will be found.
Parameters:
a - the array to be searched.
key - the value to be searched for.
Returns:
index of the search key, if it is contained in the list; otherwise, (-(insertion point) - 1). The insertion point is defined as the point at which the key would be inserted into the list: the index of the first element greater than the key, or list.size(), if all elements in the list are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.
See Also:
sort(short[])
Usages and Demos :

View More Examples of binarySearch(short[] a,short key)
   1: 
   2: import java.util.Arrays;
   3: import org.eclipse.core.runtime.Platform;
   4:         ...
   5:             INVALID_RESOURCE_CHARACTERS = new char[] {'\\', '/', ':', '*', '?', '"', '<', '>', '|'};
   6:             Arrays.sort(INVALID_RESOURCE_NAMES);
   7:         } else {
   8:         ...
   9:         }
  10:         return Arrays.binarySearch(INVALID_RESOURCE_NAMES, name.toLowerCase()) < 0;
  11:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:         int iscErrorCode = ex.getFbErrorCode();
   6:         return Arrays.binarySearch(FATAL_ERRORS, iscErrorCode) != -1;
   7:     }
   8:         ...
   9:     static {
  10:         Arrays.sort(FATAL_ERRORS); 
  11:     }

View Full Code Here
   1:     } else {
   2:       System.out.println("PASSED: [Arrays] All " + passed + " tests.");
   3:     }
   4:         ...
   5:     boolean[] a3 = new boolean[] {true, false, false, true, true, false, true};
   6:     passfail("boolean equals", !Arrays.equals(a1, a2) && Arrays.equals(a1, a3));
   7:         ...
   8:     Arrays.fill(a1, false);
   9:     boolean filled = true;
  10:         ...
  11:     passfail("byte sort", sorted);
  12:     passfail("byte search", Arrays.binarySearch(a2, (byte)1) == 4 &&

View Full Code Here
   1: import java.util.ArrayList;
   2: import java.util.Arrays;
   3: import java.util.Collections;
   4:         ...
   5:     private boolean isAcceptableEntry(ProjectEntry entry) {
   6:         return Arrays.binarySearch(ACCEPTABLE_TYPES, entry.getType()) >= 0;
   7:     }
   8: 
   9:     public boolean isFeatureReadOnly() {

View Full Code Here
   1: 
   2: public class Arrays {
   3: 
   4:         ...
   5:     private Arrays() {}
   6: 
   7:         ...
   8:     public static void sort(long[] a) {
   9:         java.util.Arrays.sort(a);
  10:     }
  11:         ...
  12:     public static int binarySearch(long[] a, long key) {
  13:         return java.util.Arrays.binarySearch(a, key);

View Full Code Here

deepEquals

public static boolean deepEquals(Object[] a1,
                                 Object[] a2)
Returns true if the two specified arrays are deeply equal to one another. Unlike the @link{#equals{Object[],Object[]) method, this method is appropriate for use with nested arrays of arbitrary depth.

Two array references are considered deeply equal if both are null, or if they refer to arrays that contain the same number of elements and all corresponding pairs of elements in the two arrays are deeply equal.

Two possibly null elements e1 and e2 are deeply equal if any of the following conditions hold:

  • e1 and e2 are both arrays of object reference types, and Arrays.deepEquals(e1, e2) would return true
  • e1 and e2 are arrays of the same primitive type, and the appropriate overloading of Arrays.equals(e1, e2) would return true.
  • e1 == e2
  • e1.equals(e2) would return true.
Note that this definition permits null elements at any depth.

If either of the specified arrays contain themselves as elements either directly or indirectly through one or more levels of arrays, the behavior of this method is undefined.

Parameters:
a1 - one array to be tested for equality
a2 - the other array to be tested for equality
Returns:
true if the two arrays are equal
Since:
1.5

deepHashCode

public static int deepHashCode(a[] )
Returns a hash code based on the "deep contents" of the specified array. If the array contains other arrays as elements, the hash code is based on their contents and so on, ad infinitum. It is therefore unacceptable to invoke this method on an array that contains itself as an element, either directly or indirectly through one or more levels of arrays. The behavior of such an invocation is undefined.

For any two arrays a and b such that Arrays.deepEquals(a, b), it is also the case that Arrays.deepHashCode(a) == Arrays.deepHashCode(b).

The computation of the value returned by this method is similar to that of the value returned by List.hashCode() on a list containing the same elements as a in the same order, with one difference: If an element e of a is itself an array, its hash code is computed not by calling e.hashCode(), but as by calling the appropriate overloading of Arrays.hashCode(e) if e is an array of a primitive type, or as by calling Arrays.deepHashCode(e) recursively if e is an array of a reference type. If a is null, this method returns 0.

Parameters:
Returns:
a deep-content-based hash code for a
Since:
1.5
See Also:
hashCode(Object[])

deepToString

public static String deepToString(Object[] a)
Returns a string representation of the "deep contents" of the specified array. If the array contains other arrays as elements, the string representation contains their contents and so on. This method is designed for converting multidimensional arrays to strings.

The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(Object), unless they are themselves arrays.

If an element e is an array of a primitive type, it is converted to a string as by invoking the appropriate overloading of Arrays.toString(e). If an element e is an array of a reference type, it is converted to a string as by invoking this method recursively.

To avoid infinite recursion, if the specified array contains itself as an element, or contains an indirect reference to itself through one or more levels of arrays, the self-reference is converted to the string "[...]". For example, an array containing only a reference to itself would be rendered as "[[...]]".

This method returns "null" if the specified array is null.

Parameters:
a - the array whose string representation to return
Returns:
a string representation of a
Since:
1.5

equals

public static boolean equals(boolean[] a,
                             boolean[] a2)
Returns true if the two specified arrays of booleans are equal to one another. Two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. In other words, two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.

Parameters:
a - one array to be tested for equality.
a2 - the other array to be tested for equality.
Returns:
true if the two arrays are equal.
Usages and Demos :

View More Examples of equals(boolean[] a,boolean[] a2)
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:                 _port==other._port &&
   6:                 Arrays.equals(_clientGUID, other._clientGUID) );
   7:     }
   8: 
   9:     public int hashCode() {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:             SavedArgumentBindings savedArgumentBindings = (SavedArgumentBindings)obj;
   6:             return Arrays.equals(_functionArguments, savedArgumentBindings._functionArguments)
   7:         ...
   8:                 && Arrays.equals(_values, savedArgumentBindings._values);
   9:         }

View Full Code Here
   1: import java.io.IOException;
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:     {
   6:         return Arrays.equals(DATA_FORMAT_ID_, dataformatid) &&
   7:         ...
   8:                Arrays.equals(DATA_FORMAT_VERSION_, dataformatversion);
   9:     }

View Full Code Here
   1: import java.security.InvalidKeyException;
   2: import java.util.Arrays;
   3: import java.util.HashMap;
   4:         ...
   5:       {
   6:         Arrays.fill(Lu, (byte) 0);
   7:         if (Lu.length != blockSize)
   8:         ...
   9:       {
  10:         Arrays.fill(Lu2, (byte) 0);
  11:         if (Lu2.length != blockSize)
  12:         ...
  13:       return false;
  14:     return Arrays.equals(DIGEST0, digest);

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: import java.util.logging.Logger;
   4:         ...
   5:       }
   6:     return Arrays.equals(H, H0);
   7:   }
   8: 
   9:   private byte[] MGF(byte[] Z, int l)

View Full Code Here

equals

public static boolean equals(byte[] a,
                             byte[] a2)
Returns true if the two specified arrays of bytes are equal to one another. Two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. In other words, two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.

Parameters:
a - one array to be tested for equality.
a2 - the other array to be tested for equality.
Returns:
true if the two arrays are equal.
Usages and Demos :

View More Examples of equals(byte[] a,byte[] a2)
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:                 _port==other._port &&
   6:                 Arrays.equals(_clientGUID, other._clientGUID) );
   7:     }
   8: 
   9:     public int hashCode() {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:             SavedArgumentBindings savedArgumentBindings = (SavedArgumentBindings)obj;
   6:             return Arrays.equals(_functionArguments, savedArgumentBindings._functionArguments)
   7:         ...
   8:                 && Arrays.equals(_values, savedArgumentBindings._values);
   9:         }

View Full Code Here
   1: import java.io.IOException;
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:     {
   6:         return Arrays.equals(DATA_FORMAT_ID_, dataformatid) &&
   7:         ...
   8:                Arrays.equals(DATA_FORMAT_VERSION_, dataformatversion);
   9:     }

View Full Code Here
   1: import java.security.InvalidKeyException;
   2: import java.util.Arrays;
   3: import java.util.HashMap;
   4:         ...
   5:       {
   6:         Arrays.fill(Lu, (byte) 0);
   7:         if (Lu.length != blockSize)
   8:         ...
   9:       {
  10:         Arrays.fill(Lu2, (byte) 0);
  11:         if (Lu2.length != blockSize)
  12:         ...
  13:       return false;
  14:     return Arrays.equals(DIGEST0, digest);

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: import java.util.logging.Logger;
   4:         ...
   5:       }
   6:     return Arrays.equals(H, H0);
   7:   }
   8: 
   9:   private byte[] MGF(byte[] Z, int l)

View Full Code Here

equals

public static boolean equals(char[] a,
                             char[] a2)
Returns true if the two specified arrays of chars are equal to one another. Two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. In other words, two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.

Parameters:
a - one array to be tested for equality.
a2 - the other array to be tested for equality.
Returns:
true if the two arrays are equal.
Usages and Demos :

View More Examples of equals(char[] a,char[] a2)
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:                 _port==other._port &&
   6:                 Arrays.equals(_clientGUID, other._clientGUID) );
   7:     }
   8: 
   9:     public int hashCode() {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:             SavedArgumentBindings savedArgumentBindings = (SavedArgumentBindings)obj;
   6:             return Arrays.equals(_functionArguments, savedArgumentBindings._functionArguments)
   7:         ...
   8:                 && Arrays.equals(_values, savedArgumentBindings._values);
   9:         }

View Full Code Here
   1: import java.io.IOException;
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:     {
   6:         return Arrays.equals(DATA_FORMAT_ID_, dataformatid) &&
   7:         ...
   8:                Arrays.equals(DATA_FORMAT_VERSION_, dataformatversion);
   9:     }

View Full Code Here
   1: import java.security.InvalidKeyException;
   2: import java.util.Arrays;
   3: import java.util.HashMap;
   4:         ...
   5:       {
   6:         Arrays.fill(Lu, (byte) 0);
   7:         if (Lu.length != blockSize)
   8:         ...
   9:       {
  10:         Arrays.fill(Lu2, (byte) 0);
  11:         if (Lu2.length != blockSize)
  12:         ...
  13:       return false;
  14:     return Arrays.equals(DIGEST0, digest);

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: import java.util.logging.Logger;
   4:         ...
   5:       }
   6:     return Arrays.equals(H, H0);
   7:   }
   8: 
   9:   private byte[] MGF(byte[] Z, int l)

View Full Code Here

equals

public static boolean equals(double[] a,
                             double[] a2)
Returns true if the two specified arrays of doubles are equal to one another. Two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. In other words, two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.

Two doubles d1 and d2 are considered equal if:

    new Double(d1).equals(new Double(d2))
(Unlike the == operator, this method considers NaN equals to itself, and 0.0d unequal to -0.0d.)
Parameters:
a - one array to be tested for equality.
a2 - the other array to be tested for equality.
Returns:
true if the two arrays are equal.
Usages and Demos :

View More Examples of equals(double[] a,double[] a2)
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:                 _port==other._port &&
   6:                 Arrays.equals(_clientGUID, other._clientGUID) );
   7:     }
   8: 
   9:     public int hashCode() {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:             SavedArgumentBindings savedArgumentBindings = (SavedArgumentBindings)obj;
   6:             return Arrays.equals(_functionArguments, savedArgumentBindings._functionArguments)
   7:         ...
   8:                 && Arrays.equals(_values, savedArgumentBindings._values);
   9:         }

View Full Code Here
   1: import java.io.IOException;
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:     {
   6:         return Arrays.equals(DATA_FORMAT_ID_, dataformatid) &&
   7:         ...
   8:                Arrays.equals(DATA_FORMAT_VERSION_, dataformatversion);
   9:     }

View Full Code Here
   1: import java.security.InvalidKeyException;
   2: import java.util.Arrays;
   3: import java.util.HashMap;
   4:         ...
   5:       {
   6:         Arrays.fill(Lu, (byte) 0);
   7:         if (Lu.length != blockSize)
   8:         ...
   9:       {
  10:         Arrays.fill(Lu2, (byte) 0);
  11:         if (Lu2.length != blockSize)
  12:         ...
  13:       return false;
  14:     return Arrays.equals(DIGEST0, digest);

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: import java.util.logging.Logger;
   4:         ...
   5:       }
   6:     return Arrays.equals(H, H0);
   7:   }
   8: 
   9:   private byte[] MGF(byte[] Z, int l)

View Full Code Here

equals

public static boolean equals(float[] a,
                             float[] a2)
Returns true if the two specified arrays of floats are equal to one another. Two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. In other words, two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.

Two floats f1 and f2 are considered equal if:

    new Float(f1).equals(new Float(f2))
(Unlike the == operator, this method considers NaN equals to itself, and 0.0f unequal to -0.0f.)
Parameters:
a - one array to be tested for equality.
a2 - the other array to be tested for equality.
Returns:
true if the two arrays are equal.
Usages and Demos :

View More Examples of equals(float[] a,float[] a2)
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:                 _port==other._port &&
   6:                 Arrays.equals(_clientGUID, other._clientGUID) );
   7:     }
   8: 
   9:     public int hashCode() {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:             SavedArgumentBindings savedArgumentBindings = (SavedArgumentBindings)obj;
   6:             return Arrays.equals(_functionArguments, savedArgumentBindings._functionArguments)
   7:         ...
   8:                 && Arrays.equals(_values, savedArgumentBindings._values);
   9:         }

View Full Code Here
   1: import java.io.IOException;
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:     {
   6:         return Arrays.equals(DATA_FORMAT_ID_, dataformatid) &&
   7:         ...
   8:                Arrays.equals(DATA_FORMAT_VERSION_, dataformatversion);
   9:     }

View Full Code Here
   1: import java.security.InvalidKeyException;
   2: import java.util.Arrays;
   3: import java.util.HashMap;
   4:         ...
   5:       {
   6:         Arrays.fill(Lu, (byte) 0);
   7:         if (Lu.length != blockSize)
   8:         ...
   9:       {
  10:         Arrays.fill(Lu2, (byte) 0);
  11:         if (Lu2.length != blockSize)
  12:         ...
  13:       return false;
  14:     return Arrays.equals(DIGEST0, digest);

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: import java.util.logging.Logger;
   4:         ...
   5:       }
   6:     return Arrays.equals(H, H0);
   7:   }
   8: 
   9:   private byte[] MGF(byte[] Z, int l)

View Full Code Here

equals

public static boolean equals(int[] a,
                             int[] a2)
Returns true if the two specified arrays of ints are equal to one another. Two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. In other words, two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.

Parameters:
a - one array to be tested for equality.
a2 - the other array to be tested for equality.
Returns:
true if the two arrays are equal.
Usages and Demos :

View More Examples of equals(int[] a,int[] a2)
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:                 _port==other._port &&
   6:                 Arrays.equals(_clientGUID, other._clientGUID) );
   7:     }
   8: 
   9:     public int hashCode() {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:             SavedArgumentBindings savedArgumentBindings = (SavedArgumentBindings)obj;
   6:             return Arrays.equals(_functionArguments, savedArgumentBindings._functionArguments)
   7:         ...
   8:                 && Arrays.equals(_values, savedArgumentBindings._values);
   9:         }

View Full Code Here
   1: import java.io.IOException;
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:     {
   6:         return Arrays.equals(DATA_FORMAT_ID_, dataformatid) &&
   7:         ...
   8:                Arrays.equals(DATA_FORMAT_VERSION_, dataformatversion);
   9:     }

View Full Code Here
   1: import java.security.InvalidKeyException;
   2: import java.util.Arrays;
   3: import java.util.HashMap;
   4:         ...
   5:       {
   6:         Arrays.fill(Lu, (byte) 0);
   7:         if (Lu.length != blockSize)
   8:         ...
   9:       {
  10:         Arrays.fill(Lu2, (byte) 0);
  11:         if (Lu2.length != blockSize)
  12:         ...
  13:       return false;
  14:     return Arrays.equals(DIGEST0, digest);

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: import java.util.logging.Logger;
   4:         ...
   5:       }
   6:     return Arrays.equals(H, H0);
   7:   }
   8: 
   9:   private byte[] MGF(byte[] Z, int l)

View Full Code Here

equals

public static boolean equals(Object[] a,
                             Object[] a2)
Returns true if the two specified arrays of Objects are equal to one another. The two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. Two objects e1 and e2 are considered equal if (e1==null ? e2==null : e1.equals(e2)). In other words, the two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.

Parameters:
a - one array to be tested for equality.
a2 - the other array to be tested for equality.
Returns:
true if the two arrays are equal.
Usages and Demos :

View More Examples of equals(Object[] a,Object[] a2)
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:                 _port==other._port &&
   6:                 Arrays.equals(_clientGUID, other._clientGUID) );
   7:     }
   8: 
   9:     public int hashCode() {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:             SavedArgumentBindings savedArgumentBindings = (SavedArgumentBindings)obj;
   6:             return Arrays.equals(_functionArguments, savedArgumentBindings._functionArguments)
   7:         ...
   8:                 && Arrays.equals(_values, savedArgumentBindings._values);
   9:         }

View Full Code Here
   1: import java.io.IOException;
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:     {
   6:         return Arrays.equals(DATA_FORMAT_ID_, dataformatid) &&
   7:         ...
   8:                Arrays.equals(DATA_FORMAT_VERSION_, dataformatversion);
   9:     }

View Full Code Here
   1: import java.security.InvalidKeyException;
   2: import java.util.Arrays;
   3: import java.util.HashMap;
   4:         ...
   5:       {
   6:         Arrays.fill(Lu, (byte) 0);
   7:         if (Lu.length != blockSize)
   8:         ...
   9:       {
  10:         Arrays.fill(Lu2, (byte) 0);
  11:         if (Lu2.length != blockSize)
  12:         ...
  13:       return false;
  14:     return Arrays.equals(DIGEST0, digest);

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: import java.util.logging.Logger;
   4:         ...
   5:       }
   6:     return Arrays.equals(H, H0);
   7:   }
   8: 
   9:   private byte[] MGF(byte[] Z, int l)

View Full Code Here

equals

public static boolean equals(long[] a,
                             long[] a2)
Returns true if the two specified arrays of longs are equal to one another. Two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. In other words, two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.

Parameters:
a - one array to be tested for equality.
a2 - the other array to be tested for equality.
Returns:
true if the two arrays are equal.
Usages and Demos :

View More Examples of equals(long[] a,long[] a2)
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:                 _port==other._port &&
   6:                 Arrays.equals(_clientGUID, other._clientGUID) );
   7:     }
   8: 
   9:     public int hashCode() {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:             SavedArgumentBindings savedArgumentBindings = (SavedArgumentBindings)obj;
   6:             return Arrays.equals(_functionArguments, savedArgumentBindings._functionArguments)
   7:         ...
   8:                 && Arrays.equals(_values, savedArgumentBindings._values);
   9:         }

View Full Code Here
   1: import java.io.IOException;
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:     {
   6:         return Arrays.equals(DATA_FORMAT_ID_, dataformatid) &&
   7:         ...
   8:                Arrays.equals(DATA_FORMAT_VERSION_, dataformatversion);
   9:     }

View Full Code Here
   1: import java.security.InvalidKeyException;
   2: import java.util.Arrays;
   3: import java.util.HashMap;
   4:         ...
   5:       {
   6:         Arrays.fill(Lu, (byte) 0);
   7:         if (Lu.length != blockSize)
   8:         ...
   9:       {
  10:         Arrays.fill(Lu2, (byte) 0);
  11:         if (Lu2.length != blockSize)
  12:         ...
  13:       return false;
  14:     return Arrays.equals(DIGEST0, digest);

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: import java.util.logging.Logger;
   4:         ...
   5:       }
   6:     return Arrays.equals(H, H0);
   7:   }
   8: 
   9:   private byte[] MGF(byte[] Z, int l)

View Full Code Here

equals

public static boolean equals(short[] a,
                             a2[] )
Returns true if the two specified arrays of shorts are equal to one another. Two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. In other words, two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.

Parameters:
a - one array to be tested for equality.
Returns:
true if the two arrays are equal.
Usages and Demos :

View More Examples of equals(short[] a,a2[] )
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:                 _port==other._port &&
   6:                 Arrays.equals(_clientGUID, other._clientGUID) );
   7:     }
   8: 
   9:     public int hashCode() {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:             SavedArgumentBindings savedArgumentBindings = (SavedArgumentBindings)obj;
   6:             return Arrays.equals(_functionArguments, savedArgumentBindings._functionArguments)
   7:         ...
   8:                 && Arrays.equals(_values, savedArgumentBindings._values);
   9:         }

View Full Code Here
   1: import java.io.IOException;
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:     {
   6:         return Arrays.equals(DATA_FORMAT_ID_, dataformatid) &&
   7:         ...
   8:                Arrays.equals(DATA_FORMAT_VERSION_, dataformatversion);
   9:     }

View Full Code Here
   1: import java.security.InvalidKeyException;
   2: import java.util.Arrays;
   3: import java.util.HashMap;
   4:         ...
   5:       {
   6:         Arrays.fill(Lu, (byte) 0);
   7:         if (Lu.length != blockSize)
   8:         ...
   9:       {
  10:         Arrays.fill(Lu2, (byte) 0);
  11:         if (Lu2.length != blockSize)
  12:         ...
  13:       return false;
  14:     return Arrays.equals(DIGEST0, digest);

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: import java.util.logging.Logger;
   4:         ...
   5:       }
   6:     return Arrays.equals(H, H0);
   7:   }
   8: 
   9:   private byte[] MGF(byte[] Z, int l)

View Full Code Here

fill

public static void fill(boolean[] a,
                        boolean val)
Assigns the specified boolean value to each element of the specified array of booleans.
Parameters:
a - the array to be filled.
val - the value to be stored in all elements of the array.
Usages and Demos :

View More Examples of fill(boolean[] a,boolean val)
   1:     if(FuLib.jdk()>=1.2)
   2:       Arrays.fill(LIST,SOFT);
   3:   }
   4: 
   5:   private static final Object createReference(Object _o)

View Full Code Here
   1:         fact = AssociationFactory.getInstance();
   2:         Arrays.fill(EXT_NEG_INFO, (byte)0xee);
   3:     }
   4:     
   5:     protected void check(AAssociateRQAC rqac) {

View Full Code Here
   1:     protected void setUp() throws Exception {
   2:         Arrays.fill(CMD, (byte)0xcc);
   3:         ...
   4:         Arrays.fill(DATA, (byte)0xdd);
   5:         fact = AssociationFactory.getInstance();
   6:     }
   7:         

View Full Code Here
   1: import java.security.InvalidKeyException;
   2: import java.util.Arrays;
   3: import java.util.HashMap;
   4:         ...
   5:       {
   6:         Arrays.fill(Lu, (byte) 0);
   7:         if (Lu.length != blockSize)
   8:         ...
   9:       {
  10:         Arrays.fill(Lu2, (byte) 0);
  11:         if (Lu2.length != blockSize)
  12:         ...
  13:       {
  14:         Arrays.fill(M, (byte) 0);

View Full Code Here
   1:   static {
   2:     Arrays.fill(HMAC_IPAD, HMAC_IPAD_BYTE);
   3:         ...
   4:     Arrays.fill(HMAC_OPAD, HMAC_OPAD_BYTE);
   5:   }
   6: 

View Full Code Here

fill

public static void fill(boolean[] a,
                        int fromIndex,
                        int toIndex,
                        boolean val)
Assigns the specified boolean value to each element of the specified range of the specified array of booleans. The range to be filled extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be filled is empty.)
Parameters:
a - the array to be filled.
fromIndex - the index of the first element (inclusive) to be filled with the specified value.
toIndex - the index of the last element (exclusive) to be filled with the specified value.
val - the value to be stored in all elements of the array.
Throws:
IllegalArgumentException - if fromIndex > toIndex
ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length
Usages and Demos :

View More Examples of fill(boolean[] a,int fromIndex,int toIndex,boolean val)
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:         makeRoom(Index, Count);
   6:         Arrays.fill(Array, Index, Index + Count, null);
   7:         
   8:         fixMatchCacheIndices(Index + Count);
   9:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here

fill

public static void fill(byte[] a,
                        byte val)
Assigns the specified byte value to each element of the specified array of bytes.
Parameters:
a - the array to be filled.
val - the value to be stored in all elements of the array.
Usages and Demos :

View More Examples of fill(byte[] a,byte val)
   1:     if(FuLib.jdk()>=1.2)
   2:       Arrays.fill(LIST,SOFT);
   3:   }
   4: 
   5:   private static final Object createReference(Object _o)

View Full Code Here
   1:         fact = AssociationFactory.getInstance();
   2:         Arrays.fill(EXT_NEG_INFO, (byte)0xee);
   3:     }
   4:     
   5:     protected void check(AAssociateRQAC rqac) {

View Full Code Here
   1:     protected void setUp() throws Exception {
   2:         Arrays.fill(CMD, (byte)0xcc);
   3:         ...
   4:         Arrays.fill(DATA, (byte)0xdd);
   5:         fact = AssociationFactory.getInstance();
   6:     }
   7:         

View Full Code Here
   1: import java.security.InvalidKeyException;
   2: import java.util.Arrays;
   3: import java.util.HashMap;
   4:         ...
   5:       {
   6:         Arrays.fill(Lu, (byte) 0);
   7:         if (Lu.length != blockSize)
   8:         ...
   9:       {
  10:         Arrays.fill(Lu2, (byte) 0);
  11:         if (Lu2.length != blockSize)
  12:         ...
  13:       {
  14:         Arrays.fill(M, (byte) 0);

View Full Code Here
   1:   static {
   2:     Arrays.fill(HMAC_IPAD, HMAC_IPAD_BYTE);
   3:         ...
   4:     Arrays.fill(HMAC_OPAD, HMAC_OPAD_BYTE);
   5:   }
   6: 

View Full Code Here

fill

public static void fill(byte[] a,
                        int fromIndex,
                        int toIndex,
                        byte val)
Assigns the specified byte value to each element of the specified range of the specified array of bytes. The range to be filled extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be filled is empty.)
Parameters:
a - the array to be filled.
fromIndex - the index of the first element (inclusive) to be filled with the specified value.
toIndex - the index of the last element (exclusive) to be filled with the specified value.
val - the value to be stored in all elements of the array.
Throws:
IllegalArgumentException - if fromIndex > toIndex
ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length
Usages and Demos :

View More Examples of fill(byte[] a,int fromIndex,int toIndex,byte val)
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:         makeRoom(Index, Count);
   6:         Arrays.fill(Array, Index, Index + Count, null);
   7:         
   8:         fixMatchCacheIndices(Index + Count);
   9:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here

fill

public static void fill(char[] a,
                        char val)
Assigns the specified char value to each element of the specified array of chars.
Parameters:
a - the array to be filled.
val - the value to be stored in all elements of the array.
Usages and Demos :

View More Examples of fill(char[] a,char val)
   1:     if(FuLib.jdk()>=1.2)
   2:       Arrays.fill(LIST,SOFT);
   3:   }
   4: 
   5:   private static final Object createReference(Object _o)

View Full Code Here
   1:         fact = AssociationFactory.getInstance();
   2:         Arrays.fill(EXT_NEG_INFO, (byte)0xee);
   3:     }
   4:     
   5:     protected void check(AAssociateRQAC rqac) {

View Full Code Here
   1:     protected void setUp() throws Exception {
   2:         Arrays.fill(CMD, (byte)0xcc);
   3:         ...
   4:         Arrays.fill(DATA, (byte)0xdd);
   5:         fact = AssociationFactory.getInstance();
   6:     }
   7:         

View Full Code Here
   1: import java.security.InvalidKeyException;
   2: import java.util.Arrays;
   3: import java.util.HashMap;
   4:         ...
   5:       {
   6:         Arrays.fill(Lu, (byte) 0);
   7:         if (Lu.length != blockSize)
   8:         ...
   9:       {
  10:         Arrays.fill(Lu2, (byte) 0);
  11:         if (Lu2.length != blockSize)
  12:         ...
  13:       {
  14:         Arrays.fill(M, (byte) 0);

View Full Code Here
   1:   static {
   2:     Arrays.fill(HMAC_IPAD, HMAC_IPAD_BYTE);
   3:         ...
   4:     Arrays.fill(HMAC_OPAD, HMAC_OPAD_BYTE);
   5:   }
   6: 

View Full Code Here

fill

public static void fill(char[] a,
                        int fromIndex,
                        int toIndex,
                        char val)
Assigns the specified char value to each element of the specified range of the specified array of chars. The range to be filled extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be filled is empty.)
Parameters:
a - the array to be filled.
fromIndex - the index of the first element (inclusive) to be filled with the specified value.
toIndex - the index of the last element (exclusive) to be filled with the specified value.
val - the value to be stored in all elements of the array.
Throws:
IllegalArgumentException - if fromIndex > toIndex
ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length
Usages and Demos :

View More Examples of fill(char[] a,int fromIndex,int toIndex,char val)
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:         makeRoom(Index, Count);
   6:         Arrays.fill(Array, Index, Index + Count, null);
   7:         
   8:         fixMatchCacheIndices(Index + Count);
   9:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here

fill

public static void fill(double[] a,
                        double val)
Assigns the specified double value to each element of the specified array of doubles.
Parameters:
a - the array to be filled.
val - the value to be stored in all elements of the array.
Usages and Demos :

View More Examples of fill(double[] a,double val)
   1:     if(FuLib.jdk()>=1.2)
   2:       Arrays.fill(LIST,SOFT);
   3:   }
   4: 
   5:   private static final Object createReference(Object _o)

View Full Code Here
   1:         fact = AssociationFactory.getInstance();
   2:         Arrays.fill(EXT_NEG_INFO, (byte)0xee);
   3:     }
   4:     
   5:     protected void check(AAssociateRQAC rqac) {

View Full Code Here
   1:     protected void setUp() throws Exception {
   2:         Arrays.fill(CMD, (byte)0xcc);
   3:         ...
   4:         Arrays.fill(DATA, (byte)0xdd);
   5:         fact = AssociationFactory.getInstance();
   6:     }
   7:         

View Full Code Here
   1: import java.security.InvalidKeyException;
   2: import java.util.Arrays;
   3: import java.util.HashMap;
   4:         ...
   5:       {
   6:         Arrays.fill(Lu, (byte) 0);
   7:         if (Lu.length != blockSize)
   8:         ...
   9:       {
  10:         Arrays.fill(Lu2, (byte) 0);
  11:         if (Lu2.length != blockSize)
  12:         ...
  13:       {
  14:         Arrays.fill(M, (byte) 0);

View Full Code Here
   1:   static {
   2:     Arrays.fill(HMAC_IPAD, HMAC_IPAD_BYTE);
   3:         ...
   4:     Arrays.fill(HMAC_OPAD, HMAC_OPAD_BYTE);
   5:   }
   6: 

View Full Code Here

fill

public static void fill(double[] a,
                        int fromIndex,
                        int toIndex,
                        double val)
Assigns the specified double value to each element of the specified range of the specified array of doubles. The range to be filled extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be filled is empty.)
Parameters:
a - the array to be filled.
fromIndex - the index of the first element (inclusive) to be filled with the specified value.
toIndex - the index of the last element (exclusive) to be filled with the specified value.
val - the value to be stored in all elements of the array.
Throws:
IllegalArgumentException - if fromIndex > toIndex
ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length
Usages and Demos :

View More Examples of fill(double[] a,int fromIndex,int toIndex,double val)
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:         makeRoom(Index, Count);
   6:         Arrays.fill(Array, Index, Index + Count, null);
   7:         
   8:         fixMatchCacheIndices(Index + Count);
   9:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here

fill

public static void fill(float[] a,
                        float val)
Assigns the specified float value to each element of the specified array of floats.
Parameters:
a - the array to be filled.
val - the value to be stored in all elements of the array.
Usages and Demos :

View More Examples of fill(float[] a,float val)
   1:     if(FuLib.jdk()>=1.2)
   2:       Arrays.fill(LIST,SOFT);
   3:   }
   4: 
   5:   private static final Object createReference(Object _o)

View Full Code Here
   1:         fact = AssociationFactory.getInstance();
   2:         Arrays.fill(EXT_NEG_INFO, (byte)0xee);
   3:     }
   4:     
   5:     protected void check(AAssociateRQAC rqac) {

View Full Code Here
   1:     protected void setUp() throws Exception {
   2:         Arrays.fill(CMD, (byte)0xcc);
   3:         ...
   4:         Arrays.fill(DATA, (byte)0xdd);
   5:         fact = AssociationFactory.getInstance();
   6:     }
   7:         

View Full Code Here
   1: import java.security.InvalidKeyException;
   2: import java.util.Arrays;
   3: import java.util.HashMap;
   4:         ...
   5:       {
   6:         Arrays.fill(Lu, (byte) 0);
   7:         if (Lu.length != blockSize)
   8:         ...
   9:       {
  10:         Arrays.fill(Lu2, (byte) 0);
  11:         if (Lu2.length != blockSize)
  12:         ...
  13:       {
  14:         Arrays.fill(M, (byte) 0);

View Full Code Here
   1:   static {
   2:     Arrays.fill(HMAC_IPAD, HMAC_IPAD_BYTE);
   3:         ...
   4:     Arrays.fill(HMAC_OPAD, HMAC_OPAD_BYTE);
   5:   }
   6: 

View Full Code Here

fill

public static void fill(float[] a,
                        int fromIndex,
                        int toIndex,
                        float val)
Assigns the specified float value to each element of the specified range of the specified array of floats. The range to be filled extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be filled is empty.)
Parameters:
a - the array to be filled.
fromIndex - the index of the first element (inclusive) to be filled with the specified value.
toIndex - the index of the last element (exclusive) to be filled with the specified value.
val - the value to be stored in all elements of the array.
Throws:
IllegalArgumentException - if fromIndex > toIndex
ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length
Usages and Demos :

View More Examples of fill(float[] a,int fromIndex,int toIndex,float val)
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:         makeRoom(Index, Count);
   6:         Arrays.fill(Array, Index, Index + Count, null);
   7:         
   8:         fixMatchCacheIndices(Index + Count);
   9:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here

fill

public static void fill(int[] a,
                        int val)
Assigns the specified int value to each element of the specified array of ints.
Parameters:
a - the array to be filled.
val - the value to be stored in all elements of the array.
Usages and Demos :

View More Examples of fill(int[] a,int val)
   1:     if(FuLib.jdk()>=1.2)
   2:       Arrays.fill(LIST,SOFT);
   3:   }
   4: 
   5:   private static final Object createReference(Object _o)

View Full Code Here
   1:         fact = AssociationFactory.getInstance();
   2:         Arrays.fill(EXT_NEG_INFO, (byte)0xee);
   3:     }
   4:     
   5:     protected void check(AAssociateRQAC rqac) {

View Full Code Here
   1:     protected void setUp() throws Exception {
   2:         Arrays.fill(CMD, (byte)0xcc);
   3:         ...
   4:         Arrays.fill(DATA, (byte)0xdd);
   5:         fact = AssociationFactory.getInstance();
   6:     }
   7:         

View Full Code Here
   1: import java.security.InvalidKeyException;
   2: import java.util.Arrays;
   3: import java.util.HashMap;
   4:         ...
   5:       {
   6:         Arrays.fill(Lu, (byte) 0);
   7:         if (Lu.length != blockSize)
   8:         ...
   9:       {
  10:         Arrays.fill(Lu2, (byte) 0);
  11:         if (Lu2.length != blockSize)
  12:         ...
  13:       {
  14:         Arrays.fill(M, (byte) 0);

View Full Code Here
   1:   static {
   2:     Arrays.fill(HMAC_IPAD, HMAC_IPAD_BYTE);
   3:         ...
   4:     Arrays.fill(HMAC_OPAD, HMAC_OPAD_BYTE);
   5:   }
   6: 

View Full Code Here

fill

public static void fill(int[] a,
                        int fromIndex,
                        int toIndex,
                        int val)
Assigns the specified int value to each element of the specified range of the specified array of ints. The range to be filled extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be filled is empty.)
Parameters:
a - the array to be filled.
fromIndex - the index of the first element (inclusive) to be filled with the specified value.
toIndex - the index of the last element (exclusive) to be filled with the specified value.
val - the value to be stored in all elements of the array.
Throws:
IllegalArgumentException - if fromIndex > toIndex
ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length
Usages and Demos :

View More Examples of fill(int[] a,int fromIndex,int toIndex,int val)
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:         makeRoom(Index, Count);
   6:         Arrays.fill(Array, Index, Index + Count, null);
   7:         
   8:         fixMatchCacheIndices(Index + Count);
   9:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here

fill

public static void fill(Object[] a,
                        int fromIndex,
                        int toIndex,
                        Object val)
Assigns the specified Object reference to each element of the specified range of the specified array of Objects. The range to be filled extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be filled is empty.)
Parameters:
a - the array to be filled.
fromIndex - the index of the first element (inclusive) to be filled with the specified value.
toIndex - the index of the last element (exclusive) to be filled with the specified value.
val - the value to be stored in all elements of the array.
Throws:
IllegalArgumentException - if fromIndex > toIndex
ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length
Usages and Demos :

View More Examples of fill(Object[] a,int fromIndex,int toIndex,Object val)
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:         makeRoom(Index, Count);
   6:         Arrays.fill(Array, Index, Index + Count, null);
   7:         
   8:         fixMatchCacheIndices(Index + Count);
   9:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here

fill

public static void fill(Object[] a,
                        Object val)
Assigns the specified Object reference to each element of the specified array of Objects.
Parameters:
a - the array to be filled.
val - the value to be stored in all elements of the array.
Usages and Demos :

View More Examples of fill(Object[] a,Object val)
   1:     if(FuLib.jdk()>=1.2)
   2:       Arrays.fill(LIST,SOFT);
   3:   }
   4: 
   5:   private static final Object createReference(Object _o)

View Full Code Here
   1:         fact = AssociationFactory.getInstance();
   2:         Arrays.fill(EXT_NEG_INFO, (byte)0xee);
   3:     }
   4:     
   5:     protected void check(AAssociateRQAC rqac) {

View Full Code Here
   1:     protected void setUp() throws Exception {
   2:         Arrays.fill(CMD, (byte)0xcc);
   3:         ...
   4:         Arrays.fill(DATA, (byte)0xdd);
   5:         fact = AssociationFactory.getInstance();
   6:     }
   7:         

View Full Code Here
   1: import java.security.InvalidKeyException;
   2: import java.util.Arrays;
   3: import java.util.HashMap;
   4:         ...
   5:       {
   6:         Arrays.fill(Lu, (byte) 0);
   7:         if (Lu.length != blockSize)
   8:         ...
   9:       {
  10:         Arrays.fill(Lu2, (byte) 0);
  11:         if (Lu2.length != blockSize)
  12:         ...
  13:       {
  14:         Arrays.fill(M, (byte) 0);

View Full Code Here
   1:   static {
   2:     Arrays.fill(HMAC_IPAD, HMAC_IPAD_BYTE);
   3:         ...
   4:     Arrays.fill(HMAC_OPAD, HMAC_OPAD_BYTE);
   5:   }
   6: 

View Full Code Here

fill

public static void fill(long[] a,
                        int fromIndex,
                        int toIndex,
                        long val)
Assigns the specified long value to each element of the specified range of the specified array of longs. The range to be filled extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be filled is empty.)
Parameters:
a - the array to be filled.
fromIndex - the index of the first element (inclusive) to be filled with the specified value.
toIndex - the index of the last element (exclusive) to be filled with the specified value.
val - the value to be stored in all elements of the array.
Throws:
IllegalArgumentException - if fromIndex > toIndex
ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length
Usages and Demos :

View More Examples of fill(long[] a,int fromIndex,int toIndex,long val)
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:         makeRoom(Index, Count);
   6:         Arrays.fill(Array, Index, Index + Count, null);
   7:         
   8:         fixMatchCacheIndices(Index + Count);
   9:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here

fill

public static void fill(long[] a,
                        long val)
Assigns the specified long value to each element of the specified array of longs.
Parameters:
a - the array to be filled.
val - the value to be stored in all elements of the array.
Usages and Demos :

View More Examples of fill(long[] a,long val)
   1:     if(FuLib.jdk()>=1.2)
   2:       Arrays.fill(LIST,SOFT);
   3:   }
   4: 
   5:   private static final Object createReference(Object _o)

View Full Code Here
   1:         fact = AssociationFactory.getInstance();
   2:         Arrays.fill(EXT_NEG_INFO, (byte)0xee);
   3:     }
   4:     
   5:     protected void check(AAssociateRQAC rqac) {

View Full Code Here
   1:     protected void setUp() throws Exception {
   2:         Arrays.fill(CMD, (byte)0xcc);
   3:         ...
   4:         Arrays.fill(DATA, (byte)0xdd);
   5:         fact = AssociationFactory.getInstance();
   6:     }
   7:         

View Full Code Here
   1: import java.security.InvalidKeyException;
   2: import java.util.Arrays;
   3: import java.util.HashMap;
   4:         ...
   5:       {
   6:         Arrays.fill(Lu, (byte) 0);
   7:         if (Lu.length != blockSize)
   8:         ...
   9:       {
  10:         Arrays.fill(Lu2, (byte) 0);
  11:         if (Lu2.length != blockSize)
  12:         ...
  13:       {
  14:         Arrays.fill(M, (byte) 0);

View Full Code Here
   1:   static {
   2:     Arrays.fill(HMAC_IPAD, HMAC_IPAD_BYTE);
   3:         ...
   4:     Arrays.fill(HMAC_OPAD, HMAC_OPAD_BYTE);
   5:   }
   6: 

View Full Code Here

fill

public static void fill(short[] a,
                        int fromIndex,
                        int toIndex,
                        short val)
Assigns the specified short value to each element of the specified range of the specified array of shorts. The range to be filled extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be filled is empty.)
Parameters:
a - the array to be filled.
fromIndex - the index of the first element (inclusive) to be filled with the specified value.
toIndex - the index of the last element (exclusive) to be filled with the specified value.
val - the value to be stored in all elements of the array.
Throws:
IllegalArgumentException - if fromIndex > toIndex
ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length
Usages and Demos :

View More Examples of fill(short[] a,int fromIndex,int toIndex,short val)
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:         makeRoom(Index, Count);
   6:         Arrays.fill(Array, Index, Index + Count, null);
   7:         
   8:         fixMatchCacheIndices(Index + Count);
   9:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4: public class XMLChar {

View Full Code Here

fill

public static void fill(short[] a,
                        short val)
Assigns the specified short value to each element of the specified array of shorts.
Parameters:
a - the array to be filled.
val - the value to be stored in all elements of the array.
Usages and Demos :

View More Examples of fill(short[] a,short val)
   1:     if(FuLib.jdk()>=1.2)
   2:       Arrays.fill(LIST,SOFT);
   3:   }
   4: 
   5:   private static final Object createReference(Object _o)

View Full Code Here
   1:         fact = AssociationFactory.getInstance();
   2:         Arrays.fill(EXT_NEG_INFO, (byte)0xee);
   3:     }
   4:     
   5:     protected void check(AAssociateRQAC rqac) {

View Full Code Here
   1:     protected void setUp() throws Exception {
   2:         Arrays.fill(CMD, (byte)0xcc);
   3:         ...
   4:         Arrays.fill(DATA, (byte)0xdd);
   5:         fact = AssociationFactory.getInstance();
   6:     }
   7:         

View Full Code Here
   1: import java.security.InvalidKeyException;
   2: import java.util.Arrays;
   3: import java.util.HashMap;
   4:         ...
   5:       {
   6:         Arrays.fill(Lu, (byte) 0);
   7:         if (Lu.length != blockSize)
   8:         ...
   9:       {
  10:         Arrays.fill(Lu2, (byte) 0);
  11:         if (Lu2.length != blockSize)
  12:         ...
  13:       {
  14:         Arrays.fill(M, (byte) 0);

View Full Code Here
   1:   static {
   2:     Arrays.fill(HMAC_IPAD, HMAC_IPAD_BYTE);
   3:         ...
   4:     Arrays.fill(HMAC_OPAD, HMAC_OPAD_BYTE);
   5:   }
   6: 

View Full Code Here

hashCode

public static int hashCode(a[] )
Returns a hash code based on the contents of the specified array. For any two long arrays a and b such that Arrays.equals(a, b), it is also the case that Arrays.hashCode(a) == Arrays.hashCode(b).

The value returned by this method is the same value that would be obtained by invoking the hashCode method on a List containing a sequence of Long instances representing the elements of a in the same order. If a is null, this method returns 0.

Parameters:
Returns:
a content-based hash code for a
Since:
1.5
Usages and Demos :

View More Examples of hashCode(a[] )
   1: import java.sql.Types;
   2: import java.util.Arrays;
   3: import java.util.Properties;
   4:         ...
   5:     public boolean equals(Object arg0, Object arg1) throws HibernateException {
   6:         return Arrays.equals((byte[])arg0,(byte[])arg1);
   7:     }
   8:         ...
   9:     public int hashCode(Object arg0) throws HibernateException {
  10:         return Arrays.hashCode((byte[]) arg0);
  11:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:             {
   6:                return Arrays.equals((int[]) state, (int[]) other.state);
   7:             }
   8:         ...
   9:             {
  10:                return Arrays.equals((double[]) state, (double[]) other.state);
  11:             }
  12:         ...
  13:       {        
  14:          return Arrays.hashCode((int[]) state);

View Full Code Here
   1: import java.io.*;
   2: import java.util.Arrays;
   3: import java.beans.*;
   4:         ...
   5:             byte[] a2 = (byte[])r.value;
   6:             return Arrays.equals(a1, a2);
   7:         }
   8:         ...
   9:     if (value instanceof byte[]) {
  10:         return Arrays.hashCode((byte[])value);
  11:     }

View Full Code Here
   1: import java.lang.reflect.Proxy;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:         if (o1 instanceof boolean[] && o2 instanceof boolean[])
   6:             return Arrays.equals((boolean[]) o1, (boolean[]) o2);
   7: 
   8:         ...
   9:         if (o1 instanceof byte[] && o2 instanceof byte[])
  10:             return Arrays.equals((byte[]) o1, (byte[]) o2);
  11: 
  12:         ...
  13:         if (obj instanceof boolean[])
  14:             return Arrays.hashCode((boolean[]) obj);

View Full Code Here

hashCode

public static int hashCode(a[] )
Returns a hash code based on the contents of the specified array. For any two non-null int arrays a and b such that Arrays.equals(a, b), it is also the case that Arrays.hashCode(a) == Arrays.hashCode(b).

The value returned by this method is the same value that would be obtained by invoking the hashCode method on a List containing a sequence of Integer instances representing the elements of a in the same order. If a is null, this method returns 0.

Parameters:
Returns:
a content-based hash code for a
Since:
1.5
Usages and Demos :

View More Examples of hashCode(a[] )
   1: import java.sql.Types;
   2: import java.util.Arrays;
   3: import java.util.Properties;
   4:         ...
   5:     public boolean equals(Object arg0, Object arg1) throws HibernateException {
   6:         return Arrays.equals((byte[])arg0,(byte[])arg1);
   7:     }
   8:         ...
   9:     public int hashCode(Object arg0) throws HibernateException {
  10:         return Arrays.hashCode((byte[]) arg0);
  11:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:             {
   6:                return Arrays.equals((int[]) state, (int[]) other.state);
   7:             }
   8:         ...
   9:             {
  10:                return Arrays.equals((double[]) state, (double[]) other.state);
  11:             }
  12:         ...
  13:       {        
  14:          return Arrays.hashCode((int[]) state);

View Full Code Here
   1: import java.io.*;
   2: import java.util.Arrays;
   3: import java.beans.*;
   4:         ...
   5:             byte[] a2 = (byte[])r.value;
   6:             return Arrays.equals(a1, a2);
   7:         }
   8:         ...
   9:     if (value instanceof byte[]) {
  10:         return Arrays.hashCode((byte[])value);
  11:     }

View Full Code Here
   1: import java.lang.reflect.Proxy;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:         if (o1 instanceof boolean[] && o2 instanceof boolean[])
   6:             return Arrays.equals((boolean[]) o1, (boolean[]) o2);
   7: 
   8:         ...
   9:         if (o1 instanceof byte[] && o2 instanceof byte[])
  10:             return Arrays.equals((byte[]) o1, (byte[]) o2);
  11: 
  12:         ...
  13:         if (obj instanceof boolean[])
  14:             return Arrays.hashCode((boolean[]) obj);

View Full Code Here

hashCode

public static int hashCode(a[] )
Returns a hash code based on the contents of the specified array. For any two short arrays a and b such that Arrays.equals(a, b), it is also the case that Arrays.hashCode(a) == Arrays.hashCode(b).

The value returned by this method is the same value that would be obtained by invoking the hashCode method on a List containing a sequence of Short instances representing the elements of a in the same order. If a is null, this method returns 0.

Parameters:
Returns:
a content-based hash code for a
Since:
1.5
Usages and Demos :

View More Examples of hashCode(a[] )
   1: import java.sql.Types;
   2: import java.util.Arrays;
   3: import java.util.Properties;
   4:         ...
   5:     public boolean equals(Object arg0, Object arg1) throws HibernateException {
   6:         return Arrays.equals((byte[])arg0,(byte[])arg1);
   7:     }
   8:         ...
   9:     public int hashCode(Object arg0) throws HibernateException {
  10:         return Arrays.hashCode((byte[]) arg0);
  11:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:             {
   6:                return Arrays.equals((int[]) state, (int[]) other.state);
   7:             }
   8:         ...
   9:             {
  10:                return Arrays.equals((double[]) state, (double[]) other.state);
  11:             }
  12:         ...
  13:       {        
  14:          return Arrays.hashCode((int[]) state);

View Full Code Here
   1: import java.io.*;
   2: import java.util.Arrays;
   3: import java.beans.*;
   4:         ...
   5:             byte[] a2 = (byte[])r.value;
   6:             return Arrays.equals(a1, a2);
   7:         }
   8:         ...
   9:     if (value instanceof byte[]) {
  10:         return Arrays.hashCode((byte[])value);
  11:     }

View Full Code Here
   1: import java.lang.reflect.Proxy;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:         if (o1 instanceof boolean[] && o2 instanceof boolean[])
   6:             return Arrays.equals((boolean[]) o1, (boolean[]) o2);
   7: 
   8:         ...
   9:         if (o1 instanceof byte[] && o2 instanceof byte[])
  10:             return Arrays.equals((byte[]) o1, (byte[]) o2);
  11: 
  12:         ...
  13:         if (obj instanceof boolean[])
  14:             return Arrays.hashCode((boolean[]) obj);

View Full Code Here

hashCode

public static int hashCode(a[] )
Returns a hash code based on the contents of the specified array. For any two char arrays a and b such that Arrays.equals(a, b), it is also the case that Arrays.hashCode(a) == Arrays.hashCode(b).

The value returned by this method is the same value that would be obtained by invoking the hashCode method on a List containing a sequence of Character instances representing the elements of a in the same order. If a is null, this method returns 0.

Parameters:
Returns:
a content-based hash code for a
Since:
1.5
Usages and Demos :

View More Examples of hashCode(a[] )
   1: import java.sql.Types;
   2: import java.util.Arrays;
   3: import java.util.Properties;
   4:         ...
   5:     public boolean equals(Object arg0, Object arg1) throws HibernateException {
   6:         return Arrays.equals((byte[])arg0,(byte[])arg1);
   7:     }
   8:         ...
   9:     public int hashCode(Object arg0) throws HibernateException {
  10:         return Arrays.hashCode((byte[]) arg0);
  11:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:             {
   6:                return Arrays.equals((int[]) state, (int[]) other.state);
   7:             }
   8:         ...
   9:             {
  10:                return Arrays.equals((double[]) state, (double[]) other.state);
  11:             }
  12:         ...
  13:       {        
  14:          return Arrays.hashCode((int[]) state);

View Full Code Here
   1: import java.io.*;
   2: import java.util.Arrays;
   3: import java.beans.*;
   4:         ...
   5:             byte[] a2 = (byte[])r.value;
   6:             return Arrays.equals(a1, a2);
   7:         }
   8:         ...
   9:     if (value instanceof byte[]) {
  10:         return Arrays.hashCode((byte[])value);
  11:     }

View Full Code Here
   1: import java.lang.reflect.Proxy;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:         if (o1 instanceof boolean[] && o2 instanceof boolean[])
   6:             return Arrays.equals((boolean[]) o1, (boolean[]) o2);
   7: 
   8:         ...
   9:         if (o1 instanceof byte[] && o2 instanceof byte[])
  10:             return Arrays.equals((byte[]) o1, (byte[]) o2);
  11: 
  12:         ...
  13:         if (obj instanceof boolean[])
  14:             return Arrays.hashCode((boolean[]) obj);

View Full Code Here

hashCode

public static int hashCode(a[] )
Returns a hash code based on the contents of the specified array. For any two byte arrays a and b such that Arrays.equals(a, b), it is also the case that Arrays.hashCode(a) == Arrays.hashCode(b).

The value returned by this method is the same value that would be obtained by invoking the hashCode method on a List containing a sequence of Byte instances representing the elements of a in the same order. If a is null, this method returns 0.

Parameters:
Returns:
a content-based hash code for a
Since:
1.5
Usages and Demos :

View More Examples of hashCode(a[] )
   1: import java.sql.Types;
   2: import java.util.Arrays;
   3: import java.util.Properties;
   4:         ...
   5:     public boolean equals(Object arg0, Object arg1) throws HibernateException {
   6:         return Arrays.equals((byte[])arg0,(byte[])arg1);
   7:     }
   8:         ...
   9:     public int hashCode(Object arg0) throws HibernateException {
  10:         return Arrays.hashCode((byte[]) arg0);
  11:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:             {
   6:                return Arrays.equals((int[]) state, (int[]) other.state);
   7:             }
   8:         ...
   9:             {
  10:                return Arrays.equals((double[]) state, (double[]) other.state);
  11:             }
  12:         ...
  13:       {        
  14:          return Arrays.hashCode((int[]) state);

View Full Code Here
   1: import java.io.*;
   2: import java.util.Arrays;
   3: import java.beans.*;
   4:         ...
   5:             byte[] a2 = (byte[])r.value;
   6:             return Arrays.equals(a1, a2);
   7:         }
   8:         ...
   9:     if (value instanceof byte[]) {
  10:         return Arrays.hashCode((byte[])value);
  11:     }

View Full Code Here
   1: import java.lang.reflect.Proxy;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:         if (o1 instanceof boolean[] && o2 instanceof boolean[])
   6:             return Arrays.equals((boolean[]) o1, (boolean[]) o2);
   7: 
   8:         ...
   9:         if (o1 instanceof byte[] && o2 instanceof byte[])
  10:             return Arrays.equals((byte[]) o1, (byte[]) o2);
  11: 
  12:         ...
  13:         if (obj instanceof boolean[])
  14:             return Arrays.hashCode((boolean[]) obj);

View Full Code Here

hashCode

public static int hashCode(a[] )
Returns a hash code based on the contents of the specified array. For any two boolean arrays a and b such that Arrays.equals(a, b), it is also the case that Arrays.hashCode(a) == Arrays.hashCode(b).

The value returned by this method is the same value that would be obtained by invoking the hashCode method on a List containing a sequence of Boolean instances representing the elements of a in the same order. If a is null, this method returns 0.

Parameters:
Returns:
a content-based hash code for a
Since:
1.5
Usages and Demos :

View More Examples of hashCode(a[] )
   1: import java.sql.Types;
   2: import java.util.Arrays;
   3: import java.util.Properties;
   4:         ...
   5:     public boolean equals(Object arg0, Object arg1) throws HibernateException {
   6:         return Arrays.equals((byte[])arg0,(byte[])arg1);
   7:     }
   8:         ...
   9:     public int hashCode(Object arg0) throws HibernateException {
  10:         return Arrays.hashCode((byte[]) arg0);
  11:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:             {
   6:                return Arrays.equals((int[]) state, (int[]) other.state);
   7:             }
   8:         ...
   9:             {
  10:                return Arrays.equals((double[]) state, (double[]) other.state);
  11:             }
  12:         ...
  13:       {        
  14:          return Arrays.hashCode((int[]) state);

View Full Code Here
   1: import java.io.*;
   2: import java.util.Arrays;
   3: import java.beans.*;
   4:         ...
   5:             byte[] a2 = (byte[])r.value;
   6:             return Arrays.equals(a1, a2);
   7:         }
   8:         ...
   9:     if (value instanceof byte[]) {
  10:         return Arrays.hashCode((byte[])value);
  11:     }

View Full Code Here
   1: import java.lang.reflect.Proxy;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:         if (o1 instanceof boolean[] && o2 instanceof boolean[])
   6:             return Arrays.equals((boolean[]) o1, (boolean[]) o2);
   7: 
   8:         ...
   9:         if (o1 instanceof byte[] && o2 instanceof byte[])
  10:             return Arrays.equals((byte[]) o1, (byte[]) o2);
  11: 
  12:         ...
  13:         if (obj instanceof boolean[])
  14:             return Arrays.hashCode((boolean[]) obj);

View Full Code Here

hashCode

public static int hashCode(a[] )
Returns a hash code based on the contents of the specified array. For any two float arrays a and b such that Arrays.equals(a, b), it is also the case that Arrays.hashCode(a) == Arrays.hashCode(b).

The value returned by this method is the same value that would be obtained by invoking the hashCode method on a List containing a sequence of Float instances representing the elements of a in the same order. If a is null, this method returns 0.

Parameters:
Returns:
a content-based hash code for a
Since:
1.5
Usages and Demos :

View More Examples of hashCode(a[] )
   1: import java.sql.Types;
   2: import java.util.Arrays;
   3: import java.util.Properties;
   4:         ...
   5:     public boolean equals(Object arg0, Object arg1) throws HibernateException {
   6:         return Arrays.equals((byte[])arg0,(byte[])arg1);
   7:     }
   8:         ...
   9:     public int hashCode(Object arg0) throws HibernateException {
  10:         return Arrays.hashCode((byte[]) arg0);
  11:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:             {
   6:                return Arrays.equals((int[]) state, (int[]) other.state);
   7:             }
   8:         ...
   9:             {
  10:                return Arrays.equals((double[]) state, (double[]) other.state);
  11:             }
  12:         ...
  13:       {        
  14:          return Arrays.hashCode((int[]) state);

View Full Code Here
   1: import java.io.*;
   2: import java.util.Arrays;
   3: import java.beans.*;
   4:         ...
   5:             byte[] a2 = (byte[])r.value;
   6:             return Arrays.equals(a1, a2);
   7:         }
   8:         ...
   9:     if (value instanceof byte[]) {
  10:         return Arrays.hashCode((byte[])value);
  11:     }

View Full Code Here
   1: import java.lang.reflect.Proxy;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:         if (o1 instanceof boolean[] && o2 instanceof boolean[])
   6:             return Arrays.equals((boolean[]) o1, (boolean[]) o2);
   7: 
   8:         ...
   9:         if (o1 instanceof byte[] && o2 instanceof byte[])
  10:             return Arrays.equals((byte[]) o1, (byte[]) o2);
  11: 
  12:         ...
  13:         if (obj instanceof boolean[])
  14:             return Arrays.hashCode((boolean[]) obj);

View Full Code Here

hashCode

public static int hashCode(a[] )
Returns a hash code based on the contents of the specified array. For any two double arrays a and b such that Arrays.equals(a, b), it is also the case that Arrays.hashCode(a) == Arrays.hashCode(b).

The value returned by this method is the same value that would be obtained by invoking the hashCode method on a List containing a sequence of Double instances representing the elements of a in the same order. If a is null, this method returns 0.

Parameters:
Returns:
a content-based hash code for a
Since:
1.5
Usages and Demos :

View More Examples of hashCode(a[] )
   1: import java.sql.Types;
   2: import java.util.Arrays;
   3: import java.util.Properties;
   4:         ...
   5:     public boolean equals(Object arg0, Object arg1) throws HibernateException {
   6:         return Arrays.equals((byte[])arg0,(byte[])arg1);
   7:     }
   8:         ...
   9:     public int hashCode(Object arg0) throws HibernateException {
  10:         return Arrays.hashCode((byte[]) arg0);
  11:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:             {
   6:                return Arrays.equals((int[]) state, (int[]) other.state);
   7:             }
   8:         ...
   9:             {
  10:                return Arrays.equals((double[]) state, (double[]) other.state);
  11:             }
  12:         ...
  13:       {        
  14:          return Arrays.hashCode((int[]) state);

View Full Code Here
   1: import java.io.*;
   2: import java.util.Arrays;
   3: import java.beans.*;
   4:         ...
   5:             byte[] a2 = (byte[])r.value;
   6:             return Arrays.equals(a1, a2);
   7:         }
   8:         ...
   9:     if (value instanceof byte[]) {
  10:         return Arrays.hashCode((byte[])value);
  11:     }

View Full Code Here
   1: import java.lang.reflect.Proxy;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:         if (o1 instanceof boolean[] && o2 instanceof boolean[])
   6:             return Arrays.equals((boolean[]) o1, (boolean[]) o2);
   7: 
   8:         ...
   9:         if (o1 instanceof byte[] && o2 instanceof byte[])
  10:             return Arrays.equals((byte[]) o1, (byte[]) o2);
  11: 
  12:         ...
  13:         if (obj instanceof boolean[])
  14:             return Arrays.hashCode((boolean[]) obj);

View Full Code Here

hashCode

public static int hashCode(a[] )
Returns a hash code based on the contents of the specified array. If the array contains other arrays as elements, the hash code is based on their identities rather than their contents. It is therefore acceptable to invoke this method on an array that contains itself as an element, either directly or indirectly through one or more levels of arrays.

For any two arrays a and b such that Arrays.equals(a, b), it is also the case that Arrays.hashCode(a) == Arrays.hashCode(b).

The value returned by this method is equal to the value that would be returned by Arrays.asList(a).hashCode(), unless a is null, in which case 0 is returned.

Parameters:
Returns:
a content-based hash code for a
Since:
1.5
See Also:
deepHashCode(Object[])
Usages and Demos :

View More Examples of hashCode(a[] )
   1: import java.sql.Types;
   2: import java.util.Arrays;
   3: import java.util.Properties;
   4:         ...
   5:     public boolean equals(Object arg0, Object arg1) throws HibernateException {
   6:         return Arrays.equals((byte[])arg0,(byte[])arg1);
   7:     }
   8:         ...
   9:     public int hashCode(Object arg0) throws HibernateException {
  10:         return Arrays.hashCode((byte[]) arg0);
  11:     }

View Full Code Here
   1: 
   2: import java.util.Arrays;
   3: 
   4:         ...
   5:             {
   6:                return Arrays.equals((int[]) state, (int[]) other.state);
   7:             }
   8:         ...
   9:             {
  10:                return Arrays.equals((double[]) state, (double[]) other.state);
  11:             }
  12:         ...
  13:       {        
  14:          return Arrays.hashCode((int[]) state);

View Full Code Here
   1: import java.io.*;
   2: import java.util.Arrays;
   3: import java.beans.*;
   4:         ...
   5:             byte[] a2 = (byte[])r.value;
   6:             return Arrays.equals(a1, a2);
   7:         }
   8:         ...
   9:     if (value instanceof byte[]) {
  10:         return Arrays.hashCode((byte[])value);
  11:     }

View Full Code Here
   1: import java.lang.reflect.Proxy;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:         if (o1 instanceof boolean[] && o2 instanceof boolean[])
   6:             return Arrays.equals((boolean[]) o1, (boolean[]) o2);
   7: 
   8:         ...
   9:         if (o1 instanceof byte[] && o2 instanceof byte[])
  10:             return Arrays.equals((byte[]) o1, (byte[]) o2);
  11: 
  12:         ...
  13:         if (obj instanceof boolean[])
  14:             return Arrays.hashCode((boolean[]) obj);

View Full Code Here

int binarySearch

public static  int binarySearch(T[] a,
                                   T key,
                                   T> c)
Searches the specified array for the specified object using the binary search algorithm. The array must be sorted into ascending order according to the specified comparator (as by the Sort(Object[], Comparator) method, above), prior to making this call. If it is not sorted, the results are undefined. If the array contains multiple elements equal to the specified object, there is no guarantee which one will be found.
Parameters:
a - the array to be searched.
key - the value to be searched for.
c - the comparator by which the array is ordered. A null value indicates that the elements' natural ordering should be used.
Returns:
index of the search key, if it is contained in the list; otherwise, (-(insertion point) - 1). The insertion point is defined as the point at which the key would be inserted into the list: the index of the first element greater than the key, or list.size(), if all elements in the list are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.
Throws:
ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator, or the search key in not mutually comparable with the elements of the array using this comparator.
See Also:
Comparable, sort(Object[], Comparator)

sort

public static void sort(byte[] a)
Sorts the specified array of bytes into ascending numerical order. The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
Parameters:
a - the array to be sorted.
Usages and Demos :

View More Examples of sort(byte[] a)
   1:         if (obj instanceof List){
   2:             Collections.sort((List)obj, comp);
   3:         } else if (obj instanceof Object[]){
   4:         ...
   5:             Arrays.sort((Object[])obj, comp);
   6:         } else if (obj instanceof int[]){
   7:         ...
   8:             Arrays.sort((int[])obj);
   9:         } else if (obj instanceof char[]){
  10:         ...
  11:             Arrays.sort((char[])obj);

View Full Code Here
   1: 
   2: import org.norther.tammi.acorn.util.converter.Arrays;
   3: 
   4:         ...
   5:         {
   6:             java.util.Collections.sort((List) source);
   7:         }
   8:         ...
   9:             source = new ArrayList((Collection) source);
  10:             java.util.Collections.sort((List) source);
  11:         }
  12:         ...
  13:         {
  14:             source = Arrays.toObject(source);

View Full Code Here

sort

public static void sort(byte[] a,
                        int fromIndex,
                        int toIndex)
Sorts the specified range of the specified array of bytes into ascending numerical order. The range to be sorted extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be sorted is empty.)

The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.

Parameters:
a - the array to be sorted.
fromIndex - the index of the first element (inclusive) to be sorted.
toIndex - the index of the last element (exclusive) to be sorted.
Throws:
IllegalArgumentException - if fromIndex > toIndex
ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length
Usages and Demos :

View More Examples of sort(byte[] a,int fromIndex,int toIndex)
   1: import java.io.IOException;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:     final void sort() {
   6:       Arrays.sort(_array, _index, _lastIndex);
   7:     }
   8: 
   9:     final void clear() {

View Full Code Here
   1: 
   2:             java.util.Arrays.sort(array, 0, count);
   3:         }
   4: 
   5:         buffer = new StringBuffer();

View Full Code Here
   1: 
   2:       java.util.Arrays.sort(allProgs,0,numProgs);
   3:       allDescription = new String[numProgs];
   4: 
   5:       for(int i=0;i<numProgs;i++)

View Full Code Here
   1: 
   2:     java.util.Arrays.sort(callout, 0, calloutCount);
   3:   }
   4: 
   5:   protected void formatPad(int numBlanks) {

View Full Code Here
   1: 
   2:             Arrays.sort(colList, 0, players.size());
   3:         }
   4: 
   5:         public void update()

View Full Code Here

sort

public static void sort(char[] a)
Sorts the specified array of chars into ascending numerical order. The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
Parameters:
a - the array to be sorted.
Usages and Demos :

View More Examples of sort(char[] a)
   1:         if (obj instanceof List){
   2:             Collections.sort((List)obj, comp);
   3:         } else if (obj instanceof Object[]){
   4:         ...
   5:             Arrays.sort((Object[])obj, comp);
   6:         } else if (obj instanceof int[]){
   7:         ...
   8:             Arrays.sort((int[])obj);
   9:         } else if (obj instanceof char[]){
  10:         ...
  11:             Arrays.sort((char[])obj);

View Full Code Here
   1: 
   2: import org.norther.tammi.acorn.util.converter.Arrays;
   3: 
   4:         ...
   5:         {
   6:             java.util.Collections.sort((List) source);
   7:         }
   8:         ...
   9:             source = new ArrayList((Collection) source);
  10:             java.util.Collections.sort((List) source);
  11:         }
  12:         ...
  13:         {
  14:             source = Arrays.toObject(source);

View Full Code Here

sort

public static void sort(char[] a,
                        int fromIndex,
                        int toIndex)
Sorts the specified range of the specified array of chars into ascending numerical order. The range to be sorted extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be sorted is empty.)

The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.

Parameters:
a - the array to be sorted.
fromIndex - the index of the first element (inclusive) to be sorted.
toIndex - the index of the last element (exclusive) to be sorted.
Throws:
IllegalArgumentException - if fromIndex > toIndex
ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length
Usages and Demos :

View More Examples of sort(char[] a,int fromIndex,int toIndex)
   1: import java.io.IOException;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:     final void sort() {
   6:       Arrays.sort(_array, _index, _lastIndex);
   7:     }
   8: 
   9:     final void clear() {

View Full Code Here
   1: 
   2:             java.util.Arrays.sort(array, 0, count);
   3:         }
   4: 
   5:         buffer = new StringBuffer();

View Full Code Here
   1: 
   2:       java.util.Arrays.sort(allProgs,0,numProgs);
   3:       allDescription = new String[numProgs];
   4: 
   5:       for(int i=0;i<numProgs;i++)

View Full Code Here
   1: 
   2:     java.util.Arrays.sort(callout, 0, calloutCount);
   3:   }
   4: 
   5:   protected void formatPad(int numBlanks) {

View Full Code Here
   1: 
   2:             Arrays.sort(colList, 0, players.size());
   3:         }
   4: 
   5:         public void update()

View Full Code Here

sort

public static void sort(double[] a)
Sorts the specified array of doubles into ascending numerical order.

The < relation does not provide a total order on all floating-point values; although they are distinct numbers -0.0 == 0.0 is true and a NaN value compares neither less than, greater than, nor equal to any floating-point value, even itself. To allow the sort to proceed, instead of using the < relation to determine ascending numerical order, this method uses the total order imposed by Double.compareTo(Double). This ordering differs from the < relation in that -0.0 is treated as less than 0.0 and NaN is considered greater than any other floating-point value. For the purposes of sorting, all NaN values are considered equivalent and equal.

The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.

Parameters:
a - the array to be sorted.
Usages and Demos :

View More Examples of sort(double[] a)
   1:         if (obj instanceof List){
   2:             Collections.sort((List)obj, comp);
   3:         } else if (obj instanceof Object[]){
   4:         ...
   5:             Arrays.sort((Object[])obj, comp);
   6:         } else if (obj instanceof int[]){
   7:         ...
   8:             Arrays.sort((int[])obj);
   9:         } else if (obj instanceof char[]){
  10:         ...
  11:             Arrays.sort((char[])obj);

View Full Code Here
   1: 
   2: import org.norther.tammi.acorn.util.converter.Arrays;
   3: 
   4:         ...
   5:         {
   6:             java.util.Collections.sort((List) source);
   7:         }
   8:         ...
   9:             source = new ArrayList((Collection) source);
  10:             java.util.Collections.sort((List) source);
  11:         }
  12:         ...
  13:         {
  14:             source = Arrays.toObject(source);

View Full Code Here

sort

public static void sort(double[] a,
                        int fromIndex,
                        int toIndex)
Sorts the specified range of the specified array of doubles into ascending numerical order. The range to be sorted extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be sorted is empty.)

The < relation does not provide a total order on all floating-point values; although they are distinct numbers -0.0 == 0.0 is true and a NaN value compares neither less than, greater than, nor equal to any floating-point value, even itself. To allow the sort to proceed, instead of using the < relation to determine ascending numerical order, this method uses the total order imposed by Double.compareTo(Double). This ordering differs from the < relation in that -0.0 is treated as less than 0.0 and NaN is considered greater than any other floating-point value. For the purposes of sorting, all NaN values are considered equivalent and equal.

The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.

Parameters:
a - the array to be sorted.
fromIndex - the index of the first element (inclusive) to be sorted.
toIndex - the index of the last element (exclusive) to be sorted.
Throws:
IllegalArgumentException - if fromIndex > toIndex
ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length
Usages and Demos :

View More Examples of sort(double[] a,int fromIndex,int toIndex)
   1: import java.io.IOException;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:     final void sort() {
   6:       Arrays.sort(_array, _index, _lastIndex);
   7:     }
   8: 
   9:     final void clear() {

View Full Code Here
   1: 
   2:             java.util.Arrays.sort(array, 0, count);
   3:         }
   4: 
   5:         buffer = new StringBuffer();

View Full Code Here
   1: 
   2:       java.util.Arrays.sort(allProgs,0,numProgs);
   3:       allDescription = new String[numProgs];
   4: 
   5:       for(int i=0;i<numProgs;i++)

View Full Code Here
   1: 
   2:     java.util.Arrays.sort(callout, 0, calloutCount);
   3:   }
   4: 
   5:   protected void formatPad(int numBlanks) {

View Full Code Here
   1: 
   2:             Arrays.sort(colList, 0, players.size());
   3:         }
   4: 
   5:         public void update()

View Full Code Here

sort

public static void sort(float[] a)
Sorts the specified array of floats into ascending numerical order.

The < relation does not provide a total order on all floating-point values; although they are distinct numbers -0.0f == 0.0f is true and a NaN value compares neither less than, greater than, nor equal to any floating-point value, even itself. To allow the sort to proceed, instead of using the < relation to determine ascending numerical order, this method uses the total order imposed by Float.compareTo(Float). This ordering differs from the < relation in that -0.0f is treated as less than 0.0f and NaN is considered greater than any other floating-point value. For the purposes of sorting, all NaN values are considered equivalent and equal.

The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.

Parameters:
a - the array to be sorted.
Usages and Demos :

View More Examples of sort(float[] a)
   1:         if (obj instanceof List){
   2:             Collections.sort((List)obj, comp);
   3:         } else if (obj instanceof Object[]){
   4:         ...
   5:             Arrays.sort((Object[])obj, comp);
   6:         } else if (obj instanceof int[]){
   7:         ...
   8:             Arrays.sort((int[])obj);
   9:         } else if (obj instanceof char[]){
  10:         ...
  11:             Arrays.sort((char[])obj);

View Full Code Here
   1: 
   2: import org.norther.tammi.acorn.util.converter.Arrays;
   3: 
   4:         ...
   5:         {
   6:             java.util.Collections.sort((List) source);
   7:         }
   8:         ...
   9:             source = new ArrayList((Collection) source);
  10:             java.util.Collections.sort((List) source);
  11:         }
  12:         ...
  13:         {
  14:             source = Arrays.toObject(source);

View Full Code Here

sort

public static void sort(float[] a,
                        int fromIndex,
                        int toIndex)
Sorts the specified range of the specified array of floats into ascending numerical order. The range to be sorted extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be sorted is empty.)

The < relation does not provide a total order on all floating-point values; although they are distinct numbers -0.0f == 0.0f is true and a NaN value compares neither less than, greater than, nor equal to any floating-point value, even itself. To allow the sort to proceed, instead of using the < relation to determine ascending numerical order, this method uses the total order imposed by Float.compareTo(Float). This ordering differs from the < relation in that -0.0f is treated as less than 0.0f and NaN is considered greater than any other floating-point value. For the purposes of sorting, all NaN values are considered equivalent and equal.

The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.

Parameters:
a - the array to be sorted.
fromIndex - the index of the first element (inclusive) to be sorted.
toIndex - the index of the last element (exclusive) to be sorted.
Throws:
IllegalArgumentException - if fromIndex > toIndex
ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length
Usages and Demos :

View More Examples of sort(float[] a,int fromIndex,int toIndex)
   1: import java.io.IOException;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:     final void sort() {
   6:       Arrays.sort(_array, _index, _lastIndex);
   7:     }
   8: 
   9:     final void clear() {

View Full Code Here
   1: 
   2:             java.util.Arrays.sort(array, 0, count);
   3:         }
   4: 
   5:         buffer = new StringBuffer();

View Full Code Here
   1: 
   2:       java.util.Arrays.sort(allProgs,0,numProgs);
   3:       allDescription = new String[numProgs];
   4: 
   5:       for(int i=0;i<numProgs;i++)

View Full Code Here
   1: 
   2:     java.util.Arrays.sort(callout, 0, calloutCount);
   3:   }
   4: 
   5:   protected void formatPad(int numBlanks) {

View Full Code Here
   1: 
   2:             Arrays.sort(colList, 0, players.size());
   3:         }
   4: 
   5:         public void update()

View Full Code Here

sort

public static void sort(int[] a)
Sorts the specified array of ints into ascending numerical order. The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
Parameters:
a - the array to be sorted.
Usages and Demos :

View More Examples of sort(int[] a)
   1:         if (obj instanceof List){
   2:             Collections.sort((List)obj, comp);
   3:         } else if (obj instanceof Object[]){
   4:         ...
   5:             Arrays.sort((Object[])obj, comp);
   6:         } else if (obj instanceof int[]){
   7:         ...
   8:             Arrays.sort((int[])obj);
   9:         } else if (obj instanceof char[]){
  10:         ...
  11:             Arrays.sort((char[])obj);

View Full Code Here
   1: 
   2: import org.norther.tammi.acorn.util.converter.Arrays;
   3: 
   4:         ...
   5:         {
   6:             java.util.Collections.sort((List) source);
   7:         }
   8:         ...
   9:             source = new ArrayList((Collection) source);
  10:             java.util.Collections.sort((List) source);
  11:         }
  12:         ...
  13:         {
  14:             source = Arrays.toObject(source);

View Full Code Here

sort

public static void sort(int[] a,
                        int fromIndex,
                        int toIndex)
Sorts the specified range of the specified array of ints into ascending numerical order. The range to be sorted extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be sorted is empty.)

The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.

Parameters:
a - the array to be sorted.
fromIndex - the index of the first element (inclusive) to be sorted.
toIndex - the index of the last element (exclusive) to be sorted.
Throws:
IllegalArgumentException - if fromIndex > toIndex
ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length
Usages and Demos :

View More Examples of sort(int[] a,int fromIndex,int toIndex)
   1: import java.io.IOException;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:     final void sort() {
   6:       Arrays.sort(_array, _index, _lastIndex);
   7:     }
   8: 
   9:     final void clear() {

View Full Code Here
   1: 
   2:             java.util.Arrays.sort(array, 0, count);
   3:         }
   4: 
   5:         buffer = new StringBuffer();

View Full Code Here
   1: 
   2:       java.util.Arrays.sort(allProgs,0,numProgs);
   3:       allDescription = new String[numProgs];
   4: 
   5:       for(int i=0;i<numProgs;i++)

View Full Code Here
   1: 
   2:     java.util.Arrays.sort(callout, 0, calloutCount);
   3:   }
   4: 
   5:   protected void formatPad(int numBlanks) {

View Full Code Here
   1: 
   2:             Arrays.sort(colList, 0, players.size());
   3:         }
   4: 
   5:         public void update()

View Full Code Here

sort

public static void sort(Object[] a)
Sorts the specified array of objects into ascending order, according to the natural ordering of its elements. All elements in the array must implement the Comparable interface. Furthermore, all elements in the array must be mutually comparable (that is, e1.compareTo(e2) must not throw a ClassCastException for any elements e1 and e2 in the array).

This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance.

Parameters:
a - the array to be sorted.
Throws:
ClassCastException - if the array contains elements that are not mutually comparable (for example, strings and integers).
See Also:
Comparable
Usages and Demos :

View More Examples of sort(Object[] a)
   1:         if (obj instanceof List){
   2:             Collections.sort((List)obj, comp);
   3:         } else if (obj instanceof Object[]){
   4:         ...
   5:             Arrays.sort((Object[])obj, comp);
   6:         } else if (obj instanceof int[]){
   7:         ...
   8:             Arrays.sort((int[])obj);
   9:         } else if (obj instanceof char[]){
  10:         ...
  11:             Arrays.sort((char[])obj);

View Full Code Here
   1: 
   2: import org.norther.tammi.acorn.util.converter.Arrays;
   3: 
   4:         ...
   5:         {
   6:             java.util.Collections.sort((List) source);
   7:         }
   8:         ...
   9:             source = new ArrayList((Collection) source);
  10:             java.util.Collections.sort((List) source);
  11:         }
  12:         ...
  13:         {
  14:             source = Arrays.toObject(source);

View Full Code Here

sort

public static void sort(Object[] a,
                        int fromIndex,
                        int toIndex)
Sorts the specified range of the specified array of objects into ascending order, according to the natural ordering of its elements. The range to be sorted extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be sorted is empty.) All elements in this range must implement the Comparable interface. Furthermore, all elements in this range must be mutually comparable (that is, e1.compareTo(e2) must not throw a ClassCastException for any elements e1 and e2 in the array).

This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance.

Parameters:
a - the array to be sorted.
fromIndex - the index of the first element (inclusive) to be sorted.
toIndex - the index of the last element (exclusive) to be sorted.
Throws:
IllegalArgumentException - if fromIndex > toIndex
ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length
ClassCastException - if the array contains elements that are not mutually comparable (for example, strings and integers).
See Also:
Comparable
Usages and Demos :

View More Examples of sort(Object[] a,int fromIndex,int toIndex)
   1: import java.io.IOException;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:     final void sort() {
   6:       Arrays.sort(_array, _index, _lastIndex);
   7:     }
   8: 
   9:     final void clear() {

View Full Code Here
   1: 
   2:             java.util.Arrays.sort(array, 0, count);
   3:         }
   4: 
   5:         buffer = new StringBuffer();

View Full Code Here
   1: 
   2:       java.util.Arrays.sort(allProgs,0,numProgs);
   3:       allDescription = new String[numProgs];
   4: 
   5:       for(int i=0;i<numProgs;i++)

View Full Code Here
   1: 
   2:     java.util.Arrays.sort(callout, 0, calloutCount);
   3:   }
   4: 
   5:   protected void formatPad(int numBlanks) {

View Full Code Here
   1: 
   2:             Arrays.sort(colList, 0, players.size());
   3:         }
   4: 
   5:         public void update()

View Full Code Here

sort

public static void sort(long[] a)
Sorts the specified array of longs into ascending numerical order. The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
Parameters:
a - the array to be sorted.
Usages and Demos :

View More Examples of sort(long[] a)
   1:         if (obj instanceof List){
   2:             Collections.sort((List)obj, comp);
   3:         } else if (obj instanceof Object[]){
   4:         ...
   5:             Arrays.sort((Object[])obj, comp);
   6:         } else if (obj instanceof int[]){
   7:         ...
   8:             Arrays.sort((int[])obj);
   9:         } else if (obj instanceof char[]){
  10:         ...
  11:             Arrays.sort((char[])obj);

View Full Code Here
   1: 
   2: import org.norther.tammi.acorn.util.converter.Arrays;
   3: 
   4:         ...
   5:         {
   6:             java.util.Collections.sort((List) source);
   7:         }
   8:         ...
   9:             source = new ArrayList((Collection) source);
  10:             java.util.Collections.sort((List) source);
  11:         }
  12:         ...
  13:         {
  14:             source = Arrays.toObject(source);

View Full Code Here

sort

public static void sort(long[] a,
                        int fromIndex,
                        int toIndex)
Sorts the specified range of the specified array of longs into ascending numerical order. The range to be sorted extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be sorted is empty.)

The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.

Parameters:
a - the array to be sorted.
fromIndex - the index of the first element (inclusive) to be sorted.
toIndex - the index of the last element (exclusive) to be sorted.
Throws:
IllegalArgumentException - if fromIndex > toIndex
ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length
Usages and Demos :

View More Examples of sort(long[] a,int fromIndex,int toIndex)
   1: import java.io.IOException;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:     final void sort() {
   6:       Arrays.sort(_array, _index, _lastIndex);
   7:     }
   8: 
   9:     final void clear() {

View Full Code Here
   1: 
   2:             java.util.Arrays.sort(array, 0, count);
   3:         }
   4: 
   5:         buffer = new StringBuffer();

View Full Code Here
   1: 
   2:       java.util.Arrays.sort(allProgs,0,numProgs);
   3:       allDescription = new String[numProgs];
   4: 
   5:       for(int i=0;i<numProgs;i++)

View Full Code Here
   1: 
   2:     java.util.Arrays.sort(callout, 0, calloutCount);
   3:   }
   4: 
   5:   protected void formatPad(int numBlanks) {

View Full Code Here
   1: 
   2:             Arrays.sort(colList, 0, players.size());
   3:         }
   4: 
   5:         public void update()

View Full Code Here

sort

public static void sort(short[] a)
Sorts the specified array of shorts into ascending numerical order. The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
Parameters:
a - the array to be sorted.
Usages and Demos :

View More Examples of sort(short[] a)
   1:         if (obj instanceof List){
   2:             Collections.sort((List)obj, comp);
   3:         } else if (obj instanceof Object[]){
   4:         ...
   5:             Arrays.sort((Object[])obj, comp);
   6:         } else if (obj instanceof int[]){
   7:         ...
   8:             Arrays.sort((int[])obj);
   9:         } else if (obj instanceof char[]){
  10:         ...
  11:             Arrays.sort((char[])obj);

View Full Code Here
   1: 
   2: import org.norther.tammi.acorn.util.converter.Arrays;
   3: 
   4:         ...
   5:         {
   6:             java.util.Collections.sort((List) source);
   7:         }
   8:         ...
   9:             source = new ArrayList((Collection) source);
  10:             java.util.Collections.sort((List) source);
  11:         }
  12:         ...
  13:         {
  14:             source = Arrays.toObject(source);

View Full Code Here

sort

public static void sort(short[] a,
                        int fromIndex,
                        int toIndex)
Sorts the specified range of the specified array of shorts into ascending numerical order. The range to be sorted extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be sorted is empty.)

The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.

Parameters:
a - the array to be sorted.
fromIndex - the index of the first element (inclusive) to be sorted.
toIndex - the index of the last element (exclusive) to be sorted.
Throws:
IllegalArgumentException - if fromIndex > toIndex
ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length
Usages and Demos :

View More Examples of sort(short[] a,int fromIndex,int toIndex)
   1: import java.io.IOException;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:     final void sort() {
   6:       Arrays.sort(_array, _index, _lastIndex);
   7:     }
   8: 
   9:     final void clear() {

View Full Code Here
   1: 
   2:             java.util.Arrays.sort(array, 0, count);
   3:         }
   4: 
   5:         buffer = new StringBuffer();

View Full Code Here
   1: 
   2:       java.util.Arrays.sort(allProgs,0,numProgs);
   3:       allDescription = new String[numProgs];
   4: 
   5:       for(int i=0;i<numProgs;i++)

View Full Code Here
   1: 
   2:     java.util.Arrays.sort(callout, 0, calloutCount);
   3:   }
   4: 
   5:   protected void formatPad(int numBlanks) {

View Full Code Here
   1: 
   2:             Arrays.sort(colList, 0, players.size());
   3:         }
   4: 
   5:         public void update()

View Full Code Here

toString

public static String toString(boolean[] a)
Returns a string representation of the contents of the specified array. The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(boolean). Returns "null" if a is null.
Parameters:
a - the array whose string representation to return
Returns:
a string representation of a
Since:
1.5
Usages and Demos :

View More Examples of toString(boolean[] a)
   1:   public String process(Object input) {
   2:     return Arrays.toString(((String)input).split(" "));
   3:   }    

View Full Code Here
   1:   String process(Object input) {
   2:     return Arrays.toString(((String)input).split(" "));
   3:   }
   4: }    

View Full Code Here
   1: import java.lang.reflect.Proxy;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:         if (o1 instanceof boolean[] && o2 instanceof boolean[])
   6:             return Arrays.equals((boolean[]) o1, (boolean[]) o2);
   7: 
   8:         ...
   9:         if (o1 instanceof byte[] && o2 instanceof byte[])
  10:             return Arrays.equals((byte[]) o1, (byte[]) o2);
  11: 
  12:         ...
  13:         if (obj instanceof boolean[])
  14:             return Arrays.toString((boolean[]) obj);

View Full Code Here
   1:       throw new Error ("can't find method " + method_name + " " +
   2:                        Arrays.toString(arg_classes) + " " + classes + " " +
   3:         ...
   4:                        invoke.toString(pool.getConstantPool()) , e);
   5:     }
   6: 
   7:     return (Modifier.isNative (modifiers));

View Full Code Here

toString

public static String toString(byte[] a)
Returns a string representation of the contents of the specified array. The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(byte). Returns "null" if a is null.
Parameters:
a - the array whose string representation to return
Returns:
a string representation of a
Since:
1.5
Usages and Demos :

View More Examples of toString(byte[] a)
   1:   public String process(Object input) {
   2:     return Arrays.toString(((String)input).split(" "));
   3:   }    

View Full Code Here
   1:   String process(Object input) {
   2:     return Arrays.toString(((String)input).split(" "));
   3:   }
   4: }    

View Full Code Here
   1: import java.lang.reflect.Proxy;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:         if (o1 instanceof boolean[] && o2 instanceof boolean[])
   6:             return Arrays.equals((boolean[]) o1, (boolean[]) o2);
   7: 
   8:         ...
   9:         if (o1 instanceof byte[] && o2 instanceof byte[])
  10:             return Arrays.equals((byte[]) o1, (byte[]) o2);
  11: 
  12:         ...
  13:         if (obj instanceof boolean[])
  14:             return Arrays.toString((boolean[]) obj);

View Full Code Here
   1:       throw new Error ("can't find method " + method_name + " " +
   2:                        Arrays.toString(arg_classes) + " " + classes + " " +
   3:         ...
   4:                        invoke.toString(pool.getConstantPool()) , e);
   5:     }
   6: 
   7:     return (Modifier.isNative (modifiers));

View Full Code Here

toString

public static String toString(char[] a)
Returns a string representation of the contents of the specified array. The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(char). Returns "null" if a is null.
Parameters:
a - the array whose string representation to return
Returns:
a string representation of a
Since:
1.5
Usages and Demos :

View More Examples of toString(char[] a)
   1:   public String process(Object input) {
   2:     return Arrays.toString(((String)input).split(" "));
   3:   }    

View Full Code Here
   1:   String process(Object input) {
   2:     return Arrays.toString(((String)input).split(" "));
   3:   }
   4: }    

View Full Code Here
   1: import java.lang.reflect.Proxy;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:         if (o1 instanceof boolean[] && o2 instanceof boolean[])
   6:             return Arrays.equals((boolean[]) o1, (boolean[]) o2);
   7: 
   8:         ...
   9:         if (o1 instanceof byte[] && o2 instanceof byte[])
  10:             return Arrays.equals((byte[]) o1, (byte[]) o2);
  11: 
  12:         ...
  13:         if (obj instanceof boolean[])
  14:             return Arrays.toString((boolean[]) obj);

View Full Code Here
   1:       throw new Error ("can't find method " + method_name + " " +
   2:                        Arrays.toString(arg_classes) + " " + classes + " " +
   3:         ...
   4:                        invoke.toString(pool.getConstantPool()) , e);
   5:     }
   6: 
   7:     return (Modifier.isNative (modifiers));

View Full Code Here

toString

public static String toString(double[] a)
Returns a string representation of the contents of the specified array. The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(double). Returns "null" if a is null.
Parameters:
a - the array whose string representation to return
Returns:
a string representation of a
Since:
1.5
Usages and Demos :

View More Examples of toString(double[] a)
   1:   public String process(Object input) {
   2:     return Arrays.toString(((String)input).split(" "));
   3:   }    

View Full Code Here
   1:   String process(Object input) {
   2:     return Arrays.toString(((String)input).split(" "));
   3:   }
   4: }    

View Full Code Here
   1: import java.lang.reflect.Proxy;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:         if (o1 instanceof boolean[] && o2 instanceof boolean[])
   6:             return Arrays.equals((boolean[]) o1, (boolean[]) o2);
   7: 
   8:         ...
   9:         if (o1 instanceof byte[] && o2 instanceof byte[])
  10:             return Arrays.equals((byte[]) o1, (byte[]) o2);
  11: 
  12:         ...
  13:         if (obj instanceof boolean[])
  14:             return Arrays.toString((boolean[]) obj);

View Full Code Here
   1:       throw new Error ("can't find method " + method_name + " " +
   2:                        Arrays.toString(arg_classes) + " " + classes + " " +
   3:         ...
   4:                        invoke.toString(pool.getConstantPool()) , e);
   5:     }
   6: 
   7:     return (Modifier.isNative (modifiers));

View Full Code Here

toString

public static String toString(float[] a)
Returns a string representation of the contents of the specified array. The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(float). Returns "null" if a is null.
Parameters:
a - the array whose string representation to return
Returns:
a string representation of a
Since:
1.5
Usages and Demos :

View More Examples of toString(float[] a)
   1:   public String process(Object input) {
   2:     return Arrays.toString(((String)input).split(" "));
   3:   }    

View Full Code Here
   1:   String process(Object input) {
   2:     return Arrays.toString(((String)input).split(" "));
   3:   }
   4: }    

View Full Code Here
   1: import java.lang.reflect.Proxy;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:         if (o1 instanceof boolean[] && o2 instanceof boolean[])
   6:             return Arrays.equals((boolean[]) o1, (boolean[]) o2);
   7: 
   8:         ...
   9:         if (o1 instanceof byte[] && o2 instanceof byte[])
  10:             return Arrays.equals((byte[]) o1, (byte[]) o2);
  11: 
  12:         ...
  13:         if (obj instanceof boolean[])
  14:             return Arrays.toString((boolean[]) obj);

View Full Code Here
   1:       throw new Error ("can't find method " + method_name + " " +
   2:                        Arrays.toString(arg_classes) + " " + classes + " " +
   3:         ...
   4:                        invoke.toString(pool.getConstantPool()) , e);
   5:     }
   6: 
   7:     return (Modifier.isNative (modifiers));

View Full Code Here

toString

public static String toString(int[] a)
Returns a string representation of the contents of the specified array. The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(int). Returns "null" if a is null.
Parameters:
a - the array whose string representation to return
Returns:
a string representation of a
Since:
1.5
Usages and Demos :

View More Examples of toString(int[] a)
   1:   public String process(Object input) {
   2:     return Arrays.toString(((String)input).split(" "));
   3:   }    

View Full Code Here
   1:   String process(Object input) {
   2:     return Arrays.toString(((String)input).split(" "));
   3:   }
   4: }    

View Full Code Here
   1: import java.lang.reflect.Proxy;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:         if (o1 instanceof boolean[] && o2 instanceof boolean[])
   6:             return Arrays.equals((boolean[]) o1, (boolean[]) o2);
   7: 
   8:         ...
   9:         if (o1 instanceof byte[] && o2 instanceof byte[])
  10:             return Arrays.equals((byte[]) o1, (byte[]) o2);
  11: 
  12:         ...
  13:         if (obj instanceof boolean[])
  14:             return Arrays.toString((boolean[]) obj);

View Full Code Here
   1:       throw new Error ("can't find method " + method_name + " " +
   2:                        Arrays.toString(arg_classes) + " " + classes + " " +
   3:         ...
   4:                        invoke.toString(pool.getConstantPool()) , e);
   5:     }
   6: 
   7:     return (Modifier.isNative (modifiers));

View Full Code Here

toString

public static String toString(Object[] a)
Returns a string representation of the contents of the specified array. If the array contains other arrays as elements, they are converted to strings by the Object.toString() method inherited from Object, which describes their identities rather than their contents.

The value returned by this method is equal to the value that would be returned by Arrays.asList(a).toString(), unless a is null, in which case "null" is returned.

Parameters:
a - the array whose string representation to return
Returns:
a string representation of a
Since:
1.5
Usages and Demos :

View More Examples of toString(Object[] a)
   1:   public String process(Object input) {
   2:     return Arrays.toString(((String)input).split(" "));
   3:   }    

View Full Code Here
   1:   String process(Object input) {
   2:     return Arrays.toString(((String)input).split(" "));
   3:   }
   4: }    

View Full Code Here
   1: import java.lang.reflect.Proxy;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:         if (o1 instanceof boolean[] && o2 instanceof boolean[])
   6:             return Arrays.equals((boolean[]) o1, (boolean[]) o2);
   7: 
   8:         ...
   9:         if (o1 instanceof byte[] && o2 instanceof byte[])
  10:             return Arrays.equals((byte[]) o1, (byte[]) o2);
  11: 
  12:         ...
  13:         if (obj instanceof boolean[])
  14:             return Arrays.toString((boolean[]) obj);

View Full Code Here
   1:       throw new Error ("can't find method " + method_name + " " +
   2:                        Arrays.toString(arg_classes) + " " + classes + " " +
   3:         ...
   4:                        invoke.toString(pool.getConstantPool()) , e);
   5:     }
   6: 
   7:     return (Modifier.isNative (modifiers));

View Full Code Here

toString

public static String toString(long[] a)
Returns a string representation of the contents of the specified array. The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(long). Returns "null" if a is null.
Parameters:
a - the array whose string representation to return
Returns:
a string representation of a
Since:
1.5
Usages and Demos :

View More Examples of toString(long[] a)
   1:   public String process(Object input) {
   2:     return Arrays.toString(((String)input).split(" "));
   3:   }    

View Full Code Here
   1:   String process(Object input) {
   2:     return Arrays.toString(((String)input).split(" "));
   3:   }
   4: }    

View Full Code Here
   1: import java.lang.reflect.Proxy;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:         if (o1 instanceof boolean[] && o2 instanceof boolean[])
   6:             return Arrays.equals((boolean[]) o1, (boolean[]) o2);
   7: 
   8:         ...
   9:         if (o1 instanceof byte[] && o2 instanceof byte[])
  10:             return Arrays.equals((byte[]) o1, (byte[]) o2);
  11: 
  12:         ...
  13:         if (obj instanceof boolean[])
  14:             return Arrays.toString((boolean[]) obj);

View Full Code Here
   1:       throw new Error ("can't find method " + method_name + " " +
   2:                        Arrays.toString(arg_classes) + " " + classes + " " +
   3:         ...
   4:                        invoke.toString(pool.getConstantPool()) , e);
   5:     }
   6: 
   7:     return (Modifier.isNative (modifiers));

View Full Code Here

toString

public static String toString(short[] a)
Returns a string representation of the contents of the specified array. The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(short). Returns "null" if a is null.
Parameters:
a - the array whose string representation to return
Returns:
a string representation of a
Since:
1.5
Usages and Demos :

View More Examples of toString(short[] a)
   1:   public String process(Object input) {
   2:     return Arrays.toString(((String)input).split(" "));
   3:   }    

View Full Code Here
   1:   String process(Object input) {
   2:     return Arrays.toString(((String)input).split(" "));
   3:   }
   4: }    

View Full Code Here
   1: import java.lang.reflect.Proxy;
   2: import java.util.Arrays;
   3: import java.util.Iterator;
   4:         ...
   5:         if (o1 instanceof boolean[] && o2 instanceof boolean[])
   6:             return Arrays.equals((boolean[]) o1, (boolean[]) o2);
   7: 
   8:         ...
   9:         if (o1 instanceof byte[] && o2 instanceof byte[])
  10:             return Arrays.equals((byte[]) o1, (byte[]) o2);
  11: 
  12:         ...
  13:         if (obj instanceof boolean[])
  14:             return Arrays.toString((boolean[]) obj);

View Full Code Here
   1:       throw new Error ("can't find method " + method_name + " " +
   2:                        Arrays.toString(arg_classes) + " " + classes + " " +
   3:         ...
   4:                        invoke.toString(pool.getConstantPool()) , e);
   5:     }
   6: 
   7:     return (Modifier.isNative (modifiers));

View Full Code Here

void sort

public static  void sort(T[] a,
                            T> c)
Sorts the specified array of objects according to the order induced by the specified comparator. All elements in the array must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the array).

This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance.

Parameters:
a - the array to be sorted.
c - the comparator to determine the order of the array. A null value indicates that the elements' natural ordering should be used.
Throws:
ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.
See Also:
Comparator

void sort

public static  void sort(T[] a,
                            int fromIndex,
                            int toIndex,
                            T> c)
Sorts the specified range of the specified array of objects according to the order induced by the specified comparator. The range to be sorted extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be sorted is empty.) All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).

This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance.

Parameters:
a - the array to be sorted.
fromIndex - the index of the first element (inclusive) to be sorted.
toIndex - the index of the last element (exclusive) to be sorted.
c - the comparator to determine the order of the array. A null value indicates that the elements' natural ordering should be used.
Throws:
ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.
IllegalArgumentException - if fromIndex > toIndex
ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length
See Also:
Comparator