1 |
|
|
2 |
|
|
3 |
|
|
4 |
|
|
5 |
|
|
6 |
|
|
7 |
|
|
8 |
|
|
9 |
|
|
10 |
|
|
11 |
|
|
12 |
|
|
13 |
|
|
14 |
|
|
15 |
|
|
16 |
|
package org.qedeq.base.io; |
17 |
|
|
18 |
|
|
19 |
|
|
20 |
|
|
21 |
|
|
22 |
|
|
23 |
|
@author |
24 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (80) |
Complexity: 27 |
Complexity Density: 0.64 |
|
25 |
|
public final class Version implements Comparable { |
26 |
|
|
27 |
|
|
28 |
|
private final int major; |
29 |
|
|
30 |
|
|
31 |
|
private final int minor; |
32 |
|
|
33 |
|
|
34 |
|
private final int patch; |
35 |
|
|
36 |
|
|
37 |
|
|
38 |
|
|
39 |
|
|
40 |
|
|
41 |
|
@param |
42 |
|
@throws |
43 |
|
@throws |
44 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (17) |
Complexity: 4 |
Complexity Density: 0.36 |
|
45 |
190
|
public Version(final String version) {... |
46 |
190
|
final TextInput text = new TextInput(version); |
47 |
187
|
major = text.readNonNegativeInt(); |
48 |
177
|
if (!".".equals(text.readString(1))) { |
49 |
2
|
throw new IllegalArgumentException("version number must have two digits"); |
50 |
|
} |
51 |
175
|
minor = text.readNonNegativeInt(); |
52 |
173
|
if (!".".equals(text.readString(1))) { |
53 |
2
|
throw new IllegalArgumentException("version number must have two digits"); |
54 |
|
} |
55 |
171
|
patch = text.readNonNegativeInt(); |
56 |
169
|
text.skipWhiteSpace(); |
57 |
169
|
if (!text.isEmpty()) { |
58 |
5
|
throw new IllegalArgumentException("version number to long: " + text.readString(100)); |
59 |
|
} |
60 |
|
} |
61 |
|
|
62 |
|
|
63 |
|
|
64 |
|
|
65 |
|
@return |
66 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
67 |
6
|
public int getMajor() {... |
68 |
6
|
return major; |
69 |
|
} |
70 |
|
|
71 |
|
|
72 |
|
|
73 |
|
|
74 |
|
@return |
75 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
76 |
6
|
public int getMinor() {... |
77 |
6
|
return minor; |
78 |
|
} |
79 |
|
|
80 |
|
|
81 |
|
|
82 |
|
|
83 |
|
@return |
84 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
85 |
6
|
public int getPatch() {... |
86 |
6
|
return patch; |
87 |
|
} |
88 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (30) |
Complexity: 8 |
Complexity Density: 0.5 |
|
89 |
157
|
public int compareTo(final Object o) {... |
90 |
157
|
if (!(o instanceof Version)) { |
91 |
1
|
return -1; |
92 |
|
} |
93 |
156
|
final Version other = (Version) o; |
94 |
156
|
if (major < other.major) { |
95 |
9
|
return -1; |
96 |
147
|
} else if (major > other.major) { |
97 |
24
|
return 1; |
98 |
|
} |
99 |
123
|
if (minor < other.minor) { |
100 |
23
|
return -1; |
101 |
100
|
} else if (minor > other.minor) { |
102 |
33
|
return 1; |
103 |
|
} |
104 |
67
|
if (patch < other.patch) { |
105 |
5
|
return -1; |
106 |
62
|
} else if (patch > other.patch) { |
107 |
7
|
return 1; |
108 |
|
} |
109 |
55
|
return 0; |
110 |
|
} |
111 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
112 |
16
|
public int hashCode() {... |
113 |
16
|
return major ^ minor ^ patch; |
114 |
|
} |
115 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
116 |
37
|
public boolean equals(final Object o) {... |
117 |
37
|
return 0 == compareTo(o); |
118 |
|
} |
119 |
|
|
120 |
|
|
121 |
|
|
122 |
|
|
123 |
|
@param |
124 |
|
@return |
125 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (4) |
Complexity: 2 |
Complexity Density: 0.5 |
|
126 |
10
|
public boolean equals(final String version) {... |
127 |
10
|
Version compare = null; |
128 |
10
|
try { |
129 |
10
|
compare = new Version(version); |
130 |
|
} catch (RuntimeException e) { |
131 |
|
|
132 |
|
} |
133 |
10
|
return equals(compare); |
134 |
|
} |
135 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (5) |
Complexity: 3 |
Complexity Density: 3 |
|
136 |
34
|
public String toString() {... |
137 |
34
|
return major + "." + (minor < 10 ? "0" : "") + minor |
138 |
34
|
+ "." + (patch < 10 ? "0" : "") + patch; |
139 |
|
} |
140 |
|
|
141 |
|
|
142 |
|
|
143 |
|
|
144 |
|
@param |
145 |
|
@return |
146 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
147 |
22
|
public boolean isLess(final Version other) {... |
148 |
22
|
return 0 > compareTo(other); |
149 |
|
} |
150 |
|
|
151 |
|
|
152 |
|
|
153 |
|
|
154 |
|
@param |
155 |
|
@return |
156 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
157 |
21
|
public boolean isBigger(final Version other) {... |
158 |
21
|
return 0 < compareTo(other); |
159 |
|
} |
160 |
|
|
161 |
|
|
162 |
|
|
163 |
|
|
164 |
|
@param |
165 |
|
@param |
166 |
|
@return |
167 |
|
@throws |
168 |
|
@throws |
169 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
170 |
6
|
public static boolean less(final String version1, final String version2) {... |
171 |
6
|
return (new Version(version1)).isLess(new Version(version2)); |
172 |
|
} |
173 |
|
|
174 |
|
|
175 |
|
|
176 |
|
|
177 |
|
@param |
178 |
|
@param |
179 |
|
@return |
180 |
|
@throws |
181 |
|
@throws |
182 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
183 |
5
|
public static boolean bigger(final String version1, final String version2) {... |
184 |
5
|
return (new Version(version1)).isBigger(new Version(version2)); |
185 |
|
} |
186 |
|
|
187 |
|
|
188 |
|
|
189 |
|
|
190 |
|
@param |
191 |
|
@param |
192 |
|
@return |
193 |
|
@throws |
194 |
|
@throws |
195 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
196 |
5
|
public static boolean equals(final String version1, final String version2) {... |
197 |
5
|
return (new Version(version1)).equals(new Version(version2)); |
198 |
|
} |
199 |
|
|
200 |
|
} |