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
|
/*
* Copyright (c) 1999, 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 4252490
* @summary The firstKey and lastKey
*/
import java.util.NoSuchElementException;
import java.util.SortedMap;
import java.util.SortedSet;
import java.util.TreeMap;
import java.util.TreeSet;
public class SubMap {
public static void main(String[] args) throws Exception {
SortedMap m = new TreeMap();
m.put(new Integer(1), new Integer(1));
m.put(new Integer(2), new Integer(2));
m.put(new Integer(3), new Integer(3));
SortedMap m2 = m.subMap(new Integer(2), new Integer(2));
boolean exc = false;
try {
m2.firstKey();
} catch (NoSuchElementException e) {
exc = true;
}
if (!exc)
throw new Exception("first key");
exc = false;
try {
m2.lastKey();
} catch (NoSuchElementException e) {
exc = true;
}
if (!exc)
throw new Exception("last key");
SortedMap m3 = m.subMap(new Integer(2), new Integer(3));
if (!m3.firstKey().equals(new Integer(2)))
throw new Exception("first key wrong");
if (!m3.lastKey().equals(new Integer(2)))
throw new Exception("last key wrong");
SortedSet s = new TreeSet();
s.add(new Integer(1));
s.add(new Integer(2));
s.add(new Integer(3));
SortedSet s2 = s.subSet(new Integer(2), new Integer(2));
exc = false;
try {
s2.first();
} catch (NoSuchElementException e) {
exc = true;
}
if (!exc)
throw new Exception("first element");
exc = false;
try {
s2.last();
} catch (NoSuchElementException e) {
exc = true;
}
if (!exc)
throw new Exception("last element");
SortedSet s3 = s.subSet(new Integer(2), new Integer(3));
if (!s3.first().equals(new Integer(2)))
throw new Exception("first element wrong");
if (!s3.last().equals(new Integer(2)))
throw new Exception("last element wrong");
}
}
|
