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
|
/**
* ============LICENSE_START==================================================== org.onap.aaf
* =========================================================================== Copyright (c) 2018
* AT&T Intellectual Property. All rights reserved.
*
* Modifications Copyright (C) 2019 IBM. ===========================================================================
* Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except
* in compliance with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software distributed under the License
* is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express
* or implied. See the License for the specific language governing permissions and limitations under
* the License. ============LICENSE_END====================================================
*/
package org.onap.aaf.certservice.cmpv2client.external;
/**
* Split by Char, optional Trim
*
* <p>Note: Copied from Inno to avoid linking issues. Note: I read the String split and Pattern
* split code, and we can do this more efficiently for a single Character
*
* <p>8/20/2015
*/
public class Split {
private static final String[] EMPTY = new String[0];
public static String[] split(char c, String value) {
if (value == null) {
return EMPTY;
}
return split(c, value, 0, value.length());
}
public static String[] split(char c, String value, int start, int end) {
if (value == null) {
return EMPTY;
}
// Count items to preallocate Array (memory alloc is more expensive than counting twice)
int count, idx;
for (count = 1, idx = value.indexOf(c, start);
idx >= 0 && idx < end;
idx = value.indexOf(c, ++idx), ++count) {
;
}
String[] rv = new String[count];
if (count == 1) {
rv[0] = value.substring(start, end);
} else {
int last = 0;
count = -1;
for (idx = value.indexOf(c, start); idx >= 0 && idx < end;
idx = value.indexOf(c, idx)) {
rv[++count] = value.substring(last, idx);
last = ++idx;
}
rv[++count] = value.substring(last, end);
}
return rv;
}
public static String[] splitTrim(char c, String value, int start, int end) {
if (value == null) {
return EMPTY;
}
// Count items to preallocate Array (memory alloc is more expensive than counting twice)
int count, idx;
for (count = 1, idx = value.indexOf(c, start);
idx >= 0 && idx < end;
idx = value.indexOf(c, ++idx), ++count) {
;
}
String[] rv = new String[count];
if (count == 1) {
rv[0] = value.substring(start, end).trim();
} else {
int last = start;
count = -1;
for (idx = value.indexOf(c, start); idx >= 0 && idx < end;
idx = value.indexOf(c, idx)) {
rv[++count] = value.substring(last, idx).trim();
last = ++idx;
}
rv[++count] = value.substring(last, end).trim();
}
return rv;
}
public static String[] splitTrim(char c, String value) {
if (value == null) {
return EMPTY;
}
return splitTrim(c, value, 0, value.length());
}
public static String[] splitTrim(char c, String value, int size) {
if (value == null) {
return EMPTY;
}
int idx;
String[] rv = new String[size];
if (size == 1) {
rv[0] = value.trim();
} else {
int last = 0;
int count = -1;
size -= 2;
for (idx = value.indexOf(c); idx >= 0 && count < size; idx = value.indexOf(c, idx)) {
rv[++count] = value.substring(last, idx).trim();
last = ++idx;
}
if (idx > 0) {
rv[++count] = value.substring(last, idx).trim();
} else {
rv[++count] = value.substring(last).trim();
}
}
return rv;
}
}
|
