efb681202bada0aa35286c1fda72824bf6b2447c
[aaf/authz.git] / misc / env / src / main / java / org / onap / aaf / misc / env / util / Split.java
1 /**\r
2  * ============LICENSE_START====================================================\r
3  * org.onap.aaf\r
4  * ===========================================================================\r
5  * Copyright (c) 2018 AT&T Intellectual Property. All rights reserved.\r
6  * ===========================================================================\r
7  * Licensed under the Apache License, Version 2.0 (the "License");\r
8  * you may not use this file except in compliance with the License.\r
9  * You may obtain a copy of the License at\r
10  * \r
11  *      http://www.apache.org/licenses/LICENSE-2.0\r
12  * \r
13  * Unless required by applicable law or agreed to in writing, software\r
14  * distributed under the License is distributed on an "AS IS" BASIS,\r
15  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r
16  * See the License for the specific language governing permissions and\r
17  * limitations under the License.\r
18  * ============LICENSE_END====================================================\r
19  *\r
20  */\r
21 \r
22 package org.onap.aaf.misc.env.util;\r
23 \r
24 /**\r
25  * Split by Char, optional Trim\r
26  * \r
27  * Note: I read the String split and Pattern split code, and we can do this more efficiently for a single Character\r
28  * \r
29  * Jonathan 8/20/2015\r
30  */\r
31 \r
32 public class Split {\r
33           private static final String[] BLANK = new String[0];\r
34           \r
35           public static String[] split(char c, String value) {\r
36                   if(value==null) {\r
37                           return BLANK;\r
38                   }\r
39 \r
40                   // Count items to preallocate Array (memory alloc is more expensive than counting twice)\r
41                   int count,idx;\r
42                   for(count=1,idx=value.indexOf(c);idx>=0;idx=value.indexOf(c,++idx),++count);\r
43                   String[] rv = new String[count];\r
44                   if(count==1) {\r
45                           rv[0]=value;\r
46                   } else {\r
47                           int last=0;\r
48                           count=-1;\r
49                           for(idx=value.indexOf(c);idx>=0;idx=value.indexOf(c,idx)) {\r
50                                   rv[++count]=value.substring(last,idx);\r
51                                   last = ++idx;\r
52                           }\r
53                           rv[++count]=value.substring(last);\r
54                   }\r
55                   return rv;\r
56           }\r
57 \r
58           public static String[] splitTrim(char c, String value) {\r
59                   if(value==null) {\r
60                           return BLANK;\r
61                   }\r
62                   // Count items to preallocate Array (memory alloc is more expensive than counting twice)\r
63                   int count,idx;\r
64                   for(count=1,idx=value.indexOf(c);idx>=0;idx=value.indexOf(c,++idx),++count);\r
65                   String[] rv = new String[count];\r
66                   if(count==1) {\r
67                           rv[0]=value.trim();\r
68                   } else {\r
69                           int last=0;\r
70                           count=-1;\r
71                           for(idx=value.indexOf(c);idx>=0;idx=value.indexOf(c,idx)) {\r
72                                   rv[++count]=value.substring(last,idx).trim();\r
73                                   last = ++idx;\r
74                           }\r
75                           rv[++count]=value.substring(last).trim();\r
76                   }\r
77                   return rv;\r
78           }\r
79 \r
80           public static String[] splitTrim(char c, String value, int size) {\r
81                   if(value==null) {\r
82                           return BLANK;\r
83                   }\r
84 \r
85                   int idx;\r
86                   String[] rv = new String[size];\r
87                   if(size==1) {\r
88                           rv[0]=value.trim();\r
89                   } else {\r
90                           int last=0;\r
91                           int count=-1;\r
92                           size-=2;\r
93                           for(idx=value.indexOf(c);idx>=0 && count<size;idx=value.indexOf(c,idx)) {\r
94                                   rv[++count]=value.substring(last,idx).trim();\r
95                                   last = ++idx;\r
96                           }\r
97                           rv[++count]=value.substring(last).trim();\r
98                   }\r
99                   return rv;\r
100           }\r
101 \r
102 }\r