1 /* 2 * Copyright (c) 2001, 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 4245809 27 * @summary Basic test of removeEldestElement method. 28 */ 29 package test.java.util.LinkedHashMap; 30 31 import java.util.LinkedHashMap; 32 import java.util.Map; 33 34 public class Cache { 35 private static final int MAP_SIZE = 10; 36 private static final int NUM_KEYS = 100; 37 main(String[] args)38 public static void main(String[] args) throws Exception { 39 Map m = new LinkedHashMap() { 40 protected boolean removeEldestEntry(Map.Entry eldest) { 41 return size() > MAP_SIZE; 42 } 43 }; 44 45 for (int i = 0; i < NUM_KEYS; i++) { 46 m.put(new Integer(i), ""); 47 int eldest = ((Integer) m.keySet().iterator().next()).intValue(); 48 if (eldest != Math.max(i-9, 0)) 49 throw new RuntimeException("i = " + i + ", eldest = " +eldest); 50 } 51 } 52 } 53