0N/A/*
2362N/A * Copyright (c) 2001, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
0N/A * published by the Free Software Foundation.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
0N/A */
0N/A
0N/A/*
0N/A * @test
0N/A * @bug 4486049
0N/A * @summary min and max methods fail if size changes in between a call to size
0N/A * and an attempt to iterate.
0N/A * @author Josh Bloch
0N/A */
0N/A
0N/Aimport java.util.*;
0N/A
0N/Apublic class MinMax {
0N/A public static void main(String[] args) {
0N/A Set s = new LyingSet();
0N/A s.add("x");
0N/A if (!Collections.min(s).equals("x"))
0N/A throw new RuntimeException("1: " + Collections.min(s));
0N/A if (!Collections.max(s).equals("x"))
0N/A throw new RuntimeException("2: " + Collections.max(s));
0N/A
0N/A s.add("y");
0N/A if (!Collections.min(s).equals("x"))
0N/A throw new RuntimeException("3: " + Collections.min(s));
0N/A if (!Collections.max(s).equals("y"))
0N/A throw new RuntimeException("4: " + Collections.max(s));
0N/A
0N/A s.add("w");
0N/A if (!Collections.min(s).equals("w"))
0N/A throw new RuntimeException("5: " + Collections.min(s));
0N/A if (!Collections.max(s).equals("y"))
0N/A throw new RuntimeException("6: " + Collections.max(s));
0N/A
0N/A s.clear();
0N/A s.add("x");
0N/A if (!Collections.min(s, Collections.reverseOrder()).equals("x"))
0N/A throw new RuntimeException("1a: " + Collections.min(s));
0N/A if (!Collections.max(s, Collections.reverseOrder()).equals("x"))
0N/A throw new RuntimeException("2a: " + Collections.max(s));
0N/A
0N/A s.add("y");
0N/A if (!Collections.min(s, Collections.reverseOrder()).equals("y"))
0N/A throw new RuntimeException("3a: " + Collections.min(s));
0N/A if (!Collections.max(s, Collections.reverseOrder()).equals("x"))
0N/A throw new RuntimeException("4a: " + Collections.max(s));
0N/A
0N/A s.add("w");
0N/A if (!Collections.min(s, Collections.reverseOrder()).equals("y"))
0N/A throw new RuntimeException("5a: " + Collections.min(s));
0N/A if (!Collections.max(s, Collections.reverseOrder()).equals("w"))
0N/A throw new RuntimeException("6a: " + Collections.max(s));
0N/A }
0N/A}
0N/A
0N/Aclass LyingSet extends LinkedHashSet {
0N/A public int size() {
0N/A return super.size() + 1; // Lies, lies, all lies!
0N/A }
0N/A}