diff options
Diffstat (limited to 'docs/org.eclipse.wst.jsdt.doc/html/api_reference/org/eclipse/wst/jsdt/core/compiler/CharOperation.html')
| -rw-r--r-- | docs/org.eclipse.wst.jsdt.doc/html/api_reference/org/eclipse/wst/jsdt/core/compiler/CharOperation.html | 3555 |
1 files changed, 0 insertions, 3555 deletions
diff --git a/docs/org.eclipse.wst.jsdt.doc/html/api_reference/org/eclipse/wst/jsdt/core/compiler/CharOperation.html b/docs/org.eclipse.wst.jsdt.doc/html/api_reference/org/eclipse/wst/jsdt/core/compiler/CharOperation.html deleted file mode 100644 index 7abfa572..00000000 --- a/docs/org.eclipse.wst.jsdt.doc/html/api_reference/org/eclipse/wst/jsdt/core/compiler/CharOperation.html +++ /dev/null @@ -1,3555 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> -<!--NewPage--> -<HTML> -<HEAD> -<!-- Generated by javadoc (build 1.5.0_12) on Fri May 30 11:15:53 CDT 2008 --> -<TITLE> -CharOperation -</TITLE> - -<META NAME="keywords" CONTENT="org.eclipse.wst.jsdt.core.compiler.CharOperation class"> - -<LINK REL ="stylesheet" TYPE="text/css" HREF="../../../../../../stylesheet.css" TITLE="Style"> - -<SCRIPT type="text/javascript"> -function windowTitle() -{ - parent.document.title="CharOperation"; -} -</SCRIPT> -<NOSCRIPT> -</NOSCRIPT> - -</HEAD> - -<BODY BGCOLOR="white" onload="windowTitle();"> - - -<!-- ========= START OF TOP NAVBAR ======= --> -<A NAME="navbar_top"><!-- --></A> -<A HREF="#skip-navbar_top" title="Skip navigation links"></A> -<TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0" SUMMARY=""> -<TR> -<TD COLSPAN=2 BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> -<A NAME="navbar_top_firstrow"><!-- --></A> -<TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3" SUMMARY=""> - <TR ALIGN="center" VALIGN="top"> - <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../../overview-summary.html"><FONT CLASS="NavBarFont1"><B>Overview</B></FONT></A> </TD> - <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A> </TD> - <TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> <FONT CLASS="NavBarFont1Rev"><B>Class</B></FONT> </TD> - <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="class-use/CharOperation.html"><FONT CLASS="NavBarFont1"><B>Use</B></FONT></A> </TD> - <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A> </TD> - <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A> </TD> - <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../../index-files/index-1.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A> </TD> - <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../../help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A> </TD> - </TR> -</TABLE> -</TD> -<TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM> -</EM> -</TD> -</TR> - -<TR> -<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2"> - <A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CategorizedProblem.html" title="class in org.eclipse.wst.jsdt.core.compiler"><B>PREV CLASS</B></A> - <A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/InvalidInputException.html" title="class in org.eclipse.wst.jsdt.core.compiler"><B>NEXT CLASS</B></A></FONT></TD> -<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2"> - <A HREF="../../../../../../index.html?org/eclipse/wst/jsdt/core/compiler/CharOperation.html" target="_top"><B>FRAMES</B></A> - <A HREF="CharOperation.html" target="_top"><B>NO FRAMES</B></A> - <SCRIPT type="text/javascript"> - <!-- - if(window==top) { - document.writeln('<A HREF="../../../../../../allclasses-noframe.html"><B>All Classes</B></A>'); - } - //--> -</SCRIPT> -<NOSCRIPT> - <A HREF="../../../../../../allclasses-noframe.html"><B>All Classes</B></A> -</NOSCRIPT> - - -</FONT></TD> -</TR> -<TR> -<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2"> - SUMMARY: NESTED | <A HREF="#field_summary">FIELD</A> | <A HREF="#constructor_summary">CONSTR</A> | <A HREF="#method_summary">METHOD</A></FONT></TD> -<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2"> -DETAIL: <A HREF="#field_detail">FIELD</A> | <A HREF="#constructor_detail">CONSTR</A> | <A HREF="#method_detail">METHOD</A></FONT></TD> -</TR> -</TABLE> -<A NAME="skip-navbar_top"></A> -<!-- ========= END OF TOP NAVBAR ========= --> - -<HR> -<!-- ======== START OF CLASS DATA ======== --> -<H2> -<FONT SIZE="-1"> -org.eclipse.wst.jsdt.core.compiler</FONT> -<BR> -Class CharOperation</H2> -<PRE> -java.lang.Object - <IMG SRC="../../../../../../resources/inherit.gif" ALT="extended by "><B>org.eclipse.wst.jsdt.core.compiler.CharOperation</B> -</PRE> -<HR> -<DL> -<DT><PRE>public final class <B>CharOperation</B><DT>extends java.lang.Object</DL> -</PRE> - -<P> -This class is a collection of helper methods to manipulate char arrays. - <p> - This class is not intended to be instantiated or subclassed by clients. - </p> - - Provisional API: This class/interface is part of an interim API that is still under development and expected to - change significantly before reaching stability. It is being made available at this early stage to solicit feedback - from pioneering adopters on the understanding that any code that uses this API will almost certainly be broken - (repeatedly) as the API evolves. -<P> - -<P> -<HR> - -<P> -<!-- =========== FIELD SUMMARY =========== --> - -<A NAME="field_summary"><!-- --></A> -<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY=""> -<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor"> -<TH ALIGN="left" COLSPAN="2"><FONT SIZE="+2"> -<B>Field Summary</B></FONT></TH> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#NO_CHAR">NO_CHAR</A></B></CODE> - -<BR> - Constant for an empty char array</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[][]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#NO_CHAR_CHAR">NO_CHAR_CHAR</A></B></CODE> - -<BR> - Constant for an empty char array with two dimensions.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static java.lang.String[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#NO_STRINGS">NO_STRINGS</A></B></CODE> - -<BR> - Constant for an empty String array.</TD> -</TR> -</TABLE> - -<!-- ======== CONSTRUCTOR SUMMARY ======== --> - -<A NAME="constructor_summary"><!-- --></A> -<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY=""> -<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor"> -<TH ALIGN="left" COLSPAN="2"><FONT SIZE="+2"> -<B>Constructor Summary</B></FONT></TH> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#CharOperation()">CharOperation</A></B>()</CODE> - -<BR> - </TD> -</TR> -</TABLE> - -<!-- ========== METHOD SUMMARY =========== --> - -<A NAME="method_summary"><!-- --></A> -<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY=""> -<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor"> -<TH ALIGN="left" COLSPAN="2"><FONT SIZE="+2"> -<B>Method Summary</B></FONT></TH> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#append(char[], char)">append</A></B>(char[] array, - char suffix)</CODE> - -<BR> - Answers a new array with appending the suffix character at the end of the array.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#append(char[], int, char[], int, int)">append</A></B>(char[] target, - int index, - char[] array, - int start, - int end)</CODE> - -<BR> - Append the given subarray to the target array starting at the given index in the target array.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[][]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#arrayConcat(char[][], char[])">arrayConcat</A></B>(char[][] first, - char[] second)</CODE> - -<BR> - Answers a new array adding the second array at the end of first array.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[][]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#arrayConcat(char[][], char[][])">arrayConcat</A></B>(char[][] first, - char[][] second)</CODE> - -<BR> - Answers the concatenation of the two arrays.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#camelCaseMatch(char[], char[])">camelCaseMatch</A></B>(char[] pattern, - char[] name)</CODE> - -<BR> - Answers true if the pattern matches the given name using CamelCase rules, or false otherwise.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#camelCaseMatch(char[], int, int, char[], int, int)">camelCaseMatch</A></B>(char[] pattern, - int patternStart, - int patternEnd, - char[] name, - int nameStart, - int nameEnd)</CODE> - -<BR> - Answers true if a sub-pattern matches the subpart of the given name using CamelCase rules, or false otherwise.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static java.lang.String[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#charArrayToStringArray(char[][])">charArrayToStringArray</A></B>(char[][] charArrays)</CODE> - -<BR> - Returns the char arrays as an array of Strings</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static java.lang.String</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#charToString(char[])">charToString</A></B>(char[] charArray)</CODE> - -<BR> - Returns the char array as a String</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static int</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#compareTo(char[], char[])">compareTo</A></B>(char[] array1, - char[] array2)</CODE> - -<BR> - Compares the two char arrays lexicographically.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static int</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#compareWith(char[], char[])">compareWith</A></B>(char[] array, - char[] prefix)</CODE> - -<BR> - Compares the contents of the two arrays array and prefix.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#concat(char[], char[])">concat</A></B>(char[] first, - char[] second)</CODE> - -<BR> - Answers the concatenation of the two arrays.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#concat(char[], char[], char)">concat</A></B>(char[] first, - char[] second, - char separator)</CODE> - -<BR> - Answers the concatenation of the two arrays inserting the separator character between the two arrays.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#concat(char[], char[], char[])">concat</A></B>(char[] first, - char[] second, - char[] third)</CODE> - -<BR> - Answers the concatenation of the three arrays.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#concat(char[], char, char[], char, char[])">concat</A></B>(char[] first, - char sep1, - char[] second, - char sep2, - char[] third)</CODE> - -<BR> - Answers the concatenation of the three arrays inserting the sep1 character between the - first two arrays and sep2 between the last two.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#concat(char, char[], char)">concat</A></B>(char prefix, - char[] array, - char suffix)</CODE> - -<BR> - Answers a new array with prepending the prefix character and appending the suffix - character at the end of the array.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#concatWith(char[][], char)">concatWith</A></B>(char[][] array, - char separator)</CODE> - -<BR> - Answers the concatenation of the given array parts using the given separator between each part.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#concatWith(char[][], char[], char)">concatWith</A></B>(char[][] array, - char[] name, - char separator)</CODE> - -<BR> - Answers the concatenation of the given array parts using the given separator between each - part and appending the given name at the end.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#concatWith(char[], char[][], char)">concatWith</A></B>(char[] name, - char[][] array, - char separator)</CODE> - -<BR> - Answers the concatenation of the given array parts using the given separator between each - part and appending the given name at the end.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#contains(char[], char[])">contains</A></B>(char[] characters, - char[] array)</CODE> - -<BR> - Answers true if the array contains an occurrence of one of the characters, false otherwise.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#contains(char, char[])">contains</A></B>(char character, - char[] array)</CODE> - -<BR> - Answers true if the array contains an occurrence of character, false otherwise.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#contains(char, char[][])">contains</A></B>(char character, - char[][] array)</CODE> - -<BR> - Answers true if the array contains an occurrence of character, false otherwise.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[][]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#deepCopy(char[][])">deepCopy</A></B>(char[][] toCopy)</CODE> - -<BR> - Answers a deep copy of the toCopy array.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#endsWith(char[], char[])">endsWith</A></B>(char[] array, - char[] toBeFound)</CODE> - -<BR> - Return true if array ends with the sequence of characters contained in toBeFound, - otherwise false.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#equals(char[][], char[][])">equals</A></B>(char[][] first, - char[][] second)</CODE> - -<BR> - Answers true if the two arrays are identical character by character, otherwise false.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#equals(char[][], char[][], boolean)">equals</A></B>(char[][] first, - char[][] second, - boolean isCaseSensitive)</CODE> - -<BR> - If isCaseSensite is true, answers true if the two arrays are identical character - by character, otherwise false.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#equals(char[], char[])">equals</A></B>(char[] first, - char[] second)</CODE> - -<BR> - Answers true if the two arrays are identical character by character, otherwise false.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#equals(char[], char[], boolean)">equals</A></B>(char[] first, - char[] second, - boolean isCaseSensitive)</CODE> - -<BR> - If isCaseSensite is true, answers true if the two arrays are identical character - by character, otherwise false.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#equals(char[], char[], int, int)">equals</A></B>(char[] first, - char[] second, - int secondStart, - int secondEnd)</CODE> - -<BR> - Answers true if the first array is identical character by character to a portion of the second array - delimited from position secondStart (inclusive) to secondEnd(exclusive), otherwise false.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#equals(char[], char[], int, int, boolean)">equals</A></B>(char[] first, - char[] second, - int secondStart, - int secondEnd, - boolean isCaseSensitive)</CODE> - -<BR> - Answers true if the first array is identical character by character to a portion of the second array - delimited from position secondStart (inclusive) to secondEnd(exclusive), otherwise false.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#fixLibPackageTail(char[])">fixLibPackageTail</A></B>(char[] packageName)</CODE> - -<BR> - </TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#fragmentEquals(char[], char[], int, boolean)">fragmentEquals</A></B>(char[] fragment, - char[] name, - int startIndex, - boolean isCaseSensitive)</CODE> - -<BR> - If isCaseSensite is true, the equality is case sensitive, otherwise it is case insensitive.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static int</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#hashCode(char[])">hashCode</A></B>(char[] array)</CODE> - -<BR> - Answers a hashcode for the array</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static int</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#indexOf(char[], char[], boolean)">indexOf</A></B>(char[] toBeFound, - char[] array, - boolean isCaseSensitive)</CODE> - -<BR> - Answers the first index in the array for which the toBeFound array is a matching - subarray following the case rule.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static int</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#indexOf(char[], char[], boolean, int)">indexOf</A></B>(char[] toBeFound, - char[] array, - boolean isCaseSensitive, - int start)</CODE> - -<BR> - Answers the first index in the array for which the toBeFound array is a matching - subarray following the case rule starting at the index start.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static int</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#indexOf(char[], char[], boolean, int, int)">indexOf</A></B>(char[] toBeFound, - char[] array, - boolean isCaseSensitive, - int start, - int end)</CODE> - -<BR> - Answers the first index in the array for which the toBeFound array is a matching - subarray following the case rule starting at the index start.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static int</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#indexOf(char, char[])">indexOf</A></B>(char toBeFound, - char[] array)</CODE> - -<BR> - Answers the first index in the array for which the corresponding character is - equal to toBeFound.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static int</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#indexOf(char, char[], int)">indexOf</A></B>(char toBeFound, - char[] array, - int start)</CODE> - -<BR> - Answers the first index in the array for which the corresponding character is - equal to toBeFound starting the search at index start.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static int</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#indexOf(char, char[], int, int)">indexOf</A></B>(char toBeFound, - char[] array, - int start, - int end)</CODE> - -<BR> - Answers the first index in the array for which the corresponding character is - equal to toBeFound starting the search at index start and before the ending index.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#isWhitespace(char)">isWhitespace</A></B>(char c)</CODE> - -<BR> - Answers true if c is a whitespace (\u000a, \u000c, \u000d, \u0009), otherwise false.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static int</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#lastIndexOf(char, char[])">lastIndexOf</A></B>(char toBeFound, - char[] array)</CODE> - -<BR> - Answers the last index in the array for which the corresponding character is - equal to toBeFound starting from the end of the array.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static int</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#lastIndexOf(char, char[], int)">lastIndexOf</A></B>(char toBeFound, - char[] array, - int startIndex)</CODE> - -<BR> - Answers the last index in the array for which the corresponding character is - equal to toBeFound stopping at the index startIndex.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static int</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#lastIndexOf(char, char[], int, int)">lastIndexOf</A></B>(char toBeFound, - char[] array, - int startIndex, - int endIndex)</CODE> - -<BR> - Answers the last index in the array for which the corresponding character is - equal to toBeFound starting from endIndex to startIndex.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#lastSegment(char[], char)">lastSegment</A></B>(char[] array, - char separator)</CODE> - -<BR> - Answers the last portion of a name given a separator.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#match(char[], char[], boolean)">match</A></B>(char[] pattern, - char[] name, - boolean isCaseSensitive)</CODE> - -<BR> - Answers true if the pattern matches the given name, false otherwise.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#match(char[], int, int, char[], int, int, boolean)">match</A></B>(char[] pattern, - int patternStart, - int patternEnd, - char[] name, - int nameStart, - int nameEnd, - boolean isCaseSensitive)</CODE> - -<BR> - Answers true if a sub-pattern matches the subpart of the given name, false otherwise.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static int</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#occurencesOf(char, char[])">occurencesOf</A></B>(char toBeFound, - char[] array)</CODE> - -<BR> - Answers the number of occurrences of the given character in the given array, 0 if any.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static int</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#occurencesOf(char, char[], int)">occurencesOf</A></B>(char toBeFound, - char[] array, - int start)</CODE> - -<BR> - Answers the number of occurrences of the given character in the given array starting - at the given index, 0 if any.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#pathMatch(char[], char[], boolean, char)">pathMatch</A></B>(char[] pattern, - char[] filepath, - boolean isCaseSensitive, - char pathSeparator)</CODE> - -<BR> - Answers true if the pattern matches the filepath using the pathSepatator, false otherwise.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#prefixEquals(char[], char[])">prefixEquals</A></B>(char[] prefix, - char[] name)</CODE> - -<BR> - Answers true if the given name starts with the given prefix, false otherwise.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static boolean</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#prefixEquals(char[], char[], boolean)">prefixEquals</A></B>(char[] prefix, - char[] name, - boolean isCaseSensitive)</CODE> - -<BR> - Answers true if the given name starts with the given prefix, false otherwise.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#remove(char[], char)">remove</A></B>(char[] array, - char toBeRemoved)</CODE> - -<BR> - Answers a new array removing a given character.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static void</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#replace(char[], char[], char)">replace</A></B>(char[] array, - char[] toBeReplaced, - char replacementChar)</CODE> - -<BR> - Replace all occurrences of characters to be replaced with the replacement character in the - given array.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#replace(char[], char[], char[])">replace</A></B>(char[] array, - char[] toBeReplaced, - char[] replacementChars)</CODE> - -<BR> - Answers a new array of characters with substitutions.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static void</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#replace(char[], char[], char, int, int)">replace</A></B>(char[] array, - char[] toBeReplaced, - char replacementChar, - int start, - int end)</CODE> - -<BR> - Replace all occurrences of characters to be replaced with the replacement character in the - given array from the start position (inclusive) to the end position (exclusive).</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static void</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#replace(char[], char, char)">replace</A></B>(char[] array, - char toBeReplaced, - char replacementChar)</CODE> - -<BR> - Replace all occurrence of the character to be replaced with the replacement character in the - given array.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#replaceOnCopy(char[], char, char)">replaceOnCopy</A></B>(char[] array, - char toBeReplaced, - char replacementChar)</CODE> - -<BR> - Replace all occurrence of the character to be replaced with the replacement character - in a copy of the given array.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[][]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#splitAndTrimOn(char, char[])">splitAndTrimOn</A></B>(char divider, - char[] array)</CODE> - -<BR> - Return a new array which is the split of the given array using the given divider and triming each subarray to remove - whitespaces equals to ' '.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[][]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#splitOn(char, char[])">splitOn</A></B>(char divider, - char[] array)</CODE> - -<BR> - Return a new array which is the split of the given array using the given divider.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[][]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#splitOn(char, char[], int, int)">splitOn</A></B>(char divider, - char[] array, - int start, - int end)</CODE> - -<BR> - Return a new array which is the split of the given array using the given divider.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[][]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#subarray(char[][], int, int)">subarray</A></B>(char[][] array, - int start, - int end)</CODE> - -<BR> - Answers a new array which is a copy of the given array starting at the given start and - ending at the given end.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#subarray(char[], int, int)">subarray</A></B>(char[] array, - int start, - int end)</CODE> - -<BR> - Answers a new array which is a copy of the given array starting at the given start and - ending at the given end.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#toLowerCase(char[])">toLowerCase</A></B>(char[] chars)</CODE> - -<BR> - Answers the result of a char[] conversion to lowercase.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static java.lang.String</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#toString(char[][])">toString</A></B>(char[][] array)</CODE> - -<BR> - Answers a string which is the concatenation of the given array using the '.' as a separator.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static java.lang.String[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#toStrings(char[][])">toStrings</A></B>(char[][] array)</CODE> - -<BR> - Answers an array of strings from the given array of char array.</TD> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"> -<CODE>static char[]</CODE></FONT></TD> -<TD><CODE><B><A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CharOperation.html#trim(char[])">trim</A></B>(char[] chars)</CODE> - -<BR> - Answers a new array removing leading and trailing spaces (' ').</TD> -</TR> -</TABLE> - <A NAME="methods_inherited_from_class_java.lang.Object"><!-- --></A> -<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY=""> -<TR BGCOLOR="#EEEEFF" CLASS="TableSubHeadingColor"> -<TH ALIGN="left"><B>Methods inherited from class java.lang.Object</B></TH> -</TR> -<TR BGCOLOR="white" CLASS="TableRowColor"> -<TD><CODE>equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait</CODE></TD> -</TR> -</TABLE> - -<P> - -<!-- ============ FIELD DETAIL =========== --> - -<A NAME="field_detail"><!-- --></A> -<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY=""> -<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor"> -<TH ALIGN="left" COLSPAN="1"><FONT SIZE="+2"> -<B>Field Detail</B></FONT></TH> -</TR> -</TABLE> - -<A NAME="NO_CHAR"><!-- --></A><H3> -NO_CHAR</H3> -<PRE> -public static final char[] <B>NO_CHAR</B></PRE> -<DL> -<DD>Constant for an empty char array -<P> -<DL> -</DL> -</DL> -<HR> - -<A NAME="NO_CHAR_CHAR"><!-- --></A><H3> -NO_CHAR_CHAR</H3> -<PRE> -public static final char[][] <B>NO_CHAR_CHAR</B></PRE> -<DL> -<DD>Constant for an empty char array with two dimensions. -<P> -<DL> -</DL> -</DL> -<HR> - -<A NAME="NO_STRINGS"><!-- --></A><H3> -NO_STRINGS</H3> -<PRE> -public static final java.lang.String[] <B>NO_STRINGS</B></PRE> -<DL> -<DD>Constant for an empty String array. -<P> -<DL> -</DL> -</DL> - -<!-- ========= CONSTRUCTOR DETAIL ======== --> - -<A NAME="constructor_detail"><!-- --></A> -<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY=""> -<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor"> -<TH ALIGN="left" COLSPAN="1"><FONT SIZE="+2"> -<B>Constructor Detail</B></FONT></TH> -</TR> -</TABLE> - -<A NAME="CharOperation()"><!-- --></A><H3> -CharOperation</H3> -<PRE> -public <B>CharOperation</B>()</PRE> -<DL> -</DL> - -<!-- ============ METHOD DETAIL ========== --> - -<A NAME="method_detail"><!-- --></A> -<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY=""> -<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor"> -<TH ALIGN="left" COLSPAN="1"><FONT SIZE="+2"> -<B>Method Detail</B></FONT></TH> -</TR> -</TABLE> - -<A NAME="append(char[], char)"><!-- --></A><H3> -append</H3> -<PRE> -public static final char[] <B>append</B>(char[] array, - char suffix)</PRE> -<DL> -<DD>Answers a new array with appending the suffix character at the end of the array. - <br> - <br> - For example:<br> - <ol> - <li><pre> - array = { 'a', 'b' } - suffix = 'c' - => result = { 'a', 'b' , 'c' } - </pre> - </li> - <li><pre> - array = null - suffix = 'c' - => result = { 'c' } - </pre></li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>array</CODE> - the array that is concanated with the suffix character<DD><CODE>suffix</CODE> - the suffix character -<DT><B>Returns:</B><DD>the new array</DL> -</DD> -</DL> -<HR> - -<A NAME="append(char[], int, char[], int, int)"><!-- --></A><H3> -append</H3> -<PRE> -public static final char[] <B>append</B>(char[] target, - int index, - char[] array, - int start, - int end)</PRE> -<DL> -<DD>Append the given subarray to the target array starting at the given index in the target array. - The start of the subarray is inclusive, the end is exclusive. - Answers a new target array if it needs to grow, otherwise answers the same target array. - <br> - For example:<br> - <ol> - <li><pre> - target = { 'a', 'b', '0' } - index = 2 - array = { 'c', 'd' } - start = 0 - end = 1 - => result = { 'a', 'b' , 'c' } - </pre> - </li> - <li><pre> - target = { 'a', 'b' } - index = 2 - array = { 'c', 'd' } - start = 0 - end = 1 - => result = { 'a', 'b' , 'c', '0', '0' , '0' } (new array) - </pre></li> - <li><pre> - target = { 'a', 'b', 'c' } - index = 1 - array = { 'c', 'd', 'e', 'f' } - start = 1 - end = 4 - => result = { 'a', 'd' , 'e', 'f', '0', '0', '0', '0' } (new array) - </pre></li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>target</CODE> - the given target<DD><CODE>index</CODE> - the given index<DD><CODE>array</CODE> - the given array<DD><CODE>start</CODE> - the given start index<DD><CODE>end</CODE> - the given end index -<DT><B>Returns:</B><DD>the new array -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if the target array is null</DL> -</DD> -</DL> -<HR> - -<A NAME="arrayConcat(char[][], char[][])"><!-- --></A><H3> -arrayConcat</H3> -<PRE> -public static final char[][] <B>arrayConcat</B>(char[][] first, - char[][] second)</PRE> -<DL> -<DD>Answers the concatenation of the two arrays. It answers null if the two arrays are null. - If the first array is null, then the second array is returned. - If the second array is null, then the first array is returned. - <br> - <br> - For example: - <ol> - <li><pre> - first = null - second = null - => result = null - </pre> - </li> - <li><pre> - first = { { ' a' } } - second = null - => result = { { ' a' } } - </pre> - </li> - <li><pre> - first = null - second = { { ' a' } } - => result = { { ' a' } } - </pre> - </li> - <li><pre> - first = { { ' b' } } - second = { { ' a' } } - => result = { { ' b' }, { ' a' } } - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>first</CODE> - the first array to concatenate<DD><CODE>second</CODE> - the second array to concatenate -<DT><B>Returns:</B><DD>the concatenation of the two arrays, or null if the two arrays are null.</DL> -</DD> -</DL> -<HR> - -<A NAME="camelCaseMatch(char[], char[])"><!-- --></A><H3> -camelCaseMatch</H3> -<PRE> -public static final boolean <B>camelCaseMatch</B>(char[] pattern, - char[] name)</PRE> -<DL> -<DD>Answers true if the pattern matches the given name using CamelCase rules, or false otherwise. - char[] CamelCase matching does NOT accept explicit wild-cards '*' and '?' and is inherently case sensitive. - <br> - CamelCase denotes the convention of writing compound names without spaces, and capitalizing every term. - This function recognizes both upper and lower CamelCase, depending whether the leading character is capitalized - or not. The leading part of an upper CamelCase pattern is assumed to contain a sequence of capitals which are appearing - in the matching name; e.g. 'NPE' will match 'NullPointerException', but not 'NewPerfData'. A lower CamelCase pattern - uses a lowercase first character. - <br> - The pattern may contain lowercase characters, which will be match in a case sensitive way. These characters must - appear in sequence in the name. - <br><br> - Examples: - <ol> - <li><pre> - pattern = { 'N', 'P', 'E' } - name = { 'N', 'u','l', 'l', 'P', 'o', 'i', 'n', 't', 'e', 'r', 'E', 'x', 'c', 'e', 'p', 't', 'i', 'o', 'n' } - result => true - </pre> - </li> - <li><pre> - pattern = { 'N', 'P', 'E' } - name = { 'N', 'o', 'P', 'e', 'r', 'm', 'i', 's', 's', 'i', 'o', 'n', 'E', 'x', 'c', 'e', 'p', 't', 'i', 'o', 'n' } - result => true - </pre> - </li> - <li><pre> - pattern = { 'N', 'u', 'P', 'o', 'E', 'x' } - name = { 'N', 'u','l', 'l', 'P', 'o', 'i', 'n', 't', 'e', 'r', 'E', 'x', 'c', 'e', 'p', 't', 'i', 'o', 'n' } - result => true - </pre> - </li> - <li><pre> - pattern = { 'N', 'u', 'P', 'o', 'E', 'x' } - name = { 'N', 'o', 'P', 'e', 'r', 'm', 'i', 's', 's', 'i', 'o', 'n', 'E', 'x', 'c', 'e', 'p', 't', 'i', 'o', 'n' } - result => false - </pre> - </li> - <li><pre> - pattern = { 'n', p', 'e' } - name = { 'N', 'u','l', 'l', 'P', 'o', 'i', 'n', 't', 'e', 'r', 'E', 'x', 'c', 'e', 'p', 't', 'i', 'o', 'n' } - result => false - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>pattern</CODE> - the given pattern<DD><CODE>name</CODE> - the given name -<DT><B>Returns:</B><DD>true if the pattern matches the given name, false otherwise</DL> -</DD> -</DL> -<HR> - -<A NAME="camelCaseMatch(char[], int, int, char[], int, int)"><!-- --></A><H3> -camelCaseMatch</H3> -<PRE> -public static final boolean <B>camelCaseMatch</B>(char[] pattern, - int patternStart, - int patternEnd, - char[] name, - int nameStart, - int nameEnd)</PRE> -<DL> -<DD>Answers true if a sub-pattern matches the subpart of the given name using CamelCase rules, or false otherwise. - char[] CamelCase matching does NOT accept explicit wild-cards '*' and '?' and is inherently case sensitive. - Can match only subset of name/pattern, considering end positions as non-inclusive. - The subpattern is defined by the patternStart and patternEnd positions. - <br> - CamelCase denotes the convention of writing compound names without spaces, and capitalizing every term. - This function recognizes both upper and lower CamelCase, depending whether the leading character is capitalized - or not. The leading part of an upper CamelCase pattern is assumed to contain a sequence of capitals which are appearing - in the matching name; e.g. 'NPE' will match 'NullPointerException', but not 'NewPerfData'. A lower CamelCase pattern - uses a lowercase first character. In JavaScript, type names follow the upper CamelCase convention, whereas method or field - names follow the lower CamelCase convention. - <br> - The pattern may contain lowercase characters, which will be match in a case sensitive way. These characters must - appear in sequence in the name. For instance, 'NPExcep' will match 'NullPointerException', but not 'NullPointerExCEPTION' - or 'NuPoEx' will match 'NullPointerException', but not 'NoPointerException'. - <br><br> - Examples: - <ol> - <li><pre> - pattern = { 'N', 'P', 'E' } - patternStart = 0 - patternEnd = 3 - name = { 'N', 'u','l', 'l', 'P', 'o', 'i', 'n', 't', 'e', 'r', 'E', 'x', 'c', 'e', 'p', 't', 'i', 'o', 'n' } - nameStart = 0 - nameEnd = 20 - result => true - </pre> - </li> - <li><pre> - pattern = { 'N', 'P', 'E' } - patternStart = 0 - patternEnd = 3 - name = { 'N', 'o', 'P', 'e', 'r', 'm', 'i', 's', 's', 'i', 'o', 'n', 'E', 'x', 'c', 'e', 'p', 't', 'i', 'o', 'n' } - nameStart = 0 - nameEnd = 21 - result => true - </pre> - </li> - <li><pre> - pattern = { 'N', 'u', 'P', 'o', 'E', 'x' } - patternStart = 0 - patternEnd = 6 - name = { 'N', 'u','l', 'l', 'P', 'o', 'i', 'n', 't', 'e', 'r', 'E', 'x', 'c', 'e', 'p', 't', 'i', 'o', 'n' } - nameStart = 0 - nameEnd = 20 - result => true - </pre> - </li> - <li><pre> - pattern = { 'N', 'u', 'P', 'o', 'E', 'x' } - patternStart = 0 - patternEnd = 6 - name = { 'N', 'o', 'P', 'e', 'r', 'm', 'i', 's', 's', 'i', 'o', 'n', 'E', 'x', 'c', 'e', 'p', 't', 'i', 'o', 'n' } - nameStart = 0 - nameEnd = 21 - result => false - </pre> - </li> - <li><pre> - pattern = { 'n', p', 'e' } - patternStart = 0 - patternEnd = 3 - name = { 'N', 'u','l', 'l', 'P', 'o', 'i', 'n', 't', 'e', 'r', 'E', 'x', 'c', 'e', 'p', 't', 'i', 'o', 'n' } - nameStart = 0 - nameEnd = 20 - result => false - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>pattern</CODE> - the given pattern<DD><CODE>patternStart</CODE> - the start index of the pattern, inclusive<DD><CODE>patternEnd</CODE> - the end index of the pattern, exclusive<DD><CODE>name</CODE> - the given name<DD><CODE>nameStart</CODE> - the start index of the name, inclusive<DD><CODE>nameEnd</CODE> - the end index of the name, exclusive -<DT><B>Returns:</B><DD>true if a sub-pattern matches the subpart of the given name, false otherwise</DL> -</DD> -</DL> -<HR> - -<A NAME="charArrayToStringArray(char[][])"><!-- --></A><H3> -charArrayToStringArray</H3> -<PRE> -public static java.lang.String[] <B>charArrayToStringArray</B>(char[][] charArrays)</PRE> -<DL> -<DD>Returns the char arrays as an array of Strings -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>charArrays</CODE> - the char array to convert -<DT><B>Returns:</B><DD>the char arrays as an array of Strings or null if the given char arrays is null.</DL> -</DD> -</DL> -<HR> - -<A NAME="charToString(char[])"><!-- --></A><H3> -charToString</H3> -<PRE> -public static java.lang.String <B>charToString</B>(char[] charArray)</PRE> -<DL> -<DD>Returns the char array as a String -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>charArray</CODE> - the char array to convert -<DT><B>Returns:</B><DD>the char array as a String or null if the given char array is null.</DL> -</DD> -</DL> -<HR> - -<A NAME="arrayConcat(char[][], char[])"><!-- --></A><H3> -arrayConcat</H3> -<PRE> -public static final char[][] <B>arrayConcat</B>(char[][] first, - char[] second)</PRE> -<DL> -<DD>Answers a new array adding the second array at the end of first array. - It answers null if the first and second are null. - If the first array is null, then a new array char[][] is created with second. - If the second array is null, then the first array is returned. - <br> - <br> - For example: - <ol> - <li><pre> - first = null - second = { 'a' } - => result = { { ' a' } } - </pre> - <li><pre> - first = { { ' a' } } - second = null - => result = { { ' a' } } - </pre> - </li> - <li><pre> - first = { { ' a' } } - second = { ' b' } - => result = { { ' a' } , { ' b' } } - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>first</CODE> - the first array to concatenate<DD><CODE>second</CODE> - the array to add at the end of the first array -<DT><B>Returns:</B><DD>a new array adding the second array at the end of first array, or null if the two arrays are null.</DL> -</DD> -</DL> -<HR> - -<A NAME="compareTo(char[], char[])"><!-- --></A><H3> -compareTo</H3> -<PRE> -public static final int <B>compareTo</B>(char[] array1, - char[] array2)</PRE> -<DL> -<DD>Compares the two char arrays lexicographically. - - Returns a negative integer if array1 lexicographically precedes the array2, - a positive integer if this array1 lexicographically follows the array2, or - zero if both arrays are equal. -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>array1</CODE> - the first given array<DD><CODE>array2</CODE> - the second given array -<DT><B>Returns:</B><DD>the returned value of the comparison between array1 and array2 -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if one of the arrays is null</DL> -</DD> -</DL> -<HR> - -<A NAME="compareWith(char[], char[])"><!-- --></A><H3> -compareWith</H3> -<PRE> -public static final int <B>compareWith</B>(char[] array, - char[] prefix)</PRE> -<DL> -<DD>Compares the contents of the two arrays array and prefix. Returns - <ul> - <li>zero if the array starts with the prefix contents</li> - <li>the difference between the first two characters that are not equal </li> - <li>one if array length is lower than the prefix length and that the prefix starts with the - array contents.</li> - </ul> - <p> - For example: - <ol> - <li><pre> - array = null - prefix = null - => result = NullPointerException - </pre> - </li> - <li><pre> - array = { 'a', 'b', 'c', 'd', 'e' } - prefix = { 'a', 'b', 'c'} - => result = 0 - </pre> - </li> - <li><pre> - array = { 'a', 'b', 'c', 'd', 'e' } - prefix = { 'a', 'B', 'c'} - => result = 32 - </pre> - </li> - <li><pre> - array = { 'd', 'b', 'c', 'd', 'e' } - prefix = { 'a', 'b', 'c'} - => result = 3 - </pre> - </li> - <li><pre> - array = { 'a', 'b', 'c', 'd', 'e' } - prefix = { 'd', 'b', 'c'} - => result = -3 - </pre> - </li> - <li><pre> - array = { 'a', 'a', 'c', 'd', 'e' } - prefix = { 'a', 'e', 'c'} - => result = -4 - </pre> - </li> - </ol> - </p> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>array</CODE> - the given array<DD><CODE>prefix</CODE> - the given prefix -<DT><B>Returns:</B><DD>the result of the comparison (>=0 if array>prefix) -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if either array or prefix is null</DL> -</DD> -</DL> -<HR> - -<A NAME="concat(char[], char[])"><!-- --></A><H3> -concat</H3> -<PRE> -public static final char[] <B>concat</B>(char[] first, - char[] second)</PRE> -<DL> -<DD>Answers the concatenation of the two arrays. It answers null if the two arrays are null. - If the first array is null, then the second array is returned. - If the second array is null, then the first array is returned. - <br> - <br> - For example: - <ol> - <li><pre> - first = null - second = { 'a' } - => result = { ' a' } - </pre> - </li> - <li><pre> - first = { ' a' } - second = null - => result = { ' a' } - </pre> - </li> - <li><pre> - first = { ' a' } - second = { ' b' } - => result = { ' a' , ' b' } - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>first</CODE> - the first array to concatenate<DD><CODE>second</CODE> - the second array to concatenate -<DT><B>Returns:</B><DD>the concatenation of the two arrays, or null if the two arrays are null.</DL> -</DD> -</DL> -<HR> - -<A NAME="concat(char[], char[], char[])"><!-- --></A><H3> -concat</H3> -<PRE> -public static final char[] <B>concat</B>(char[] first, - char[] second, - char[] third)</PRE> -<DL> -<DD>Answers the concatenation of the three arrays. It answers null if the three arrays are null. - If first is null, it answers the concatenation of second and third. - If second is null, it answers the concatenation of first and third. - If third is null, it answers the concatenation of first and second. - <br> - <br> - For example: - <ol> - <li><pre> - first = null - second = { 'a' } - third = { 'b' } - => result = { ' a', 'b' } - </pre> - </li> - <li><pre> - first = { 'a' } - second = null - third = { 'b' } - => result = { ' a', 'b' } - </pre> - </li> - <li><pre> - first = { 'a' } - second = { 'b' } - third = null - => result = { ' a', 'b' } - </pre> - </li> - <li><pre> - first = null - second = null - third = null - => result = null - </pre> - </li> - <li><pre> - first = { 'a' } - second = { 'b' } - third = { 'c' } - => result = { 'a', 'b', 'c' } - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>first</CODE> - the first array to concatenate<DD><CODE>second</CODE> - the second array to concatenate<DD><CODE>third</CODE> - the third array to concatenate -<DT><B>Returns:</B><DD>the concatenation of the three arrays, or null if the three arrays are null.</DL> -</DD> -</DL> -<HR> - -<A NAME="concat(char[], char[], char)"><!-- --></A><H3> -concat</H3> -<PRE> -public static final char[] <B>concat</B>(char[] first, - char[] second, - char separator)</PRE> -<DL> -<DD>Answers the concatenation of the two arrays inserting the separator character between the two arrays. - It answers null if the two arrays are null. - If the first array is null, then the second array is returned. - If the second array is null, then the first array is returned. - <br> - <br> - For example: - <ol> - <li><pre> - first = null - second = { 'a' } - separator = '/' - => result = { ' a' } - </pre> - </li> - <li><pre> - first = { ' a' } - second = null - separator = '/' - => result = { ' a' } - </pre> - </li> - <li><pre> - first = { ' a' } - second = { ' b' } - separator = '/' - => result = { ' a' , '/', 'b' } - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>first</CODE> - the first array to concatenate<DD><CODE>second</CODE> - the second array to concatenate<DD><CODE>separator</CODE> - the character to insert -<DT><B>Returns:</B><DD>the concatenation of the two arrays inserting the separator character - between the two arrays , or null if the two arrays are null.</DL> -</DD> -</DL> -<HR> - -<A NAME="concat(char[], char, char[], char, char[])"><!-- --></A><H3> -concat</H3> -<PRE> -public static final char[] <B>concat</B>(char[] first, - char sep1, - char[] second, - char sep2, - char[] third)</PRE> -<DL> -<DD>Answers the concatenation of the three arrays inserting the sep1 character between the - first two arrays and sep2 between the last two. - It answers null if the three arrays are null. - If the first array is null, then it answers the concatenation of second and third inserting - the sep2 character between them. - If the second array is null, then it answers the concatenation of first and third inserting - the sep1 character between them. - If the third array is null, then it answers the concatenation of first and second inserting - the sep1 character between them. - <br> - <br> - For example: - <ol> - <li><pre> - first = null - sep1 = '/' - second = { 'a' } - sep2 = ':' - third = { 'b' } - => result = { ' a' , ':', 'b' } - </pre> - </li> - <li><pre> - first = { 'a' } - sep1 = '/' - second = null - sep2 = ':' - third = { 'b' } - => result = { ' a' , '/', 'b' } - </pre> - </li> - <li><pre> - first = { 'a' } - sep1 = '/' - second = { 'b' } - sep2 = ':' - third = null - => result = { ' a' , '/', 'b' } - </pre> - </li> - <li><pre> - first = { 'a' } - sep1 = '/' - second = { 'b' } - sep2 = ':' - third = { 'c' } - => result = { ' a' , '/', 'b' , ':', 'c' } - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>first</CODE> - the first array to concatenate<DD><CODE>sep1</CODE> - the character to insert<DD><CODE>second</CODE> - the second array to concatenate<DD><CODE>sep2</CODE> - the character to insert<DD><CODE>third</CODE> - the second array to concatenate -<DT><B>Returns:</B><DD>the concatenation of the three arrays inserting the sep1 character between the - two arrays and sep2 between the last two.</DL> -</DD> -</DL> -<HR> - -<A NAME="concat(char, char[], char)"><!-- --></A><H3> -concat</H3> -<PRE> -public static final char[] <B>concat</B>(char prefix, - char[] array, - char suffix)</PRE> -<DL> -<DD>Answers a new array with prepending the prefix character and appending the suffix - character at the end of the array. If array is null, it answers a new array containing the - prefix and the suffix characters. - <br> - <br> - For example:<br> - <ol> - <li><pre> - prefix = 'a' - array = { 'b' } - suffix = 'c' - => result = { 'a', 'b' , 'c' } - </pre> - </li> - <li><pre> - prefix = 'a' - array = null - suffix = 'c' - => result = { 'a', 'c' } - </pre></li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>prefix</CODE> - the prefix character<DD><CODE>array</CODE> - the array that is concanated with the prefix and suffix characters<DD><CODE>suffix</CODE> - the suffix character -<DT><B>Returns:</B><DD>the new array</DL> -</DD> -</DL> -<HR> - -<A NAME="concatWith(char[], char[][], char)"><!-- --></A><H3> -concatWith</H3> -<PRE> -public static final char[] <B>concatWith</B>(char[] name, - char[][] array, - char separator)</PRE> -<DL> -<DD>Answers the concatenation of the given array parts using the given separator between each - part and appending the given name at the end. - <br> - <br> - For example:<br> - <ol> - <li><pre> - name = { 'c' } - array = { { 'a' }, { 'b' } } - separator = '.' - => result = { 'a', '.', 'b' , '.', 'c' } - </pre> - </li> - <li><pre> - name = null - array = { { 'a' }, { 'b' } } - separator = '.' - => result = { 'a', '.', 'b' } - </pre></li> - <li><pre> - name = { ' c' } - array = null - separator = '.' - => result = { 'c' } - </pre></li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>name</CODE> - the given name<DD><CODE>array</CODE> - the given array<DD><CODE>separator</CODE> - the given separator -<DT><B>Returns:</B><DD>the concatenation of the given array parts using the given separator between each - part and appending the given name at the end</DL> -</DD> -</DL> -<HR> - -<A NAME="concatWith(char[][], char[], char)"><!-- --></A><H3> -concatWith</H3> -<PRE> -public static final char[] <B>concatWith</B>(char[][] array, - char[] name, - char separator)</PRE> -<DL> -<DD>Answers the concatenation of the given array parts using the given separator between each - part and appending the given name at the end. - <br> - <br> - For example:<br> - <ol> - <li><pre> - name = { 'c' } - array = { { 'a' }, { 'b' } } - separator = '.' - => result = { 'a', '.', 'b' , '.', 'c' } - </pre> - </li> - <li><pre> - name = null - array = { { 'a' }, { 'b' } } - separator = '.' - => result = { 'a', '.', 'b' } - </pre></li> - <li><pre> - name = { ' c' } - array = null - separator = '.' - => result = { 'c' } - </pre></li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>array</CODE> - the given array<DD><CODE>name</CODE> - the given name<DD><CODE>separator</CODE> - the given separator -<DT><B>Returns:</B><DD>the concatenation of the given array parts using the given separator between each - part and appending the given name at the end</DL> -</DD> -</DL> -<HR> - -<A NAME="fixLibPackageTail(char[])"><!-- --></A><H3> -fixLibPackageTail</H3> -<PRE> -public static final char[] <B>fixLibPackageTail</B>(char[] packageName)</PRE> -<DL> -<DD><DL> -</DL> -</DD> -</DL> -<HR> - -<A NAME="concatWith(char[][], char)"><!-- --></A><H3> -concatWith</H3> -<PRE> -public static final char[] <B>concatWith</B>(char[][] array, - char separator)</PRE> -<DL> -<DD>Answers the concatenation of the given array parts using the given separator between each part. - <br> - <br> - For example:<br> - <ol> - <li><pre> - array = { { 'a' }, { 'b' } } - separator = '.' - => result = { 'a', '.', 'b' } - </pre> - </li> - <li><pre> - array = null - separator = '.' - => result = { } - </pre></li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>array</CODE> - the given array<DD><CODE>separator</CODE> - the given separator -<DT><B>Returns:</B><DD>the concatenation of the given array parts using the given separator between each part</DL> -</DD> -</DL> -<HR> - -<A NAME="contains(char, char[][])"><!-- --></A><H3> -contains</H3> -<PRE> -public static final boolean <B>contains</B>(char character, - char[][] array)</PRE> -<DL> -<DD>Answers true if the array contains an occurrence of character, false otherwise. - - <br> - <br> - For example: - <ol> - <li><pre> - character = 'c' - array = { { ' a' }, { ' b' } } - result => false - </pre> - </li> - <li><pre> - character = 'a' - array = { { ' a' }, { ' b' } } - result => true - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>character</CODE> - the character to search<DD><CODE>array</CODE> - the array in which the search is done -<DT><B>Returns:</B><DD>true if the array contains an occurrence of character, false otherwise. -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if array is null.</DL> -</DD> -</DL> -<HR> - -<A NAME="contains(char, char[])"><!-- --></A><H3> -contains</H3> -<PRE> -public static final boolean <B>contains</B>(char character, - char[] array)</PRE> -<DL> -<DD>Answers true if the array contains an occurrence of character, false otherwise. - - <br> - <br> - For example: - <ol> - <li><pre> - character = 'c' - array = { ' b' } - result => false - </pre> - </li> - <li><pre> - character = 'a' - array = { ' a' , ' b' } - result => true - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>character</CODE> - the character to search<DD><CODE>array</CODE> - the array in which the search is done -<DT><B>Returns:</B><DD>true if the array contains an occurrence of character, false otherwise. -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if array is null.</DL> -</DD> -</DL> -<HR> - -<A NAME="contains(char[], char[])"><!-- --></A><H3> -contains</H3> -<PRE> -public static final boolean <B>contains</B>(char[] characters, - char[] array)</PRE> -<DL> -<DD>Answers true if the array contains an occurrence of one of the characters, false otherwise. - - <br> - <br> - For example: - <ol> - <li><pre> - characters = { 'c', 'd' } - array = { 'a', ' b' } - result => false - </pre> - </li> - <li><pre> - characters = { 'c', 'd' } - array = { 'a', ' b', 'c' } - result => true - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>characters</CODE> - the characters to search<DD><CODE>array</CODE> - the array in which the search is done -<DT><B>Returns:</B><DD>true if the array contains an occurrence of one of the characters, false otherwise. -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if array is null.</DL> -</DD> -</DL> -<HR> - -<A NAME="deepCopy(char[][])"><!-- --></A><H3> -deepCopy</H3> -<PRE> -public static final char[][] <B>deepCopy</B>(char[][] toCopy)</PRE> -<DL> -<DD>Answers a deep copy of the toCopy array. -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>toCopy</CODE> - the array to copy -<DT><B>Returns:</B><DD>a deep copy of the toCopy array.</DL> -</DD> -</DL> -<HR> - -<A NAME="endsWith(char[], char[])"><!-- --></A><H3> -endsWith</H3> -<PRE> -public static final boolean <B>endsWith</B>(char[] array, - char[] toBeFound)</PRE> -<DL> -<DD>Return true if array ends with the sequence of characters contained in toBeFound, - otherwise false. - <br> - <br> - For example: - <ol> - <li><pre> - array = { 'a', 'b', 'c', 'd' } - toBeFound = { 'b', 'c' } - result => false - </pre> - </li> - <li><pre> - array = { 'a', 'b', 'c' } - toBeFound = { 'b', 'c' } - result => true - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>array</CODE> - the array to check<DD><CODE>toBeFound</CODE> - the array to find -<DT><B>Returns:</B><DD>true if array ends with the sequence of characters contained in toBeFound, - otherwise false. -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if array is null or toBeFound is null</DL> -</DD> -</DL> -<HR> - -<A NAME="equals(char[][], char[][])"><!-- --></A><H3> -equals</H3> -<PRE> -public static final boolean <B>equals</B>(char[][] first, - char[][] second)</PRE> -<DL> -<DD>Answers true if the two arrays are identical character by character, otherwise false. - The equality is case sensitive. - <br> - <br> - For example: - <ol> - <li><pre> - first = null - second = null - result => true - </pre> - </li> - <li><pre> - first = { { } } - second = null - result => false - </pre> - </li> - <li><pre> - first = { { 'a' } } - second = { { 'a' } } - result => true - </pre> - </li> - <li><pre> - first = { { 'A' } } - second = { { 'a' } } - result => false - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>first</CODE> - the first array<DD><CODE>second</CODE> - the second array -<DT><B>Returns:</B><DD>true if the two arrays are identical character by character, otherwise false</DL> -</DD> -</DL> -<HR> - -<A NAME="equals(char[][], char[][], boolean)"><!-- --></A><H3> -equals</H3> -<PRE> -public static final boolean <B>equals</B>(char[][] first, - char[][] second, - boolean isCaseSensitive)</PRE> -<DL> -<DD>If isCaseSensite is true, answers true if the two arrays are identical character - by character, otherwise false. - If it is false, answers true if the two arrays are identical character by - character without checking the case, otherwise false. - <br> - <br> - For example: - <ol> - <li><pre> - first = null - second = null - isCaseSensitive = true - result => true - </pre> - </li> - <li><pre> - first = { { } } - second = null - isCaseSensitive = true - result => false - </pre> - </li> - <li><pre> - first = { { 'A' } } - second = { { 'a' } } - isCaseSensitive = true - result => false - </pre> - </li> - <li><pre> - first = { { 'A' } } - second = { { 'a' } } - isCaseSensitive = false - result => true - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>first</CODE> - the first array<DD><CODE>second</CODE> - the second array<DD><CODE>isCaseSensitive</CODE> - check whether or not the equality should be case sensitive -<DT><B>Returns:</B><DD>true if the two arrays are identical character by character according to the value - of isCaseSensitive, otherwise false</DL> -</DD> -</DL> -<HR> - -<A NAME="equals(char[], char[])"><!-- --></A><H3> -equals</H3> -<PRE> -public static final boolean <B>equals</B>(char[] first, - char[] second)</PRE> -<DL> -<DD>Answers true if the two arrays are identical character by character, otherwise false. - The equality is case sensitive. - <br> - <br> - For example: - <ol> - <li><pre> - first = null - second = null - result => true - </pre> - </li> - <li><pre> - first = { } - second = null - result => false - </pre> - </li> - <li><pre> - first = { 'a' } - second = { 'a' } - result => true - </pre> - </li> - <li><pre> - first = { 'a' } - second = { 'A' } - result => false - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>first</CODE> - the first array<DD><CODE>second</CODE> - the second array -<DT><B>Returns:</B><DD>true if the two arrays are identical character by character, otherwise false</DL> -</DD> -</DL> -<HR> - -<A NAME="equals(char[], char[], int, int)"><!-- --></A><H3> -equals</H3> -<PRE> -public static final boolean <B>equals</B>(char[] first, - char[] second, - int secondStart, - int secondEnd)</PRE> -<DL> -<DD>Answers true if the first array is identical character by character to a portion of the second array - delimited from position secondStart (inclusive) to secondEnd(exclusive), otherwise false. - The equality is case sensitive. - <br> - <br> - For example: - <ol> - <li><pre> - first = null - second = null - secondStart = 0 - secondEnd = 0 - result => true - </pre> - </li> - <li><pre> - first = { } - second = null - secondStart = 0 - secondEnd = 0 - result => false - </pre> - </li> - <li><pre> - first = { 'a' } - second = { 'a' } - secondStart = 0 - secondEnd = 1 - result => true - </pre> - </li> - <li><pre> - first = { 'a' } - second = { 'A' } - secondStart = 0 - secondEnd = 1 - result => false - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>first</CODE> - the first array<DD><CODE>second</CODE> - the second array<DD><CODE>secondStart</CODE> - inclusive start position in the second array to compare<DD><CODE>secondEnd</CODE> - exclusive end position in the second array to compare -<DT><B>Returns:</B><DD>true if the first array is identical character by character to fragment of second array ranging from secondStart to secondEnd-1, otherwise false</DL> -</DD> -</DL> -<HR> - -<A NAME="equals(char[], char[], int, int, boolean)"><!-- --></A><H3> -equals</H3> -<PRE> -public static final boolean <B>equals</B>(char[] first, - char[] second, - int secondStart, - int secondEnd, - boolean isCaseSensitive)</PRE> -<DL> -<DD><p>Answers true if the first array is identical character by character to a portion of the second array - delimited from position secondStart (inclusive) to secondEnd(exclusive), otherwise false. The equality could be either - case sensitive or case insensitive according to the value of the <code>isCaseSensitive</code> parameter. - </p> - <p>For example:</p> - <ol> - <li><pre> - first = null - second = null - secondStart = 0 - secondEnd = 0 - isCaseSensitive = false - result => true - </pre> - </li> - <li><pre> - first = { } - second = null - secondStart = 0 - secondEnd = 0 - isCaseSensitive = false - result => false - </pre> - </li> - <li><pre> - first = { 'a' } - second = { 'a' } - secondStart = 0 - secondEnd = 1 - isCaseSensitive = true - result => true - </pre> - </li> - <li><pre> - first = { 'a' } - second = { 'A' } - secondStart = 0 - secondEnd = 1 - isCaseSensitive = true - result => false - </pre> - </li> - <li><pre> - first = { 'a' } - second = { 'A' } - secondStart = 0 - secondEnd = 1 - isCaseSensitive = false - result => true - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>first</CODE> - the first array<DD><CODE>second</CODE> - the second array<DD><CODE>secondStart</CODE> - inclusive start position in the second array to compare<DD><CODE>secondEnd</CODE> - exclusive end position in the second array to compare<DD><CODE>isCaseSensitive</CODE> - check whether or not the equality should be case sensitive -<DT><B>Returns:</B><DD>true if the first array is identical character by character to fragment of second array ranging from secondStart to secondEnd-1, otherwise false</DL> -</DD> -</DL> -<HR> - -<A NAME="equals(char[], char[], boolean)"><!-- --></A><H3> -equals</H3> -<PRE> -public static final boolean <B>equals</B>(char[] first, - char[] second, - boolean isCaseSensitive)</PRE> -<DL> -<DD>If isCaseSensite is true, answers true if the two arrays are identical character - by character, otherwise false. - If it is false, answers true if the two arrays are identical character by - character without checking the case, otherwise false. - <br> - <br> - For example: - <ol> - <li><pre> - first = null - second = null - isCaseSensitive = true - result => true - </pre> - </li> - <li><pre> - first = { } - second = null - isCaseSensitive = true - result => false - </pre> - </li> - <li><pre> - first = { 'A' } - second = { 'a' } - isCaseSensitive = true - result => false - </pre> - </li> - <li><pre> - first = { 'A' } - second = { 'a' } - isCaseSensitive = false - result => true - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>first</CODE> - the first array<DD><CODE>second</CODE> - the second array<DD><CODE>isCaseSensitive</CODE> - check whether or not the equality should be case sensitive -<DT><B>Returns:</B><DD>true if the two arrays are identical character by character according to the value - of isCaseSensitive, otherwise false</DL> -</DD> -</DL> -<HR> - -<A NAME="fragmentEquals(char[], char[], int, boolean)"><!-- --></A><H3> -fragmentEquals</H3> -<PRE> -public static final boolean <B>fragmentEquals</B>(char[] fragment, - char[] name, - int startIndex, - boolean isCaseSensitive)</PRE> -<DL> -<DD>If isCaseSensite is true, the equality is case sensitive, otherwise it is case insensitive. - - Answers true if the name contains the fragment at the starting index startIndex, otherwise false. - <br> - <br> - For example: - <ol> - <li><pre> - fragment = { 'b', 'c' , 'd' } - name = { 'a', 'b', 'c' , 'd' } - startIndex = 1 - isCaseSensitive = true - result => true - </pre> - </li> - <li><pre> - fragment = { 'b', 'c' , 'd' } - name = { 'a', 'b', 'C' , 'd' } - startIndex = 1 - isCaseSensitive = true - result => false - </pre> - </li> - <li><pre> - fragment = { 'b', 'c' , 'd' } - name = { 'a', 'b', 'C' , 'd' } - startIndex = 0 - isCaseSensitive = false - result => false - </pre> - </li> - <li><pre> - fragment = { 'b', 'c' , 'd' } - name = { 'a', 'b'} - startIndex = 0 - isCaseSensitive = true - result => false - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>fragment</CODE> - the fragment to check<DD><CODE>name</CODE> - the array to check<DD><CODE>startIndex</CODE> - the starting index<DD><CODE>isCaseSensitive</CODE> - check whether or not the equality should be case sensitive -<DT><B>Returns:</B><DD>true if the name contains the fragment at the starting index startIndex according to the - value of isCaseSensitive, otherwise false. -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if fragment or name is null.</DL> -</DD> -</DL> -<HR> - -<A NAME="hashCode(char[])"><!-- --></A><H3> -hashCode</H3> -<PRE> -public static final int <B>hashCode</B>(char[] array)</PRE> -<DL> -<DD>Answers a hashcode for the array -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>array</CODE> - the array for which a hashcode is required -<DT><B>Returns:</B><DD>the hashcode -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if array is null</DL> -</DD> -</DL> -<HR> - -<A NAME="isWhitespace(char)"><!-- --></A><H3> -isWhitespace</H3> -<PRE> -public static boolean <B>isWhitespace</B>(char c)</PRE> -<DL> -<DD>Answers true if c is a whitespace (\u000a, \u000c, \u000d, \u0009), otherwise false. - <br> - <br> - For example: - <ol> - <li><pre> - c = ' ' - result => true - </pre> - </li> - <li><pre> - c = '\u3000' - result => false - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>c</CODE> - the character to check -<DT><B>Returns:</B><DD>true if c is a whitespace according to the JLS, otherwise false.</DL> -</DD> -</DL> -<HR> - -<A NAME="indexOf(char, char[])"><!-- --></A><H3> -indexOf</H3> -<PRE> -public static final int <B>indexOf</B>(char toBeFound, - char[] array)</PRE> -<DL> -<DD>Answers the first index in the array for which the corresponding character is - equal to toBeFound. Answers -1 if no occurrence of this character is found. - <br> - <br> - For example: - <ol> - <li><pre> - toBeFound = 'c' - array = { ' a', 'b', 'c', 'd' } - result => 2 - </pre> - </li> - <li><pre> - toBeFound = 'e' - array = { ' a', 'b', 'c', 'd' } - result => -1 - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>toBeFound</CODE> - the character to search<DD><CODE>array</CODE> - the array to be searched -<DT><B>Returns:</B><DD>the first index in the array for which the corresponding character is - equal to toBeFound, -1 otherwise -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if array is null</DL> -</DD> -</DL> -<HR> - -<A NAME="indexOf(char[], char[], boolean)"><!-- --></A><H3> -indexOf</H3> -<PRE> -public static final int <B>indexOf</B>(char[] toBeFound, - char[] array, - boolean isCaseSensitive)</PRE> -<DL> -<DD>Answers the first index in the array for which the toBeFound array is a matching - subarray following the case rule. Answers -1 if no match is found. - <br> - <br> - For example: - <ol> - <li><pre> - toBeFound = { 'c' } - array = { ' a', 'b', 'c', 'd' } - result => 2 - </pre> - </li> - <li><pre> - toBeFound = { 'e' } - array = { ' a', 'b', 'c', 'd' } - result => -1 - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>toBeFound</CODE> - the subarray to search<DD><CODE>array</CODE> - the array to be searched<DD><CODE>isCaseSensitive</CODE> - flag to know if the matching should be case sensitive -<DT><B>Returns:</B><DD>the first index in the array for which the toBeFound array is a matching - subarray following the case rule, -1 otherwise -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if array is null or toBeFound is null</DL> -</DD> -</DL> -<HR> - -<A NAME="indexOf(char[], char[], boolean, int)"><!-- --></A><H3> -indexOf</H3> -<PRE> -public static final int <B>indexOf</B>(char[] toBeFound, - char[] array, - boolean isCaseSensitive, - int start)</PRE> -<DL> -<DD>Answers the first index in the array for which the toBeFound array is a matching - subarray following the case rule starting at the index start. Answers -1 if no match is found. - <br> - <br> - For example: - <ol> - <li><pre> - toBeFound = { 'c' } - array = { ' a', 'b', 'c', 'd' } - result => 2 - </pre> - </li> - <li><pre> - toBeFound = { 'e' } - array = { ' a', 'b', 'c', 'd' } - result => -1 - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>toBeFound</CODE> - the subarray to search<DD><CODE>array</CODE> - the array to be searched<DD><CODE>isCaseSensitive</CODE> - flag to know if the matching should be case sensitive<DD><CODE>start</CODE> - the starting index -<DT><B>Returns:</B><DD>the first index in the array for which the toBeFound array is a matching - subarray following the case rule starting at the index start, -1 otherwise -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if array is null or toBeFound is null</DL> -</DD> -</DL> -<HR> - -<A NAME="indexOf(char[], char[], boolean, int, int)"><!-- --></A><H3> -indexOf</H3> -<PRE> -public static final int <B>indexOf</B>(char[] toBeFound, - char[] array, - boolean isCaseSensitive, - int start, - int end)</PRE> -<DL> -<DD>Answers the first index in the array for which the toBeFound array is a matching - subarray following the case rule starting at the index start. Answers -1 if no match is found. - <br> - <br> - For example: - <ol> - <li><pre> - toBeFound = { 'c' } - array = { ' a', 'b', 'c', 'd' } - result => 2 - </pre> - </li> - <li><pre> - toBeFound = { 'e' } - array = { ' a', 'b', 'c', 'd' } - result => -1 - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>toBeFound</CODE> - the subarray to search<DD><CODE>array</CODE> - the array to be searched<DD><CODE>isCaseSensitive</CODE> - flag to know if the matching should be case sensitive<DD><CODE>start</CODE> - the starting index (inclusive)<DD><CODE>end</CODE> - the end index (exclusive) -<DT><B>Returns:</B><DD>the first index in the array for which the toBeFound array is a matching - subarray following the case rule starting at the index start, -1 otherwise -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if array is null or toBeFound is null</DL> -</DD> -</DL> -<HR> - -<A NAME="indexOf(char, char[], int)"><!-- --></A><H3> -indexOf</H3> -<PRE> -public static final int <B>indexOf</B>(char toBeFound, - char[] array, - int start)</PRE> -<DL> -<DD>Answers the first index in the array for which the corresponding character is - equal to toBeFound starting the search at index start. - Answers -1 if no occurrence of this character is found. - <br> - <br> - For example: - <ol> - <li><pre> - toBeFound = 'c' - array = { ' a', 'b', 'c', 'd' } - start = 2 - result => 2 - </pre> - </li> - <li><pre> - toBeFound = 'c' - array = { ' a', 'b', 'c', 'd' } - start = 3 - result => -1 - </pre> - </li> - <li><pre> - toBeFound = 'e' - array = { ' a', 'b', 'c', 'd' } - start = 1 - result => -1 - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>toBeFound</CODE> - the character to search<DD><CODE>array</CODE> - the array to be searched<DD><CODE>start</CODE> - the starting index -<DT><B>Returns:</B><DD>the first index in the array for which the corresponding character is - equal to toBeFound, -1 otherwise -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if array is null -<DD><CODE>java.lang.ArrayIndexOutOfBoundsException</CODE> - if start is lower than 0</DL> -</DD> -</DL> -<HR> - -<A NAME="indexOf(char, char[], int, int)"><!-- --></A><H3> -indexOf</H3> -<PRE> -public static final int <B>indexOf</B>(char toBeFound, - char[] array, - int start, - int end)</PRE> -<DL> -<DD>Answers the first index in the array for which the corresponding character is - equal to toBeFound starting the search at index start and before the ending index. - Answers -1 if no occurrence of this character is found. - <br> - <br> - For example: - <ol> - <li><pre> - toBeFound = 'c' - array = { ' a', 'b', 'c', 'd' } - start = 2 - result => 2 - </pre> - </li> - <li><pre> - toBeFound = 'c' - array = { ' a', 'b', 'c', 'd' } - start = 3 - result => -1 - </pre> - </li> - <li><pre> - toBeFound = 'e' - array = { ' a', 'b', 'c', 'd' } - start = 1 - result => -1 - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>toBeFound</CODE> - the character to search<DD><CODE>array</CODE> - the array to be searched<DD><CODE>start</CODE> - the starting index (inclusive)<DD><CODE>end</CODE> - the ending index (exclusive) -<DT><B>Returns:</B><DD>the first index in the array for which the corresponding character is - equal to toBeFound, -1 otherwise -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if array is null -<DD><CODE>java.lang.ArrayIndexOutOfBoundsException</CODE> - if start is lower than 0 or ending greater than array length</DL> -</DD> -</DL> -<HR> - -<A NAME="lastIndexOf(char, char[])"><!-- --></A><H3> -lastIndexOf</H3> -<PRE> -public static final int <B>lastIndexOf</B>(char toBeFound, - char[] array)</PRE> -<DL> -<DD>Answers the last index in the array for which the corresponding character is - equal to toBeFound starting from the end of the array. - Answers -1 if no occurrence of this character is found. - <br> - <br> - For example: - <ol> - <li><pre> - toBeFound = 'c' - array = { ' a', 'b', 'c', 'd' , 'c', 'e' } - result => 4 - </pre> - </li> - <li><pre> - toBeFound = 'e' - array = { ' a', 'b', 'c', 'd' } - result => -1 - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>toBeFound</CODE> - the character to search<DD><CODE>array</CODE> - the array to be searched -<DT><B>Returns:</B><DD>the last index in the array for which the corresponding character is - equal to toBeFound starting from the end of the array, -1 otherwise -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if array is null</DL> -</DD> -</DL> -<HR> - -<A NAME="lastIndexOf(char, char[], int)"><!-- --></A><H3> -lastIndexOf</H3> -<PRE> -public static final int <B>lastIndexOf</B>(char toBeFound, - char[] array, - int startIndex)</PRE> -<DL> -<DD>Answers the last index in the array for which the corresponding character is - equal to toBeFound stopping at the index startIndex. - Answers -1 if no occurrence of this character is found. - <br> - <br> - For example: - <ol> - <li><pre> - toBeFound = 'c' - array = { ' a', 'b', 'c', 'd' } - startIndex = 2 - result => 2 - </pre> - </li> - <li><pre> - toBeFound = 'c' - array = { ' a', 'b', 'c', 'd', 'e' } - startIndex = 3 - result => -1 - </pre> - </li> - <li><pre> - toBeFound = 'e' - array = { ' a', 'b', 'c', 'd' } - startIndex = 0 - result => -1 - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>toBeFound</CODE> - the character to search<DD><CODE>array</CODE> - the array to be searched<DD><CODE>startIndex</CODE> - the stopping index -<DT><B>Returns:</B><DD>the last index in the array for which the corresponding character is - equal to toBeFound stopping at the index startIndex, -1 otherwise -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if array is null -<DD><CODE>java.lang.ArrayIndexOutOfBoundsException</CODE> - if startIndex is lower than 0</DL> -</DD> -</DL> -<HR> - -<A NAME="lastIndexOf(char, char[], int, int)"><!-- --></A><H3> -lastIndexOf</H3> -<PRE> -public static final int <B>lastIndexOf</B>(char toBeFound, - char[] array, - int startIndex, - int endIndex)</PRE> -<DL> -<DD>Answers the last index in the array for which the corresponding character is - equal to toBeFound starting from endIndex to startIndex. - Answers -1 if no occurrence of this character is found. - <br> - <br> - For example: - <ol> - <li><pre> - toBeFound = 'c' - array = { ' a', 'b', 'c', 'd' } - startIndex = 2 - endIndex = 2 - result => 2 - </pre> - </li> - <li><pre> - toBeFound = 'c' - array = { ' a', 'b', 'c', 'd', 'e' } - startIndex = 3 - endIndex = 4 - result => -1 - </pre> - </li> - <li><pre> - toBeFound = 'e' - array = { ' a', 'b', 'c', 'd' } - startIndex = 0 - endIndex = 3 - result => -1 - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>toBeFound</CODE> - the character to search<DD><CODE>array</CODE> - the array to be searched<DD><CODE>startIndex</CODE> - the stopping index<DD><CODE>endIndex</CODE> - the starting index -<DT><B>Returns:</B><DD>the last index in the array for which the corresponding character is - equal to toBeFound starting from endIndex to startIndex, -1 otherwise -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if array is null -<DD><CODE>java.lang.ArrayIndexOutOfBoundsException</CODE> - if endIndex is greater or equals to array length or starting is lower than 0</DL> -</DD> -</DL> -<HR> - -<A NAME="lastSegment(char[], char)"><!-- --></A><H3> -lastSegment</H3> -<PRE> -public static final char[] <B>lastSegment</B>(char[] array, - char separator)</PRE> -<DL> -<DD>Answers the last portion of a name given a separator. - <br> - <br> - For example, - <pre> - lastSegment("my.namespace.Object".toCharArray(),'.') --> Object - </pre> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>array</CODE> - the array<DD><CODE>separator</CODE> - the given separator -<DT><B>Returns:</B><DD>the last portion of a name given a separator -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if array is null</DL> -</DD> -</DL> -<HR> - -<A NAME="match(char[], char[], boolean)"><!-- --></A><H3> -match</H3> -<PRE> -public static final boolean <B>match</B>(char[] pattern, - char[] name, - boolean isCaseSensitive)</PRE> -<DL> -<DD>Answers true if the pattern matches the given name, false otherwise. This char[] pattern matching - accepts wild-cards '*' and '?'. - - When not case sensitive, the pattern is assumed to already be lowercased, the - name will be lowercased character per character as comparing. - If name is null, the answer is false. - If pattern is null, the answer is true if name is not null. - <br> - <br> - For example: - <ol> - <li><pre> - pattern = { '?', 'b', '*' } - name = { 'a', 'b', 'c' , 'd' } - isCaseSensitive = true - result => true - </pre> - </li> - <li><pre> - pattern = { '?', 'b', '?' } - name = { 'a', 'b', 'c' , 'd' } - isCaseSensitive = true - result => false - </pre> - </li> - <li><pre> - pattern = { 'b', '*' } - name = { 'a', 'b', 'c' , 'd' } - isCaseSensitive = true - result => false - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>pattern</CODE> - the given pattern<DD><CODE>name</CODE> - the given name<DD><CODE>isCaseSensitive</CODE> - flag to know whether or not the matching should be case sensitive -<DT><B>Returns:</B><DD>true if the pattern matches the given name, false otherwise</DL> -</DD> -</DL> -<HR> - -<A NAME="match(char[], int, int, char[], int, int, boolean)"><!-- --></A><H3> -match</H3> -<PRE> -public static final boolean <B>match</B>(char[] pattern, - int patternStart, - int patternEnd, - char[] name, - int nameStart, - int nameEnd, - boolean isCaseSensitive)</PRE> -<DL> -<DD>Answers true if a sub-pattern matches the subpart of the given name, false otherwise. - char[] pattern matching, accepting wild-cards '*' and '?'. Can match only subset of name/pattern. - end positions are non-inclusive. - The subpattern is defined by the patternStart and pattternEnd positions. - When not case sensitive, the pattern is assumed to already be lowercased, the - name will be lowercased character per character as comparing. - <br> - <br> - For example: - <ol> - <li><pre> - pattern = { '?', 'b', '*' } - patternStart = 1 - patternEnd = 3 - name = { 'a', 'b', 'c' , 'd' } - nameStart = 1 - nameEnd = 4 - isCaseSensitive = true - result => true - </pre> - </li> - <li><pre> - pattern = { '?', 'b', '*' } - patternStart = 1 - patternEnd = 2 - name = { 'a', 'b', 'c' , 'd' } - nameStart = 1 - nameEnd = 2 - isCaseSensitive = true - result => false - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>pattern</CODE> - the given pattern<DD><CODE>patternStart</CODE> - the given pattern start<DD><CODE>patternEnd</CODE> - the given pattern end<DD><CODE>name</CODE> - the given name<DD><CODE>nameStart</CODE> - the given name start<DD><CODE>nameEnd</CODE> - the given name end<DD><CODE>isCaseSensitive</CODE> - flag to know if the matching should be case sensitive -<DT><B>Returns:</B><DD>true if a sub-pattern matches the subpart of the given name, false otherwise</DL> -</DD> -</DL> -<HR> - -<A NAME="pathMatch(char[], char[], boolean, char)"><!-- --></A><H3> -pathMatch</H3> -<PRE> -public static final boolean <B>pathMatch</B>(char[] pattern, - char[] filepath, - boolean isCaseSensitive, - char pathSeparator)</PRE> -<DL> -<DD>Answers true if the pattern matches the filepath using the pathSepatator, false otherwise. - - Path char[] pattern matching, accepting wild-cards '**', '*' and '?' (using Ant directory tasks - conventions, also see "http://jakarta.apache.org/ant/manual/dirtasks.html#defaultexcludes"). - Path pattern matching is enhancing regular pattern matching in supporting extra rule where '**' represent - any folder combination. - Special rule: - - foo\ is equivalent to foo\** - When not case sensitive, the pattern is assumed to already be lowercased, the - name will be lowercased character per character as comparing. -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>pattern</CODE> - the given pattern<DD><CODE>filepath</CODE> - the given path<DD><CODE>isCaseSensitive</CODE> - to find out whether or not the matching should be case sensitive<DD><CODE>pathSeparator</CODE> - the given path separator -<DT><B>Returns:</B><DD>true if the pattern matches the filepath using the pathSepatator, false otherwise</DL> -</DD> -</DL> -<HR> - -<A NAME="occurencesOf(char, char[])"><!-- --></A><H3> -occurencesOf</H3> -<PRE> -public static final int <B>occurencesOf</B>(char toBeFound, - char[] array)</PRE> -<DL> -<DD>Answers the number of occurrences of the given character in the given array, 0 if any. - - <br> - <br> - For example: - <ol> - <li><pre> - toBeFound = 'b' - array = { 'a' , 'b', 'b', 'a', 'b', 'a' } - result => 3 - </pre> - </li> - <li><pre> - toBeFound = 'c' - array = { 'a' , 'b', 'b', 'a', 'b', 'a' } - result => 0 - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>toBeFound</CODE> - the given character<DD><CODE>array</CODE> - the given array -<DT><B>Returns:</B><DD>the number of occurrences of the given character in the given array, 0 if any -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if array is null</DL> -</DD> -</DL> -<HR> - -<A NAME="occurencesOf(char, char[], int)"><!-- --></A><H3> -occurencesOf</H3> -<PRE> -public static final int <B>occurencesOf</B>(char toBeFound, - char[] array, - int start)</PRE> -<DL> -<DD>Answers the number of occurrences of the given character in the given array starting - at the given index, 0 if any. - - <br> - <br> - For example: - <ol> - <li><pre> - toBeFound = 'b' - array = { 'a' , 'b', 'b', 'a', 'b', 'a' } - start = 2 - result => 2 - </pre> - </li> - <li><pre> - toBeFound = 'c' - array = { 'a' , 'b', 'b', 'a', 'b', 'a' } - start = 0 - result => 0 - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>toBeFound</CODE> - the given character<DD><CODE>array</CODE> - the given array<DD><CODE>start</CODE> - the given index -<DT><B>Returns:</B><DD>the number of occurrences of the given character in the given array, 0 if any -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if array is null -<DD><CODE>java.lang.ArrayIndexOutOfBoundsException</CODE> - if start is lower than 0</DL> -</DD> -</DL> -<HR> - -<A NAME="prefixEquals(char[], char[])"><!-- --></A><H3> -prefixEquals</H3> -<PRE> -public static final boolean <B>prefixEquals</B>(char[] prefix, - char[] name)</PRE> -<DL> -<DD>Answers true if the given name starts with the given prefix, false otherwise. - The comparison is case sensitive. - <br> - <br> - For example: - <ol> - <li><pre> - prefix = { 'a' , 'b' } - name = { 'a' , 'b', 'b', 'a', 'b', 'a' } - result => true - </pre> - </li> - <li><pre> - prefix = { 'a' , 'c' } - name = { 'a' , 'b', 'b', 'a', 'b', 'a' } - result => false - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>prefix</CODE> - the given prefix<DD><CODE>name</CODE> - the given name -<DT><B>Returns:</B><DD>true if the given name starts with the given prefix, false otherwise -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if the given name is null or if the given prefix is null</DL> -</DD> -</DL> -<HR> - -<A NAME="prefixEquals(char[], char[], boolean)"><!-- --></A><H3> -prefixEquals</H3> -<PRE> -public static final boolean <B>prefixEquals</B>(char[] prefix, - char[] name, - boolean isCaseSensitive)</PRE> -<DL> -<DD>Answers true if the given name starts with the given prefix, false otherwise. - isCaseSensitive is used to find out whether or not the comparison should be case sensitive. - <br> - <br> - For example: - <ol> - <li><pre> - prefix = { 'a' , 'B' } - name = { 'a' , 'b', 'b', 'a', 'b', 'a' } - isCaseSensitive = false - result => true - </pre> - </li> - <li><pre> - prefix = { 'a' , 'B' } - name = { 'a' , 'b', 'b', 'a', 'b', 'a' } - isCaseSensitive = true - result => false - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>prefix</CODE> - the given prefix<DD><CODE>name</CODE> - the given name<DD><CODE>isCaseSensitive</CODE> - to find out whether or not the comparison should be case sensitive -<DT><B>Returns:</B><DD>true if the given name starts with the given prefix, false otherwise -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if the given name is null or if the given prefix is null</DL> -</DD> -</DL> -<HR> - -<A NAME="remove(char[], char)"><!-- --></A><H3> -remove</H3> -<PRE> -public static final char[] <B>remove</B>(char[] array, - char toBeRemoved)</PRE> -<DL> -<DD>Answers a new array removing a given character. Answers the given array if there is - no occurence of the character to remove. - <br> - <br> - For example: - <ol> - <li><pre> - array = { 'a' , 'b', 'b', 'c', 'b', 'a' } - toBeRemoved = 'b' - return { 'a' , 'c', 'a' } - </pre> - </li> - <li><pre> - array = { 'a' , 'b', 'b', 'a', 'b', 'a' } - toBeRemoved = 'c' - return array - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>array</CODE> - the given array<DD><CODE>toBeRemoved</CODE> - the character to be removed -<DT><B>Returns:</B><DD>a new array removing given character</DL> -</DD> -</DL> -<HR> - -<A NAME="replace(char[], char, char)"><!-- --></A><H3> -replace</H3> -<PRE> -public static final void <B>replace</B>(char[] array, - char toBeReplaced, - char replacementChar)</PRE> -<DL> -<DD>Replace all occurrence of the character to be replaced with the replacement character in the - given array. - <br> - <br> - For example: - <ol> - <li><pre> - array = { 'a' , 'b', 'b', 'a', 'b', 'a' } - toBeReplaced = 'b' - replacementChar = 'a' - result => No returned value, but array is now equals to { 'a' , 'a', 'a', 'a', 'a', 'a' } - </pre> - </li> - <li><pre> - array = { 'a' , 'b', 'b', 'a', 'b', 'a' } - toBeReplaced = 'c' - replacementChar = 'a' - result => No returned value, but array is now equals to { 'a' , 'b', 'b', 'a', 'b', 'a' } - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>array</CODE> - the given array<DD><CODE>toBeReplaced</CODE> - the character to be replaced<DD><CODE>replacementChar</CODE> - the replacement character -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if the given array is null</DL> -</DD> -</DL> -<HR> - -<A NAME="replace(char[], char[], char)"><!-- --></A><H3> -replace</H3> -<PRE> -public static final void <B>replace</B>(char[] array, - char[] toBeReplaced, - char replacementChar)</PRE> -<DL> -<DD>Replace all occurrences of characters to be replaced with the replacement character in the - given array. - <br> - <br> - For example: - <ol> - <li><pre> - array = { 'a' , 'b', 'b', 'c', 'a', 'b', 'c', 'a' } - toBeReplaced = { 'b', 'c' } - replacementChar = 'a' - result => No returned value, but array is now equals to { 'a' , 'a', 'a', 'a', 'a', 'a', 'a', 'a' } - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>array</CODE> - the given array<DD><CODE>toBeReplaced</CODE> - characters to be replaced<DD><CODE>replacementChar</CODE> - the replacement character -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if arrays are null.</DL> -</DD> -</DL> -<HR> - -<A NAME="replace(char[], char[], char, int, int)"><!-- --></A><H3> -replace</H3> -<PRE> -public static final void <B>replace</B>(char[] array, - char[] toBeReplaced, - char replacementChar, - int start, - int end)</PRE> -<DL> -<DD>Replace all occurrences of characters to be replaced with the replacement character in the - given array from the start position (inclusive) to the end position (exclusive). - <br> - <br> - For example: - <ol> - <li><pre> - array = { 'a' , 'b', 'b', 'c', 'a', 'b', 'c', 'a' } - toBeReplaced = { 'b', 'c' } - replacementChar = 'a' - start = 4 - end = 8 - result => No returned value, but array is now equals to { 'a' , 'b', 'b', 'c', 'a', 'a', 'a', 'a' } - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>array</CODE> - the given array<DD><CODE>toBeReplaced</CODE> - characters to be replaced<DD><CODE>replacementChar</CODE> - the replacement character<DD><CODE>start</CODE> - the given start position (inclusive)<DD><CODE>end</CODE> - the given end position (exclusive) -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if arrays are null.</DL> -</DD> -</DL> -<HR> - -<A NAME="replace(char[], char[], char[])"><!-- --></A><H3> -replace</H3> -<PRE> -public static final char[] <B>replace</B>(char[] array, - char[] toBeReplaced, - char[] replacementChars)</PRE> -<DL> -<DD>Answers a new array of characters with substitutions. No side-effect is operated on the original - array, in case no substitution happened, then the result is the same as the - original one. - <br> - <br> - For example: - <ol> - <li><pre> - array = { 'a' , 'b', 'b', 'a', 'b', 'a' } - toBeReplaced = { 'b' } - replacementChar = { 'a', 'a' } - result => { 'a', 'a', 'a', 'a', 'a', 'a', 'a', 'a', 'a' } - </pre> - </li> - <li><pre> - array = { 'a' , 'b', 'b', 'a', 'b', 'a' } - toBeReplaced = { 'c' } - replacementChar = { 'a' } - result => { 'a' , 'b', 'b', 'a', 'b', 'a' } - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>array</CODE> - the given array<DD><CODE>toBeReplaced</CODE> - characters to be replaced<DD><CODE>replacementChars</CODE> - the replacement characters -<DT><B>Returns:</B><DD>a new array of characters with substitutions or the given array if none -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if the given array is null</DL> -</DD> -</DL> -<HR> - -<A NAME="replaceOnCopy(char[], char, char)"><!-- --></A><H3> -replaceOnCopy</H3> -<PRE> -public static final char[] <B>replaceOnCopy</B>(char[] array, - char toBeReplaced, - char replacementChar)</PRE> -<DL> -<DD>Replace all occurrence of the character to be replaced with the replacement character - in a copy of the given array. Returns the given array if no occurrences of the character - to be replaced are found. - <br> - <br> - For example: - <ol> - <li><pre> - array = { 'a' , 'b', 'b', 'a', 'b', 'a' } - toBeReplaced = 'b' - replacementChar = 'a' - result => A new array that is equals to { 'a' , 'a', 'a', 'a', 'a', 'a' } - </pre> - </li> - <li><pre> - array = { 'a' , 'b', 'b', 'a', 'b', 'a' } - toBeReplaced = 'c' - replacementChar = 'a' - result => The original array that remains unchanged. - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>array</CODE> - the given array<DD><CODE>toBeReplaced</CODE> - the character to be replaced<DD><CODE>replacementChar</CODE> - the replacement character -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if the given array is null</DL> -</DD> -</DL> -<HR> - -<A NAME="splitAndTrimOn(char, char[])"><!-- --></A><H3> -splitAndTrimOn</H3> -<PRE> -public static final char[][] <B>splitAndTrimOn</B>(char divider, - char[] array)</PRE> -<DL> -<DD>Return a new array which is the split of the given array using the given divider and triming each subarray to remove - whitespaces equals to ' '. - <br> - <br> - For example: - <ol> - <li><pre> - divider = 'b' - array = { 'a' , 'b', 'b', 'a', 'b', 'a' } - result => { { 'a' }, { }, { 'a' }, { 'a' } } - </pre> - </li> - <li><pre> - divider = 'c' - array = { 'a' , 'b', 'b', 'a', 'b', 'a' } - result => { { 'a', 'b', 'b', 'a', 'b', 'a' } } - </pre> - </li> - <li><pre> - divider = 'b' - array = { 'a' , ' ', 'b', 'b', 'a', 'b', 'a' } - result => { { 'a' }, { }, { 'a' }, { 'a' } } - </pre> - </li> - <li><pre> - divider = 'c' - array = { ' ', ' ', 'a' , 'b', 'b', 'a', 'b', 'a', ' ' } - result => { { 'a', 'b', 'b', 'a', 'b', 'a' } } - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>divider</CODE> - the given divider<DD><CODE>array</CODE> - the given array -<DT><B>Returns:</B><DD>a new array which is the split of the given array using the given divider and triming each subarray to remove - whitespaces equals to ' '</DL> -</DD> -</DL> -<HR> - -<A NAME="splitOn(char, char[])"><!-- --></A><H3> -splitOn</H3> -<PRE> -public static final char[][] <B>splitOn</B>(char divider, - char[] array)</PRE> -<DL> -<DD>Return a new array which is the split of the given array using the given divider. - <br> - <br> - For example: - <ol> - <li><pre> - divider = 'b' - array = { 'a' , 'b', 'b', 'a', 'b', 'a' } - result => { { 'a' }, { }, { 'a' }, { 'a' } } - </pre> - </li> - <li><pre> - divider = 'c' - array = { 'a' , 'b', 'b', 'a', 'b', 'a' } - result => { { 'a', 'b', 'b', 'a', 'b', 'a' } } - </pre> - </li> - <li><pre> - divider = 'c' - array = { ' ', ' ', 'a' , 'b', 'b', 'a', 'b', 'a', ' ' } - result => { { ' ', 'a', 'b', 'b', 'a', 'b', 'a', ' ' } } - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>divider</CODE> - the given divider<DD><CODE>array</CODE> - the given array -<DT><B>Returns:</B><DD>a new array which is the split of the given array using the given divider</DL> -</DD> -</DL> -<HR> - -<A NAME="splitOn(char, char[], int, int)"><!-- --></A><H3> -splitOn</H3> -<PRE> -public static final char[][] <B>splitOn</B>(char divider, - char[] array, - int start, - int end)</PRE> -<DL> -<DD>Return a new array which is the split of the given array using the given divider. The given end - is exclusive and the given start is inclusive. - <br> - <br> - For example: - <ol> - <li><pre> - divider = 'b' - array = { 'a' , 'b', 'b', 'a', 'b', 'a' } - start = 2 - end = 5 - result => { { }, { 'a' }, { } } - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>divider</CODE> - the given divider<DD><CODE>array</CODE> - the given array<DD><CODE>start</CODE> - the given starting index<DD><CODE>end</CODE> - the given ending index -<DT><B>Returns:</B><DD>a new array which is the split of the given array using the given divider -<DT><B>Throws:</B> -<DD><CODE>java.lang.ArrayIndexOutOfBoundsException</CODE> - if start is lower than 0 or end is greater than the array length</DL> -</DD> -</DL> -<HR> - -<A NAME="subarray(char[][], int, int)"><!-- --></A><H3> -subarray</H3> -<PRE> -public static final char[][] <B>subarray</B>(char[][] array, - int start, - int end)</PRE> -<DL> -<DD>Answers a new array which is a copy of the given array starting at the given start and - ending at the given end. The given start is inclusive and the given end is exclusive. - Answers null if start is greater than end, if start is lower than 0 or if end is greater - than the length of the given array. If end equals -1, it is converted to the array length. - <br> - <br> - For example: - <ol> - <li><pre> - array = { { 'a' } , { 'b' } } - start = 0 - end = 1 - result => { { 'a' } } - </pre> - </li> - <li><pre> - array = { { 'a' } , { 'b' } } - start = 0 - end = -1 - result => { { 'a' }, { 'b' } } - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>array</CODE> - the given array<DD><CODE>start</CODE> - the given starting index<DD><CODE>end</CODE> - the given ending index -<DT><B>Returns:</B><DD>a new array which is a copy of the given array starting at the given start and - ending at the given end -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if the given array is null</DL> -</DD> -</DL> -<HR> - -<A NAME="subarray(char[], int, int)"><!-- --></A><H3> -subarray</H3> -<PRE> -public static final char[] <B>subarray</B>(char[] array, - int start, - int end)</PRE> -<DL> -<DD>Answers a new array which is a copy of the given array starting at the given start and - ending at the given end. The given start is inclusive and the given end is exclusive. - Answers null if start is greater than end, if start is lower than 0 or if end is greater - than the length of the given array. If end equals -1, it is converted to the array length. - <br> - <br> - For example: - <ol> - <li><pre> - array = { 'a' , 'b' } - start = 0 - end = 1 - result => { 'a' } - </pre> - </li> - <li><pre> - array = { 'a', 'b' } - start = 0 - end = -1 - result => { 'a' , 'b' } - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>array</CODE> - the given array<DD><CODE>start</CODE> - the given starting index<DD><CODE>end</CODE> - the given ending index -<DT><B>Returns:</B><DD>a new array which is a copy of the given array starting at the given start and - ending at the given end -<DT><B>Throws:</B> -<DD><CODE>java.lang.NullPointerException</CODE> - if the given array is null</DL> -</DD> -</DL> -<HR> - -<A NAME="toLowerCase(char[])"><!-- --></A><H3> -toLowerCase</H3> -<PRE> -public static final char[] <B>toLowerCase</B>(char[] chars)</PRE> -<DL> -<DD>Answers the result of a char[] conversion to lowercase. Answers null if the given chars array is null. - <br> - NOTE: If no conversion was necessary, then answers back the argument one. - <br> - <br> - For example: - <ol> - <li><pre> - chars = { 'a' , 'b' } - result => { 'a' , 'b' } - </pre> - </li> - <li><pre> - array = { 'A', 'b' } - result => { 'a' , 'b' } - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>chars</CODE> - the chars to convert -<DT><B>Returns:</B><DD>the result of a char[] conversion to lowercase</DL> -</DD> -</DL> -<HR> - -<A NAME="trim(char[])"><!-- --></A><H3> -trim</H3> -<PRE> -public static final char[] <B>trim</B>(char[] chars)</PRE> -<DL> -<DD>Answers a new array removing leading and trailing spaces (' '). Answers the given array if there is no - space characters to remove. - <br> - <br> - For example: - <ol> - <li><pre> - chars = { ' ', 'a' , 'b', ' ', ' ' } - result => { 'a' , 'b' } - </pre> - </li> - <li><pre> - array = { 'A', 'b' } - result => { 'A' , 'b' } - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>chars</CODE> - the given array -<DT><B>Returns:</B><DD>a new array removing leading and trailing spaces (' ')</DL> -</DD> -</DL> -<HR> - -<A NAME="toString(char[][])"><!-- --></A><H3> -toString</H3> -<PRE> -public static final java.lang.String <B>toString</B>(char[][] array)</PRE> -<DL> -<DD>Answers a string which is the concatenation of the given array using the '.' as a separator. - <br> - <br> - For example: - <ol> - <li><pre> - array = { { 'a' } , { 'b' } } - result => "a.b" - </pre> - </li> - <li><pre> - array = { { ' ', 'a' } , { 'b' } } - result => " a.b" - </pre> - </li> - </ol> -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>array</CODE> - the given array -<DT><B>Returns:</B><DD>a string which is the concatenation of the given array using the '.' as a separator</DL> -</DD> -</DL> -<HR> - -<A NAME="toStrings(char[][])"><!-- --></A><H3> -toStrings</H3> -<PRE> -public static final java.lang.String[] <B>toStrings</B>(char[][] array)</PRE> -<DL> -<DD>Answers an array of strings from the given array of char array. -<P> -<DD><DL> -<DT><B>Parameters:</B><DD><CODE>array</CODE> - the given array -<DT><B>Returns:</B><DD>an array of strings</DL> -</DD> -</DL> -<!-- ========= END OF CLASS DATA ========= --> -<HR> - - -<!-- ======= START OF BOTTOM NAVBAR ====== --> -<A NAME="navbar_bottom"><!-- --></A> -<A HREF="#skip-navbar_bottom" title="Skip navigation links"></A> -<TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0" SUMMARY=""> -<TR> -<TD COLSPAN=2 BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> -<A NAME="navbar_bottom_firstrow"><!-- --></A> -<TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3" SUMMARY=""> - <TR ALIGN="center" VALIGN="top"> - <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../../overview-summary.html"><FONT CLASS="NavBarFont1"><B>Overview</B></FONT></A> </TD> - <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A> </TD> - <TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> <FONT CLASS="NavBarFont1Rev"><B>Class</B></FONT> </TD> - <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="class-use/CharOperation.html"><FONT CLASS="NavBarFont1"><B>Use</B></FONT></A> </TD> - <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A> </TD> - <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A> </TD> - <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../../index-files/index-1.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A> </TD> - <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../../help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A> </TD> - </TR> -</TABLE> -</TD> -<TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM> -</EM> -</TD> -</TR> - -<TR> -<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2"> - <A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/CategorizedProblem.html" title="class in org.eclipse.wst.jsdt.core.compiler"><B>PREV CLASS</B></A> - <A HREF="../../../../../../org/eclipse/wst/jsdt/core/compiler/InvalidInputException.html" title="class in org.eclipse.wst.jsdt.core.compiler"><B>NEXT CLASS</B></A></FONT></TD> -<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2"> - <A HREF="../../../../../../index.html?org/eclipse/wst/jsdt/core/compiler/CharOperation.html" target="_top"><B>FRAMES</B></A> - <A HREF="CharOperation.html" target="_top"><B>NO FRAMES</B></A> - <SCRIPT type="text/javascript"> - <!-- - if(window==top) { - document.writeln('<A HREF="../../../../../../allclasses-noframe.html"><B>All Classes</B></A>'); - } - //--> -</SCRIPT> -<NOSCRIPT> - <A HREF="../../../../../../allclasses-noframe.html"><B>All Classes</B></A> -</NOSCRIPT> - - -</FONT></TD> -</TR> -<TR> -<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2"> - SUMMARY: NESTED | <A HREF="#field_summary">FIELD</A> | <A HREF="#constructor_summary">CONSTR</A> | <A HREF="#method_summary">METHOD</A></FONT></TD> -<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2"> -DETAIL: <A HREF="#field_detail">FIELD</A> | <A HREF="#constructor_detail">CONSTR</A> | <A HREF="#method_detail">METHOD</A></FONT></TD> -</TR> -</TABLE> -<A NAME="skip-navbar_bottom"></A> -<!-- ======== END OF BOTTOM NAVBAR ======= --> - -<HR> - -</BODY> -</HTML> |