|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object net.sf.ivmaidns.util.CharVector
public final class CharVector
Class for 'char' array wrappers.
This class wraps a primitive char
-type array, and
has the possibility to resize (when required) the wrapped array.
This class supports cloning, serialization and comparison of its
instances. In addition, the class contains static
methods for char
arrays resizing, filling in,
reversing, non-zero elements counting, sorting, linear/binary
searching in for a value or sequence, case-sensitive or
case-insensitive 'less-equal-greater' comparison, mismatches
counting and hashing.
ByteVector
,
DoubleVector
,
FloatVector
,
IntVector
,
LongVector
,
ShortVector
,
BooleanVector
,
ObjectVector
,
StrComparator
,
Serialized FormField Summary | |
---|---|
protected char[] |
array
The wrapped (encapsulated) custom char array. |
protected static char[] |
EMPTY
A constant initialized with an instance of empty char array. |
Constructor Summary | |
---|---|
CharVector()
Constructs an empty char vector. |
|
CharVector(char[] array)
Constructs a new char array wrapper. |
|
CharVector(int size)
Constructs a new char vector of the specified
length. |
Method Summary | |
---|---|
char[] |
array()
Returns array wrapped by this vector. |
static int |
binarySearch(char[] array,
int offset,
int len,
char value)
Searches (fast) for value in a given sorted array. |
java.lang.Object |
clone()
Creates and returns a copy of this object. |
static int |
compare(char[] arrayA,
int offsetA,
int lenA,
char[] arrayB,
int offsetB,
int lenB,
boolean ignoreCase)
Compares two given array regions. |
void |
copyAt(int srcOffset,
int destOffset,
int len)
Copies a region of values at one offset to another offset in this vector. |
static void |
counterSort(char[] array,
int offset,
int len)
Sorts the elements in the region of a given array by counting the amount of each possible value in it. |
static int |
countNonZero(char[] array)
Count non-zero elements in a given array. |
static char[] |
ensureSize(char[] array,
int size)
Ensures the length (capacity) of a given array. |
void |
ensureSize(int size)
Ensures the size (capacity) of this vector. |
static boolean |
equals(char[] arrayA,
char[] arrayB)
Tests whether or not the specified two arrays are equal. |
boolean |
equals(java.lang.Object obj)
Indicates whether this object is equal to the
specified one. |
static void |
fill(char[] array,
int offset,
int len,
char value)
Fills in the region of a given array with the specified value. |
java.lang.Object |
getAt(int index)
Returns the wrapped value of the element at the specified index. |
char |
getCharAt(int index)
Returns value of the element at the specified index. |
boolean |
greaterThan(java.lang.Object obj)
Tests for being semantically greater than the argument. |
int |
hashCode()
Computes and returns a hash code value for the object. |
static int |
hashCode(char[] array,
boolean ignoreCase)
Produces a hash code value for a given array. |
static int |
indexOf(char[] subArray,
int offset,
int len,
int index,
char[] array,
boolean ignoreCase)
Searches forward for the specified sequence in a given array. |
static int |
indexOf(char value,
int index,
char[] array,
boolean ignoreCase)
Searches forward for value in a given array. |
void |
integrityCheck()
Verifies this object for its integrity. |
static int |
lastIndexOf(char[] subArray,
int offset,
int len,
int index,
char[] array,
boolean ignoreCase)
Searches backward for the specified sequence in a given array. |
static int |
lastIndexOf(char value,
int index,
char[] array,
boolean ignoreCase)
Searches backward for value in a given array. |
int |
length()
Returns the number of elements in this vector. |
static int |
mismatches(char[] arrayA,
int offsetA,
char[] arrayB,
int offsetB,
int len,
boolean ignoreCase)
Count the mismatches of two given array regions. |
static void |
quickSort(char[] array,
int offset,
int len)
Sorts the elements in the region of a given array using 'Quick' algorithm. |
static char[] |
resize(char[] array,
int size)
Resizes a given array. |
void |
resize(int size)
Resizes this vector. |
static void |
reverse(char[] array)
Reverses the elements order in a given array. |
void |
setArray(char[] array)
Sets another array to be wrapped by this vector. |
void |
setAt(int index,
char value)
Assigns a new value to the element at the specified index. |
java.lang.String |
toString()
Converts this character vector to a string. |
Methods inherited from class java.lang.Object |
---|
finalize, getClass, notify, notifyAll, wait, wait, wait |
Field Detail |
---|
protected static final char[] EMPTY
char
array.
array
protected char[] array
char
array.
array must be non-null
.
EMPTY
,
CharVector()
,
CharVector(int)
,
CharVector(char[])
,
setArray(char[])
,
array()
,
length()
,
resize(int)
,
ensureSize(int)
,
setAt(int, char)
,
getCharAt(int)
,
copyAt(int, int, int)
,
clone()
,
integrityCheck()
Constructor Detail |
---|
public CharVector()
char
vector.
This constructor is used for the creation of a resizable vector.
The length of such a vector is changed only by
resize(int)
and ensureSize(int)
methods.
CharVector(int)
,
CharVector(char[])
,
array()
,
length()
,
resize(int)
,
ensureSize(int)
,
setAt(int, char)
,
getCharAt(int)
,
copyAt(int, int, int)
,
clone()
,
toString()
public CharVector(int size)
char
vector of the specified
length.
This constructor is typically used for the creation of a vector
with a fixed size. All elements of the created vector are set to
zero.
size
- the initial length (unsigned) of the vector to be created.
java.lang.OutOfMemoryError
- if there is not enough memory.CharVector()
,
CharVector(char[])
,
array()
,
length()
,
setAt(int, char)
,
getCharAt(int)
,
copyAt(int, int, int)
,
fill(char[], int, int, char)
,
clone()
,
toString()
public CharVector(char[] array) throws java.lang.NullPointerException
char
array wrapper.
This constructor is used for the creation of a vector which wraps
the specified array (without copying it). The wrapped array may
be further replaced with another one only by
setArray(char[])
and by resize(int)
,
ensureSize(int)
methods.
array
- the char
array (must be non-null
) to be
wrapped.
java.lang.NullPointerException
- if array is null
.CharVector()
,
CharVector(int)
,
setArray(char[])
,
array()
,
resize(int)
,
ensureSize(int)
,
setAt(int, char)
,
getCharAt(int)
,
copyAt(int, int, int)
,
clone()
,
toString()
Method Detail |
---|
public void setArray(char[] array) throws java.lang.NullPointerException
this
vector.
Important notes: resize(int)
and
ensureSize(int)
methods may change the array to be
wrapped too (but only with its copy of a different length); this
method does not copy array. If an exception is thrown
then this
vector remains unchanged.
array
- the char
array (must be non-null
) to be
wrapped.
java.lang.NullPointerException
- if array is null
.CharVector()
,
CharVector(char[])
,
array()
,
resize(int)
,
ensureSize(int)
,
setAt(int, char)
,
getCharAt(int)
,
copyAt(int, int, int)
,
clone()
public final char[] array()
this
vector.
Important notes: this method does not copy array.
char
array (not null
), which is
wrapped.CharVector(char[])
,
setArray(char[])
,
length()
,
resize(int)
,
ensureSize(int)
,
copyAt(int, int, int)
,
clone()
public int length()
this
vector.
The result is the same as length
of
array()
.
length
in interface Indexable
this
vector.setArray(char[])
,
array()
,
setAt(int, char)
,
resize(int)
,
ensureSize(int)
,
getCharAt(int)
,
getAt(int)
public java.lang.Object getAt(int index) throws java.lang.ArrayIndexOutOfBoundsException
new Character(array()[index])
.
getAt
in interface Indexable
index
- the index (must be in the range) at which to return an element.
Character
) at
index.
java.lang.ArrayIndexOutOfBoundsException
- if index is negative or is not less than
length()
.
java.lang.OutOfMemoryError
- if there is not enough memory.getCharAt(int)
,
array()
,
length()
public final char getCharAt(int index) throws java.lang.ArrayIndexOutOfBoundsException
array()[index]
.
index
- the index (must be in the range) at which to return an element.
char
element at index.
java.lang.ArrayIndexOutOfBoundsException
- if index is negative or is not less than
length()
.array()
,
length()
,
setAt(int, char)
,
resize(int)
,
ensureSize(int)
public void setAt(int index, char value) throws java.lang.ArrayIndexOutOfBoundsException
this
vector remains
unchanged.
index
- the index (must be in the range) at which to assign a new value.value
- the value to be assigned.
java.lang.ArrayIndexOutOfBoundsException
- if index is negative or is not less than
length()
.setArray(char[])
,
array()
,
length()
,
getCharAt(int)
,
resize(int)
,
ensureSize(int)
,
copyAt(int, int, int)
,
fill(char[], int, int, char)
public void copyAt(int srcOffset, int destOffset, int len) throws java.lang.ArrayIndexOutOfBoundsException
this
vector.
Copying is performed here through
arraycopy(Object, int, Object, int, int)
method of
System
class. Negative len is treated as
zero. If an exception is thrown then this
vector
remains unchanged.
srcOffset
- the source first index (must be in the range) of the region to be
copied.destOffset
- the first index (must be in the range) of the region copy
destination.len
- the length of the region to be copied.
java.lang.ArrayIndexOutOfBoundsException
- if len is positive and (srcOffset is
negative or is greater than length()
minus
len, or destOffset is negative or is
greater than length()
minus len).array()
,
length()
,
setAt(int, char)
,
getCharAt(int)
,
resize(int)
,
ensureSize(int)
public void resize(int size)
this
vector.
The result is the same as of
setArray(resize(array(), size))
. This method changes
the length of this
vector to the specified one.
Important notes: if size (length) of the vector grows then its
new elements are set to zero. If an exception is thrown then
this
vector remains unchanged.
size
- the (unsigned) length of this
vector to set.
java.lang.OutOfMemoryError
- if there is not enough memory.CharVector(int)
,
setArray(char[])
,
array()
,
length()
,
ensureSize(int)
,
resize(char[], int)
public void ensureSize(int size)
this
vector.
The result is the same as of
setArray(ensureSize(array(), size))
. This method
changes (only if size is greater than
length()
) the length of this
vector to
a value not less than size. Important notes: if size
(length) of the vector grows then its new elements are set to
zero. If an exception is thrown then this
vector
remains unchanged.
size
- the (unsigned) length of this
vector to be ensured.
java.lang.OutOfMemoryError
- if there is not enough memory.array()
,
length()
,
setAt(int, char)
,
resize(int)
,
ensureSize(char[], int)
public static final char[] resize(char[] array, int size) throws java.lang.NullPointerException
length
of array is the same as
size then array is returned else
array content is copied into the result (all new
elements are set to zero).
array
- the array (must be non-null
) to be resized.size
- the (unsigned) length of the array to set.
null
, with
length
equal to size).
java.lang.NullPointerException
- if array is null
.
java.lang.OutOfMemoryError
- if there is not enough memory.resize(int)
,
ensureSize(char[], int)
,
fill(char[], int, int, char)
public static final char[] ensureSize(char[] array, int size) throws java.lang.NullPointerException
length
of array) the length of
array. Important notes: array elements are
not changed; if length
of array is
greater or the same as size then array is
returned else array content is copied into the result
(all new elements are set to zero).
array
- the array (must be non-null
) to be length-ensured.size
- the (unsigned) length of the array to ensure.
null
, with
length
not less than size).
java.lang.NullPointerException
- if array is null
.
java.lang.OutOfMemoryError
- if there is not enough memory.ensureSize(int)
,
resize(char[], int)
,
fill(char[], int, int, char)
public static final void fill(char[] array, int offset, int len, char value) throws java.lang.NullPointerException, java.lang.ArrayIndexOutOfBoundsException
arraycopy(Object, int, Object, int, int)
method of
System
class.
array
- the array (must be non-null
) to be filled in.offset
- the first index (must be in the range) of the region to fill in.len
- the length of the region to be filled.value
- the value to fill with.
java.lang.NullPointerException
- if array is null
.
java.lang.ArrayIndexOutOfBoundsException
- if len is positive and (offset is negative
or is greater than length
of array minus
len).array()
,
copyAt(int, int, int)
,
indexOf(char[], int, int, int, char[], boolean)
,
lastIndexOf(char[], int, int, int, char[], boolean)
,
quickSort(char[], int, int)
,
binarySearch(char[], int, int, char)
public static final void reverse(char[] array) throws java.lang.NullPointerException
array
- the array (must be non-null
) to be reversed.
java.lang.NullPointerException
- if array is null
.array()
,
countNonZero(char[])
,
indexOf(char, int, char[], boolean)
,
lastIndexOf(char, int, char[], boolean)
,
hashCode(char[], boolean)
,
equals(char[], char[])
,
compare(char[], int, int, char[], int, int, boolean)
,
mismatches(char[], int, char[], int, int, boolean)
public static final int countNonZero(char[] array) throws java.lang.NullPointerException
array
- the array (must be non-null
) to count non-zero
elements in.
length
of array) of non-zero elements.
java.lang.NullPointerException
- if array is null
.array()
,
fill(char[], int, int, char)
,
equals(char[], char[])
,
compare(char[], int, int, char[], int, int, boolean)
,
mismatches(char[], int, char[], int, int, boolean)
public static final int indexOf(char value, int index, char[] array, boolean ignoreCase) throws java.lang.NullPointerException
length
of
array. Characters case is ignored only if
ignoreCase. If value is not found then the
result is -1
.
value
- the character to sequentially search for.index
- the first index, from which to begin forward searching.array
- the array (must be non-null
) to be searched in.ignoreCase
- true
if and only if characters case is ignored.
-1
(if not found).
java.lang.NullPointerException
- if array is null
.array()
,
lastIndexOf(char, int, char[], boolean)
,
indexOf(char[], int, int, int, char[], boolean)
,
binarySearch(char[], int, int, char)
,
equals(char[], char[])
,
compare(char[], int, int, char[], int, int, boolean)
public static final int lastIndexOf(char value, int index, char[] array, boolean ignoreCase) throws java.lang.NullPointerException
-1
, too big
index is treated as length
of
array minus one. Characters case is ignored only if
ignoreCase. If value is not found then the
result is -1
.
value
- the character to sequentially search for.index
- the first index, from which to begin backward searching.array
- the array (must be non-null
) to be searched in.ignoreCase
- true
if and only if characters case is ignored.
-1
(if not found).
java.lang.NullPointerException
- if array is null
.array()
,
indexOf(char, int, char[], boolean)
,
lastIndexOf(char[], int, int, int, char[], boolean)
,
binarySearch(char[], int, int, char)
,
reverse(char[])
,
equals(char[], char[])
,
compare(char[], int, int, char[], int, int, boolean)
public static final int indexOf(char[] subArray, int offset, int len, int index, char[] array, boolean ignoreCase) throws java.lang.NullPointerException, java.lang.ArrayIndexOutOfBoundsException
length
of array. Characters
case is ignored only if ignoreCase. If the sequence is
not found then the result is -1
.
subArray
- the array (must be non-null
) specifying the sequence
of characters to search for.offset
- the offset (must be in the range) of the sequence in
subArray.len
- the length of the sequence.index
- the first index, from which to begin forward searching.array
- the array (must be non-null
) to be searched in.ignoreCase
- true
if and only if characters case is ignored.
-1
(if not found).
java.lang.NullPointerException
- if subArray is null
or array
is null
.
java.lang.ArrayIndexOutOfBoundsException
- if len is positive and (offset is negative
or is greater than length
of subArray
minus len).array()
,
indexOf(char, int, char[], boolean)
,
lastIndexOf(char[], int, int, int, char[], boolean)
,
equals(char[], char[])
,
compare(char[], int, int, char[], int, int, boolean)
public static final int lastIndexOf(char[] subArray, int offset, int len, int index, char[] array, boolean ignoreCase) throws java.lang.NullPointerException, java.lang.ArrayIndexOutOfBoundsException
-1
, too big
index is treated as length
of
array minus one. Characters case is ignored only if
ignoreCase. If the sequence is not found then the
result is -1
.
subArray
- the array (must be non-null
) specifying the sequence
of characters to search for.offset
- the offset (must be in the range) of the sequence in
subArray.len
- the length of the sequence.index
- the first index, from which to begin backward searching.array
- the array (must be non-null
) to be searched in.ignoreCase
- true
if and only if characters case is ignored.
-1
(if not found).
java.lang.NullPointerException
- if subArray is null
or array
is null
.
java.lang.ArrayIndexOutOfBoundsException
- if len is positive and (offset is negative
or is greater than length
of subArray
minus len).array()
,
lastIndexOf(char, int, char[], boolean)
,
indexOf(char[], int, int, int, char[], boolean)
,
equals(char[], char[])
,
compare(char[], int, int, char[], int, int, boolean)
public static final int hashCode(char[] array, boolean ignoreCase) throws java.lang.NullPointerException
array
- the array (must be non-null
) to evaluate hash of.ignoreCase
- true
if and only if characters case is ignored.
java.lang.NullPointerException
- if array is null
.array()
,
hashCode()
,
fill(char[], int, int, char)
,
reverse(char[])
,
countNonZero(char[])
,
indexOf(char, int, char[], boolean)
,
lastIndexOf(char, int, char[], boolean)
,
equals(char[], char[])
,
compare(char[], int, int, char[], int, int, boolean)
,
mismatches(char[], int, char[], int, int, boolean)
public static final boolean equals(char[] arrayA, char[] arrayB) throws java.lang.NullPointerException
true
if and only if both of the
arrays are of the same length and all the characters of the first
array are equal to the corresponding characters of the second
array (matching their case).
arrayA
- the first array (must be non-null
) to be compared.arrayB
- the second array (must be non-null
) to compare with.
true
if and only if arrayA content is the
same as arrayB content.
java.lang.NullPointerException
- if arrayA is null
or arrayB is
null
.array()
,
equals(java.lang.Object)
,
fill(char[], int, int, char)
,
reverse(char[])
,
countNonZero(char[])
,
indexOf(char, int, char[], boolean)
,
lastIndexOf(char, int, char[], boolean)
,
indexOf(char[], int, int, int, char[], boolean)
,
lastIndexOf(char[], int, int, int, char[], boolean)
,
hashCode(char[], boolean)
,
compare(char[], int, int, char[], int, int, boolean)
,
mismatches(char[], int, char[], int, int, boolean)
public static final int mismatches(char[] arrayA, int offsetA, char[] arrayB, int offsetB, int len, boolean ignoreCase) throws java.lang.NullPointerException, java.lang.ArrayIndexOutOfBoundsException
arrayA
- the first array (must be non-null
) to be compared.offsetA
- the first index (must be in the range) of the first region.arrayB
- the second array (must be non-null
) to compare with.offsetB
- the first index (must be in the range) of the second region.len
- the length of the regions.ignoreCase
- true
if and only if characters case is ignored.
java.lang.NullPointerException
- if arrayA is null
or arrayB is
null
.
java.lang.ArrayIndexOutOfBoundsException
- if len is positive and (offsetA is negative
or is greater than length
of arrayA minus
len, or offsetB is negative or is greater
than length
of arrayB minus
len).array()
,
fill(char[], int, int, char)
,
reverse(char[])
,
countNonZero(char[])
,
hashCode(char[], boolean)
,
equals(char[], char[])
,
compare(char[], int, int, char[], int, int, boolean)
public static final int compare(char[] arrayA, int offsetA, int lenA, char[] arrayB, int offsetB, int lenB, boolean ignoreCase) throws java.lang.NullPointerException, java.lang.ArrayIndexOutOfBoundsException
arrayA
- the first array (must be non-null
) to be compared.offsetA
- the first index (must be in the range) of the first region.lenA
- the length of the first region.arrayB
- the second array (must be non-null
) to compare with.offsetB
- the first index (must be in the range) of the second region.lenB
- the length of the second region.ignoreCase
- true
if and only if characters case is ignored.
java.lang.NullPointerException
- if arrayA is null
or arrayB is
null
.
java.lang.ArrayIndexOutOfBoundsException
- if lenA is positive and (offsetA is
negative or is greater than length
of
arrayA minus lenA), or if lenB
is positive and (offsetB is negative or is greater
than length
of arrayB minus
lenB).array()
,
greaterThan(java.lang.Object)
,
fill(char[], int, int, char)
,
reverse(char[])
,
indexOf(char, int, char[], boolean)
,
lastIndexOf(char, int, char[], boolean)
,
hashCode(char[], boolean)
,
equals(char[], char[])
,
mismatches(char[], int, char[], int, int, boolean)
public static final void quickSort(char[] array, int offset, int len) throws java.lang.NullPointerException, java.lang.ArrayIndexOutOfBoundsException
O(log(len) * len)
typically, but may be of
O(len * len)
in the worst case (which is rare, in
fact). Negative len is treated as zero. If an
exception is thrown then array remains unchanged. Else
the region content is altered.
array
- the array (must be non-null
) to be sorted.offset
- the first index (must be in the range) of the region to sort.len
- the length of the region to sort.
java.lang.NullPointerException
- if array is null
.
java.lang.ArrayIndexOutOfBoundsException
- if len is positive and (offset is negative
or is greater than length
of array minus
len).
java.lang.OutOfMemoryError
- if there is not enough memory.array()
,
counterSort(char[], int, int)
,
binarySearch(char[], int, int, char)
,
fill(char[], int, int, char)
public static final void counterSort(char[] array, int offset, int len) throws java.lang.NullPointerException, java.lang.ArrayIndexOutOfBoundsException
(CHAR_MASK + 1)
(or (BYTE_MASK + 1)
if
all characters in the region are bytes) integer values is
allocated. The algorithm cost is linear but only for large
regions. Negative len is treated as zero. If an
exception is thrown then array remains unchanged. Else
the region content is altered.
array
- the array (must be non-null
) to be sorted.offset
- the first index (must be in the range) of the region to sort.len
- the length of the region to sort.
java.lang.NullPointerException
- if array is null
.
java.lang.ArrayIndexOutOfBoundsException
- if len is positive and (offset is negative
or is greater than length
of array minus
len).
java.lang.OutOfMemoryError
- if there is not enough memory.array()
,
quickSort(char[], int, int)
,
binarySearch(char[], int, int, char)
,
fill(char[], int, int, char)
public static final int binarySearch(char[] array, int offset, int len, char value) throws java.lang.NullPointerException, java.lang.ArrayIndexOutOfBoundsException
O(log(len))
. Negative len is treated as
zero. If value is not found then
(-result - 1)
is the offset of the insertion point
for value.
array
- the sorted array (must be non-null
) to be searched
in.offset
- the first index (must be in the range) of the region to search
in.len
- the length of the region to search in.value
- the case-sensitive value to search for.
(-insertionOffset - 1)
(a negative integer) if not
found.
java.lang.NullPointerException
- if array is null
.
java.lang.ArrayIndexOutOfBoundsException
- if len is positive and (offset is negative
or is greater than length
of array minus
len).array()
,
indexOf(char, int, char[], boolean)
,
lastIndexOf(char, int, char[], boolean)
,
quickSort(char[], int, int)
,
counterSort(char[], int, int)
,
fill(char[], int, int, char)
public java.lang.Object clone()
this
object.
This method creates a new instance of the class of this object
and initializes its array with a copy of
array of this
vector.
clone
in interface ReallyCloneable
clone
in class java.lang.Object
null
and != this
) of
this
instance.
java.lang.OutOfMemoryError
- if there is not enough memory.CharVector()
,
array()
,
getCharAt(int)
,
equals(java.lang.Object)
public int hashCode()
this
vector to produce a single hash code value.
hashCode
in class java.lang.Object
this
object.hashCode(char[], boolean)
,
array()
,
length()
,
getCharAt(int)
,
equals(java.lang.Object)
public boolean equals(java.lang.Object obj)
this
object is equal to the
specified one.
This method returns true
if and only if
obj is instance of this vector class and all elements
of this
vector are equal to the corresponding
elements of obj vector.
equals
in class java.lang.Object
obj
- the object (may be null
) with which to compare.
true
if and only if this
value is the
same as obj value.CharVector()
,
equals(char[], char[])
,
array()
,
length()
,
getCharAt(int)
,
hashCode()
,
greaterThan(java.lang.Object)
public boolean greaterThan(java.lang.Object obj)
true
if and only if obj is
instance of this
class and this
object
is greater than the specified object. Vectors are compared in the
element-by-element case-sensitive manner, starting at index
0
.
greaterThan
in interface Sortable
obj
- the second compared object (may be null
).
true
if obj is comparable with
this
and this
object is greater than
obj, else false
.compare(char[], int, int, char[], int, int, boolean)
,
array()
,
length()
,
getCharAt(int)
,
equals(java.lang.Object)
public java.lang.String toString()
this
character vector to a string.
All the characters of the wrapped array are concatenated together
(without spaces) to produce a single string (using
String(char[])
constructor).
toString
in class java.lang.Object
null
) of
this
object.
java.lang.OutOfMemoryError
- if there is not enough memory.array()
,
length()
public void integrityCheck()
this
object for its integrity.
For debug purpose only.
integrityCheck
in interface Verifiable
java.lang.InternalError
- if integrity violation is detected.CharVector(char[])
,
setArray(char[])
,
array()
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |