5 private int cachedHashcode;
10 public String(char str[]) {
11 char charstr[]=new char[str.length];
12 for(int i=0;i<str.length;i++)
15 this.count=str.length;
19 public String(byte str[]) {
20 char charstr[]=new char[str.length];
21 for(int i=0;i<str.length;i++)
22 charstr[i]=(char)str[i];
24 this.count=str.length;
28 public String(String str) {
31 this.offset=str.offset;
34 public String(StringBuffer strbuf) {
35 value=new char[strbuf.length()];
36 count=strbuf.length();
38 for(int i=0;i<count;i++)
39 value[i]=strbuf.value[i];
42 public boolean endsWith(String suffix) {
43 return regionMatches(count - suffix.count, suffix, 0, suffix.count);
47 public String substring(int beginIndex) {
48 return substring(beginIndex, this.count);
51 public String subString(int beginIndex, int endIndex) {
52 return substring(beginIndex, endIndex);
55 public String substring(int beginIndex, int endIndex) {
56 String str=new String();
57 if (beginIndex>this.count||endIndex>this.count||beginIndex>endIndex) {
61 str.count=endIndex-beginIndex;
62 str.offset=this.offset+beginIndex;
66 public String subString(int beginIndex) {
67 return this.subString(beginIndex, this.count);
70 public int lastindexOf(int ch) {
71 return this.lastindexOf(ch, count - 1);
74 public String concat(String str) {
75 String newstr=new String();
76 newstr.count=this.count+str.count;
77 char charstr[]=new char[newstr.count];
80 for(int i=0;i<count;i++) {
81 charstr[i]=value[i+offset];
83 for(int i=0;i<str.count;i++) {
84 charstr[i+count]=str.value[i+str.offset];
89 public int lastindexOf(int ch, int fromIndex) {
90 for(int i=fromIndex;i>0;i--)
91 if (this.charAt(i)==ch)
96 public String replace(char oldch, char newch) {
97 char[] buffer=new char[count];
98 for(int i=0;i<count;i++) {
104 return new String(buffer);
107 public int indexOf(int ch) {
108 return this.indexOf(ch, 0);
111 public int indexOf(int ch, int fromIndex) {
112 for(int i=fromIndex;i<count;i++)
113 if (this.charAt(i)==ch)
118 public int indexOf(String str) {
119 return this.indexOf(str, 0);
122 public int indexOf(String str, int fromIndex) {
125 for(int i=fromIndex;i<=(count-str.count);i++)
126 if (regionMatches(i, str, 0, str.count))
131 public int lastIndexOf(String str, int fromIndex) {
132 int k=count-str.count;
136 if (regionMatches(fromIndex, str, 0, str.count))
142 public int lastIndexOf(String str) {
143 return lastIndexOf(str, count-str.count);
146 public boolean startsWith(String str) {
147 return regionMatches(0, str, 0, str.count);
150 public boolean startsWith(String str, int toffset) {
151 return regionMatches(toffset, str, 0, str.count);
154 public boolean regionMatches(int toffset, String other, int ooffset, int len) {
155 if (toffset<0 || ooffset <0 || (toffset+len)>count || (ooffset+len)>other.count)
157 for(int i=0;i<len;i++)
158 if (other.value[i+other.offset+ooffset]!=
159 this.value[i+this.offset+toffset])
164 public char[] toCharArray() {
165 char str[]=new char[count];
166 for(int i=0;i<count;i++)
167 str[i]=value[i+offset];
171 public byte[] getBytes() {
172 byte str[]=new byte[count];
173 for(int i=0;i<count;i++)
174 str[i]=(byte)value[i+offset];
178 public int length() {
182 public char charAt(int i) {
183 return value[i+offset];
186 public String toString() {
190 public static String valueOf(Object o) {
197 public static String valueOf(char c) {
198 char ar[]=new char[1];
200 return new String(ar);
203 public static String valueOf(int x) {
217 chararray=new char[length+1];
219 chararray=new char[length];
229 chararray[--length+voffset]=(char)(x%10+'0');
232 return new String(chararray);
235 public int hashCode() {
236 if (cachedHashcode!=0)
237 return cachedHashcode;
239 for(int i=0;i<count;i++)
240 hashcode=hashcode*31+value[i+offset];
241 cachedHashcode=hashcode;
245 public boolean equals(Object o) {
246 if (o.getType()!=getType())
251 for(int i=0;i<count;i++) {
252 if (s.value[i+s.offset]!=value[i+offset])
258 public boolean equalsIgnoreCase(String s) {
261 for(int i=0;i<count;i++) {
262 char l=s.value[i+s.offset];
263 char r=value[i+offset];