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
|
/*
* Copyright (c) 2002, 2025, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/*
* @test
* @bug 4509255 5055567 6176318 7090844 8347841 8347955
* @summary Tests consistencies of time zone IDs.
*/
import java.time.ZoneId;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;
import java.util.TimeZone;
import java.util.TreeMap;
import java.util.function.Predicate;
public class IDTest {
public static void main(String[] args) {
Set<String> ids = new HashSet<>();
Map<Integer, Set<String>> tree = new TreeMap<>();
String[] tzs = TimeZone.availableIDs()
.filter(Predicate.not(ZoneId.SHORT_IDS::containsKey))
.toArray(String[]::new);
String[] tzs2 = TimeZone.availableIDs()
.filter(Predicate.not(ZoneId.SHORT_IDS::containsKey))
.toArray(String[]::new);
if (tzs.length != tzs2.length) {
throw new RuntimeException("tzs.length(" + tzs.length
+ ") != tzs2.length(" + tzs2.length + ")");
}
for (int i = 0; i < tzs.length; i++) {
if (tzs[i] != tzs2[i]) {
throw new RuntimeException(i + ": " + tzs[i] + " != " + tzs2[i]);
}
}
System.out.println("Total: " + tzs.length + " time zone IDs");
for (String id : tzs) {
ids.add(id);
TimeZone tz = TimeZone.getTimeZone(id);
Integer offset = tz.getRawOffset();
Set<String> s = tree.get(offset);
if (s == null) {
s = new HashSet<>();
tree.put(offset, s);
}
s.add(id);
}
for (Integer key : tree.keySet()) {
Set<String> s1 = tree.get(key);
// Make sure no duplicates in the other sets
for (Integer k : tree.keySet()) {
if (k.equals(key)) {
continue;
}
Set<String> s2 = new HashSet<>(tree.get(k));
s2.retainAll(s1);
if (!s2.isEmpty()) {
throw new RuntimeException("s1 included in the subset for " + (k.intValue()/60000) +
" (" + s2 + " shouldn't be in s1)");
}
}
// Check the getAvailableIDs(int) call to return the same
// set of IDs
int offset = key.intValue();
tzs = TimeZone.availableIDs(offset)
.filter(Predicate.not(ZoneId.SHORT_IDS::containsKey))
.toArray(String[]::new);
tzs2 = TimeZone.availableIDs(offset)
.filter(Predicate.not(ZoneId.SHORT_IDS::containsKey))
.toArray(String[]::new);
if (!Arrays.equals(tzs, tzs2)) {
throw new RuntimeException("inconsistent tzs from getAvailableIDs("+offset+")");
}
Set<String> s2 = new HashSet<>();
s2.addAll(Arrays.asList(tzs));
if (!s1.equals(s2)) {
throw new RuntimeException("s1 != s2 for " + offset/60000 +
" (diff=" + getDiff(s1, s2) + ")");
}
if (!ids.containsAll(s2)) {
throw new RuntimeException("s2 isn't a subset of ids (" + getDiff(s2, ids) +
" not in ids)");
}
}
for (Integer key : tree.keySet()) {
Set<String> s1 = tree.get(key);
ids.removeAll(s1);
}
if (!ids.isEmpty()) {
throw new RuntimeException("ids didn't become empty. (" + ids + ")");
}
}
private static String getDiff(Set<String> set1, Set<String> set2) {
Set<String> s1 = new HashSet<>(set1);
s1.removeAll(set2);
Set<String> s2 = new HashSet<>(set2);
s2.removeAll(set1);
s2.addAll(s1);
return s2.toString();
}
}
|
