Code Review
/
aaf
/
authz.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
review
|
tree
raw
|
inline
| side by side
Mass whitespace changes (Style Warnings)
[aaf/authz.git]
/
misc
/
env
/
src
/
main
/
java
/
org
/
onap
/
aaf
/
misc
/
env
/
util
/
Split.java
diff --git
a/misc/env/src/main/java/org/onap/aaf/misc/env/util/Split.java
b/misc/env/src/main/java/org/onap/aaf/misc/env/util/Split.java
index
4069c32
..
b0da8ba
100644
(file)
--- a/
misc/env/src/main/java/org/onap/aaf/misc/env/util/Split.java
+++ b/
misc/env/src/main/java/org/onap/aaf/misc/env/util/Split.java
@@
-33,20
+33,20
@@
public class Split {
private static final String[] BLANK = new String[0];
\r
\r
public static String[] split(char c, String value) {
\r
private static final String[] BLANK = new String[0];
\r
\r
public static String[] split(char c, String value) {
\r
- if(value==null) {
\r
+ if
(value==null) {
\r
return BLANK;
\r
}
\r
\r
// Count items to preallocate Array (memory alloc is more expensive than counting twice)
\r
int count,idx;
\r
return BLANK;
\r
}
\r
\r
// Count items to preallocate Array (memory alloc is more expensive than counting twice)
\r
int count,idx;
\r
- for(count=1,idx=value.indexOf(c);idx>=0;idx=value.indexOf(c,++idx),++count);
\r
+ for
(count=1,idx=value.indexOf(c);idx>=0;idx=value.indexOf(c,++idx),++count);
\r
String[] rv = new String[count];
\r
String[] rv = new String[count];
\r
- if(count==1) {
\r
+ if
(count==1) {
\r
rv[0]=value;
\r
} else {
\r
int last=0;
\r
count=-1;
\r
rv[0]=value;
\r
} else {
\r
int last=0;
\r
count=-1;
\r
- for(idx=value.indexOf(c);idx>=0;idx=value.indexOf(c,idx)) {
\r
+ for
(idx=value.indexOf(c);idx>=0;idx=value.indexOf(c,idx)) {
\r
rv[++count]=value.substring(last,idx);
\r
last = ++idx;
\r
}
\r
rv[++count]=value.substring(last,idx);
\r
last = ++idx;
\r
}
\r
@@
-56,19
+56,19
@@
public class Split {
}
\r
\r
public static String[] splitTrim(char c, String value) {
\r
}
\r
\r
public static String[] splitTrim(char c, String value) {
\r
- if(value==null) {
\r
+ if
(value==null) {
\r
return BLANK;
\r
}
\r
// Count items to preallocate Array (memory alloc is more expensive than counting twice)
\r
int count,idx;
\r
return BLANK;
\r
}
\r
// Count items to preallocate Array (memory alloc is more expensive than counting twice)
\r
int count,idx;
\r
- for(count=1,idx=value.indexOf(c);idx>=0;idx=value.indexOf(c,++idx),++count);
\r
+ for
(count=1,idx=value.indexOf(c);idx>=0;idx=value.indexOf(c,++idx),++count);
\r
String[] rv = new String[count];
\r
String[] rv = new String[count];
\r
- if(count==1) {
\r
+ if
(count==1) {
\r
rv[0]=value.trim();
\r
} else {
\r
int last=0;
\r
count=-1;
\r
rv[0]=value.trim();
\r
} else {
\r
int last=0;
\r
count=-1;
\r
- for(idx=value.indexOf(c);idx>=0;idx=value.indexOf(c,idx)) {
\r
+ for
(idx=value.indexOf(c);idx>=0;idx=value.indexOf(c,idx)) {
\r
rv[++count]=value.substring(last,idx).trim();
\r
last = ++idx;
\r
}
\r
rv[++count]=value.substring(last,idx).trim();
\r
last = ++idx;
\r
}
\r
@@
-78,19
+78,19
@@
public class Split {
}
\r
\r
public static String[] splitTrim(char c, String value, int size) {
\r
}
\r
\r
public static String[] splitTrim(char c, String value, int size) {
\r
- if(value==null) {
\r
+ if
(value==null) {
\r
return BLANK;
\r
}
\r
\r
int idx;
\r
String[] rv = new String[size];
\r
return BLANK;
\r
}
\r
\r
int idx;
\r
String[] rv = new String[size];
\r
- if(size==1) {
\r
+ if
(size==1) {
\r
rv[0]=value.trim();
\r
} else {
\r
int last=0;
\r
int count=-1;
\r
size-=2;
\r
rv[0]=value.trim();
\r
} else {
\r
int last=0;
\r
int count=-1;
\r
size-=2;
\r
- for(idx=value.indexOf(c);idx>=0 && count<size;idx=value.indexOf(c,idx)) {
\r
+ for
(idx=value.indexOf(c);idx>=0 && count<size;idx=value.indexOf(c,idx)) {
\r
rv[++count]=value.substring(last,idx).trim();
\r
last = ++idx;
\r
}
\r
rv[++count]=value.substring(last,idx).trim();
\r
last = ++idx;
\r
}
\r