1/*
2 * Copyright (c) 1999, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 */
23
24/*
25 * @test
26 * @bug 4252490
27 * @summary The firstKey and lastKey
28 */
29
30import java.util.*;
31
32public class SubMap {
33    public static void main(String args[]) throws Exception {
34        SortedMap m = new TreeMap();
35        m.put(new Integer(1), new Integer(1));
36        m.put(new Integer(2), new Integer(2));
37        m.put(new Integer(3), new Integer(3));
38        SortedMap m2 = m.subMap(new Integer(2), new Integer(2));
39
40        boolean exc = false;
41        try {
42            m2.firstKey();
43        } catch (NoSuchElementException e) {
44            exc = true;
45        }
46        if (!exc)
47            throw new Exception("first key");
48
49        exc = false;
50        try {
51            m2.lastKey();
52        } catch (NoSuchElementException e) {
53            exc = true;
54        }
55        if (!exc)
56            throw new Exception("last key");
57
58        SortedMap m3 = m.subMap(new Integer(2), new Integer(3));
59        if (!m3.firstKey().equals(new Integer(2)))
60            throw new Exception("first key wrong");
61        if (!m3.lastKey().equals(new Integer(2)))
62            throw new Exception("last key wrong");
63
64        SortedSet s = new TreeSet();
65        s.add(new Integer(1));
66        s.add(new Integer(2));
67        s.add(new Integer(3));
68        SortedSet s2 = s.subSet(new Integer(2), new Integer(2));
69
70        exc = false;
71        try {
72            s2.first();
73        } catch (NoSuchElementException e) {
74            exc = true;
75        }
76        if (!exc)
77            throw new Exception("first element");
78
79        exc = false;
80        try {
81            s2.last();
82        } catch (NoSuchElementException e) {
83            exc = true;
84        }
85        if (!exc)
86            throw new Exception("last element");
87
88        SortedSet s3 = s.subSet(new Integer(2), new Integer(3));
89        if (!s3.first().equals(new Integer(2)))
90            throw new Exception("first element wrong");
91        if (!s3.last().equals(new Integer(2)))
92            throw new Exception("last element wrong");
93    }
94}
95