1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
| /**
* CharArrayUtilities.java
*
* @author Peter Veentjer
*/
package com.jph.string;
public class CharArrayUtilities
{
public static int indexOfIgnoreCase(char[] source,char[] target)
{
return indexOfIgnoreCase(source,target,0,source.length);
}
public static int indexOfIgnoreCase(char[] source,char[] target, int fromIndex)
{
return indexOfIgnoreCase(source,target,fromIndex,source.length);
}
public static int indexOfIgnoreCase(char[] source,char[] target, int fromIndex, int stopOffset)
{
return indexOfIgnoreCase(source,0,stopOffset,target,0,target.length,fromIndex);
}
public static int indexOf(char[] source,char[] target)
{
return indexOf(source,target,0,source.length);
}
public static int indexOf(char[] source,char[] target, int fromIndex)
{
return indexOf(source,target,fromIndex,source.length);
}
public static int indexOf(char[] source,char[] target, int fromIndex, int stopIndex)
{
return indexOf(source,0,stopIndex,target,0,target.length,fromIndex);
}
public static int lastIndexOf(char[] source,char[] target)
{
return lastIndexOf(source,target,source.length-1,0);
}
public static int lastIndexOf(char[] source,char[] target, int fromIndex)
{
return lastIndexOf(source,target,fromIndex,0);
}
public static int lastIndexOf(char[] source,char[] target, int fromIndex, int stopIndex)
{
return lastIndexOf(source,stopIndex,source.length-stopIndex,target,0,target.length,fromIndex);
}
public static int lastIndexOfIgnoreCase(char[] source,char[] target)
{
return lastIndexOfIgnoreCase(source,target,source.length-1,0);
}
public static int lastIndexOfIgnoreCase(char[] source,char[] target, int fromIndex)
{
return lastIndexOfIgnoreCase(source,target,fromIndex,0);
}
public static int lastIndexOfIgnoreCase(char[] source,char[] target, int fromIndex, int stopIndex)
{
return lastIndexOfIgnoreCase(source,stopIndex,source.length-stopIndex,target,0,target.length,fromIndex);
}
/**
* Code shared by String and StringBuffer to do searches. The
* source is the character array being searched, and the target
* is the string being searched for.
*
* @param source the characters being searched.
*
* @param sourceOffset offset of the source string.
*
* @param sourceCount count of the source string.
*
* @param target the characters being searched for.
*
* @param targetOffset offset of the target string.
*
* @param targetCount count of the target string.
*
* @param fromIndex the index to begin searching from.
*/
static int indexOf(char[] source, int sourceOffset, int sourceCount,
char[] target, int targetOffset, int targetCount,
int fromIndex)
{
if (fromIndex >= sourceCount) {
return (targetCount == 0 ? sourceCount : -1);
}
if (fromIndex < 0) {
fromIndex = 0;
}
if (targetCount == 0) {
return fromIndex;
}
char first = target[targetOffset];
//de huidige karakter positie
int i = sourceOffset + fromIndex;
//de maximale offset.
int max = sourceOffset + (sourceCount - targetCount);
startSearchForFirstChar:
while (true) {
/* Look for first character. */
while (i <= max && source[i] != first) {
i++;
}
if (i > max) {
return -1;
}
/* Found first character, now look at the rest of v2 */
int j = i + 1;
int end = j + targetCount - 1;
int k = targetOffset + 1;
while (j < end) {
if (source[j++] != target[k++]) {
i++;
/* Look for str's first char again. */
continue startSearchForFirstChar;
}
}
return i - sourceOffset; /* Found whole string. */
}
}
static int indexOfIgnoreCase(char[] source, int sourceOffset, int sourceCount,
char[] target, int targetOffset, int targetCount,
int fromIndex)
{
if (fromIndex >= sourceCount) {
return (targetCount == 0 ? sourceCount : -1);
}
if (fromIndex < 0) {
fromIndex = 0;
}
if (targetCount == 0) {
return fromIndex;
}
//converteer target naar lower case.
char[] lowerCaseTarget = new char[target.length];
for(int k=0;k<target.length;k++)
lowerCaseTarget[k]=Character.toLowerCase(target[k]);
char first = lowerCaseTarget[targetOffset];
//de huidige karakter positie
int i = sourceOffset + fromIndex;
//de maximale offset.
int max = sourceOffset + (sourceCount - targetCount);
startSearchForFirstChar:
while (true) {
/* Look for first character. */
while (i <= max && Character.toLowerCase(source[i]) != first) {
i++;
}
if (i > max) {
return -1;
}
/* Found first character, now look at the rest of v2 */
int j = i + 1;
int end = j + targetCount - 1;
int k = targetOffset + 1;
while (j < end) {
if (Character.toLowerCase(source[j++]) != target[k++]) {
i++;
/* Look for str's first char again. */
continue startSearchForFirstChar;
}
}
return i - sourceOffset; /* Found whole string. */
}
}
/**
* Code shared by String and StringBuffer to do searches. The
* source is the character array being searched, and the target
* is the string being searched for.
*
* @param source the characters being searched.
* @param sourceOffset offset of the source string.
* @param sourceCount count of the source string.
* @param target the characters being searched for.
* @param targetOffset offset of the target string.
* @param targetCount count of the target string.
* @param fromIndex the index to begin searching from.
*/
static int lastIndexOfIgnoreCase(char[] source, int sourceOffset, int sourceCount,
char[] target, int targetOffset, int targetCount,
int fromIndex) {
/*
* Check arguments; return immediately where possible. For
* consistency, don't check for null str.
*/
int rightIndex = sourceCount - targetCount;
if (fromIndex < 0) {
return -1;
}
if (fromIndex > rightIndex) {
fromIndex = rightIndex;
}
/* Empty string always matches. */
if (targetCount == 0) {
return fromIndex;
}
//converteer target naar lower case.
char[] lowerCaseTarget = new char[target.length];
for(int k=0;k<target.length;k++)
lowerCaseTarget[k]=Character.toLowerCase(target[k]);
int strLastIndex = targetOffset + targetCount - 1;
char strLastChar = lowerCaseTarget[strLastIndex];
int min = sourceOffset + targetCount - 1;
int i = min + fromIndex;
startSearchForLastChar:
while (true) {
while (i >= min && Character.toLowerCase(source[i]) != strLastChar) {
i--;
}
if (i < min) {
return -1;
}
int j = i - 1;
int start = j - (targetCount - 1);
int k = strLastIndex - 1;
while (j > start) {
if (Character.toLowerCase(source[j--]) != lowerCaseTarget[k--]) {
i--;
continue startSearchForLastChar;
}
}
return start - sourceOffset + 1;
}
}
static int lastIndexOf(char[] source, int sourceOffset, int sourceCount,
char[] target, int targetOffset, int targetCount,
int fromIndex) {
/*
* Check arguments; return immediately where possible. For
* consistency, don't check for null str.
*/
int rightIndex = sourceCount - targetCount;
if (fromIndex < 0) {
return -1;
}
if (fromIndex > rightIndex) {
fromIndex = rightIndex;
}
/* Empty string always matches. */
if (targetCount == 0) {
return fromIndex;
}
int strLastIndex = targetOffset + targetCount - 1;
char strLastChar = target[strLastIndex];
int min = sourceOffset + targetCount - 1;
int i = min + fromIndex;
startSearchForLastChar:
while (true) {
while (i >= min && source[i] != strLastChar) {
i--;
}
if (i < min) {
return -1;
}
int j = i - 1;
int start = j - (targetCount - 1);
int k = strLastIndex - 1;
while (j > start) {
if (source[j--] != target[k--]) {
i--;
continue startSearchForLastChar;
}
}
return start - sourceOffset + 1;
}
}
public static void main(String[] args)
{
String source = "peter";
String target = "e";
int indexOf = lastIndexOf(source.toCharArray(),target.toCharArray(),10);
System.out.println("indexOf:"+indexOf);
}
} |
/u/2046/pooh2.png?f=community)
. Veel succes 
.:strip_exif()/u/31626/eend.gif?f=community)
.
:strip_icc():strip_exif()/u/12461/crop65b195553d948.jpg?f=community)
:strip_exif()/u/18993/logo.gif?f=community){kind=logo}
:strip_icc():strip_exif()/u/22964/amd.jpg?f=community)
(tip: ga eens in dat oude gamesdesign topic kijken, daar staat geloof ik nog een hoop java-geflame van mij, geheel onderbouwd 
. Je kunt enkele logische transformaties dan makkelijk daarin uitdrukken en aanbieden bij je tool 
/u/71437/crop6867a75b81f09_cropped.png?f=community)
) Weer open dus